@opensip-cli/clone-detection 0.1.12

package/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/NOTICE

@@ -0,0 +1,8 @@
+OpenSIP CLI
+Copyright 2026 opensip-ai
+
+Licensed under the Apache License, Version 2.0 (the "License"); you may not use
+this software except in compliance with the License. A copy of the License is
+included in the LICENSE file and is also available at:
+
+    http://www.apache.org/licenses/LICENSE-2.0

package/README.md

@@ -0,0 +1,33 @@
+<!-- Generated by scripts/build-package-readmes.mjs — do not edit by hand.
+     Change the package's "description" (or the generator template) and run
+     `pnpm docs:readmes`. CI enforces sync via `pnpm docs:readmes:check`. -->
+
+# @opensip-cli/clone-detection
+
+> Shared function-body clone-detection substrate for OpenSIP CLI — hash/MinHash primitives + duplicate/near-duplicate algorithms over a tool-neutral candidate type
+
+This is an **internal library** of the opensip-cli toolkit. It is published so the CLI and tools can depend on it; most users will not install it directly.
+
+Part of [**opensip-cli**](https://github.com/opensip-ai/opensip-cli) — an open-source codebase intelligence CLI: fitness checks (`fit`), static call-graph analysis (`graph`), and simulation (`sim`).
+
+**Distribution model:** the published `opensip-cli` npm package is a full-stack bundle of first-party tools, check packs, and language adapters. Third-party tools install separately via the `opensipTools` manifest and host allowlist; a slim install without bundled tools is not a current goal.
+
+## Install
+
+Most users install the CLI, which bundles the first-party tools:
+
+```bash
+curl -fsSL https://opensip.ai/cli/install.sh | bash
+```
+
+This package is published for the CLI and advanced plugin authors; most users should not install `@opensip-cli/clone-detection` directly.
+
+## Documentation
+
+- 📚 Project docs: https://opensip.ai/docs/opensip-cli/
+- 🧭 Package catalog (what every package does): https://github.com/opensip-ai/opensip-cli/blob/v0.1.12/docs/public/70-reference/02-package-catalog.md
+- 📦 Source: https://github.com/opensip-ai/opensip-cli/tree/v0.1.12/packages/clone-detection
+
+## License
+
+Apache-2.0 © opensip-ai

package/dist/body-digest.d.ts

@@ -0,0 +1,48 @@
+/**
+ * @fileoverview Shared body-digest primitives for GraphLanguageAdapters.
+ *
+ * The catalog's `bodyHash` contract is "reduce a function body to a
+ * canonical string, then SHA-256 it." The normalize-to-hash TAIL of that
+ * pipeline — the `BodyDigest` shape, the whitespace-collapse normalizer,
+ * and the hash+size step — was byte-identical across every adapter that
+ * hashes bodies (go/java/rust real bodies, plus the synthetic-body path
+ * in all four tree-sitter packs). Per the round-3 modular-monolith audit
+ * (2026-05-30, finding D) it lives here on the contract layer instead of
+ * being copy-pasted into each pack.
+ *
+ * This mirrors edge-helpers.ts exactly: tiny utilities that used to be
+ * duplicated under each adapter now sit in lang-adapter/, which adapters
+ * already import types from — so importing one more helper is
+ * structurally consistent and violates no layering rule (lang-* adapters
+ * may not import each OTHER, but lang-adapter/ is fair game).
+ *
+ * What deliberately STAYS in each adapter pack: the language-specific
+ * comment stripper (Go rune literals vs Java text blocks vs Rust nested
+ * block comments) and any language-specific normalization. Python, for
+ * example, substitutes its own `normalizePythonBody` for real bodies
+ * because indentation is semantically significant there — it still
+ * composes `hashBody` + `normalizeWhitespace` for synthetic bodies. The
+ * primitives are intentionally low-level (not a single `digestBody(text,
+ * stripFn)`) precisely so a pack can swap the normalization step.
+ */
+/** Catalog body fingerprint: SHA-256 hex hash + canonical-text length. */
+export interface BodyDigest {
+    readonly hash: string;
+    readonly size: number;
+    /** MinHash signature for near-clone detection; absent when not computed. */
+    readonly signature?: readonly number[];
+}
+/**
+ * Collapse every run of whitespace to a single space and trim. The
+ * default body normalization for whitespace-insensitive languages
+ * (Go/Java/Rust) and for synthetic (module-init) bodies in every pack.
+ */
+export declare function normalizeWhitespace(s: string): string;
+/**
+ * SHA-256 an already-normalized ("canonical") body string into a
+ * `BodyDigest`. `size` is the canonical-text length so it tracks the
+ * hashed content, not the raw source. Callers normalize first — via
+ * `normalizeWhitespace` or a language-specific normalizer.
+ */
+export declare function hashBody(canonical: string): BodyDigest;
+//# sourceMappingURL=body-digest.d.ts.map

package/dist/body-digest.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"body-digest.d.ts","sourceRoot":"","sources":["../src/body-digest.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AAIH,0EAA0E;AAC1E,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,4EAA4E;IAC5E,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CACxC;AAED;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAErD;AAED;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,SAAS,EAAE,MAAM,GAAG,UAAU,CAKtD"}

package/dist/body-digest.js

@@ -0,0 +1,49 @@
+/**
+ * @fileoverview Shared body-digest primitives for GraphLanguageAdapters.
+ *
+ * The catalog's `bodyHash` contract is "reduce a function body to a
+ * canonical string, then SHA-256 it." The normalize-to-hash TAIL of that
+ * pipeline — the `BodyDigest` shape, the whitespace-collapse normalizer,
+ * and the hash+size step — was byte-identical across every adapter that
+ * hashes bodies (go/java/rust real bodies, plus the synthetic-body path
+ * in all four tree-sitter packs). Per the round-3 modular-monolith audit
+ * (2026-05-30, finding D) it lives here on the contract layer instead of
+ * being copy-pasted into each pack.
+ *
+ * This mirrors edge-helpers.ts exactly: tiny utilities that used to be
+ * duplicated under each adapter now sit in lang-adapter/, which adapters
+ * already import types from — so importing one more helper is
+ * structurally consistent and violates no layering rule (lang-* adapters
+ * may not import each OTHER, but lang-adapter/ is fair game).
+ *
+ * What deliberately STAYS in each adapter pack: the language-specific
+ * comment stripper (Go rune literals vs Java text blocks vs Rust nested
+ * block comments) and any language-specific normalization. Python, for
+ * example, substitutes its own `normalizePythonBody` for real bodies
+ * because indentation is semantically significant there — it still
+ * composes `hashBody` + `normalizeWhitespace` for synthetic bodies. The
+ * primitives are intentionally low-level (not a single `digestBody(text,
+ * stripFn)`) precisely so a pack can swap the normalization step.
+ */
+import { createHash } from 'node:crypto';
+/**
+ * Collapse every run of whitespace to a single space and trim. The
+ * default body normalization for whitespace-insensitive languages
+ * (Go/Java/Rust) and for synthetic (module-init) bodies in every pack.
+ */
+export function normalizeWhitespace(s) {
+    return s.replaceAll(/\s+/g, ' ').trim();
+}
+/**
+ * SHA-256 an already-normalized ("canonical") body string into a
+ * `BodyDigest`. `size` is the canonical-text length so it tracks the
+ * hashed content, not the raw source. Callers normalize first — via
+ * `normalizeWhitespace` or a language-specific normalizer.
+ */
+export function hashBody(canonical) {
+    return {
+        hash: createHash('sha256').update(canonical, 'utf8').digest('hex'),
+        size: canonical.length,
+    };
+}
+//# sourceMappingURL=body-digest.js.map

package/dist/body-digest.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"body-digest.js","sourceRoot":"","sources":["../src/body-digest.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAUzC;;;;GAIG;AACH,MAAM,UAAU,mBAAmB,CAAC,CAAS;IAC3C,OAAO,CAAC,CAAC,UAAU,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;AAC1C,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,QAAQ,CAAC,SAAiB;IACxC,OAAO;QACL,IAAI,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC;QAClE,IAAI,EAAE,SAAS,CAAC,MAAM;KACvB,CAAC;AACJ,CAAC"}

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

@@ -0,0 +1,31 @@
+/**
+ * Exact duplicate-body detection — the single implementation of the policy that
+ * graph's `duplicated-function-body` rule and yagni's duplicate detector both consume
+ * (ADR-0064). Pure over `CloneCandidate[]`; emits tool-agnostic findings (no `Signal`).
+ *
+ * Two complementary paths under one result:
+ *   1. Per-instance (size-gated): groups of ≥2 byte-identical normalized bodies that
+ *      pass a line floor (default 5) AND a normalized-char floor (default 200) — the
+ *      char floor drops thin wrappers (`defineCheck`/pass-through) that share a body
+ *      but are never an extract target. The caller emits N-1 per group.
+ *   2. Aggregate (cross-package): a body hash present in ≥ `minCrossPackagePackages`
+ *      (default 3) DISTINCT packages emits ONE aggregate and SUPPRESSES its
+ *      per-instance signals (a lighter body-size-only floor, default 80, no line floor).
+ *
+ * The hash already normalizes whitespace + strips comments (see `digestCanonicalBody`),
+ * so identical hashes mean identical executable bodies.
+ */
+import type { CloneCandidate, DupOpts, DuplicateFindings } from './types.js';
+/**
+ * Detect exact duplicate function bodies. Returns cross-package aggregates plus the
+ * per-instance groups that survive aggregate suppression. The caller wraps each into
+ * its own signal/metadata.
+ */
+export declare function findDuplicateBodies(candidates: readonly CloneCandidate[], opts?: DupOpts): DuplicateFindings;
+/**
+ * The kind/test-file exclusions shared by both code paths. Inline arrows / function
+ * expressions / module-init occurrences are never an extract/hoist target; test-file
+ * occurrences are excluded on both paths.
+ */
+export declare function isEligibleKind(occ: CloneCandidate): boolean;
+//# sourceMappingURL=find-duplicate-bodies.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"find-duplicate-bodies.d.ts","sourceRoot":"","sources":["../src/find-duplicate-bodies.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,KAAK,EACV,cAAc,EAEd,OAAO,EACP,iBAAiB,EAElB,MAAM,YAAY,CAAC;AAUpB;;;;GAIG;AACH,wBAAgB,mBAAmB,CACjC,UAAU,EAAE,SAAS,cAAc,EAAE,EACrC,IAAI,GAAE,OAAY,GACjB,iBAAiB,CAwCnB;AAyED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,GAAG,EAAE,cAAc,GAAG,OAAO,CAM3D"}

package/dist/find-duplicate-bodies.js

@@ -0,0 +1,159 @@
+/**
+ * Exact duplicate-body detection — the single implementation of the policy that
+ * graph's `duplicated-function-body` rule and yagni's duplicate detector both consume
+ * (ADR-0064). Pure over `CloneCandidate[]`; emits tool-agnostic findings (no `Signal`).
+ *
+ * Two complementary paths under one result:
+ *   1. Per-instance (size-gated): groups of ≥2 byte-identical normalized bodies that
+ *      pass a line floor (default 5) AND a normalized-char floor (default 200) — the
+ *      char floor drops thin wrappers (`defineCheck`/pass-through) that share a body
+ *      but are never an extract target. The caller emits N-1 per group.
+ *   2. Aggregate (cross-package): a body hash present in ≥ `minCrossPackagePackages`
+ *      (default 3) DISTINCT packages emits ONE aggregate and SUPPRESSES its
+ *      per-instance signals (a lighter body-size-only floor, default 80, no line floor).
+ *
+ * The hash already normalizes whitespace + strips comments (see `digestCanonicalBody`),
+ * so identical hashes mean identical executable bodies.
+ */
+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 catches genuinely-small shared utilities copied across
+// packages, so its floor only drops trivial bodies (empty DI shims, one-line getters).
+const DEFAULT_MIN_CROSS_PACKAGE_BODY_SIZE = 80;
+/**
+ * Detect exact duplicate function bodies. Returns cross-package aggregates plus the
+ * per-instance groups that survive aggregate suppression. The caller wraps each into
+ * its own signal/metadata.
+ */
+export function findDuplicateBodies(candidates, opts = {}) {
+    const minLines = opts.minLines ?? DEFAULT_MIN_LINES;
+    const minBodySize = opts.minBodySize ?? DEFAULT_MIN_BODY_SIZE;
+    const minPackages = opts.minCrossPackagePackages ?? DEFAULT_MIN_CROSS_PACKAGE_PACKAGES;
+    const minCrossPackageBodySize = opts.minCrossPackageBodySize ?? DEFAULT_MIN_CROSS_PACKAGE_BODY_SIZE;
+    // Aggregate path first: group every kind/test-eligible candidate 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(candidates);
+    const suppressedHashes = new Set();
+    const aggregates = [];
+    for (const [bodyHash, occs] of aggregateBuckets) {
+        const packages = [...new Set(occs.map((o) => o.package ?? ''))].sort();
+        if (packages.length < minPackages)
+            continue;
+        const anchor = lowestByQualifiedName(occs);
+        // Lighter, body-size-only floor (NO line floor) — see DEFAULT_MIN_CROSS_PACKAGE_BODY_SIZE.
+        // A body that fails this won't surface on the per-instance path either (200-char
+        // floor is stricter), so there is nothing to suppress.
+        if (anchor.bodySize !== undefined && anchor.bodySize < minCrossPackageBodySize)
+            continue;
+        suppressedHashes.add(bodyHash);
+        aggregates.push({ bodyHash, anchor, packages, occurrenceCount: occs.length });
+    }
+    // Per-instance path: size-gated groups, skipping any hash already claimed by an
+    // aggregate (no double-reporting).
+    const rawGroups = groupByHash(candidates, minLines, minBodySize);
+    const groups = [];
+    for (const group of rawGroups) {
+        if (group.length < 2)
+            continue;
+        const primary = group[0];
+        /* v8 ignore next */
+        if (!primary)
+            continue;
+        if (suppressedHashes.has(primary.bodyHash))
+            continue;
+        groups.push({ bodyHash: primary.bodyHash, members: group });
+    }
+    return { aggregates, groups };
+}
+/**
+ * A function's stable physical identity: where it is declared. A producer's index can
+ * surface the same physical function more than once (dual simple/qualified indexing,
+ * recursive self-reference); two entries sharing this identity are the SAME function and
+ * must never count as a duplicate of each other.
+ */
+function identityOf(occ) {
+    return `${occ.filePath}:${String(occ.line)}:${String(occ.column)}:${occ.simpleName}`;
+}
+/**
+ * Add a candidate to its body-hash bucket, deduping by physical identity so a function
+ * never appears twice in its own bucket (which 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);
+    }
+    /* v8 ignore next */
+    if (!seen)
+        return;
+    const id = identityOf(occ);
+    if (seen.has(id))
+        return;
+    seen.add(id);
+    bucket.push(occ);
+}
+function groupByHash(candidates, minLines, minBodySize) {
+    const buckets = new Map();
+    const seenByHash = new Map();
+    for (const occ of candidates) {
+        if (!isInterestingForDup(occ, minLines, minBodySize))
+            continue;
+        pushDeduped(buckets, seenByHash, occ);
+    }
+    return [...buckets.values()];
+}
+/**
+ * Group candidates 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.
+ */
+function groupByHashUnfloored(candidates) {
+    const buckets = new Map();
+    const seenByHash = new Map();
+    for (const occ of candidates) {
+        if (!isEligibleKind(occ))
+            continue;
+        pushDeduped(buckets, seenByHash, occ);
+    }
+    return buckets;
+}
+function lowestByQualifiedName(occs) {
+    return occs.reduce((lo, c) => (c.qualifiedName < lo.qualifiedName ? c : lo));
+}
+/**
+ * The kind/test-file exclusions shared by both code paths. Inline arrows / function
+ * expressions / module-init occurrences are never an extract/hoist target; test-file
+ * occurrences are excluded on both paths.
+ */
+export 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. Candidates lacking `bodySize` skip the size check ("passes"). `bodyLines` is the
+ * canonical span the caller pre-resolves; absent ⇒ `endLine − line + 1` fallback.
+ */
+function isInterestingForDup(occ, minLines, minBodySize) {
+    if (!isEligibleKind(occ))
+        return false;
+    const span = occ.bodyLines ?? occ.endLine - occ.line + 1;
+    if (span < minLines)
+        return false;
+    if (occ.bodySize !== undefined && occ.bodySize < minBodySize)
+        return false;
+    return true;
+}
+//# sourceMappingURL=find-duplicate-bodies.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"find-duplicate-bodies.js","sourceRoot":"","sources":["../src/find-duplicate-bodies.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAUH,MAAM,iBAAiB,GAAG,CAAC,CAAC;AAC5B,MAAM,qBAAqB,GAAG,GAAG,CAAC;AAClC,MAAM,kCAAkC,GAAG,CAAC,CAAC;AAC7C,uFAAuF;AACvF,mFAAmF;AACnF,uFAAuF;AACvF,MAAM,mCAAmC,GAAG,EAAE,CAAC;AAE/C;;;;GAIG;AACH,MAAM,UAAU,mBAAmB,CACjC,UAAqC,EACrC,OAAgB,EAAE;IAElB,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,iBAAiB,CAAC;IACpD,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,IAAI,qBAAqB,CAAC;IAC9D,MAAM,WAAW,GAAG,IAAI,CAAC,uBAAuB,IAAI,kCAAkC,CAAC;IACvF,MAAM,uBAAuB,GAC3B,IAAI,CAAC,uBAAuB,IAAI,mCAAmC,CAAC;IAEtE,kFAAkF;IAClF,+EAA+E;IAC/E,2CAA2C;IAC3C,MAAM,gBAAgB,GAAG,oBAAoB,CAAC,UAAU,CAAC,CAAC;IAC1D,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAU,CAAC;IAC3C,MAAM,UAAU,GAA4B,EAAE,CAAC;IAE/C,KAAK,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,gBAAgB,EAAE,CAAC;QAChD,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACvE,IAAI,QAAQ,CAAC,MAAM,GAAG,WAAW;YAAE,SAAS;QAC5C,MAAM,MAAM,GAAG,qBAAqB,CAAC,IAAI,CAAC,CAAC;QAC3C,2FAA2F;QAC3F,iFAAiF;QACjF,uDAAuD;QACvD,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,GAAG,uBAAuB;YAAE,SAAS;QACzF,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC/B,UAAU,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,eAAe,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IAChF,CAAC;IAED,gFAAgF;IAChF,mCAAmC;IACnC,MAAM,SAAS,GAAG,WAAW,CAAC,UAAU,EAAE,QAAQ,EAAE,WAAW,CAAC,CAAC;IACjE,MAAM,MAAM,GAAqB,EAAE,CAAC;IACpC,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE,CAAC;QAC9B,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS;QAC/B,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACzB,oBAAoB;QACpB,IAAI,CAAC,OAAO;YAAE,SAAS;QACvB,IAAI,gBAAgB,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC;YAAE,SAAS;QACrD,MAAM,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;IAC9D,CAAC;IAED,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC;AAChC,CAAC;AAED;;;;;GAKG;AACH,SAAS,UAAU,CAAC,GAAmB;IACrC,OAAO,GAAG,GAAG,CAAC,QAAQ,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,UAAU,EAAE,CAAC;AACvF,CAAC;AAED;;;;GAIG;AACH,SAAS,WAAW,CAClB,OAAsC,EACtC,UAAoC,EACpC,GAAmB;IAEnB,IAAI,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IACvC,IAAI,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IACxC,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,MAAM,GAAG,EAAE,CAAC;QACZ,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QAClC,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QACzB,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IACrC,CAAC;IACD,oBAAoB;IACpB,IAAI,CAAC,IAAI;QAAE,OAAO;IAClB,MAAM,EAAE,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;IAC3B,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAAE,OAAO;IACzB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACb,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACnB,CAAC;AAED,SAAS,WAAW,CAClB,UAAqC,EACrC,QAAgB,EAChB,WAAmB;IAEnB,MAAM,OAAO,GAAG,IAAI,GAAG,EAA4B,CAAC;IACpD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAuB,CAAC;IAClD,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;QAC7B,IAAI,CAAC,mBAAmB,CAAC,GAAG,EAAE,QAAQ,EAAE,WAAW,CAAC;YAAE,SAAS;QAC/D,WAAW,CAAC,OAAO,EAAE,UAAU,EAAE,GAAG,CAAC,CAAC;IACxC,CAAC;IACD,OAAO,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;AAC/B,CAAC;AAED;;;;GAIG;AACH,SAAS,oBAAoB,CAC3B,UAAqC;IAErC,MAAM,OAAO,GAAG,IAAI,GAAG,EAA4B,CAAC;IACpD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAuB,CAAC;IAClD,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;QAC7B,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC;YAAE,SAAS;QACnC,WAAW,CAAC,OAAO,EAAE,UAAU,EAAE,GAAG,CAAC,CAAC;IACxC,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,qBAAqB,CAAC,IAA+B;IAC5D,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,aAAa,GAAG,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC/E,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAAC,GAAmB;IAChD,IAAI,GAAG,CAAC,IAAI,KAAK,OAAO,IAAI,GAAG,CAAC,IAAI,KAAK,qBAAqB,IAAI,GAAG,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;QAC7F,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,GAAG,CAAC,UAAU;QAAE,OAAO,KAAK,CAAC;IACjC,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,SAAS,mBAAmB,CAAC,GAAmB,EAAE,QAAgB,EAAE,WAAmB;IACrF,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IACvC,MAAM,IAAI,GAAG,GAAG,CAAC,SAAS,IAAI,GAAG,CAAC,OAAO,GAAG,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC;IACzD,IAAI,IAAI,GAAG,QAAQ;QAAE,OAAO,KAAK,CAAC;IAClC,IAAI,GAAG,CAAC,QAAQ,KAAK,SAAS,IAAI,GAAG,CAAC,QAAQ,GAAG,WAAW;QAAE,OAAO,KAAK,CAAC;IAC3E,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/find-near-duplicates.d.ts

