@massa-ai/core 1.2.1

package/dist/services/symbol/communities.d.ts

@@ -0,0 +1,86 @@
+/**
+ * Community Detection over the File-Import Graph (P4-T4 / D4)
+ *
+ * Multi-level **Louvain** modularity optimization with a connectivity
+ * refinement pass. Surfaces de-facto modules/clusters: tightly-coupled groups
+ * of files that form implicit packages/layers in the codebase.
+ *
+ * Why Louvain (+ refinement) rather than full Leiden:
+ *   - Louvain is simpler and well-understood; its main known defect is that a
+ *     local-moving phase can leave a community internally disconnected. We
+ *     close that gap with an explicit connectivity refinement pass
+ *     (split-and-reattach by connected components within each community), which
+ *     is the property Leiden guarantees. This gives Leiden-quality output at
+ *     Louvain implementation cost, with no heavy dependency.
+ *
+ * Algorithm sketch (porting the *approach* from codebase-memory-mcp's Leiden,
+ * rewritten fresh in TypeScript):
+ *
+ *   1. Build an undirected weighted graph (CSR: offsets + neighbors + weights).
+ *      Directed import edges {from→to} are symmetrized and deduped (multi-edges
+ *      become weights); self-loops are folded into each node's weighted degree.
+ *   2. Local-moving phase: greedily move each node to the neighboring community
+ *      that maximizes modularity gain, until stable. Re-queue only neighbors of
+ *      moved nodes (near-linear per level).
+ *   3. Refinement: ensure every community is internally connected by splitting
+ *      disconnected communities along their connected components.
+ *   4. Aggregate: collapse communities into super-nodes; repeat on the coarse
+ *      graph until a level stops shrinking.
+ *   5. Back-project the final community onto the original node ids via an
+ *      `orig[]` indirection array.
+ *
+ * Bounds & fallback:
+ *   - Node cap `COMMUNITY_NODE_CAP` (default 8000). Graphs above this run a
+ *     cheaper connected-components + weighted label-propagation hybrid.
+ *   - Edge cap `COMMUNITY_EDGE_CAP` (default 50000) — same fallback.
+ *   - Max levels `MAX_LEVELS` (default 64) and per-pass iteration cap guard
+ *     against pathological oscillation.
+ *   - Empty / single-node / no-edge graphs short-circuit: every node its own
+ *     community (no crash).
+ *
+ * Resolution `gamma` (default 1.0): higher → more, smaller communities.
+ */
+/** Above this many nodes, fall back to the cheaper label-propagation hybrid. */
+export declare const COMMUNITY_NODE_CAP = 8000;
+/** Above this many undirected edges, fall back. */
+export declare const COMMUNITY_EDGE_CAP = 50000;
+export interface WeightedEdge {
+    /** Index into the `nodes` array of runLouvain. */
+    a: number;
+    b: number;
+    /** Edge weight (>= 0). */
+    w: number;
+}
+export interface CommunityOptions {
+    /** Resolution parameter; higher → more, smaller communities. Default 1.0. */
+    gamma?: number;
+    /** Node cap above which the cheaper fallback runs. */
+    nodeCap?: number;
+    /** Edge cap above which the cheaper fallback runs. */
+    edgeCap?: number;
+}
+export interface Community {
+    /** Stable community id (0-based, contiguous in the result array). */
+    id: number;
+    /** Original node indices belonging to this community. */
+    members: number[];
+}
+export interface CommunityResult {
+    communities: Community[];
+    /** communityId per original node (length === nodes.length). */
+    assignment: number[];
+    /** Modularity of the final partition (-1..1, higher is better). */
+    modularity: number;
+    /** Which algorithm produced this result. */
+    algorithm: "louvain" | "fallback" | "trivial";
+}
+/**
+ * Run multi-level Louvain community detection.
+ *
+ * @param nodeCount number of nodes (files).
+ * @param edges weighted undirected edges (will be symmetrized internally).
+ * @param opts gamma + caps.
+ * @returns communities, per-node assignment, modularity, and algorithm used.
+ */
+export declare function runLouvain(nodeCount: number, edges: WeightedEdge[], opts?: CommunityOptions): CommunityResult;
+//# sourceMappingURL=communities.d.ts.map

package/dist/services/symbol/communities.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"communities.d.ts","sourceRoot":"","sources":["../../../src/services/symbol/communities.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAyCG;AAKH,gFAAgF;AAChF,eAAO,MAAM,kBAAkB,OAAO,CAAC;AACvC,mDAAmD;AACnD,eAAO,MAAM,kBAAkB,QAAQ,CAAC;AAQxC,MAAM,WAAW,YAAY;IAC3B,kDAAkD;IAClD,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,0BAA0B;IAC1B,CAAC,EAAE,MAAM,CAAC;CACX;AAED,MAAM,WAAW,gBAAgB;IAC/B,6EAA6E;IAC7E,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,sDAAsD;IACtD,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,sDAAsD;IACtD,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,SAAS;IACxB,qEAAqE;IACrE,EAAE,EAAE,MAAM,CAAC;IACX,yDAAyD;IACzD,OAAO,EAAE,MAAM,EAAE,CAAC;CACnB;AAED,MAAM,WAAW,eAAe;IAC9B,WAAW,EAAE,SAAS,EAAE,CAAC;IACzB,+DAA+D;IAC/D,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,mEAAmE;IACnE,UAAU,EAAE,MAAM,CAAC;IACnB,4CAA4C;IAC5C,SAAS,EAAE,SAAS,GAAG,UAAU,GAAG,SAAS,CAAC;CAC/C;AA0aD;;;;;;;GAOG;AACH,wBAAgB,UAAU,CACxB,SAAS,EAAE,MAAM,EACjB,KAAK,EAAE,YAAY,EAAE,EACrB,IAAI,GAAE,gBAAqB,GAC1B,eAAe,CA0GjB"}

