homegraph 1.2.0 → 1.5.0

package/dist/spec/mine/clustering/leiden.js

@@ -0,0 +1,489 @@
+"use strict";
+/**
+ * Leiden community detection on a weighted similarity graph — a generic
+ * graph-clustering implementation with no dependency on the commit domain.
+ *
+ * Replaces Louvain and connected-components (single-linkage) to avoid chaining
+ * all nodes 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 a target.
+ *
+ * @module spec/mine/clustering/leiden
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.leiden = leiden;
+exports.recursiveSubSplit = recursiveSubSplit;
+exports.autoTuneResolution = autoTuneResolution;
+exports.greedyMerge = greedyMerge;
+const errors_1 = require("../../../errors");
+/** Compute weighted degree for every node. */
+function computeDegrees(graph) {
+    const n = graph.length;
+    const degrees = new Array(n).fill(0);
+    for (let i = 0; i < n; i++) {
+        for (let j = 0; j < n; j++) {
+            degrees[i] += graph[i][j];
+        }
+    }
+    return degrees;
+}
+/**
+ * Shuffle an array in place (Fisher-Yates). Returns the same array.
+ */
+function shuffle(arr) {
+    for (let i = arr.length - 1; i > 0; i--) {
+        const j = Math.floor(Math.random() * (i + 1));
+        [arr[i], arr[j]] = [arr[j], arr[i]];
+    }
+    return arr;
+}
+/**
+ * Create an array [0, 1, ..., n-1].
+ */
+function range(n) {
+    return Array.from({ length: n }, (_, i) => i);
+}
+/**
+ * Modularity gain from moving node i into community C.
+ *
+ * Assumes node i has already been *removed* from its current community.
+ *
+ * @param k_i_in   - Sum of edge weights from node i to community C.
+ * @param k_i      - Weighted degree of node i.
+ * @param sigmaTotC - Total weighted degree of community C BEFORE adding i.
+ * @param m2       - Twice the total edge weight of the graph (2m).
+ * @param gamma    - Resolution parameter (higher = more communities).
+ */
+function modularityGain(k_i_in, k_i, sigmaTotC, m2, gamma) {
+    if (m2 === 0)
+        return 0;
+    return k_i_in - gamma * sigmaTotC * k_i / m2;
+}
+/**
+ * Refinement phase of the Leiden algorithm.
+ *
+ * For each Phase-1 community, runs a restricted local-moving pass that starts
+ * from singleton sub-communities and only allows moves within the same community.
+ * This guarantees that sub-communities are internally well-connected before they
+ * are aggregated — the key advantage of Leiden over Louvain.
+ *
+ * @param graph       - Full weighted graph.
+ * @param communities - Phase-1 partition (list of node-index arrays).
+ * @param degrees     - Pre-computed weighted degrees for every node.
+ * @param m2          - Twice the total edge weight of the full graph.
+ * @param gamma       - Resolution parameter.
+ * @returns Refined partition — flat list of sub-community node-index arrays.
+ */
+function refine(graph, communities, degrees, m2, gamma) {
+    const refined = [];
+    for (const community of communities) {
+        if (community.length <= 1) {
+            refined.push([...community]);
+            continue;
+        }
+        const nodes = community;
+        const nodeCount = nodes.length;
+        // Each node starts in its own singleton sub-community.
+        const nodeToSub = range(nodeCount);
+        const subSigmaTot = nodes.map((n) => degrees[n]);
+        // Local moving restricted to within this community only.
+        const MAX_PASSES = 20;
+        for (let pass = 0; pass < MAX_PASSES; pass++) {
+            let moved = false;
+            const order = shuffle(range(nodeCount));
+            for (const localIdx of order) {
+                const globalNode = nodes[localIdx];
+                const currentSub = nodeToSub[localIdx];
+                const k_i = degrees[globalNode];
+                // Collect edge weights to neighbor sub-communities (within this community only).
+                const neighborSubs = new Map();
+                for (let j = 0; j < nodeCount; j++) {
+                    if (j === localIdx)
+                        continue;
+                    const w = graph[globalNode][nodes[j]];
+                    if (w > 0) {
+                        const subJ = nodeToSub[j];
+                        neighborSubs.set(subJ, (neighborSubs.get(subJ) || 0) + w);
+                    }
+                }
+                // ΔQ for removing from current sub-community.
+                const k_i_in_current = neighborSubs.get(currentSub) || 0;
+                const sigmaTotCurrent = subSigmaTot[currentSub];
+                const sigmaTotCurrentWithout = sigmaTotCurrent - k_i;
+                const deltaQRemove = k_i_in_current > 0 || sigmaTotCurrentWithout > 0
+                    ? -(k_i_in_current - gamma * sigmaTotCurrentWithout * k_i / m2)
+                    : 0;
+                let bestSub = currentSub;
+                let bestDeltaQ = 0;
+                for (const [subId, k_i_in] of neighborSubs) {
+                    if (subId === currentSub)
+                        continue;
+                    const sigmaTotTarget = subSigmaTot[subId];
+                    if (sigmaTotTarget === 0)
+                        continue;
+                    const deltaQAdd = modularityGain(k_i_in, k_i, sigmaTotTarget, m2, gamma);
+                    const totalDelta = deltaQRemove + deltaQAdd;
+                    if (totalDelta > bestDeltaQ) {
+                        bestDeltaQ = totalDelta;
+                        bestSub = subId;
+                    }
+                }
+                if (bestSub !== currentSub) {
+                    nodeToSub[localIdx] = bestSub;
+                    subSigmaTot[currentSub] -= k_i;
+                    subSigmaTot[bestSub] += k_i;
+                    moved = true;
+                }
+            }
+            if (!moved)
+                break;
+        }
+        // Collect non-empty sub-communities from this community.
+        const subCommToNodes = new Map();
+        for (let i = 0; i < nodeCount; i++) {
+            const subId = nodeToSub[i];
+            if (!subCommToNodes.has(subId)) {
+                subCommToNodes.set(subId, []);
+            }
+            subCommToNodes.get(subId).push(nodes[i]);
+        }
+        for (const [, members] of subCommToNodes) {
+            refined.push(members);
+        }
+    }
+    return refined;
+}
+/**
+ * Core Leiden algorithm: iterative local-moving + refinement + aggregation.
+ *
+ * Unlike Louvain (which feeds the Phase-1 partition directly into aggregation),
+ * Leiden inserts a refinement step that splits each Phase-1 community into
+ * well-connected sub-communities. Only the refined partition is aggregated.
+ * This guarantees internally-connected communities and avoids the
+ * "disconnected community" defect of Louvain.
+ *
+ * @param graph  - Weighted undirected similarity graph.
+ * @param gamma  - Resolution parameter (default 1.0).
+ * @param depth  - Aggregation depth guard (internal use).
+ */
+function leiden(graph, gamma, depth = 0) {
+    const n = graph.length;
+    if (n <= 1) {
+        return n === 0 ? [] : [[0]];
+    }
+    const degrees = computeDegrees(graph);
+    const totalWeight = degrees.reduce((a, b) => a + b, 0);
+    const m2 = totalWeight; // 2m (sum of all degrees = 2 × sum of edge weights)
+    // Each node starts in its own community
+    const nodeToComm = range(n);
+    // Per-community stats
+    // sigmaTot[c] = sum of degrees of all nodes in community c
+    const sigmaTot = [...degrees];
+    // Phase 1: local moving
+    const MAX_PASSES = 20;
+    for (let pass = 0; pass < MAX_PASSES; pass++) {
+        let moved = false;
+        const order = shuffle(range(n));
+        for (const node of order) {
+            const currentComm = nodeToComm[node];
+            const k_i = degrees[node];
+            // Collect edge weights to each neighbor community
+            const neighborComms = new Map(); // commId → k_i_in
+            for (let j = 0; j < n; j++) {
+                const w = graph[node][j];
+                if (w > 0) {
+                    const cj = nodeToComm[j];
+                    neighborComms.set(cj, (neighborComms.get(cj) || 0) + w);
+                }
+            }
+            // Compute ΔQ for removing node from its current community.
+            // k_i_in_current = edges from node to nodes in current community.
+            const k_i_in_current = neighborComms.get(currentComm) || 0;
+            const sigmaTotCurrent = sigmaTot[currentComm];
+            // ΔQ of removal (negative of the gain formula applied to current community
+            // with sigmaTot excluding self)
+            const sigmaTotCurrentWithout = sigmaTotCurrent - k_i;
+            const deltaQRemove = k_i_in_current > 0 || sigmaTotCurrentWithout > 0
+                ? -(k_i_in_current - gamma * sigmaTotCurrentWithout * k_i / m2)
+                : 0;
+            // Find best community to move to
+            let bestComm = currentComm;
+            let bestDeltaQ = 0;
+            for (const [commId, k_i_in] of neighborComms) {
+                if (commId === currentComm)
+                    continue;
+                const sigmaTotTarget = sigmaTot[commId];
+                if (sigmaTotTarget === 0)
+                    continue;
+                const deltaQAdd = modularityGain(k_i_in, k_i, sigmaTotTarget, m2, gamma);
+                const totalDelta = deltaQRemove + deltaQAdd;
+                if (totalDelta > bestDeltaQ) {
+                    bestDeltaQ = totalDelta;
+                    bestComm = commId;
+                }
+            }
+            if (bestComm !== currentComm) {
+                // Move node from currentComm to bestComm
+                nodeToComm[node] = bestComm;
+                sigmaTot[currentComm] -= k_i;
+                sigmaTot[bestComm] += k_i;
+                moved = true;
+            }
+        }
+        if (!moved)
+            break;
+    }
+    // Collect non-empty communities from Phase 1
+    const commIdToMembers = new Map();
+    for (let i = 0; i < n; i++) {
+        const cid = nodeToComm[i];
+        if (!commIdToMembers.has(cid)) {
+            commIdToMembers.set(cid, []);
+        }
+        commIdToMembers.get(cid).push(i);
+    }
+    const communities = Array.from(commIdToMembers.values());
+    // Refinement: split each Phase-1 community into well-connected sub-communities.
+    const refinedCommunities = refine(graph, communities, degrees, m2, gamma);
+    // Phase 2: Aggregation using refined partition (Leiden key difference from Louvain).
+    const k = refinedCommunities.length;
+    if (k < n && k > 1 && depth < 5) {
+        const aggGraph = aggregateGraph(graph, refinedCommunities);
+        const subCommunities = leiden(aggGraph, gamma, depth + 1);
+        return mapBackCommunities(subCommunities, refinedCommunities);
+    }
+    return refinedCommunities;
+}
+/**
+ * Build an aggregated graph where each node represents a community from the
+ * previous level. Edge weights are summed across community boundaries.
+ */
+function aggregateGraph(graph, communities) {
+    const k = communities.length;
+    const agg = Array.from({ length: k }, () => new Array(k).fill(0));
+    // Build reverse map: original node → community index
+    const nodeToCommIdx = new Map();
+    for (let ci = 0; ci < k; ci++) {
+        for (const node of communities[ci]) {
+            nodeToCommIdx.set(node, ci);
+        }
+    }
+    // Aggregate edge weights
+    for (let i = 0; i < graph.length; i++) {
+        const ci = nodeToCommIdx.get(i);
+        for (let j = i + 1; j < graph.length; j++) {
+            const w = graph[i][j];
+            if (w > 0) {
+                const cj = nodeToCommIdx.get(j);
+                if (ci === cj) {
+                    // Self-loop: double weight to preserve total degree
+                    // (each internal edge contributes to degrees of both endpoints).
+                    agg[ci][ci] += 2 * w;
+                }
+                else {
+                    agg[ci][cj] += w;
+                    agg[cj][ci] += w;
+                }
+            }
+        }
+    }
+    return agg;
+}
+/**
+ * Map aggregated-level community indices back to original node indices.
+ */
+function mapBackCommunities(subCommunities, originalCommunities) {
+    return subCommunities.map((aggComm) => {
+        const members = [];
+        for (const aggIdx of aggComm) {
+            for (const node of originalCommunities[aggIdx]) {
+                members.push(node);
+            }
+        }
+        return members;
+    });
+}
+/**
+ * Extract a sub-graph containing only the specified nodes and edges between them.
+ *
+ * @param graph   - Full weighted graph.
+ * @param indices - Node indices to include in the sub-graph.
+ * @returns New WeightedGraph with local indexing; subGraph[i][j] == graph[indices[i]][indices[j]].
+ */
+function extractSubGraph(graph, indices) {
+    const m = indices.length;
+    const subGraph = Array.from({ length: m }, () => new Array(m).fill(0));
+    for (let i = 0; i < m; i++) {
+        for (let j = i + 1; j < m; j++) {
+            const w = graph[indices[i]][indices[j]];
+            subGraph[i][j] = w;
+            subGraph[j][i] = w;
+        }
+    }
+    return subGraph;
+}
+// ---------------------------------------------------------------------------
+// Resolution Auto-Tuning
+// ---------------------------------------------------------------------------
+/** Maximum iterations for resolution parameter search. */
+const MAX_TUNING_ITER = 15;
+/** Minimum cluster size to consider for recursive sub-splitting. */
+const MIN_SUBSPLIT_SIZE = 4;
+/** Maximum recursion depth for sub-splitting. */
+const MAX_SUBSPLIT_DEPTH = 3;
+/**
+ * Recursively split large clusters by running Leiden on their sub-graphs.
+ *
+ * For each cluster with size > MIN_SUBSPLIT_SIZE, extracts its sub-graph,
+ * runs Leiden with auto-tuned γ (targeting up to min(5, floor(size/2))),
+ * and recursively splits further if sub-communities still have structure.
+ *
+ * Stop conditions:
+ *   - Cluster size ≤ MIN_SUBSPLIT_SIZE
+ *   - Sub-graph Leiden returns 1 community (no further structure)
+ *   - Max recursion depth reached (MAX_SUBSPLIT_DEPTH)
+ *
+ * @param graph       - Full original weighted graph.
+ * @param communities - Current partition (list of node-index arrays).
+ * @param depth       - Current recursion depth (internal).
+ * @returns Flat list of leaf-community node-index arrays.
+ */
+function recursiveSubSplit(graph, communities, depth = 0) {
+    if (depth >= MAX_SUBSPLIT_DEPTH)
+        return communities;
+    const result = [];
+    for (const community of communities) {
+        if (community.length <= MIN_SUBSPLIT_SIZE) {
+            result.push(community);
+            continue;
+        }
+        // Extract sub-graph and run Leiden with independent γ tuning.
+        const subGraph = extractSubGraph(graph, community);
+        const targetClusters = Math.min(5, Math.floor(community.length / 2));
+        const subComms = autoTuneResolution(subGraph, targetClusters);
+        if (subComms.length <= 1) {
+            // No further structure found — keep as-is.
+            result.push(community);
+            continue;
+        }
+        // Map sub-community local indices back to original graph indices.
+        const mappedSubComms = subComms.map((subComm) => subComm.map((localIdx) => community[localIdx]));
+        // Recurse into sub-communities.
+        const splitResult = recursiveSubSplit(graph, mappedSubComms, depth + 1);
+        result.push(...splitResult);
+    }
+    return result;
+}
+/**
+ * Adjust the resolution parameter γ so that Leiden produces approximately
+ * `targetClusters` communities.
+ *
+ * Uses multiplicative search: higher γ → more communities, lower γ → fewer.
+ */
+function autoTuneResolution(graph, maxClusters) {
+    const n = graph.length;
+    if (n <= maxClusters) {
+        // Can't have more communities than nodes. Run once with default gamma
+        // and let post-processing handle it.
+        return leiden(graph, 1.0);
+    }
+    let gamma = 1.0;
+    let communities = leiden(graph, gamma);
+    let count = communities.length;
+    // If already in range (±30% tolerance with upper cap at maxClusters), accept.
+    if (count >= Math.ceil(maxClusters * 0.5) && count <= maxClusters) {
+        return communities;
+    }
+    // Multiplicative search: keep adjusting gamma until we bracket the target.
+    let lowGamma = 0.05;
+    let highGamma = 50.0;
+    let lowCommunities = null;
+    let highCommunities = null;
+    for (let iter = 0; iter < MAX_TUNING_ITER; iter++) {
+        // Run Leiden at current gamma
+        communities = leiden(graph, gamma);
+        count = communities.length;
+        (0, errors_1.logDebug)('Clusterer: resolution tuning', {
+            iteration: iter,
+            gamma: Math.round(gamma * 1000) / 1000,
+            communities: count,
+            target: maxClusters,
+        });
+        if (count >= Math.ceil(maxClusters * 0.5) && count <= maxClusters) {
+            // In range — accept.
+            return communities;
+        }
+        if (count > maxClusters) {
+            // Too many communities → need lower gamma
+            highGamma = gamma;
+            highCommunities = communities;
+            gamma = Math.max(lowGamma, gamma * 0.65);
+        }
+        else {
+            // Too few communities → need higher gamma
+            lowGamma = gamma;
+            lowCommunities = communities;
+            gamma = Math.min(highGamma, gamma * 1.55);
+        }
+        // If search range collapsed, exit
+        if (highGamma - lowGamma < 0.01)
+            break;
+    }
+    // Prefer the result with count closest to (but not exceeding) maxClusters.
+    // If both exceed, use the one with fewer communities.
+    if (lowCommunities && highCommunities) {
+        const lowCount = lowCommunities.length;
+        const highCount = highCommunities.length;
+        if (lowCount <= maxClusters && highCount > maxClusters) {
+            return lowCommunities;
+        }
+        if (lowCount > maxClusters && highCount > maxClusters) {
+            return lowCount <= highCount ? lowCommunities : highCommunities;
+        }
+        // Both <= maxClusters: prefer the one closer to target
+        const lowDist = maxClusters - lowCount;
+        const highDist = maxClusters - highCount;
+        return lowDist <= highDist ? lowCommunities : highCommunities;
+    }
+    return communities;
+}
+// ---------------------------------------------------------------------------
+// Greedy Merge (fallback when too many communities)
+// ---------------------------------------------------------------------------
+/**
+ * Greedily merge communities until count ≤ maxClusters, by repeatedly
+ * merging the pair with the highest average inter-community similarity.
+ */
+function greedyMerge(graph, communities, maxClusters) {
+    if (communities.length <= maxClusters)
+        return communities;
+    let current = communities.map((c) => [...c]);
+    while (current.length > maxClusters) {
+        let bestPair = null;
+        let bestSim = -Infinity;
+        for (let i = 0; i < current.length; i++) {
+            for (let j = i + 1; j < current.length; j++) {
+                let sum = 0;
+                let count = 0;
+                for (const a of current[i]) {
+                    for (const b of current[j]) {
+                        sum += graph[a][b];
+                        count++;
+                    }
+                }
+                const avgSim = count > 0 ? sum / count : 0;
+                if (avgSim > bestSim) {
+                    bestSim = avgSim;
+                    bestPair = [i, j];
+                }
+            }
+        }
+        if (!bestPair)
+            break;
+        const [a, b] = bestPair;
+        current[a] = [...current[a], ...current[b]];
+        current.splice(b, 1);
+    }
+    return current;
+}
+//# sourceMappingURL=leiden.js.map