@@ -0,0 +1,14 @@
+/**
+ * Near-duplicate body detection — LSH-banded MinHash, the single implementation graph's
+ * `near-duplicate-function-body` rule consumes (ADR-0064). Pure over `CloneCandidate[]`;
+ * emits tool-agnostic clusters (no `Signal`). Candidate pairs exclude identical
+ * `bodyHash` edges and cross-language false positives (via the pre-resolved
+ * `candidate.language`).
+ */
+import type { CloneCandidate, NearDupOpts, NearDuplicateCluster } from './types.js';
+/**
+ * Detect near-duplicate body clusters (Jaccard ≥ `minSimilarity`, same language, distinct
+ * exact hash). Returns one cluster per connected component with ≥2 near members.
+ */
+export declare function findNearDuplicates(candidates: readonly CloneCandidate[], opts?: NearDupOpts): NearDuplicateCluster[];
+//# sourceMappingURL=find-near-duplicates.d.ts.map

package/dist/find-near-duplicates.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"find-near-duplicates.d.ts","sourceRoot":"","sources":["../src/find-near-duplicates.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAUH,OAAO,KAAK,EAAE,cAAc,EAAE,WAAW,EAAE,oBAAoB,EAAE,MAAM,YAAY,CAAC;AAMpF;;;GAGG;AACH,wBAAgB,kBAAkB,CAChC,UAAU,EAAE,SAAS,cAAc,EAAE,EACrC,IAAI,GAAE,WAAgB,GACrB,oBAAoB,EAAE,CAgBxB"}