package/dist/services/symbol/communities.js

@@ -0,0 +1,551 @@
+/**
+ * Community Detection over the File-Import Graph (P4-T4 / D4)
+ *
+ * Multi-level **Louvain** modularity optimization with a connectivity
+ * refinement pass. Surfaces de-facto modules/clusters: tightly-coupled groups
+ * of files that form implicit packages/layers in the codebase.
+ *
+ * Why Louvain (+ refinement) rather than full Leiden:
+ *   - Louvain is simpler and well-understood; its main known defect is that a
+ *     local-moving phase can leave a community internally disconnected. We
+ *     close that gap with an explicit connectivity refinement pass
+ *     (split-and-reattach by connected components within each community), which
+ *     is the property Leiden guarantees. This gives Leiden-quality output at
+ *     Louvain implementation cost, with no heavy dependency.
+ *
+ * Algorithm sketch (porting the *approach* from codebase-memory-mcp's Leiden,
+ * rewritten fresh in TypeScript):
+ *
+ *   1. Build an undirected weighted graph (CSR: offsets + neighbors + weights).
+ *      Directed import edges {from→to} are symmetrized and deduped (multi-edges
+ *      become weights); self-loops are folded into each node's weighted degree.
+ *   2. Local-moving phase: greedily move each node to the neighboring community
+ *      that maximizes modularity gain, until stable. Re-queue only neighbors of
+ *      moved nodes (near-linear per level).
+ *   3. Refinement: ensure every community is internally connected by splitting
+ *      disconnected communities along their connected components.
+ *   4. Aggregate: collapse communities into super-nodes; repeat on the coarse
+ *      graph until a level stops shrinking.
+ *   5. Back-project the final community onto the original node ids via an
+ *      `orig[]` indirection array.
+ *
+ * Bounds & fallback:
+ *   - Node cap `COMMUNITY_NODE_CAP` (default 8000). Graphs above this run a
+ *     cheaper connected-components + weighted label-propagation hybrid.
+ *   - Edge cap `COMMUNITY_EDGE_CAP` (default 50000) — same fallback.
+ *   - Max levels `MAX_LEVELS` (default 64) and per-pass iteration cap guard
+ *     against pathological oscillation.
+ *   - Empty / single-node / no-edge graphs short-circuit: every node its own
+ *     community (no crash).
+ *
+ * Resolution `gamma` (default 1.0): higher → more, smaller communities.
+ */
+const MAX_LEVELS = 64;
+/** Per local-moving pass, process at most N * this many node-visits. */
+const MOVE_PASS_CAP = 100;
+/** Above this many nodes, fall back to the cheaper label-propagation hybrid. */
+export const COMMUNITY_NODE_CAP = 8000;
+/** Above this many undirected edges, fall back. */
+export const COMMUNITY_EDGE_CAP = 50000;
+/** Communities with fewer members than this are merged into the nearest neighbor or dropped. */
+const MIN_COMMUNITY_SIZE = 1;
+/** Default resolution parameter (modularity). */
+const DEFAULT_GAMMA = 1.0;
+/**
+ * Build a CSR weighted undirected graph from an edge list.
+ * Directed edges are symmetrized; multi-edges deduped into weights; self-loops
+ * folded into `k[]` and NOT materialized in `nbr`/`w` (the gain formula relies
+ * on this — intra-community weight lives only in `k`).
+ */
+function buildGraph(n, edges) {
+    // Dedupe + symmetrize via a Map keyed by "minIdx:maxIdx".
+    const acc = new Map();
+    const selfLoop = new Float64Array(n);
+    for (const e of edges) {
+        if (e.w <= 0)
+            continue;
+        if (e.a === e.b) {
+            selfLoop[e.a] += e.w;
+            continue;
+        }
+        const lo = e.a < e.b ? e.a : e.b;
+        const hi = e.a < e.b ? e.b : e.a;
+        const key = lo + ":" + hi;
+        acc.set(key, (acc.get(key) ?? 0) + e.w);
+    }
+    // Count undirected degree (each deduped edge contributes to both endpoints).
+    const deg = new Int32Array(n);
+    for (const [key, wt] of acc) {
+        const sep = key.indexOf(":");
+        const a = +key.slice(0, sep);
+        const b = +key.slice(sep + 1);
+        deg[a]++;
+        deg[b]++;
+        void wt;
+    }
+    const off = new Int32Array(n + 1);
+    for (let i = 0; i < n; i++)
+        off[i + 1] = off[i] + deg[i];
+    const nbr = new Int32Array(off[n]);
+    const w = new Float64Array(off[n]);
+    const fill = new Int32Array(n); // cursor per node
+    const k = new Float64Array(n);
+    for (const [key, wt] of acc) {
+        const sep = key.indexOf(":");
+        const a = +key.slice(0, sep);
+        const b = +key.slice(sep + 1);
+        // a → b
+        nbr[off[a] + fill[a]] = b;
+        w[off[a] + fill[a]] = wt;
+        fill[a]++;
+        k[a] += wt;
+        // b → a
+        nbr[off[b] + fill[b]] = a;
+        w[off[b] + fill[b]] = wt;
+        fill[b]++;
+        k[b] += wt;
+    }
+    // Fold self-loops into degree (not materialized as neighbors).
+    let twom = 0;
+    for (let i = 0; i < n; i++) {
+        k[i] += selfLoop[i] * 2; // self-loop contributes 2× to degree
+        twom += k[i];
+    }
+    return { n, off, nbr, w, k, twom };
+}
+// ─── Local-moving phase (queue-based, near-linear) ───────────────────────────
+/**
+ * Greedily move each node to the neighboring community maximizing modularity
+ * gain. Uses a work queue and re-queues only neighbors of moved nodes that are
+ * not already queued and not in the destination community.
+ *
+ * `comm[i]` = current community of node i (mutated in place).
+ * `stot[c]` = Σ weighted degree of nodes currently in community c (mutated).
+ */
+function localMove(g, comm, stot, gamma) {
+    const { n, off, nbr, w, k, twom } = g;
+    if (twom <= 0)
+        return false;
+    const inq = new Uint8Array(n);
+    const queue = new Array(n);
+    for (let i = 0; i < n; i++) {
+        queue[i] = i;
+        inq[i] = 1;
+    }
+    // Sparse accumulator: edge-weight from the current node into each touched
+    // community. Reset via a dirty list to avoid O(n) clears.
+    const acc = new Float64Array(n);
+    const dirty = [];
+    let visits = 0;
+    const visitCap = n * MOVE_PASS_CAP + MAX_LEVELS;
+    let head = 0;
+    while (head < queue.length) {
+        if (visits++ > visitCap)
+            break;
+        const v = queue[head++];
+        inq[v] = 0;
+        const cv = comm[v];
+        const kv = k[v];
+        // Accumulate weights into each neighboring community.
+        for (let e = off[v]; e < off[v + 1]; e++) {
+            const u = nbr[e];
+            const cu = comm[u];
+            if (acc[cu] === 0)
+                dirty.push(cu);
+            acc[cu] += w[e];
+        }
+        // Tentatively remove v from its current community's degree total.
+        stot[cv] -= kv;
+        // Edge weight from v into its own current community.
+        const intoCurrent = acc[cv] || 0;
+        let bestC = cv;
+        // Gain of staying put (baseline).
+        let bestGain = intoCurrent - (gamma * kv * stot[cv]) / twom;
+        for (const c of dirty) {
+            if (c === cv)
+                continue;
+            const gain = acc[c] - (gamma * kv * stot[c]) / twom;
+            if (gain > bestGain + 1e-15) {
+                bestGain = gain;
+                bestC = c;
+            }
+        }
+        // Commit: move v into bestC.
+        stot[bestC] += kv;
+        if (bestC !== cv) {
+            comm[v] = bestC;
+            // Re-queue neighbors not in bestC and not already queued.
+            for (let e = off[v]; e < off[v + 1]; e++) {
+                const u = nbr[e];
+                if (comm[u] !== bestC && !inq[u]) {
+                    queue.push(u);
+                    inq[u] = 1;
+                }
+            }
+        }
+        // Reset accumulator.
+        for (const c of dirty)
+            acc[c] = 0;
+        dirty.length = 0;
+    }
+    return true;
+}
+// ─── Connectivity refinement ─────────────────────────────────────────────────
+/**
+ * Ensure every community is internally connected (the Leiden guarantee).
+ * Split any community whose members form >1 connected component in the original
+ * graph, assigning each component its own label. `labels` mutated in place.
+ */
+function refineConnectivity(g, labels) {
+    const { n, off, nbr } = g;
+    // Group nodes by current community.
+    const byComm = new Map();
+    for (let i = 0; i < n; i++) {
+        const c = labels[i];
+        let arr = byComm.get(c);
+        if (!arr) {
+            arr = [];
+            byComm.set(c, arr);
+        }
+        arr.push(i);
+    }
+    // Union-Find restricted to a community's members.
+    const parent = new Int32Array(n);
+    for (let i = 0; i < n; i++)
+        parent[i] = i;
+    const find = (x) => {
+        while (parent[x] !== x) {
+            parent[x] = parent[parent[x]];
+            x = parent[x];
+        }
+        return x;
+    };
+    const union = (a, b) => {
+        const ra = find(a);
+        const rb = find(b);
+        if (ra !== rb)
+            parent[ra] = rb;
+    };
+    let nextLabel = 0;
+    const remap = new Int32Array(n);
+    for (const [, members] of byComm) {
+        if (members.length <= 1) {
+            const m = members[0];
+            remap[m] = nextLabel++;
+            continue;
+        }
+        // Reset UF roots for these members.
+        for (const m of members)
+            parent[m] = m;
+        // Only edges WITHIN this community's member set union nodes.
+        const inSet = new Set(members);
+        for (const m of members) {
+            for (let e = off[m]; e < off[m + 1]; e++) {
+                const u = nbr[e];
+                if (inSet.has(u))
+                    union(m, u);
+            }
+        }
+        // Each distinct root → a new label.
+        const rootLabel = new Map();
+        for (const m of members) {
+            const r = find(m);
+            let lbl = rootLabel.get(r);
+            if (lbl === undefined) {
+                lbl = nextLabel++;
+                rootLabel.set(r, lbl);
+            }
+            remap[m] = lbl;
+        }
+    }
+    let changed = false;
+    for (let i = 0; i < n; i++) {
+        if (labels[i] !== remap[i])
+            changed = true;
+        labels[i] = remap[i];
+    }
+    return changed ? nextLabel : -1;
+}
+// ─── Relabel (compact community ids) ─────────────────────────────────────────
+/** Compact community ids to a contiguous 0..(count-1) range. Returns count. */
+function relabel(labels) {
+    const seen = new Map();
+    let next = 0;
+    for (let i = 0; i < labels.length; i++) {
+        let lbl = seen.get(labels[i]);
+        if (lbl === undefined) {
+            lbl = next++;
+            seen.set(labels[i], lbl);
+        }
+        labels[i] = lbl;
+    }
+    return next;
+}
+// ─── Aggregate (collapse communities into super-nodes) ───────────────────────
+/**
+ * Build the coarse graph: each community becomes a super-node. Inter-community
+ * edges become weighted edges between super-nodes; intra-community weight is
+ * folded into each super-node's `k` (NOT materialized as a self-loop).
+ * Returns the coarse graph plus `seed[c]` = any original comm id for super-node c.
+ */
+function aggregate(g, comm, commCount) {
+    const { n, off, nbr, w, k } = g;
+    // Sum weighted degree into each super-node.
+    const k2 = new Float64Array(commCount);
+    for (let i = 0; i < n; i++)
+        k2[comm[i]] += k[i];
+    // Accumulate inter-community edges (deduped) via Map keyed "lo:hi".
+    const edges = new Map();
+    for (let i = 0; i < n; i++) {
+        const ci = comm[i];
+        for (let e = off[i]; e < off[i + 1]; e++) {
+            const cj = comm[nbr[e]];
+            if (ci === cj)
+                continue; // intra-community: already in k2
+            const lo = ci < cj ? ci : cj;
+            const hi = ci < cj ? cj : ci;
+            const key = lo + ":" + hi;
+            edges.set(key, (edges.get(key) ?? 0) + w[e]);
+        }
+    }
+    const edgeList = [];
+    for (const [key, wt] of edges) {
+        const sep = key.indexOf(":");
+        edgeList.push({ a: +key.slice(0, sep), b: +key.slice(sep + 1), w: wt });
+    }
+    const g2 = buildGraph(commCount, edgeList);
+    // Override k with the true super-node degree (buildGraph recomputes from
+    // edges, but we must add back the folded intra weight).
+    for (let c = 0; c < commCount; c++) {
+        g2.k[c] += k2[c];
+    }
+    // Recompute twom from the corrected k.
+    let twom = 0;
+    for (let c = 0; c < commCount; c++)
+        twom += g2.k[c];
+    g2.twom = twom;
+    // seed[c] = a representative original community id (here identity).
+    const seed = new Int32Array(commCount);
+    for (let c = 0; c < commCount; c++)
+        seed[c] = c;
+    return { g2, seed };
+}
+// ─── Modularity ──────────────────────────────────────────────────────────────
+/**
+ * Modularity of a partition on graph g:
+ *   Q = (1/twom) * Σ_c [ Σ_in(c) - (Σ_tot(c)^2) / (2*twom) ]
+ * where Σ_in(c) is twice the intra-community edge weight of community c.
+ * (Standard Newman-Girvan modularity, gamma=1.)
+ */
+function modularityOf(g, comm, commCount) {
+    const { n, off, nbr, w, k, twom } = g;
+    if (twom <= 0)
+        return 0;
+    const sigmaIn = new Float64Array(commCount);
+    const sigmaTot = new Float64Array(commCount);
+    for (let i = 0; i < n; i++) {
+        const ci = comm[i];
+        sigmaTot[ci] += k[i];
+        for (let e = off[i]; e < off[i + 1]; e++) {
+            if (comm[nbr[e]] === ci)
+                sigmaIn[ci] += w[e]; // counts each directed half once
+        }
+    }
+    let q = 0;
+    for (let c = 0; c < commCount; c++) {
+        // sigmaIn currently counts each undirected intra edge once per endpoint
+        // (we stored both directions) → divide by 2*twom directly matches the
+        // Σ_in (which conventionally is the double-counted intra weight).
+        q += sigmaIn[c] / (2 * twom) - (sigmaTot[c] / (2 * twom)) ** 2;
+    }
+    return q;
+}
+// ─── Fallback: connected components + weighted label propagation ─────────────
+/**
+ * Cheaper alternative for very large graphs. Seeds each connected component as
+ * a community, then runs a few synchronous weighted label-propagation sweeps
+ * (a node adopts the most-weighted neighbor community, capped iterations).
+ */
+function fallbackCommunities(g) {
+    const { n, off, nbr, w } = g;
+    // Connected components via BFS.
+    const comp = new Int32Array(n).fill(-1);
+    let nextComp = 0;
+    for (let s = 0; s < n; s++) {
+        if (comp[s] !== -1)
+            continue;
+        comp[s] = nextComp;
+        const stack = [s];
+        while (stack.length) {
+            const v = stack.pop();
+            for (let e = off[v]; e < off[v + 1]; e++) {
+                const u = nbr[e];
+                if (comp[u] === -1) {
+                    comp[u] = nextComp;
+                    stack.push(u);
+                }
+            }
+        }
+        nextComp++;
+    }
+    // Weighted label propagation within components: 4 synchronous sweeps.
+    let labels = comp;
+    let count = nextComp;
+    const acc = new Float64Array(n);
+    const dirty = [];
+    for (let iter = 0; iter < 4; iter++) {
+        let moved = false;
+        for (let v = 0; v < n; v++) {
+            if (off[v] === off[v + 1])
+                continue;
+            const lv = labels[v];
+            for (let e = off[v]; e < off[v + 1]; e++) {
+                const lc = labels[nbr[e]];
+                if (acc[lc] === 0)
+                    dirty.push(lc);
+                acc[lc] += w[e];
+            }
+            let best = lv;
+            let bestW = -1;
+            for (const c of dirty) {
+                if (acc[c] > bestW) {
+                    bestW = acc[c];
+                    best = c;
+                }
+            }
+            if (best !== lv) {
+                labels[v] = best;
+                moved = true;
+            }
+            for (const c of dirty)
+                acc[c] = 0;
+            dirty.length = 0;
+        }
+        if (!moved)
+            break;
+        count = relabel(labels);
+    }
+    return { comm: labels, count };
+}
+// ─── Public entry ────────────────────────────────────────────────────────────
+/**
+ * Run multi-level Louvain community detection.
+ *
+ * @param nodeCount number of nodes (files).
+ * @param edges weighted undirected edges (will be symmetrized internally).
+ * @param opts gamma + caps.
+ * @returns communities, per-node assignment, modularity, and algorithm used.
+ */
+export function runLouvain(nodeCount, edges, opts = {}) {
+    const gamma = opts.gamma ?? DEFAULT_GAMMA;
+    const nodeCap = opts.nodeCap ?? COMMUNITY_NODE_CAP;
+    const edgeCap = opts.edgeCap ?? COMMUNITY_EDGE_CAP;
+    if (nodeCount <= 0) {
+        return { communities: [], assignment: [], modularity: 0, algorithm: "trivial" };
+    }
+    if (nodeCount === 1) {
+        return {
+            communities: [{ id: 0, members: [0] }],
+            assignment: [0],
+            modularity: 0,
+            algorithm: "trivial",
+        };
+    }
+    const g = buildGraph(nodeCount, edges);
+    // Trivial: no edges → every node its own community.
+    if (g.twom <= 0 || edges.length === 0) {
+        const assignment = Array.from({ length: nodeCount }, (_, i) => i);
+        return {
+            communities: assignment.map((id) => ({ id, members: [id] })),
+            assignment,
+            modularity: 0,
+            algorithm: "trivial",
+        };
+    }
+    // Large-graph fallback.
+    if (nodeCount > nodeCap || edges.length > edgeCap) {
+        const { comm, count } = fallbackCommunities(g);
+        const finalCount = refineConnectivity(g, comm) >= 0 ? relabel(comm) : count;
+        const communities = buildCommunities(comm, finalCount);
+        return {
+            communities,
+            assignment: Array.from(comm),
+            modularity: modularityOf(g, comm, finalCount),
+            algorithm: "fallback",
+        };
+    }
+    // Multi-level Louvain.
+    // `orig[i]` maps original node i → its index in the CURRENT (possibly coarse) graph.
+    let orig = new Int32Array(nodeCount);
+    for (let i = 0; i < nodeCount; i++)
+        orig[i] = i;
+    let cur = g;
+    let comm = new Int32Array(cur.n);
+    for (let i = 0; i < cur.n; i++)
+        comm[i] = i;
+    let lastLevelComm = comm;
+    let lastLevelGraph = cur;
+    let lastLevelCount = cur.n;
+    for (let level = 0; level < MAX_LEVELS; level++) {
+        const stot = new Float64Array(cur.n);
+        for (let i = 0; i < cur.n; i++)
+            stot[comm[i]] += cur.k[i];
+        localMove(cur, comm, stot, gamma);
+        let count = relabel(comm);
+        // Connectivity refinement (Leiden guarantee): split disconnected communities.
+        const refined = refineConnectivity(cur, comm);
+        if (refined >= 0)
+            count = refined;
+        count = relabel(comm);
+        lastLevelComm = comm;
+        lastLevelGraph = cur;
+        lastLevelCount = count;
+        if (count >= cur.n)
+            break; // nothing coarsened
+        const { g2 } = aggregate(cur, comm, count);
+        if (g2.n >= cur.n)
+            break; // safety: no shrink
+        // Update orig indirection: orig[i] = comm[orig[i]] of the level we just finished.
+        // comm currently holds the (refined) community of each node in `cur`.
+        const newOrig = new Int32Array(nodeCount);
+        for (let i = 0; i < nodeCount; i++)
+            newOrig[i] = comm[orig[i]];
+        orig = newOrig;
+        cur = g2;
+        comm = new Int32Array(cur.n);
+        // Seed coarse communities from identity (each super-node starts alone);
+        // local-move on the coarse graph re-merges where beneficial.
+        for (let i = 0; i < cur.n; i++)
+            comm[i] = i;
+    }
+    // Back-project: community of original node i = lastLevelComm[orig[i]].
+    const assignment = new Int32Array(nodeCount);
+    for (let i = 0; i < nodeCount; i++) {
+        assignment[i] = lastLevelComm[orig[i]];
+    }
+    const finalCount = relabel(assignment);
+    const communities = buildCommunities(assignment, finalCount);
+    // Compute modularity on the ORIGINAL graph with the back-projected
+    // assignment (coarse-graph modularity would be on super-nodes and is not
+    // comparable across runs).
+    const q = modularityOf(g, assignment, finalCount);
+    void lastLevelGraph;
+    void lastLevelComm;
+    void lastLevelCount;
+    return { communities, assignment: Array.from(assignment), modularity: q, algorithm: "louvain" };
+}
+/** Group node indices by community id, dropping sub-MIN_COMMUNITY_SIZE groups. */
+function buildCommunities(assignment, count) {
+    const buckets = Array.from({ length: count }, () => []);
+    for (let i = 0; i < assignment.length; i++)
+        buckets[assignment[i]].push(i);
+    const out = [];
+    let id = 0;
+    for (const members of buckets) {
+        if (members.length < MIN_COMMUNITY_SIZE)
+            continue;
+        out.push({ id: id++, members });
+    }
+    return out;
+}
+//# sourceMappingURL=communities.js.map