package/dist/spec/mine/clustering/leiden.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"leiden.js","sourceRoot":"","sources":["../../../../src/spec/mine/clustering/leiden.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;GAUG;;AAyLH,wBA0GC;AAsHD,8CAqCC;AAQD,gDA8EC;AAUD,kCAuCC;AAnkBD,4CAA2C;AAQ3C,8CAA8C;AAC9C,SAAS,cAAc,CAAC,KAAoB;IAC1C,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,MAAM,OAAO,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,OAAO,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC,CAAE,CAAC;QAC9B,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;GAEG;AACH,SAAS,OAAO,CAAI,GAAQ;IAC1B,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,EAAE,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;IACxC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;GAEG;AACH,SAAS,KAAK,CAAC,CAAS;IACtB,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;AAChD,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,cAAc,CACrB,MAAc,EACd,GAAW,EACX,SAAiB,EACjB,EAAU,EACV,KAAa;IAEb,IAAI,EAAE,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACvB,OAAO,MAAM,GAAG,KAAK,GAAG,SAAS,GAAG,GAAG,GAAG,EAAE,CAAC;AAC/C,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,SAAS,MAAM,CACb,KAAoB,EACpB,WAAuB,EACvB,OAAiB,EACjB,EAAU,EACV,KAAa;IAEb,MAAM,OAAO,GAAe,EAAE,CAAC;IAE/B,KAAK,MAAM,SAAS,IAAI,WAAW,EAAE,CAAC;QACpC,IAAI,SAAS,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAC1B,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;YAC7B,SAAS;QACX,CAAC;QAED,MAAM,KAAK,GAAG,SAAS,CAAC;QACxB,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC;QAE/B,uDAAuD;QACvD,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC;QACnC,MAAM,WAAW,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,CAAC;QAElD,yDAAyD;QACzD,MAAM,UAAU,GAAG,EAAE,CAAC;QACtB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,UAAU,EAAE,IAAI,EAAE,EAAE,CAAC;YAC7C,IAAI,KAAK,GAAG,KAAK,CAAC;YAClB,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC;YAExC,KAAK,MAAM,QAAQ,IAAI,KAAK,EAAE,CAAC;gBAC7B,MAAM,UAAU,GAAG,KAAK,CAAC,QAAQ,CAAE,CAAC;gBACpC,MAAM,UAAU,GAAG,SAAS,CAAC,QAAQ,CAAE,CAAC;gBACxC,MAAM,GAAG,GAAG,OAAO,CAAC,UAAU,CAAE,CAAC;gBAEjC,iFAAiF;gBACjF,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;gBAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;oBACnC,IAAI,CAAC,KAAK,QAAQ;wBAAE,SAAS;oBAC7B,MAAM,CAAC,GAAG,KAAK,CAAC,UAAU,CAAE,CAAC,KAAK,CAAC,CAAC,CAAE,CAAE,CAAC;oBACzC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;wBACV,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAE,CAAC;wBAC3B,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBAC5D,CAAC;gBACH,CAAC;gBAED,8CAA8C;gBAC9C,MAAM,cAAc,GAAG,YAAY,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;gBACzD,MAAM,eAAe,GAAG,WAAW,CAAC,UAAU,CAAE,CAAC;gBACjD,MAAM,sBAAsB,GAAG,eAAe,GAAG,GAAG,CAAC;gBACrD,MAAM,YAAY,GAAG,cAAc,GAAG,CAAC,IAAI,sBAAsB,GAAG,CAAC;oBACnE,CAAC,CAAC,CAAC,CAAC,cAAc,GAAG,KAAK,GAAG,sBAAsB,GAAG,GAAG,GAAG,EAAE,CAAC;oBAC/D,CAAC,CAAC,CAAC,CAAC;gBAEN,IAAI,OAAO,GAAG,UAAU,CAAC;gBACzB,IAAI,UAAU,GAAG,CAAC,CAAC;gBAEnB,KAAK,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;oBAC3C,IAAI,KAAK,KAAK,UAAU;wBAAE,SAAS;oBACnC,MAAM,cAAc,GAAG,WAAW,CAAC,KAAK,CAAE,CAAC;oBAC3C,IAAI,cAAc,KAAK,CAAC;wBAAE,SAAS;oBACnC,MAAM,SAAS,GAAG,cAAc,CAAC,MAAM,EAAE,GAAG,EAAE,cAAc,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;oBACzE,MAAM,UAAU,GAAG,YAAY,GAAG,SAAS,CAAC;oBAC5C,IAAI,UAAU,GAAG,UAAU,EAAE,CAAC;wBAC5B,UAAU,GAAG,UAAU,CAAC;wBACxB,OAAO,GAAG,KAAK,CAAC;oBAClB,CAAC;gBACH,CAAC;gBAED,IAAI,OAAO,KAAK,UAAU,EAAE,CAAC;oBAC3B,SAAS,CAAC,QAAQ,CAAC,GAAG,OAAO,CAAC;oBAC9B,WAAW,CAAC,UAAU,CAAE,IAAI,GAAG,CAAC;oBAChC,WAAW,CAAC,OAAO,CAAE,IAAI,GAAG,CAAC;oBAC7B,KAAK,GAAG,IAAI,CAAC;gBACf,CAAC;YACH,CAAC;YAED,IAAI,CAAC,KAAK;gBAAE,MAAM;QACpB,CAAC;QAED,yDAAyD;QACzD,MAAM,cAAc,GAAG,IAAI,GAAG,EAAoB,CAAC;QACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAE,CAAC;YAC5B,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC/B,cAAc,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YAChC,CAAC;YACD,cAAc,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC;QAC7C,CAAC;QACD,KAAK,MAAM,CAAC,EAAE,OAAO,CAAC,IAAI,cAAc,EAAE,CAAC;YACzC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,SAAgB,MAAM,CACpB,KAAoB,EACpB,KAAa,EACb,QAAgB,CAAC;IAEjB,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QACX,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC;IAED,MAAM,OAAO,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;IACtC,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACvD,MAAM,EAAE,GAAG,WAAW,CAAC,CAAC,oDAAoD;IAE5E,wCAAwC;IACxC,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IAE5B,sBAAsB;IACtB,2DAA2D;IAC3D,MAAM,QAAQ,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC;IAE9B,wBAAwB;IACxB,MAAM,UAAU,GAAG,EAAE,CAAC;IACtB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,UAAU,EAAE,IAAI,EAAE,EAAE,CAAC;QAC7C,IAAI,KAAK,GAAG,KAAK,CAAC;QAClB,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAEhC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,WAAW,GAAG,UAAU,CAAC,IAAI,CAAE,CAAC;YACtC,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAE,CAAC;YAE3B,kDAAkD;YAClD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC,CAAC,kBAAkB;YACnE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAE,CAAC,CAAC,CAAE,CAAC;gBAC3B,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;oBACV,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,CAAE,CAAC;oBAC1B,aAAa,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC1D,CAAC;YACH,CAAC;YAED,2DAA2D;YAC3D,kEAAkE;YAClE,MAAM,cAAc,GAAG,aAAa,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YAC3D,MAAM,eAAe,GAAG,QAAQ,CAAC,WAAW,CAAE,CAAC;YAC/C,2EAA2E;YAC3E,gCAAgC;YAChC,MAAM,sBAAsB,GAAG,eAAe,GAAG,GAAG,CAAC;YACrD,MAAM,YAAY,GAAG,cAAc,GAAG,CAAC,IAAI,sBAAsB,GAAG,CAAC;gBACnE,CAAC,CAAC,CAAC,CAAC,cAAc,GAAG,KAAK,GAAG,sBAAsB,GAAG,GAAG,GAAG,EAAE,CAAC;gBAC/D,CAAC,CAAC,CAAC,CAAC;YAEN,iCAAiC;YACjC,IAAI,QAAQ,GAAG,WAAW,CAAC;YAC3B,IAAI,UAAU,GAAG,CAAC,CAAC;YAEnB,KAAK,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,aAAa,EAAE,CAAC;gBAC7C,IAAI,MAAM,KAAK,WAAW;oBAAE,SAAS;gBAErC,MAAM,cAAc,GAAG,QAAQ,CAAC,MAAM,CAAE,CAAC;gBACzC,IAAI,cAAc,KAAK,CAAC;oBAAE,SAAS;gBAEnC,MAAM,SAAS,GAAG,cAAc,CAAC,MAAM,EAAE,GAAG,EAAE,cAAc,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;gBACzE,MAAM,UAAU,GAAG,YAAY,GAAG,SAAS,CAAC;gBAE5C,IAAI,UAAU,GAAG,UAAU,EAAE,CAAC;oBAC5B,UAAU,GAAG,UAAU,CAAC;oBACxB,QAAQ,GAAG,MAAM,CAAC;gBACpB,CAAC;YACH,CAAC;YAED,IAAI,QAAQ,KAAK,WAAW,EAAE,CAAC;gBAC7B,yCAAyC;gBACzC,UAAU,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC;gBAC5B,QAAQ,CAAC,WAAW,CAAE,IAAI,GAAG,CAAC;gBAC9B,QAAQ,CAAC,QAAQ,CAAE,IAAI,GAAG,CAAC;gBAC3B,KAAK,GAAG,IAAI,CAAC;YACf,CAAC;QACH,CAAC;QAED,IAAI,CAAC,KAAK;YAAE,MAAM;IACpB,CAAC;IAED,6CAA6C;IAC7C,MAAM,eAAe,GAAG,IAAI,GAAG,EAAoB,CAAC;IACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,CAAE,CAAC;QAC3B,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAC9B,eAAe,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QAC/B,CAAC;QACD,eAAe,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC;IACD,MAAM,WAAW,GAAe,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,CAAC,CAAC;IAErE,gFAAgF;IAChF,MAAM,kBAAkB,GAAG,MAAM,CAAC,KAAK,EAAE,WAAW,EAAE,OAAO,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;IAE1E,qFAAqF;IACrF,MAAM,CAAC,GAAG,kBAAkB,CAAC,MAAM,CAAC;IACpC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QAChC,MAAM,QAAQ,GAAG,cAAc,CAAC,KAAK,EAAE,kBAAkB,CAAC,CAAC;QAC3D,MAAM,cAAc,GAAG,MAAM,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QAC1D,OAAO,kBAAkB,CAAC,cAAc,EAAE,kBAAkB,CAAC,CAAC;IAChE,CAAC;IAED,OAAO,kBAAkB,CAAC;AAC5B,CAAC;AAED;;;GAGG;AACH,SAAS,cAAc,CACrB,KAAoB,EACpB,WAAuB;IAEvB,MAAM,CAAC,GAAG,WAAW,CAAC,MAAM,CAAC;IAC7B,MAAM,GAAG,GAAkB,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CACxD,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CACrB,CAAC;IAEF,qDAAqD;IACrD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;IAChD,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;QAC9B,KAAK,MAAM,IAAI,IAAI,WAAW,CAAC,EAAE,CAAE,EAAE,CAAC;YACpC,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IAED,yBAAyB;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,EAAE,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;QACjC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC,CAAE,CAAC;YACxB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBACV,MAAM,EAAE,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;gBACjC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;oBACd,oDAAoD;oBACpD,iEAAiE;oBACjE,GAAG,CAAC,EAAE,CAAE,CAAC,EAAE,CAAE,IAAI,CAAC,GAAG,CAAC,CAAC;gBACzB,CAAC;qBAAM,CAAC;oBACN,GAAG,CAAC,EAAE,CAAE,CAAC,EAAE,CAAE,IAAI,CAAC,CAAC;oBACnB,GAAG,CAAC,EAAE,CAAE,CAAC,EAAE,CAAE,IAAI,CAAC,CAAC;gBACrB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;GAEG;AACH,SAAS,kBAAkB,CACzB,cAA0B,EAC1B,mBAA+B;IAE/B,OAAO,cAAc,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE;QACpC,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,KAAK,MAAM,IAAI,IAAI,mBAAmB,CAAC,MAAM,CAAE,EAAE,CAAC;gBAChD,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;;GAMG;AACH,SAAS,eAAe,CACtB,KAAoB,EACpB,OAAiB;IAEjB,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;IACzB,MAAM,QAAQ,GAAkB,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAC7D,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CACrB,CAAC;IACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,MAAM,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAE,CAAE,CAAC,OAAO,CAAC,CAAC,CAAE,CAAE,CAAC;YAC5C,QAAQ,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACpB,QAAQ,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,8EAA8E;AAC9E,yBAAyB;AACzB,8EAA8E;AAE9E,0DAA0D;AAC1D,MAAM,eAAe,GAAG,EAAE,CAAC;AAE3B,oEAAoE;AACpE,MAAM,iBAAiB,GAAG,CAAC,CAAC;AAE5B,iDAAiD;AACjD,MAAM,kBAAkB,GAAG,CAAC,CAAC;AAE7B;;;;;;;;;;;;;;;;GAgBG;AACH,SAAgB,iBAAiB,CAC/B,KAAoB,EACpB,WAAuB,EACvB,QAAgB,CAAC;IAEjB,IAAI,KAAK,IAAI,kBAAkB;QAAE,OAAO,WAAW,CAAC;IAEpD,MAAM,MAAM,GAAe,EAAE,CAAC;IAE9B,KAAK,MAAM,SAAS,IAAI,WAAW,EAAE,CAAC;QACpC,IAAI,SAAS,CAAC,MAAM,IAAI,iBAAiB,EAAE,CAAC;YAC1C,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACvB,SAAS;QACX,CAAC;QAED,8DAA8D;QAC9D,MAAM,QAAQ,GAAG,eAAe,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QACnD,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;QACrE,MAAM,QAAQ,GAAG,kBAAkB,CAAC,QAAQ,EAAE,cAAc,CAAC,CAAC;QAE9D,IAAI,QAAQ,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YACzB,2CAA2C;YAC3C,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACvB,SAAS;QACX,CAAC;QAED,kEAAkE;QAClE,MAAM,cAAc,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAC9C,OAAO,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,SAAS,CAAC,QAAQ,CAAE,CAAC,CAChD,CAAC;QAEF,gCAAgC;QAChC,MAAM,WAAW,GAAG,iBAAiB,CAAC,KAAK,EAAE,cAAc,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QACxE,MAAM,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC;IAC9B,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;GAKG;AACH,SAAgB,kBAAkB,CAChC,KAAoB,EACpB,WAAmB;IAEnB,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,IAAI,CAAC,IAAI,WAAW,EAAE,CAAC;QACrB,sEAAsE;QACtE,qCAAqC;QACrC,OAAO,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IAC5B,CAAC;IAED,IAAI,KAAK,GAAG,GAAG,CAAC;IAChB,IAAI,WAAW,GAAG,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IACvC,IAAI,KAAK,GAAG,WAAW,CAAC,MAAM,CAAC;IAE/B,8EAA8E;IAC9E,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,GAAG,GAAG,CAAC,IAAI,KAAK,IAAI,WAAW,EAAE,CAAC;QAClE,OAAO,WAAW,CAAC;IACrB,CAAC;IAED,2EAA2E;IAC3E,IAAI,QAAQ,GAAG,IAAI,CAAC;IACpB,IAAI,SAAS,GAAG,IAAI,CAAC;IACrB,IAAI,cAAc,GAAsB,IAAI,CAAC;IAC7C,IAAI,eAAe,GAAsB,IAAI,CAAC;IAE9C,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,eAAe,EAAE,IAAI,EAAE,EAAE,CAAC;QAClD,8BAA8B;QAC9B,WAAW,GAAG,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACnC,KAAK,GAAG,WAAW,CAAC,MAAM,CAAC;QAE3B,IAAA,iBAAQ,EAAC,8BAA8B,EAAE;YACvC,SAAS,EAAE,IAAI;YACf,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,IAAI;YACtC,WAAW,EAAE,KAAK;YAClB,MAAM,EAAE,WAAW;SACpB,CAAC,CAAC;QAEH,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,GAAG,GAAG,CAAC,IAAI,KAAK,IAAI,WAAW,EAAE,CAAC;YAClE,qBAAqB;YACrB,OAAO,WAAW,CAAC;QACrB,CAAC;QAED,IAAI,KAAK,GAAG,WAAW,EAAE,CAAC;YACxB,0CAA0C;YAC1C,SAAS,GAAG,KAAK,CAAC;YAClB,eAAe,GAAG,WAAW,CAAC;YAC9B,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,GAAG,IAAI,CAAC,CAAC;QAC3C,CAAC;aAAM,CAAC;YACN,0CAA0C;YAC1C,QAAQ,GAAG,KAAK,CAAC;YACjB,cAAc,GAAG,WAAW,CAAC;YAC7B,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,GAAG,IAAI,CAAC,CAAC;QAC5C,CAAC;QAED,kCAAkC;QAClC,IAAI,SAAS,GAAG,QAAQ,GAAG,IAAI;YAAE,MAAM;IACzC,CAAC;IAED,2EAA2E;IAC3E,sDAAsD;IACtD,IAAI,cAAc,IAAI,eAAe,EAAE,CAAC;QACtC,MAAM,QAAQ,GAAG,cAAc,CAAC,MAAM,CAAC;QACvC,MAAM,SAAS,GAAG,eAAe,CAAC,MAAM,CAAC;QAEzC,IAAI,QAAQ,IAAI,WAAW,IAAI,SAAS,GAAG,WAAW,EAAE,CAAC;YACvD,OAAO,cAAc,CAAC;QACxB,CAAC;QACD,IAAI,QAAQ,GAAG,WAAW,IAAI,SAAS,GAAG,WAAW,EAAE,CAAC;YACtD,OAAO,QAAQ,IAAI,SAAS,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,eAAe,CAAC;QAClE,CAAC;QACD,uDAAuD;QACvD,MAAM,OAAO,GAAG,WAAW,GAAG,QAAQ,CAAC;QACvC,MAAM,QAAQ,GAAG,WAAW,GAAG,SAAS,CAAC;QACzC,OAAO,OAAO,IAAI,QAAQ,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,eAAe,CAAC;IAChE,CAAC;IAED,OAAO,WAAW,CAAC;AACrB,CAAC;AAED,8EAA8E;AAC9E,oDAAoD;AACpD,8EAA8E;AAE9E;;;GAGG;AACH,SAAgB,WAAW,CACzB,KAAoB,EACpB,WAAuB,EACvB,WAAmB;IAEnB,IAAI,WAAW,CAAC,MAAM,IAAI,WAAW;QAAE,OAAO,WAAW,CAAC;IAE1D,IAAI,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAE7C,OAAO,OAAO,CAAC,MAAM,GAAG,WAAW,EAAE,CAAC;QACpC,IAAI,QAAQ,GAA4B,IAAI,CAAC;QAC7C,IAAI,OAAO,GAAG,CAAC,QAAQ,CAAC;QAExB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5C,IAAI,GAAG,GAAG,CAAC,CAAC;gBACZ,IAAI,KAAK,GAAG,CAAC,CAAC;gBACd,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,CAAC,CAAE,EAAE,CAAC;oBAC5B,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,CAAC,CAAE,EAAE,CAAC;wBAC5B,GAAG,IAAI,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC,CAAE,CAAC;wBACrB,KAAK,EAAE,CAAC;oBACV,CAAC;gBACH,CAAC;gBACD,MAAM,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3C,IAAI,MAAM,GAAG,OAAO,EAAE,CAAC;oBACrB,OAAO,GAAG,MAAM,CAAC;oBACjB,QAAQ,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACpB,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,CAAC,QAAQ;YAAE,MAAM;QAErB,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,QAAQ,CAAC;QACxB,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,CAAE,EAAE,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC,CAAC;QAC9C,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACvB,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC"}

