@phuetz/code-buddy 0.3.0 → 1.0.0-rc.8

package/dist/knowledge/community-detection.js

@@ -0,0 +1,293 @@
+/**
+ * Community Detection — Label Propagation on the Knowledge Graph
+ *
+ * Detects architectural sub-systems (clusters of tightly-connected modules)
+ * using a deterministic Label Propagation algorithm.
+ * Ties are broken by PageRank score to stabilize convergence.
+ */
+const DEFAULT_CONFIG = {
+    predicate: 'imports',
+    entityPrefix: 'mod:',
+    maxIterations: 20,
+    minCommunitySize: 2,
+    seed: 42,
+};
+// ============================================================================
+// Algorithm: Label Propagation
+// ============================================================================
+/**
+ * Detect communities using Label Propagation.
+ *
+ * 1. Each entity gets a unique label.
+ * 2. Each iteration, in shuffled order, adopt the most common neighbor label.
+ * 3. Ties broken by PageRank (highest-ranked neighbor's label wins).
+ * 4. Converge when no labels change, or maxIterations reached.
+ * 5. Filter out communities below minCommunitySize.
+ */
+export function detectCommunities(graph, config, pageRankScores) {
+    const cfg = { ...DEFAULT_CONFIG, ...config };
+    // Collect entities with the given prefix
+    const entities = [];
+    const allTriples = graph.toJSON();
+    const entitySet = new Set();
+    for (const t of allTriples) {
+        if (t.subject.startsWith(cfg.entityPrefix))
+            entitySet.add(t.subject);
+        if (t.object.startsWith(cfg.entityPrefix))
+            entitySet.add(t.object);
+    }
+    entities.push(...entitySet);
+    entities.sort(); // deterministic order
+    if (entities.length === 0) {
+        return {
+            communities: new Map(),
+            communitySizes: new Map(),
+            communityMembers: new Map(),
+            modularity: 0,
+            computedAt: Date.now(),
+        };
+    }
+    // Build bidirectional adjacency (imports go both ways for community detection)
+    const neighbors = new Map();
+    const predTriples = graph.query({ predicate: cfg.predicate });
+    for (const t of predTriples) {
+        if (!t.subject.startsWith(cfg.entityPrefix) || !t.object.startsWith(cfg.entityPrefix))
+            continue;
+        let sn = neighbors.get(t.subject);
+        if (!sn) {
+            sn = new Set();
+            neighbors.set(t.subject, sn);
+        }
+        sn.add(t.object);
+        let on = neighbors.get(t.object);
+        if (!on) {
+            on = new Set();
+            neighbors.set(t.object, on);
+        }
+        on.add(t.subject);
+    }
+    // Initialize: each entity gets its own label
+    const labels = new Map();
+    for (const [i, entity] of entities.entries()) {
+        labels.set(entity, i);
+    }
+    // Deterministic seeded shuffle
+    const order = [...entities];
+    for (let iter = 0; iter < cfg.maxIterations; iter++) {
+        seededShuffle(order, cfg.seed + iter);
+        let changed = false;
+        for (const entity of order) {
+            const nbrs = neighbors.get(entity);
+            if (!nbrs || nbrs.size === 0)
+                continue;
+            // Count neighbor label frequencies
+            const labelCounts = new Map();
+            for (const nbr of nbrs) {
+                const lbl = labels.get(nbr);
+                labelCounts.set(lbl, (labelCounts.get(lbl) ?? 0) + 1);
+            }
+            // Find max frequency
+            let maxCount = 0;
+            for (const count of labelCounts.values()) {
+                if (count > maxCount)
+                    maxCount = count;
+            }
+            // Collect all labels with max frequency
+            const candidates = [];
+            for (const [lbl, count] of labelCounts) {
+                if (count === maxCount)
+                    candidates.push(lbl);
+            }
+            // Break tie: pick label of the neighbor with highest PageRank
+            const firstCandidate = candidates[0] ?? 0; // candidates non-empty (built from neighbor labels); default unreachable
+            let bestLabel;
+            if (candidates.length === 1) {
+                bestLabel = firstCandidate;
+            }
+            else if (pageRankScores && pageRankScores.size > 0) {
+                let bestScore = -1;
+                bestLabel = firstCandidate;
+                for (const nbr of nbrs) {
+                    const nbrLabel = labels.get(nbr);
+                    if (candidates.includes(nbrLabel)) {
+                        const score = pageRankScores.get(nbr) ?? 0;
+                        if (score > bestScore) {
+                            bestScore = score;
+                            bestLabel = nbrLabel;
+                        }
+                    }
+                }
+            }
+            else {
+                // Lexicographic tie-break: pick smallest label
+                bestLabel = Math.min(...candidates);
+            }
+            if (labels.get(entity) !== bestLabel) {
+                labels.set(entity, bestLabel);
+                changed = true;
+            }
+        }
+        if (!changed)
+            break;
+    }
+    // Renumber labels to sequential IDs
+    const labelRemap = new Map();
+    let nextId = 0;
+    const communities = new Map();
+    const communityMembers = new Map();
+    for (const entity of entities) {
+        const rawLabel = labels.get(entity);
+        if (!labelRemap.has(rawLabel)) {
+            labelRemap.set(rawLabel, nextId++);
+        }
+        const cid = labelRemap.get(rawLabel);
+        communities.set(entity, cid);
+        let members = communityMembers.get(cid);
+        if (!members) {
+            members = [];
+            communityMembers.set(cid, members);
+        }
+        members.push(entity);
+    }
+    // Filter by minCommunitySize
+    const communitySizes = new Map();
+    for (const [cid, members] of communityMembers) {
+        if (members.length >= cfg.minCommunitySize) {
+            communitySizes.set(cid, members.length);
+        }
+        else {
+            // Remove from communities map
+            for (const member of members) {
+                communities.delete(member);
+            }
+            communityMembers.delete(cid);
+        }
+    }
+    // Compute modularity
+    const modularity = computeModularity(communities, neighbors, predTriples.length);
+    return {
+        communities,
+        communitySizes,
+        communityMembers,
+        modularity,
+        computedAt: Date.now(),
+    };
+}
+// ============================================================================
+// Community Summary
+// ============================================================================
+/**
+ * Generate a human-readable summary for a community.
+ * Shows common path prefix, top entities by PageRank, and fn/cls counts.
+ */
+export function summarizeCommunity(graph, members, pageRankScores) {
+    if (members.length === 0)
+        return '(empty)';
+    // Common path prefix
+    const paths = members.map(m => m.replace(/^mod:/, ''));
+    const prefix = commonPrefix(paths);
+    const label = prefix ? prefix.replace(/\/$/, '') : (paths[0] ?? '').split('/').slice(0, 2).join('/');
+    // Top-3 by PageRank
+    const ranked = [...members].sort((a, b) => {
+        const sa = pageRankScores?.get(a) ?? 0;
+        const sb = pageRankScores?.get(b) ?? 0;
+        return sb - sa;
+    });
+    const top3 = ranked.slice(0, 3).map(m => m.replace(/^mod:/, '').split('/').pop());
+    // Count functions and classes contained
+    let fnCount = 0;
+    let clsCount = 0;
+    for (const member of members) {
+        fnCount += graph.query({ subject: member, predicate: 'containsFunction' }).length;
+        clsCount += graph.query({ subject: member, predicate: 'contains' })
+            .filter(t => t.object.startsWith('cls:')).length;
+    }
+    const parts = [`${label} (${members.length} modules)`];
+    if (top3.length > 0)
+        parts.push(`  top: ${top3.join(', ')}`);
+    if (fnCount > 0 || clsCount > 0) {
+        parts.push(`  ${fnCount} functions, ${clsCount} classes`);
+    }
+    return parts.join('\n');
+}
+// ============================================================================
+// Helpers
+// ============================================================================
+/** Deterministic seeded Fisher-Yates shuffle */
+function seededShuffle(arr, seed) {
+    let s = seed;
+    for (let i = arr.length - 1; i > 0; i--) {
+        s = (s * 1103515245 + 12345) & 0x7fffffff;
+        const j = s % (i + 1);
+        const a = arr[i];
+        const b = arr[j];
+        if (a !== undefined && b !== undefined) {
+            arr[i] = b;
+            arr[j] = a;
+        }
+    }
+}
+/**
+ * Compute modularity Q using the standard Newman-Girvan formula:
+ *   Q = Σ_c [ L_c/m - (d_c/(2m))² ]
+ * where:
+ *   L_c = number of edges within community c
+ *   d_c = sum of degrees of nodes in community c
+ *   m   = total number of edges
+ *
+ * Result is clamped to [0, 1].
+ */
+function computeModularity(communities, neighbors, totalEdges) {
+    if (totalEdges === 0)
+        return 0;
+    // m = number of undirected edges. Since the neighbor map is bidirectional
+    // from directed import triples, totalEdges (import triple count) = undirected edge count
+    const m = totalEdges;
+    // Gather per-community stats
+    const communityEdges = new Map(); // L_c: edges within community
+    const communityDegree = new Map(); // d_c: sum of degrees
+    for (const [entity, cid] of communities) {
+        const nbrs = neighbors.get(entity);
+        const degree = nbrs?.size ?? 0;
+        communityDegree.set(cid, (communityDegree.get(cid) ?? 0) + degree);
+        if (!nbrs)
+            continue;
+        let internalEdges = 0;
+        for (const nbr of nbrs) {
+            if (communities.get(nbr) === cid)
+                internalEdges++;
+        }
+        // Each undirected edge counted twice (once from each end), divide by 2 later
+        communityEdges.set(cid, (communityEdges.get(cid) ?? 0) + internalEdges);
+    }
+    let Q = 0;
+    for (const [cid] of communityDegree) {
+        const Lc = (communityEdges.get(cid) ?? 0) / 2; // undirected edges within community
+        const dc = communityDegree.get(cid) ?? 0;
+        Q += Lc / m - (dc / (2 * m)) ** 2;
+    }
+    // Clamp to [0, 1]
+    return Math.max(0, Math.min(1, Q));
+}
+/** Find the longest common prefix of a set of strings */
+function commonPrefix(strings) {
+    if (strings.length === 0)
+        return '';
+    if (strings.length === 1) {
+        const only = strings[0] ?? '';
+        return only.includes('/') ? only.substring(0, only.lastIndexOf('/') + 1) : '';
+    }
+    const sorted = [...strings].sort();
+    const first = sorted[0];
+    const last = sorted[sorted.length - 1];
+    if (first === undefined || last === undefined)
+        return '';
+    let i = 0;
+    while (i < first.length && i < last.length && first[i] === last[i])
+        i++;
+    const prefix = first.substring(0, i);
+    // Cut at last /
+    const lastSlash = prefix.lastIndexOf('/');
+    return lastSlash >= 0 ? prefix.substring(0, lastSlash + 1) : '';
+}
+//# sourceMappingURL=community-detection.js.map

