homegraph 1.5.0 → 1.5.2

package/dist/spec/mine/clusterer.d.ts

@@ -1,63 +0,0 @@
-/**
- * Commit Clusterer — multi-signal graph clustering for the `spec mine` pipeline.
- *
- * Groups commits by structural (AST symbol overlap), file-path, temporal,
- * and commit-message similarity. Pure TypeScript implementation — no native
- * dependencies required.
- *
- * Algorithm: Leiden community detection on a weighted similarity graph.
- * Replaces Louvain and connected-components (single-linkage) to avoid chaining
- * all commits into one giant cluster and to guarantee well-connected communities
- * via the refinement phase. A resolution parameter γ is auto-tuned via
- * multiplicative search so the output community count stays close to maxClusters.
- *
- * @module spec/mine/clusterer
- */
-import { CommitChange } from './scanner';
-/** A cluster of semantically-related commits. */
-export interface CommitCluster {
-    id: number;
-    commits: CommitChange[];
-    primaryFiles: string[];
-    primarySymbols: string[];
-    summary: string;
-    timeRange: {
-        start: number;
-        end: number;
-    };
-}
-/** Full clustering result including unclustered outliers and stats. */
-export interface ClusterResult {
-    clusters: CommitCluster[];
-    unclustered: CommitChange[];
-    stats: {
-        totalCommits: number;
-        clusteredCommits: number;
-        clusterCount: number;
-    };
-}
-/**
- * Cluster commits using Leiden community detection on a multi-signal
- * similarity graph, with recursive sub-splitting for large clusters.
- *
- * The pipeline:
- *   1. Build a weighted similarity graph from AST symbol, file-path,
- *      commit-message TF-IDF, ticket-reference, and temporal signals.
- *   2. Run Leiden community detection with auto-tuned resolution γ.
- *   3. Greedy-merge if still too many communities.
- *   4. Recursively split large clusters (≥ 4 commits) by running
- *      Leiden on their sub-graphs.
- *
- * Replaces the previous Louvain (no refinement) and connected-components
- * (single-linkage chaining) approaches.
- *
- * @param changes     - AST change data for each commit.
- * @param threshold   - Minimum similarity (0-1) for considering an edge.
- * @param maxClusters - Desired maximum number of top-level clusters.
- *                      The resolution parameter γ is auto-tuned to approach
- *                      this target. Recursive splitting may produce more
- *                      clusters at finer granularities.
- * @returns Clustered result with stats.
- */
-export declare function clusterCommits(changes: CommitChange[], threshold: number, maxClusters: number): ClusterResult;
-//# sourceMappingURL=clusterer.d.ts.map

package/dist/spec/mine/clusterer.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"clusterer.d.ts","sourceRoot":"","sources":["../../../src/spec/mine/clusterer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,WAAW,CAAC;AAQzC,iDAAiD;AACjD,MAAM,WAAW,aAAa;IAC5B,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,YAAY,EAAE,CAAC;IACxB,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,CAAC;CAC3C;AAED,uEAAuE;AACvE,MAAM,WAAW,aAAa;IAC5B,QAAQ,EAAE,aAAa,EAAE,CAAC;IAC1B,WAAW,EAAE,YAAY,EAAE,CAAC;IAC5B,KAAK,EAAE;QACL,YAAY,EAAE,MAAM,CAAC;QACrB,gBAAgB,EAAE,MAAM,CAAC;QACzB,YAAY,EAAE,MAAM,CAAC;KACtB,CAAC;CACH;AAs1BD;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,wBAAgB,cAAc,CAC5B,OAAO,EAAE,YAAY,EAAE,EACvB,SAAS,EAAE,MAAM,EACjB,WAAW,EAAE,MAAM,GAClB,aAAa,CA0Mf"}