package/dist/spec/mine/clustering/text-similarity.d.ts

@@ -0,0 +1,22 @@
+/**
+ * Text-similarity utilities for commit clustering — tokenisation, Jaccard /
+ * cosine similarity, and a minimal TF-IDF vectorizer. Pure functions with no
+ * dependency on the commit/cluster domain.
+ *
+ * @module spec/mine/clustering/text-similarity
+ */
+/** Tokenize a string into lowercase words (3+ chars). */
+export declare function tokenize(text: string): string[];
+/** Jaccard similarity between two sets of strings. */
+export declare function jaccard(a: string[], b: string[]): number;
+/** Cosine similarity between two equal-length numeric vectors. */
+export declare function cosineSimilarity(a: number[], b: number[]): number;
+export declare class TfidfVectorizer {
+    private vocabulary;
+    private idf;
+    /** Build vocabulary and compute IDF from document corpus. */
+    fit(documents: string[][]): void;
+    /** Transform a document into a TF-IDF vector. */
+    transform(document: string[]): number[];
+}
+//# sourceMappingURL=text-similarity.d.ts.map

package/dist/spec/mine/clustering/text-similarity.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"text-similarity.d.ts","sourceRoot":"","sources":["../../../../src/spec/mine/clustering/text-similarity.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,yDAAyD;AACzD,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAK/C;AAED,sDAAsD;AACtD,wBAAgB,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAUxD;AAED,kEAAkE;AAClE,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAYjE;AAMD,qBAAa,eAAe;IAC1B,OAAO,CAAC,UAAU,CAAkC;IACpD,OAAO,CAAC,GAAG,CAAgB;IAE3B,6DAA6D;IAC7D,GAAG,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,GAAG,IAAI;IA4BhC,iDAAiD;IACjD,SAAS,CAAC,QAAQ,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE;CAcxC"}