package/dist/knowledge/community-detection.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"community-detection.js","sourceRoot":"","sources":["../../src/knowledge/community-detection.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAkCH,MAAM,cAAc,GAAoB;IACtC,SAAS,EAAE,SAAS;IACpB,YAAY,EAAE,MAAM;IACpB,aAAa,EAAE,EAAE;IACjB,gBAAgB,EAAE,CAAC;IACnB,IAAI,EAAE,EAAE;CACT,CAAC;AAEF,+EAA+E;AAC/E,+BAA+B;AAC/B,+EAA+E;AAE/E;;;;;;;;GAQG;AACH,MAAM,UAAU,iBAAiB,CAC/B,KAAqB,EACrB,MAAiC,EACjC,cAAoC;IAEpC,MAAM,GAAG,GAAG,EAAE,GAAG,cAAc,EAAE,GAAG,MAAM,EAAE,CAAC;IAE7C,yCAAyC;IACzC,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;IAClC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IAEpC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,IAAI,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,YAAY,CAAC;YAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QACrE,IAAI,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,YAAY,CAAC;YAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IACrE,CAAC;IACD,QAAQ,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;IAC5B,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,sBAAsB;IAEvC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO;YACL,WAAW,EAAE,IAAI,GAAG,EAAE;YACtB,cAAc,EAAE,IAAI,GAAG,EAAE;YACzB,gBAAgB,EAAE,IAAI,GAAG,EAAE;YAC3B,UAAU,EAAE,CAAC;YACb,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE;SACvB,CAAC;IACJ,CAAC;IAED,+EAA+E;IAC/E,MAAM,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAC;IACjD,MAAM,WAAW,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,SAAS,EAAE,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC;IAC9D,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;QAC5B,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,YAAY,CAAC;YAAE,SAAS;QAChG,IAAI,EAAE,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QAClC,IAAI,CAAC,EAAE,EAAE,CAAC;YAAC,EAAE,GAAG,IAAI,GAAG,EAAE,CAAC;YAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QAAC,CAAC;QAC1D,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QACjB,IAAI,EAAE,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QACjC,IAAI,CAAC,EAAE,EAAE,CAAC;YAAC,EAAE,GAAG,IAAI,GAAG,EAAE,CAAC;YAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QAAC,CAAC;QACzD,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;IACpB,CAAC;IAED,6CAA6C;IAC7C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,IAAI,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC;QAC7C,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACxB,CAAC;IAED,+BAA+B;IAC/B,MAAM,KAAK,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC;IAE5B,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,GAAG,CAAC,aAAa,EAAE,IAAI,EAAE,EAAE,CAAC;QACpD,aAAa,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC;QACtC,IAAI,OAAO,GAAG,KAAK,CAAC;QAEpB,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACnC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC;gBAAE,SAAS;YAEvC,mCAAmC;YACnC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;YAC9C,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;gBAC7B,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACxD,CAAC;YAED,qBAAqB;YACrB,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,KAAK,MAAM,KAAK,IAAI,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC;gBACzC,IAAI,KAAK,GAAG,QAAQ;oBAAE,QAAQ,GAAG,KAAK,CAAC;YACzC,CAAC;YAED,wCAAwC;YACxC,MAAM,UAAU,GAAa,EAAE,CAAC;YAChC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,WAAW,EAAE,CAAC;gBACvC,IAAI,KAAK,KAAK,QAAQ;oBAAE,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC/C,CAAC;YAED,8DAA8D;YAC9D,MAAM,cAAc,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,yEAAyE;YACpH,IAAI,SAAiB,CAAC;YACtB,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC5B,SAAS,GAAG,cAAc,CAAC;YAC7B,CAAC;iBAAM,IAAI,cAAc,IAAI,cAAc,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;gBACrD,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC;gBACnB,SAAS,GAAG,cAAc,CAAC;gBAC3B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;oBACvB,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;oBAClC,IAAI,UAAU,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;wBAClC,MAAM,KAAK,GAAG,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;wBAC3C,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;4BACtB,SAAS,GAAG,KAAK,CAAC;4BAClB,SAAS,GAAG,QAAQ,CAAC;wBACvB,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,+CAA+C;gBAC/C,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC;YACtC,CAAC;YAED,IAAI,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,SAAS,EAAE,CAAC;gBACrC,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;gBAC9B,OAAO,GAAG,IAAI,CAAC;YACjB,CAAC;QACH,CAAC;QAED,IAAI,CAAC,OAAO;YAAE,MAAM;IACtB,CAAC;IAED,oCAAoC;IACpC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC7C,IAAI,MAAM,GAAG,CAAC,CAAC;IAEf,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC9C,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAoB,CAAC;IAErD,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;QAC9B,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;QACrC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC9B,UAAU,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,EAAE,CAAC,CAAC;QACrC,CAAC;QACD,MAAM,GAAG,GAAG,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;QACtC,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QAE7B,IAAI,OAAO,GAAG,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACxC,IAAI,CAAC,OAAO,EAAE,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;YAAC,gBAAgB,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QAAC,CAAC;QACnE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACvB,CAAC;IAED,6BAA6B;IAC7B,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAC;IACjD,KAAK,MAAM,CAAC,GAAG,EAAE,OAAO,CAAC,IAAI,gBAAgB,EAAE,CAAC;QAC9C,IAAI,OAAO,CAAC,MAAM,IAAI,GAAG,CAAC,gBAAgB,EAAE,CAAC;YAC3C,cAAc,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;QAC1C,CAAC;aAAM,CAAC;YACN,8BAA8B;YAC9B,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC7B,CAAC;YACD,gBAAgB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,qBAAqB;IACrB,MAAM,UAAU,GAAG,iBAAiB,CAAC,WAAW,EAAE,SAAS,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IAEjF,OAAO;QACL,WAAW;QACX,cAAc;QACd,gBAAgB;QAChB,UAAU;QACV,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE;KACvB,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,oBAAoB;AACpB,+EAA+E;AAE/E;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAChC,KAAqB,EACrB,OAAiB,EACjB,cAAoC;IAEpC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAE3C,qBAAqB;IACrB,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC;IACvD,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;IACnC,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAErG,oBAAoB;IACpB,MAAM,MAAM,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACxC,MAAM,EAAE,GAAG,cAAc,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACvC,MAAM,EAAE,GAAG,cAAc,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACvC,OAAO,EAAE,GAAG,EAAE,CAAC;IACjB,CAAC,CAAC,CAAC;IACH,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IAElF,wCAAwC;IACxC,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,OAAO,IAAI,KAAK,CAAC,KAAK,CAAC,EAAE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,kBAAkB,EAAE,CAAC,CAAC,MAAM,CAAC;QAClF,QAAQ,IAAI,KAAK,CAAC,KAAK,CAAC,EAAE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,UAAU,EAAE,CAAC;aAChE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;IACrD,CAAC;IAED,MAAM,KAAK,GAAG,CAAC,GAAG,KAAK,KAAK,OAAO,CAAC,MAAM,WAAW,CAAC,CAAC;IACvD,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,UAAU,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC7D,IAAI,OAAO,GAAG,CAAC,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;QAChC,KAAK,CAAC,IAAI,CAAC,KAAK,OAAO,eAAe,QAAQ,UAAU,CAAC,CAAC;IAC5D,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,+EAA+E;AAC/E,UAAU;AACV,+EAA+E;AAE/E,gDAAgD;AAChD,SAAS,aAAa,CAAI,GAAQ,EAAE,IAAY;IAC9C,IAAI,CAAC,GAAG,IAAI,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,GAAG,KAAK,CAAC,GAAG,UAAU,CAAC;QAC1C,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtB,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACjB,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACvC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACX,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACb,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,iBAAiB,CACxB,WAAgC,EAChC,SAAmC,EACnC,UAAkB;IAElB,IAAI,UAAU,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAE/B,0EAA0E;IAC1E,yFAAyF;IACzF,MAAM,CAAC,GAAG,UAAU,CAAC;IAErB,6BAA6B;IAC7B,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAC,CAAC,8BAA8B;IAChF,MAAM,eAAe,GAAG,IAAI,GAAG,EAAkB,CAAC,CAAC,sBAAsB;IAEzE,KAAK,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,WAAW,EAAE,CAAC;QACxC,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACnC,MAAM,MAAM,GAAG,IAAI,EAAE,IAAI,IAAI,CAAC,CAAC;QAC/B,eAAe,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;QAEnE,IAAI,CAAC,IAAI;YAAE,SAAS;QACpB,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,IAAI,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,GAAG;gBAAE,aAAa,EAAE,CAAC;QACpD,CAAC;QACD,6EAA6E;QAC7E,cAAc,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC;IAC1E,CAAC;IAED,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,GAAG,CAAC,IAAI,eAAe,EAAE,CAAC;QACpC,MAAM,EAAE,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,oCAAoC;QACnF,MAAM,EAAE,GAAG,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACzC,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC;IAED,kBAAkB;IAClB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AACrC,CAAC;AAED,yDAAyD;AACzD,SAAS,YAAY,CAAC,OAAiB;IACrC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACpC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAC9B,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAChF,CAAC;IAED,MAAM,MAAM,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC;IACnC,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACxB,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACvC,IAAI,KAAK,KAAK,SAAS,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC;IAEzD,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC;QAAE,CAAC,EAAE,CAAC;IAExE,MAAM,MAAM,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACrC,gBAAgB;IAChB,MAAM,SAAS,GAAG,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IAC1C,OAAO,SAAS,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AAClE,CAAC"}