package/dist/services/symbol/communities.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"communities.js","sourceRoot":"","sources":["../../../src/services/symbol/communities.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAyCG;AAEH,MAAM,UAAU,GAAG,EAAE,CAAC;AACtB,wEAAwE;AACxE,MAAM,aAAa,GAAG,GAAG,CAAC;AAC1B,gFAAgF;AAChF,MAAM,CAAC,MAAM,kBAAkB,GAAG,IAAI,CAAC;AACvC,mDAAmD;AACnD,MAAM,CAAC,MAAM,kBAAkB,GAAG,KAAK,CAAC;AACxC,gGAAgG;AAChG,MAAM,kBAAkB,GAAG,CAAC,CAAC;AAC7B,iDAAiD;AACjD,MAAM,aAAa,GAAG,GAAG,CAAC;AAuD1B;;;;;GAKG;AACH,SAAS,UAAU,CAAC,CAAS,EAAE,KAAqB;IAClD,0DAA0D;IAC1D,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,MAAM,QAAQ,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IACrC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;YAAE,SAAS;QACvB,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;YAChB,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,SAAS;QACX,CAAC;QACD,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,CAAC;QAC1B,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC;IAED,6EAA6E;IAC7E,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAC9B,KAAK,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC;QAC5B,MAAM,GAAG,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAC7B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAC7B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QAC9B,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QACT,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QACT,KAAK,EAAE,CAAC;IACV,CAAC;IAED,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IACzD,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACnC,MAAM,CAAC,GAAG,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACnC,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,kBAAkB;IAClD,MAAM,CAAC,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IAE9B,KAAK,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC;QAC5B,MAAM,GAAG,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAC7B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAC7B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QAC9B,QAAQ;QACR,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC1B,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QACzB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;QACV,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACX,QAAQ;QACR,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC1B,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QACzB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;QACV,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IACb,CAAC;IAED,+DAA+D;IAC/D,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,CAAC,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,qCAAqC;QAC9D,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACf,CAAC;IAED,OAAO,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC;AACrC,CAAC;AAED,gFAAgF;AAEhF;;;;;;;GAOG;AACH,SAAS,SAAS,CAChB,CAAQ,EACR,IAAgB,EAChB,IAAkB,EAClB,KAAa;IAEb,MAAM,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;IACtC,IAAI,IAAI,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IAE5B,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,KAAK,GAAa,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;IACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACb,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACb,CAAC;IAED,0EAA0E;IAC1E,0DAA0D;IAC1D,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IAChC,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,MAAM,QAAQ,GAAG,CAAC,GAAG,aAAa,GAAG,UAAU,CAAC;IAEhD,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,OAAO,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QAC3B,IAAI,MAAM,EAAE,GAAG,QAAQ;YAAE,MAAM;QAC/B,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;QACxB,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAEX,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAEhB,sDAAsD;QACtD,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YACjB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACnB,IAAI,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAClC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAClB,CAAC;QAED,kEAAkE;QAClE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QACf,qDAAqD;QACrD,MAAM,WAAW,GAAG,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QAEjC,IAAI,KAAK,GAAG,EAAE,CAAC;QACf,kCAAkC;QAClC,IAAI,QAAQ,GAAG,WAAW,GAAG,CAAC,KAAK,GAAG,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC;QAE5D,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,IAAI,CAAC,KAAK,EAAE;gBAAE,SAAS;YACvB,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YACpD,IAAI,IAAI,GAAG,QAAQ,GAAG,KAAK,EAAE,CAAC;gBAC5B,QAAQ,GAAG,IAAI,CAAC;gBAChB,KAAK,GAAG,CAAC,CAAC;YACZ,CAAC;QACH,CAAC;QAED,6BAA6B;QAC7B,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;QAClB,IAAI,KAAK,KAAK,EAAE,EAAE,CAAC;YACjB,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;YAChB,0DAA0D;YAC1D,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;gBACjB,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBACjC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACd,GAAG,CAAC,CAAC,CAAC,GAAE,CAAC,CAAC;gBACZ,CAAC;YACH,CAAC;QACH,CAAC;QAED,qBAAqB;QACrB,KAAK,MAAM,CAAC,IAAI,KAAK;YAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAClC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACnB,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED,gFAAgF;AAEhF;;;;GAIG;AACH,SAAS,kBAAkB,CAAC,CAAQ,EAAE,MAAkB;IACtD,MAAM,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IAC1B,oCAAoC;IACpC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,GAAG,GAAG,EAAE,CAAC;YACT,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACrB,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,CAAC;IAED,kDAAkD;IAClD,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC1C,MAAM,IAAI,GAAG,CAAC,CAAS,EAAU,EAAE;QACjC,OAAO,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YACvB,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9B,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QAChB,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC,CAAC;IACF,MAAM,KAAK,GAAG,CAAC,CAAS,EAAE,CAAS,EAAQ,EAAE;QAC3C,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,EAAE,KAAK,EAAE;YAAE,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;IACjC,CAAC,CAAC;IAEF,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAEhC,KAAK,MAAM,CAAC,EAAE,OAAO,CAAC,IAAI,MAAM,EAAE,CAAC;QACjC,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YACxB,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACrB,KAAK,CAAC,CAAC,CAAC,GAAG,SAAS,EAAE,CAAC;YACvB,SAAS;QACX,CAAC;QACD,oCAAoC;QACpC,KAAK,MAAM,CAAC,IAAI,OAAO;YAAE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACvC,6DAA6D;QAC7D,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;QAC/B,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;gBACjB,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;QACD,oCAAoC;QACpC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC5C,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YAClB,IAAI,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC3B,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;gBACtB,GAAG,GAAG,SAAS,EAAE,CAAC;gBAClB,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YACxB,CAAC;YACD,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACjB,CAAC;IACH,CAAC;IAED,IAAI,OAAO,GAAG,KAAK,CAAC;IACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC;YAAE,OAAO,GAAG,IAAI,CAAC;QAC3C,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IACD,OAAO,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAClC,CAAC;AAED,gFAAgF;AAEhF,+EAA+E;AAC/E,SAAS,OAAO,CAAC,MAAkB;IACjC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,IAAI,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACtB,GAAG,GAAG,IAAI,EAAE,CAAC;YACb,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAC3B,CAAC;QACD,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;IAClB,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,gFAAgF;AAEhF;;;;;GAKG;AACH,SAAS,SAAS,CAChB,CAAQ,EACR,IAAgB,EAChB,SAAiB;IAEjB,MAAM,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;IAEhC,4CAA4C;IAC5C,MAAM,EAAE,GAAG,IAAI,YAAY,CAAC,SAAS,CAAC,CAAC;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAEhD,oEAAoE;IACpE,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACxB,IAAI,EAAE,KAAK,EAAE;gBAAE,SAAS,CAAC,iCAAiC;YAC1D,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC7B,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC7B,MAAM,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,CAAC;YAC1B,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/C,CAAC;IACH,CAAC;IAED,MAAM,QAAQ,GAAmB,EAAE,CAAC;IACpC,KAAK,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC;QAC9B,MAAM,GAAG,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAC7B,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC1E,CAAC;IAED,MAAM,EAAE,GAAG,UAAU,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IAC3C,yEAAyE;IACzE,wDAAwD;IACxD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IACnB,CAAC;IACD,uCAAuC;IACvC,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE;QAAE,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpD,EAAE,CAAC,IAAI,GAAG,IAAI,CAAC;IAEf,oEAAoE;IACpE,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,SAAS,CAAC,CAAC;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE;QAAE,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAEhD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC;AACtB,CAAC;AAED,gFAAgF;AAEhF;;;;;GAKG;AACH,SAAS,YAAY,CAAC,CAAQ,EAAE,IAAgB,EAAE,SAAiB;IACjE,MAAM,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;IACtC,IAAI,IAAI,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC;IACxB,MAAM,OAAO,GAAG,IAAI,YAAY,CAAC,SAAS,CAAC,CAAC;IAC5C,MAAM,QAAQ,GAAG,IAAI,YAAY,CAAC,SAAS,CAAC,CAAC;IAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE;gBAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,iCAAiC;QACjF,CAAC;IACH,CAAC;IACD,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,wEAAwE;QACxE,sEAAsE;QACtE,kEAAkE;QAClE,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;IACjE,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,gFAAgF;AAEhF;;;;GAIG;AACH,SAAS,mBAAmB,CAAC,CAAQ;IACnC,MAAM,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;IAE7B,gCAAgC;IAChC,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACxC,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YAAE,SAAS;QAC7B,IAAI,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;QACnB,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;QAClB,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;YACpB,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;YACvB,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;gBACjB,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;oBACnB,IAAI,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;oBACnB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAChB,CAAC;YACH,CAAC;QACH,CAAC;QACD,QAAQ,EAAE,CAAC;IACb,CAAC;IAED,sEAAsE;IACtE,IAAI,MAAM,GAAG,IAAI,CAAC;IAClB,IAAI,KAAK,GAAG,QAAQ,CAAC;IACrB,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IAChC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;QACpC,IAAI,KAAK,GAAG,KAAK,CAAC;QAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;gBAAE,SAAS;YACpC,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACrB,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,MAAM,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1B,IAAI,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC;oBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAClC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAClB,CAAC;YACD,IAAI,IAAI,GAAG,EAAE,CAAC;YACd,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;YACf,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC;oBACnB,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;oBACf,IAAI,GAAG,CAAC,CAAC;gBACX,CAAC;YACH,CAAC;YACD,IAAI,IAAI,KAAK,EAAE,EAAE,CAAC;gBAChB,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;gBACjB,KAAK,GAAG,IAAI,CAAC;YACf,CAAC;YACD,KAAK,MAAM,CAAC,IAAI,KAAK;gBAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAClC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QACnB,CAAC;QACD,IAAI,CAAC,KAAK;YAAE,MAAM;QAClB,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAC1B,CAAC;IAED,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;AACjC,CAAC;AAED,gFAAgF;AAEhF;;;;;;;GAOG;AACH,MAAM,UAAU,UAAU,CACxB,SAAiB,EACjB,KAAqB,EACrB,OAAyB,EAAE;IAE3B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,aAAa,CAAC;IAC1C,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,kBAAkB,CAAC;IACnD,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,kBAAkB,CAAC;IAEnD,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;QACnB,OAAO,EAAE,WAAW,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC;IAClF,CAAC;IACD,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;QACpB,OAAO;YACL,WAAW,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACtC,UAAU,EAAE,CAAC,CAAC,CAAC;YACf,UAAU,EAAE,CAAC;YACb,SAAS,EAAE,SAAS;SACrB,CAAC;IACJ,CAAC;IAED,MAAM,CAAC,GAAG,UAAU,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;IAEvC,oDAAoD;IACpD,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtC,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QAClE,OAAO;YACL,WAAW,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YAC5D,UAAU;YACV,UAAU,EAAE,CAAC;YACb,SAAS,EAAE,SAAS;SACrB,CAAC;IACJ,CAAC;IAED,wBAAwB;IACxB,IAAI,SAAS,GAAG,OAAO,IAAI,KAAK,CAAC,MAAM,GAAG,OAAO,EAAE,CAAC;QAClD,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC;QAC/C,MAAM,UAAU,GAAG,kBAAkB,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QAC5E,MAAM,WAAW,GAAG,gBAAgB,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QACvD,OAAO;YACL,WAAW;YACX,UAAU,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;YAC5B,UAAU,EAAE,YAAY,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,CAAC;YAC7C,SAAS,EAAE,UAAU;SACtB,CAAC;IACJ,CAAC;IAED,uBAAuB;IACvB,qFAAqF;IACrF,IAAI,IAAI,GAAG,IAAI,UAAU,CAAC,SAAS,CAAC,CAAC;IACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE;QAAE,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAEhD,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,IAAI,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE;QAAE,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAE5C,IAAI,aAAa,GAAG,IAAI,CAAC;IACzB,IAAI,cAAc,GAAG,GAAG,CAAC;IACzB,IAAI,cAAc,GAAG,GAAG,CAAC,CAAC,CAAC;IAE3B,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,UAAU,EAAE,KAAK,EAAE,EAAE,CAAC;QAChD,MAAM,IAAI,GAAG,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAE1D,SAAS,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QAElC,IAAI,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;QAC1B,8EAA8E;QAC9E,MAAM,OAAO,GAAG,kBAAkB,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC9C,IAAI,OAAO,IAAI,CAAC;YAAE,KAAK,GAAG,OAAO,CAAC;QAClC,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;QAEtB,aAAa,GAAG,IAAI,CAAC;QACrB,cAAc,GAAG,GAAG,CAAC;QACrB,cAAc,GAAG,KAAK,CAAC;QAEvB,IAAI,KAAK,IAAI,GAAG,CAAC,CAAC;YAAE,MAAM,CAAC,oBAAoB;QAE/C,MAAM,EAAE,EAAE,EAAE,GAAG,SAAS,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QAC3C,IAAI,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;YAAE,MAAM,CAAC,oBAAoB;QAE9C,kFAAkF;QAClF,sEAAsE;QACtE,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,SAAS,CAAC,CAAC;QAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE;YAAE,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/D,IAAI,GAAG,OAAO,CAAC;QAEf,GAAG,GAAG,EAAE,CAAC;QACT,IAAI,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC7B,wEAAwE;QACxE,6DAA6D;QAC7D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC9C,CAAC;IAED,uEAAuE;IACvE,MAAM,UAAU,GAAG,IAAI,UAAU,CAAC,SAAS,CAAC,CAAC;IAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,UAAU,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACzC,CAAC;IACD,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC;IACvC,MAAM,WAAW,GAAG,gBAAgB,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;IAC7D,mEAAmE;IACnE,yEAAyE;IACzE,2BAA2B;IAC3B,MAAM,CAAC,GAAG,YAAY,CAAC,CAAC,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;IAClD,KAAK,cAAc,CAAC;IACpB,KAAK,aAAa,CAAC;IACnB,KAAK,cAAc,CAAC;IAEpB,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC;AAClG,CAAC;AAED,kFAAkF;AAClF,SAAS,gBAAgB,CAAC,UAAsB,EAAE,KAAa;IAC7D,MAAM,OAAO,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;IACpE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC3E,MAAM,GAAG,GAAgB,EAAE,CAAC;IAC5B,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,KAAK,MAAM,OAAO,IAAI,OAAO,EAAE,CAAC;QAC9B,IAAI,OAAO,CAAC,MAAM,GAAG,kBAAkB;YAAE,SAAS;QAClD,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;IAClC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}