package/dist/spec/mine/clustering/text-similarity.js

@@ -0,0 +1,98 @@
+"use strict";
+/**
+ * Text-similarity utilities for commit clustering — tokenisation, Jaccard /
+ * cosine similarity, and a minimal TF-IDF vectorizer. Pure functions with no
+ * dependency on the commit/cluster domain.
+ *
+ * @module spec/mine/clustering/text-similarity
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.TfidfVectorizer = void 0;
+exports.tokenize = tokenize;
+exports.jaccard = jaccard;
+exports.cosineSimilarity = cosineSimilarity;
+/** Tokenize a string into lowercase words (3+ chars). */
+function tokenize(text) {
+    return text
+        .toLowerCase()
+        .split(/[^a-z0-9]+/)
+        .filter((t) => t.length >= 3);
+}
+/** Jaccard similarity between two sets of strings. */
+function jaccard(a, b) {
+    if (a.length === 0 && b.length === 0)
+        return 0;
+    const setA = new Set(a);
+    const setB = new Set(b);
+    let intersection = 0;
+    for (const x of setA) {
+        if (setB.has(x))
+            intersection++;
+    }
+    const union = setA.size + setB.size - intersection;
+    return union === 0 ? 0 : intersection / union;
+}
+/** Cosine similarity between two equal-length numeric vectors. */
+function cosineSimilarity(a, b) {
+    if (a.length !== b.length || a.length === 0)
+        return 0;
+    let dot = 0;
+    let magA = 0;
+    let magB = 0;
+    for (let i = 0; i < a.length; i++) {
+        dot += a[i] * b[i];
+        magA += a[i] * a[i];
+        magB += b[i] * b[i];
+    }
+    const denom = Math.sqrt(magA) * Math.sqrt(magB);
+    return denom === 0 ? 0 : dot / denom;
+}
+// ---------------------------------------------------------------------------
+// TF-IDF Vectorizer (message-level)
+// ---------------------------------------------------------------------------
+class TfidfVectorizer {
+    vocabulary = new Map();
+    idf = [];
+    /** Build vocabulary and compute IDF from document corpus. */
+    fit(documents) {
+        const docFreq = new Map();
+        const N = documents.length;
+        for (const doc of documents) {
+            const seen = new Set();
+            for (const term of doc) {
+                if (!seen.has(term)) {
+                    seen.add(term);
+                    docFreq.set(term, (docFreq.get(term) || 0) + 1);
+                }
+            }
+        }
+        // Build vocabulary sorted for deterministic output
+        const sorted = Array.from(docFreq.keys()).sort();
+        this.vocabulary.clear();
+        this.idf = [];
+        for (let i = 0; i < sorted.length; i++) {
+            const term = sorted[i];
+            this.vocabulary.set(term, i);
+            // IDF = log((N + 1) / (df + 1)) + 1  (smooth)
+            const df = docFreq.get(term);
+            this.idf.push(Math.log((N + 1) / (df + 1)) + 1);
+        }
+    }
+    /** Transform a document into a TF-IDF vector. */
+    transform(document) {
+        const vec = new Array(this.vocabulary.size).fill(0);
+        const tf = new Map();
+        for (const term of document) {
+            tf.set(term, (tf.get(term) || 0) + 1);
+        }
+        for (const [term, count] of tf) {
+            const idx = this.vocabulary.get(term);
+            if (idx !== undefined) {
+                vec[idx] = (count / document.length) * this.idf[idx];
+            }
+        }
+        return vec;
+    }
+}
+exports.TfidfVectorizer = TfidfVectorizer;
+//# sourceMappingURL=text-similarity.js.map