package/dist/knowledge/community-detector.d.ts

@@ -0,0 +1,31 @@
+/**
+ * Community Detection — GitNexus Knowledge Graph
+ *
+ * Simplified label propagation algorithm for detecting architectural
+ * modules/clusters in the code graph. Each node starts with its own
+ * label, then iteratively adopts the most common label among its
+ * neighbors until stable.
+ *
+ * This is simpler than full Louvain/Leiden but sufficient for v1.
+ */
+import { KnowledgeGraph } from './knowledge-graph.js';
+export interface Community {
+    id: number;
+    name: string;
+    symbols: string[];
+    files: string[];
+    cohesion: number;
+    entryPoints: string[];
+}
+/**
+ * Detect communities (architectural modules) in the code graph
+ * using label propagation.
+ *
+ * @param graph - KnowledgeGraph to analyze
+ * @param options - Optional configuration
+ * @returns Array of detected communities
+ */
+export declare function detectCommunities(graph: KnowledgeGraph, options?: {
+    minSize?: number;
+    maxIterations?: number;
+}): Community[];

package/dist/knowledge/community-detector.js

@@ -0,0 +1,257 @@
+/**
+ * Community Detection — GitNexus Knowledge Graph
+ *
+ * Simplified label propagation algorithm for detecting architectural
+ * modules/clusters in the code graph. Each node starts with its own
+ * label, then iteratively adopts the most common label among its
+ * neighbors until stable.
+ *
+ * This is simpler than full Louvain/Leiden but sufficient for v1.
+ */
+import { logger } from '../utils/logger.js';
+// ============================================================================
+// Internal Helpers
+// ============================================================================
+/**
+ * Build an adjacency list from the knowledge graph.
+ * Includes all edge types (calls, imports, extends, etc.)
+ */
+function buildAdjacencyList(graph) {
+    const adj = new Map();
+    const addEdge = (a, b) => {
+        if (!adj.has(a))
+            adj.set(a, new Set());
+        if (!adj.has(b))
+            adj.set(b, new Set());
+        adj.get(a).add(b);
+        adj.get(b).add(a);
+    };
+    const triples = graph.toJSON();
+    for (const t of triples) {
+        // Skip metadata-like predicates
+        if (['typeof', 'importCount', 'hasDirectory', 'patternOf'].includes(t.predicate)) {
+            continue;
+        }
+        addEdge(t.subject, t.object);
+    }
+    return adj;
+}
+/**
+ * Find the most common label among a node's neighbors.
+ * Ties are broken by picking the smallest label (deterministic).
+ */
+function mostCommonNeighborLabel(node, adj, labels) {
+    const neighbors = adj.get(node);
+    if (!neighbors || neighbors.size === 0) {
+        return labels.get(node) ?? 0;
+    }
+    const counts = new Map();
+    for (const neighbor of neighbors) {
+        const label = labels.get(neighbor);
+        if (label !== undefined) {
+            counts.set(label, (counts.get(label) ?? 0) + 1);
+        }
+    }
+    if (counts.size === 0) {
+        return labels.get(node) ?? 0;
+    }
+    // Find max count
+    let maxCount = 0;
+    for (const c of counts.values()) {
+        if (c > maxCount)
+            maxCount = c;
+    }
+    // Among labels with maxCount, pick smallest (deterministic tie-break)
+    let bestLabel = Infinity;
+    for (const [label, count] of counts) {
+        if (count === maxCount && label < bestLabel) {
+            bestLabel = label;
+        }
+    }
+    return bestLabel;
+}
+/**
+ * Extract file path from a symbol.
+ */
+function symbolToFile(symbol, graph) {
+    const definedIn = graph.query({ subject: symbol, predicate: 'definedIn' });
+    const firstDefinedIn = definedIn[0];
+    if (firstDefinedIn)
+        return firstDefinedIn.object.replace(/^mod:/, '');
+    const belongsTo = graph.query({ subject: symbol, predicate: 'belongsTo' });
+    const firstBelongsTo = belongsTo[0];
+    if (firstBelongsTo)
+        return firstBelongsTo.object.replace(/^mod:/, '');
+    if (symbol.startsWith('mod:'))
+        return symbol.replace(/^mod:/, '');
+    if (symbol.includes('/')) {
+        const parts = symbol.split(':');
+        return parts.length > 1 ? parts.slice(1).join(':') : (parts[0] ?? symbol);
+    }
+    return '';
+}
+/**
+ * Generate a human-readable name for a community based on common paths.
+ */
+function nameCommunity(symbols, graph) {
+    const files = symbols
+        .map(s => symbolToFile(s, graph))
+        .filter(f => f.length > 0);
+    if (files.length === 0)
+        return 'Unknown Module';
+    // Extract directory components
+    const dirCounts = new Map();
+    for (const file of files) {
+        const parts = file.replace(/\\/g, '/').split('/');
+        // Use the most specific non-leaf directory
+        for (let i = 0; i < parts.length - 1; i++) {
+            const dir = parts[i];
+            if (dir && dir !== 'src' && dir !== 'lib' && dir !== 'dist') {
+                dirCounts.set(dir, (dirCounts.get(dir) ?? 0) + 1);
+            }
+        }
+    }
+    if (dirCounts.size === 0)
+        return 'Core Module';
+    // Find most common directory
+    let bestDir = '';
+    let bestCount = 0;
+    for (const [dir, count] of dirCounts) {
+        if (count > bestCount) {
+            bestCount = count;
+            bestDir = dir;
+        }
+    }
+    // Capitalize and format
+    const formatted = bestDir
+        .replace(/[-_]/g, ' ')
+        .replace(/\b\w/g, c => c.toUpperCase());
+    return formatted + ' Module';
+}
+/**
+ * Calculate cohesion for a community.
+ * cohesion = internal edges / total edges of community members
+ */
+function calculateCohesion(symbols, adj) {
+    let internalEdges = 0;
+    let totalEdges = 0;
+    for (const sym of symbols) {
+        const neighbors = adj.get(sym);
+        if (!neighbors)
+            continue;
+        for (const neighbor of neighbors) {
+            totalEdges++;
+            if (symbols.has(neighbor)) {
+                internalEdges++;
+            }
+        }
+    }
+    if (totalEdges === 0)
+        return 0;
+    return internalEdges / totalEdges;
+}
+/**
+ * Find entry points within a community (nodes with external callers).
+ */
+function findEntryPoints(symbols, adj, graph) {
+    const entryPoints = [];
+    for (const sym of symbols) {
+        // Check if this symbol is called from outside the community
+        const callers = graph.query({ predicate: 'calls', object: sym });
+        const hasExternalCaller = callers.some(t => !symbols.has(t.subject));
+        // Check if it's exported
+        const exports = graph.query({ predicate: 'exports', object: sym });
+        const exposes = graph.query({ predicate: 'exposes', object: sym });
+        if (hasExternalCaller || exports.length > 0 || exposes.length > 0) {
+            entryPoints.push(sym);
+        }
+    }
+    return entryPoints;
+}
+// ============================================================================
+// Public API
+// ============================================================================
+const MAX_ITERATIONS = 10;
+const MIN_COMMUNITY_SIZE = 3;
+/**
+ * Detect communities (architectural modules) in the code graph
+ * using label propagation.
+ *
+ * @param graph - KnowledgeGraph to analyze
+ * @param options - Optional configuration
+ * @returns Array of detected communities
+ */
+export function detectCommunities(graph, options) {
+    const minSize = options?.minSize ?? MIN_COMMUNITY_SIZE;
+    const maxIterations = options?.maxIterations ?? MAX_ITERATIONS;
+    const adj = buildAdjacencyList(graph);
+    const nodes = [...adj.keys()];
+    if (nodes.length === 0)
+        return [];
+    // Initialize: each node gets its own label
+    const labels = new Map();
+    for (const [i, node] of nodes.entries()) {
+        labels.set(node, i);
+    }
+    // Iterate: each node adopts the most common label among neighbors
+    for (let iter = 0; iter < maxIterations; iter++) {
+        let changed = false;
+        // Shuffle nodes for randomized propagation (deterministic with seed)
+        const shuffled = [...nodes];
+        for (let i = shuffled.length - 1; i > 0; i--) {
+            // Simple deterministic shuffle based on iteration
+            const j = (i * (iter + 1) * 31) % (i + 1);
+            const a = shuffled[i];
+            const b = shuffled[j];
+            // Both i (1..length-1) and j (0..i via modulo) are in bounds, so a/b
+            // are defined; guard only to satisfy the type checker without changing behavior.
+            if (a === undefined || b === undefined)
+                continue;
+            shuffled[i] = b;
+            shuffled[j] = a;
+        }
+        for (const node of shuffled) {
+            const newLabel = mostCommonNeighborLabel(node, adj, labels);
+            const oldLabel = labels.get(node);
+            if (newLabel !== oldLabel) {
+                labels.set(node, newLabel);
+                changed = true;
+            }
+        }
+        if (!changed) {
+            logger.debug(`CommunityDetector: converged after ${iter + 1} iterations`);
+            break;
+        }
+    }
+    // Group by final label
+    const groups = new Map();
+    for (const [node, label] of labels) {
+        if (!groups.has(label))
+            groups.set(label, []);
+        groups.get(label).push(node);
+    }
+    // Filter by minimum size and build communities
+    const communities = [];
+    let communityId = 0;
+    for (const [, members] of groups) {
+        if (members.length < minSize)
+            continue;
+        const symbolSet = new Set(members);
+        const files = [...new Set(members
+                .map(s => symbolToFile(s, graph))
+                .filter(f => f.length > 0))];
+        communities.push({
+            id: communityId++,
+            name: nameCommunity(members, graph),
+            symbols: members.sort(),
+            files: files.sort(),
+            cohesion: calculateCohesion(symbolSet, adj),
+            entryPoints: findEntryPoints(symbolSet, adj, graph),
+        });
+    }
+    // Sort by size descending
+    communities.sort((a, b) => b.symbols.length - a.symbols.length);
+    logger.debug(`CommunityDetector: found ${communities.length} communities from ${nodes.length} nodes`);
+    return communities;
+}
+//# sourceMappingURL=community-detector.js.map