package/dist/spec/mine/clustering/text-similarity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"text-similarity.js","sourceRoot":"","sources":["../../../../src/spec/mine/clustering/text-similarity.ts"],"names":[],"mappings":";AAAA;;;;;;GAMG;;;AAGH,4BAKC;AAGD,0BAUC;AAGD,4CAYC;AAlCD,yDAAyD;AACzD,SAAgB,QAAQ,CAAC,IAAY;IACnC,OAAO,IAAI;SACR,WAAW,EAAE;SACb,KAAK,CAAC,YAAY,CAAC;SACnB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;AAClC,CAAC;AAED,sDAAsD;AACtD,SAAgB,OAAO,CAAC,CAAW,EAAE,CAAW;IAC9C,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC/C,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;IACxB,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;IACxB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,YAAY,EAAE,CAAC;IAClC,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,YAAY,CAAC;IACnD,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,KAAK,CAAC;AAChD,CAAC;AAED,kEAAkE;AAClE,SAAgB,gBAAgB,CAAC,CAAW,EAAE,CAAW;IACvD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACtD,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;QACrB,IAAI,IAAI,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;QACtB,IAAI,IAAI,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;IACxB,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAChD,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,KAAK,CAAC;AACvC,CAAC;AAED,8EAA8E;AAC9E,oCAAoC;AACpC,8EAA8E;AAE9E,MAAa,eAAe;IAClB,UAAU,GAAwB,IAAI,GAAG,EAAE,CAAC;IAC5C,GAAG,GAAa,EAAE,CAAC;IAE3B,6DAA6D;IAC7D,GAAG,CAAC,SAAqB;QACvB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC1C,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;QAE3B,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;YAC/B,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;gBACvB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBACpB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBACf,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAClD,CAAC;YACH,CAAC;QACH,CAAC;QAED,mDAAmD;QACnD,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;QACjD,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QACxB,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC;QAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;YACxB,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAC7B,8CAA8C;YAC9C,MAAM,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;YAC9B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAClD,CAAC;IACH,CAAC;IAED,iDAAiD;IACjD,SAAS,CAAC,QAAkB;QAC1B,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpD,MAAM,EAAE,GAAG,IAAI,GAAG,EAAkB,CAAC;QACrC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACxC,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YAC/B,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACtC,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;gBACtB,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;YACxD,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;CACF;AAhDD,0CAgDC"}