package/dist/knowledge/community-detector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"community-detector.js","sourceRoot":"","sources":["../../src/knowledge/community-detector.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAGH,OAAO,EAAE,MAAM,EAAE,MAAM,oBAAoB,CAAC;AAe5C,+EAA+E;AAC/E,mBAAmB;AACnB,+EAA+E;AAE/E;;;GAGG;AACH,SAAS,kBAAkB,CAAC,KAAqB;IAC/C,MAAM,GAAG,GAAG,IAAI,GAAG,EAAuB,CAAC;IAE3C,MAAM,OAAO,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE;QACvC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACvC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACvC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACnB,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC,CAAC;IAEF,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,gCAAgC;QAChC,IAAI,CAAC,QAAQ,EAAE,aAAa,EAAE,cAAc,EAAE,WAAW,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC;YACjF,SAAS;QACX,CAAC;QACD,OAAO,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;IAC/B,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;GAGG;AACH,SAAS,uBAAuB,CAC9B,IAAY,EACZ,GAA6B,EAC7B,MAA2B;IAE3B,MAAM,SAAS,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAChC,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QACvC,OAAO,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC/B,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACnC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAClD,CAAC;IACH,CAAC;IAED,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QACtB,OAAO,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC/B,CAAC;IAED,iBAAiB;IACjB,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;QAChC,IAAI,CAAC,GAAG,QAAQ;YAAE,QAAQ,GAAG,CAAC,CAAC;IACjC,CAAC;IAED,sEAAsE;IACtE,IAAI,SAAS,GAAG,QAAQ,CAAC;IACzB,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;QACpC,IAAI,KAAK,KAAK,QAAQ,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;YAC5C,SAAS,GAAG,KAAK,CAAC;QACpB,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;GAEG;AACH,SAAS,YAAY,CAAC,MAAc,EAAE,KAAqB;IACzD,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,WAAW,EAAE,CAAC,CAAC;IAC3E,MAAM,cAAc,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;IACpC,IAAI,cAAc;QAAE,OAAO,cAAc,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IAEtE,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,WAAW,EAAE,CAAC,CAAC;IAC3E,MAAM,cAAc,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;IACpC,IAAI,cAAc;QAAE,OAAO,cAAc,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IAEtE,IAAI,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC;QAAE,OAAO,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IAElE,IAAI,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAChC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC;IAC5E,CAAC;IAED,OAAO,EAAE,CAAC;AACZ,CAAC;AAED;;GAEG;AACH,SAAS,aAAa,CAAC,OAAiB,EAAE,KAAqB;IAC7D,MAAM,KAAK,GAAG,OAAO;SAClB,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;SAChC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAE7B,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,gBAAgB,CAAC;IAEhD,+BAA+B;IAC/B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC5C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAClD,2CAA2C;QAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACrB,IAAI,GAAG,IAAI,GAAG,KAAK,KAAK,IAAI,GAAG,KAAK,KAAK,IAAI,GAAG,KAAK,MAAM,EAAE,CAAC;gBAC5D,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACpD,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,SAAS,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,aAAa,CAAC;IAE/C,6BAA6B;IAC7B,IAAI,OAAO,GAAG,EAAE,CAAC;IACjB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,SAAS,EAAE,CAAC;QACrC,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;YACtB,SAAS,GAAG,KAAK,CAAC;YAClB,OAAO,GAAG,GAAG,CAAC;QAChB,CAAC;IACH,CAAC;IAED,wBAAwB;IACxB,MAAM,SAAS,GAAG,OAAO;SACtB,OAAO,CAAC,OAAO,EAAE,GAAG,CAAC;SACrB,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;IAE1C,OAAO,SAAS,GAAG,SAAS,CAAC;AAC/B,CAAC;AAED;;;GAGG;AACH,SAAS,iBAAiB,CACxB,OAAoB,EACpB,GAA6B;IAE7B,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,MAAM,SAAS,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,CAAC,SAAS;YAAE,SAAS;QAEzB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,UAAU,EAAE,CAAC;YACb,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC1B,aAAa,EAAE,CAAC;YAClB,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,UAAU,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC/B,OAAO,aAAa,GAAG,UAAU,CAAC;AACpC,CAAC;AAED;;GAEG;AACH,SAAS,eAAe,CACtB,OAAoB,EACpB,GAA6B,EAC7B,KAAqB;IAErB,MAAM,WAAW,GAAa,EAAE,CAAC;IAEjC,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,4DAA4D;QAC5D,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC;QACjE,MAAM,iBAAiB,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;QAErE,yBAAyB;QACzB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC;QACnE,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC;QAEnE,IAAI,iBAAiB,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAClE,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED,OAAO,WAAW,CAAC;AACrB,CAAC;AAED,+EAA+E;AAC/E,aAAa;AACb,+EAA+E;AAE/E,MAAM,cAAc,GAAG,EAAE,CAAC;AAC1B,MAAM,kBAAkB,GAAG,CAAC,CAAC;AAE7B;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAC/B,KAAqB,EACrB,OAGC;IAED,MAAM,OAAO,GAAG,OAAO,EAAE,OAAO,IAAI,kBAAkB,CAAC;IACvD,MAAM,aAAa,GAAG,OAAO,EAAE,aAAa,IAAI,cAAc,CAAC;IAE/D,MAAM,GAAG,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC;IACtC,MAAM,KAAK,GAAG,CAAC,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;IAE9B,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAElC,2CAA2C;IAC3C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;QACxC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACtB,CAAC;IAED,kEAAkE;IAClE,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,aAAa,EAAE,IAAI,EAAE,EAAE,CAAC;QAChD,IAAI,OAAO,GAAG,KAAK,CAAC;QAEpB,qEAAqE;QACrE,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,kDAAkD;YAClD,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC1C,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACtB,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACtB,qEAAqE;YACrE,iFAAiF;YACjF,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS;gBAAE,SAAS;YACjD,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAChB,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAClB,CAAC;QAED,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,MAAM,QAAQ,GAAG,uBAAuB,CAAC,IAAI,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;YAC5D,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;YACnC,IAAI,QAAQ,KAAK,QAAQ,EAAE,CAAC;gBAC1B,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;gBAC3B,OAAO,GAAG,IAAI,CAAC;YACjB,CAAC;QACH,CAAC;QAED,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,MAAM,CAAC,KAAK,CAAC,sCAAsC,IAAI,GAAG,CAAC,aAAa,CAAC,CAAC;YAC1E,MAAM;QACR,CAAC;IACH,CAAC;IAED,uBAAuB;IACvB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;QACnC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QAC9C,MAAM,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC;IAED,+CAA+C;IAC/C,MAAM,WAAW,GAAgB,EAAE,CAAC;IACpC,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,KAAK,MAAM,CAAC,EAAE,OAAO,CAAC,IAAI,MAAM,EAAE,CAAC;QACjC,IAAI,OAAO,CAAC,MAAM,GAAG,OAAO;YAAE,SAAS;QAEvC,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;QACnC,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,GAAG,CACvB,OAAO;iBACJ,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;iBAChC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAC7B,CAAC,CAAC;QAEH,WAAW,CAAC,IAAI,CAAC;YACf,EAAE,EAAE,WAAW,EAAE;YACjB,IAAI,EAAE,aAAa,CAAC,OAAO,EAAE,KAAK,CAAC;YACnC,OAAO,EAAE,OAAO,CAAC,IAAI,EAAE;YACvB,KAAK,EAAE,KAAK,CAAC,IAAI,EAAE;YACnB,QAAQ,EAAE,iBAAiB,CAAC,SAAS,EAAE,GAAG,CAAC;YAC3C,WAAW,EAAE,eAAe,CAAC,SAAS,EAAE,GAAG,EAAE,KAAK,CAAC;SACpD,CAAC,CAAC;IACL,CAAC;IAED,0BAA0B;IAC1B,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAEhE,MAAM,CAAC,KAAK,CAAC,4BAA4B,WAAW,CAAC,MAAM,qBAAqB,KAAK,CAAC,MAAM,QAAQ,CAAC,CAAC;IACtG,OAAO,WAAW,CAAC;AACrB,CAAC"}