@ninebix/nmt-system 1.0.2 → 1.0.3

package/dist/extensions/clustering/community-detection.js

@@ -1,470 +0,0 @@
-/**
- * Community Detection - Graph-based neuron community analysis
- * @module extensions/clustering/community-detection
- */
-import { generateUUID } from '../../utils/uuid.js';
-/**
- * Community Detection Service
- */
-export class CommunityDetectionService {
-    neuronStore;
-    communities;
-    constructor(neuronStore) {
-        this.neuronStore = neuronStore;
-        this.communities = new Map();
-    }
-    /**
-     * Louvain community detection algorithm
-     */
-    async louvain(options = {}) {
-        const { resolution = 1.0, minCommunitySize = 1, maxIterations = 100 } = options;
-        // Build adjacency data
-        const { nodes, edges, weights, totalWeight } = await this.buildGraph();
-        if (nodes.length === 0) {
-            return { communities: [], modularity: 0, coverage: 0 };
-        }
-        // Initialize: each node in its own community
-        let communityAssignment = new Map();
-        nodes.forEach((id, idx) => communityAssignment.set(id, idx));
-        // Degree of each node
-        const degree = new Map();
-        for (const nodeId of nodes) {
-            let deg = 0;
-            const nodeEdges = edges.get(nodeId) ?? [];
-            for (const [, weight] of nodeEdges) {
-                deg += weight;
-            }
-            degree.set(nodeId, deg);
-        }
-        const hierarchy = [];
-        let improved = true;
-        let iteration = 0;
-        let currentNodes = [...nodes];
-        let currentEdges = new Map(edges);
-        let currentDegree = new Map(degree);
-        let currentTotalWeight = totalWeight;
-        while (improved && iteration < maxIterations) {
-            improved = false;
-            // Phase 1: Local moving
-            const localResult = this.localMoving(currentNodes, currentEdges, currentDegree, communityAssignment, currentTotalWeight, resolution);
-            improved = localResult.improved;
-            communityAssignment = localResult.assignment;
-            // Build communities for this level
-            const levelCommunities = this.buildCommunitiesFromAssignment(currentNodes, currentEdges, communityAssignment);
-            hierarchy.push(levelCommunities);
-            if (improved) {
-                // Phase 2: Aggregation
-                const aggregated = this.aggregate(currentNodes, currentEdges, communityAssignment);
-                currentNodes = aggregated.nodes;
-                currentEdges = aggregated.edges;
-                currentDegree = aggregated.degree;
-                // Reset assignment for aggregated nodes
-                communityAssignment = new Map();
-                currentNodes.forEach((id, idx) => communityAssignment.set(id, idx));
-            }
-            iteration++;
-        }
-        // Find best level by modularity
-        let bestModularity = -Infinity;
-        let bestLevel = 0;
-        for (let l = 0; l < hierarchy.length; l++) {
-            const levelMod = this.calculateLevelModularity(hierarchy[l]);
-            if (levelMod > bestModularity) {
-                bestModularity = levelMod;
-                bestLevel = l;
-            }
-        }
-        // Get communities from best level, filter by size
-        const finalCommunities = hierarchy[bestLevel]
-            .filter(c => c.members.length >= minCommunitySize);
-        // Expand aggregated communities back to original nodes if needed
-        const expandedCommunities = await this.expandCommunities(finalCommunities, nodes);
-        // Calculate overall metrics
-        const modularity = this.calculateModularity(nodes, edges, expandedCommunities, totalWeight);
-        const coverage = expandedCommunities.reduce((sum, c) => sum + c.members.length, 0) / nodes.length;
-        // Store communities
-        for (const community of expandedCommunities) {
-            this.communities.set(community.id, community);
-        }
-        return {
-            communities: expandedCommunities,
-            modularity,
-            coverage,
-            hierarchy: {
-                levels: hierarchy,
-                bestLevel
-            }
-        };
-    }
-    /**
-     * Label Propagation community detection
-     */
-    async labelPropagation(options = {}) {
-        const { maxIterations = 100, minCommunitySize = 1 } = options;
-        const { nodes, edges, totalWeight } = await this.buildGraph();
-        if (nodes.length === 0) {
-            return { communities: [], modularity: 0, coverage: 0 };
-        }
-        // Initialize labels
-        const labels = new Map();
-        nodes.forEach((id, idx) => labels.set(id, idx));
-        let changed = true;
-        let iteration = 0;
-        while (changed && iteration < maxIterations) {
-            changed = false;
-            // Shuffle nodes for random order
-            const shuffled = [...nodes].sort(() => Math.random() - 0.5);
-            for (const nodeId of shuffled) {
-                const neighborLabels = new Map();
-                const nodeEdges = edges.get(nodeId) ?? [];
-                // Count neighbor labels weighted by edge weight
-                for (const [neighborId, weight] of nodeEdges) {
-                    const neighborLabel = labels.get(neighborId);
-                    neighborLabels.set(neighborLabel, (neighborLabels.get(neighborLabel) ?? 0) + weight);
-                }
-                if (neighborLabels.size === 0)
-                    continue;
-                // Find most common label
-                let maxWeight = 0;
-                let bestLabels = [];
-                for (const [label, weight] of neighborLabels) {
-                    if (weight > maxWeight) {
-                        maxWeight = weight;
-                        bestLabels = [label];
-                    }
-                    else if (weight === maxWeight) {
-                        bestLabels.push(label);
-                    }
-                }
-                // Random tie-breaking
-                const newLabel = bestLabels[Math.floor(Math.random() * bestLabels.length)];
-                const currentLabel = labels.get(nodeId);
-                if (newLabel !== currentLabel) {
-                    labels.set(nodeId, newLabel);
-                    changed = true;
-                }
-            }
-            iteration++;
-        }
-        // Build communities from labels
-        const labelGroups = new Map();
-        for (const [nodeId, label] of labels) {
-            if (!labelGroups.has(label)) {
-                labelGroups.set(label, []);
-            }
-            labelGroups.get(label).push(nodeId);
-        }
-        const communities = [];
-        for (const members of labelGroups.values()) {
-            if (members.length >= minCommunitySize) {
-                communities.push(await this.buildCommunity(members, edges, 'label-propagation'));
-            }
-        }
-        const modularity = this.calculateModularity(nodes, edges, communities, totalWeight);
-        const coverage = communities.reduce((sum, c) => sum + c.members.length, 0) / nodes.length;
-        // Store communities
-        for (const community of communities) {
-            this.communities.set(community.id, community);
-        }
-        return { communities, modularity, coverage };
-    }
-    /**
-     * Get community by ID
-     */
-    getCommunity(id) {
-        return this.communities.get(id);
-    }
-    /**
-     * Get all communities
-     */
-    getAllCommunities() {
-        return Array.from(this.communities.values());
-    }
-    /**
-     * Find community for a neuron
-     */
-    findCommunityForNeuron(neuronId) {
-        for (const community of this.communities.values()) {
-            if (community.members.includes(neuronId)) {
-                return community;
-            }
-        }
-        return undefined;
-    }
-    /**
-     * Get bridge nodes (connect multiple communities)
-     */
-    async getBridgeNodes() {
-        const bridges = [];
-        const ids = await this.neuronStore.getAllNeuronIds();
-        for (const id of ids) {
-            const outgoing = await this.neuronStore.getOutgoingSynapses(id);
-            const incoming = await this.neuronStore.getIncomingSynapses(id);
-            const myCommunity = this.findCommunityForNeuron(id);
-            if (!myCommunity)
-                continue;
-            const connectedCommunities = new Set();
-            for (const synapse of [...outgoing, ...incoming]) {
-                const otherId = synapse.sourceId === id ? synapse.targetId : synapse.sourceId;
-                const otherCommunity = this.findCommunityForNeuron(otherId);
-                if (otherCommunity && otherCommunity.id !== myCommunity.id) {
-                    connectedCommunities.add(otherCommunity.id);
-                }
-            }
-            if (connectedCommunities.size > 0) {
-                bridges.push(id);
-            }
-        }
-        return bridges;
-    }
-    // ==================== Private Methods ====================
-    async buildGraph() {
-        const nodes = await this.neuronStore.getAllNeuronIds();
-        const edges = new Map();
-        const weights = new Map();
-        let totalWeight = 0;
-        for (const nodeId of nodes) {
-            edges.set(nodeId, []);
-        }
-        for (const nodeId of nodes) {
-            const outgoing = await this.neuronStore.getOutgoingSynapses(nodeId);
-            for (const synapse of outgoing) {
-                const edgeKey = [nodeId, synapse.targetId].sort().join('-');
-                if (!weights.has(edgeKey)) {
-                    weights.set(edgeKey, synapse.weight);
-                    edges.get(nodeId).push([synapse.targetId, synapse.weight]);
-                    edges.get(synapse.targetId).push([nodeId, synapse.weight]);
-                    totalWeight += synapse.weight;
-                }
-            }
-        }
-        return { nodes, edges, weights, totalWeight };
-    }
-    localMoving(nodes, edges, degree, assignment, totalWeight, resolution) {
-        let improved = false;
-        const newAssignment = new Map(assignment);
-        // Shuffle for random order
-        const shuffled = [...nodes].sort(() => Math.random() - 0.5);
-        for (const nodeId of shuffled) {
-            const currentCommunity = newAssignment.get(nodeId);
-            const nodeDegree = degree.get(nodeId) ?? 0;
-            // Calculate delta Q for moving to each neighbor's community
-            const neighborCommunities = new Map();
-            const nodeEdges = edges.get(nodeId) ?? [];
-            for (const [neighborId, weight] of nodeEdges) {
-                const neighborCommunity = newAssignment.get(neighborId);
-                neighborCommunities.set(neighborCommunity, (neighborCommunities.get(neighborCommunity) ?? 0) + weight);
-            }
-            let bestCommunity = currentCommunity;
-            let bestDelta = 0;
-            for (const [community, edgeWeight] of neighborCommunities) {
-                if (community === currentCommunity)
-                    continue;
-                // Calculate community totals
-                let currentTotal = 0;
-                let targetTotal = 0;
-                for (const [nId, comm] of newAssignment) {
-                    const nDeg = degree.get(nId) ?? 0;
-                    if (comm === currentCommunity)
-                        currentTotal += nDeg;
-                    if (comm === community)
-                        targetTotal += nDeg;
-                }
-                // Delta Q for moving from current to target
-                const deltaQ = (edgeWeight - (neighborCommunities.get(currentCommunity) ?? 0)) / totalWeight
-                    - resolution * nodeDegree * (targetTotal - currentTotal + nodeDegree) / (2 * totalWeight * totalWeight);
-                if (deltaQ > bestDelta) {
-                    bestDelta = deltaQ;
-                    bestCommunity = community;
-                }
-            }
-            if (bestCommunity !== currentCommunity) {
-                newAssignment.set(nodeId, bestCommunity);
-                improved = true;
-            }
-        }
-        return { improved, assignment: newAssignment };
-    }
-    aggregate(nodes, edges, assignment) {
-        // Map communities to super-nodes
-        const communityToSuper = new Map();
-        const superNodes = [];
-        for (const [, community] of assignment) {
-            if (!communityToSuper.has(community)) {
-                const superId = generateUUID();
-                communityToSuper.set(community, superId);
-                superNodes.push(superId);
-            }
-        }
-        // Build super-edges
-        const superEdges = new Map();
-        const superWeights = new Map();
-        for (const superId of superNodes) {
-            superEdges.set(superId, []);
-        }
-        for (const nodeId of nodes) {
-            const nodeComm = assignment.get(nodeId);
-            const superNode = communityToSuper.get(nodeComm);
-            const nodeEdges = edges.get(nodeId) ?? [];
-            for (const [neighborId, weight] of nodeEdges) {
-                const neighborComm = assignment.get(neighborId);
-                const neighborSuper = communityToSuper.get(neighborComm);
-                if (superNode !== neighborSuper) {
-                    const edgeKey = [superNode, neighborSuper].sort().join('-');
-                    superWeights.set(edgeKey, (superWeights.get(edgeKey) ?? 0) + weight);
-                }
-            }
-        }
-        // Add aggregated edges
-        for (const [edgeKey, weight] of superWeights) {
-            const [a, b] = edgeKey.split('-');
-            superEdges.get(a).push([b, weight]);
-            superEdges.get(b).push([a, weight]);
-        }
-        // Calculate degrees
-        const superDegree = new Map();
-        for (const superId of superNodes) {
-            let deg = 0;
-            for (const [, weight] of superEdges.get(superId)) {
-                deg += weight;
-            }
-            superDegree.set(superId, deg);
-        }
-        return {
-            nodes: superNodes,
-            edges: superEdges,
-            degree: superDegree
-        };
-    }
-    buildCommunitiesFromAssignment(nodes, edges, assignment) {
-        const groups = new Map();
-        for (const nodeId of nodes) {
-            const comm = assignment.get(nodeId);
-            if (!groups.has(comm)) {
-                groups.set(comm, []);
-            }
-            groups.get(comm).push(nodeId);
-        }
-        const communities = [];
-        for (const [, members] of groups) {
-            // Calculate density
-            let internalEdges = 0;
-            for (const nodeId of members) {
-                for (const [neighborId] of edges.get(nodeId) ?? []) {
-                    if (members.includes(neighborId)) {
-                        internalEdges++;
-                    }
-                }
-            }
-            internalEdges /= 2; // Each edge counted twice
-            const maxEdges = (members.length * (members.length - 1)) / 2;
-            const density = maxEdges > 0 ? internalEdges / maxEdges : 0;
-            communities.push({
-                id: generateUUID(),
-                members,
-                modularity: 0, // Will be calculated later
-                density,
-                bridgeNodes: [],
-                metadata: {
-                    createdAt: new Date().toISOString(),
-                    algorithm: 'louvain'
-                }
-            });
-        }
-        return communities;
-    }
-    async buildCommunity(members, edges, algorithm) {
-        // Calculate density
-        let internalEdges = 0;
-        for (const nodeId of members) {
-            for (const [neighborId] of edges.get(nodeId) ?? []) {
-                if (members.includes(neighborId)) {
-                    internalEdges++;
-                }
-            }
-        }
-        internalEdges /= 2;
-        const maxEdges = (members.length * (members.length - 1)) / 2;
-        const density = maxEdges > 0 ? internalEdges / maxEdges : 0;
-        // Find bridge nodes
-        const bridgeNodes = [];
-        for (const nodeId of members) {
-            for (const [neighborId] of edges.get(nodeId) ?? []) {
-                if (!members.includes(neighborId)) {
-                    bridgeNodes.push(nodeId);
-                    break;
-                }
-            }
-        }
-        return {
-            id: generateUUID(),
-            members,
-            modularity: 0,
-            density,
-            bridgeNodes,
-            metadata: {
-                createdAt: new Date().toISOString(),
-                algorithm
-            }
-        };
-    }
-    calculateLevelModularity(communities) {
-        // Simplified modularity based on density
-        return communities.reduce((sum, c) => sum + c.density * c.members.length, 0) /
-            communities.reduce((sum, c) => sum + c.members.length, 0);
-    }
-    calculateModularity(nodes, edges, communities, totalWeight) {
-        if (totalWeight === 0)
-            return 0;
-        let Q = 0;
-        const m = totalWeight;
-        // Calculate degree for each node
-        const degree = new Map();
-        for (const nodeId of nodes) {
-            let deg = 0;
-            for (const [, weight] of edges.get(nodeId) ?? []) {
-                deg += weight;
-            }
-            degree.set(nodeId, deg);
-        }
-        for (const community of communities) {
-            for (const i of community.members) {
-                for (const j of community.members) {
-                    if (i === j)
-                        continue;
-                    // Check if edge exists
-                    let aij = 0;
-                    for (const [neighborId, weight] of edges.get(i) ?? []) {
-                        if (neighborId === j) {
-                            aij = weight;
-                            break;
-                        }
-                    }
-                    const ki = degree.get(i) ?? 0;
-                    const kj = degree.get(j) ?? 0;
-                    Q += aij - (ki * kj) / (2 * m);
-                }
-            }
-        }
-        return Q / (2 * m);
-    }
-    async expandCommunities(communities, originalNodes) {
-        // If communities already contain original nodes, return as-is
-        const allMembers = new Set(communities.flatMap(c => c.members));
-        const originalSet = new Set(originalNodes);
-        const needsExpansion = ![...allMembers].every(m => originalSet.has(m));
-        if (!needsExpansion) {
-            return communities;
-        }
-        // For hierarchical expansion, we'd need to track the aggregation mapping
-        // For now, return communities as-is
-        return communities;
-    }
-}
-/**
- * Create a CommunityDetectionService instance
- */
-export function createCommunityDetectionService(neuronStore) {
-    return new CommunityDetectionService(neuronStore);
-}
-//# sourceMappingURL=community-detection.js.map

package/dist/extensions/clustering/community-detection.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"community-detection.js","sourceRoot":"","sources":["../../../src/extensions/clustering/community-detection.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AA8CnD;;GAEG;AACH,MAAM,OAAO,yBAAyB;IAC5B,WAAW,CAAe;IAC1B,WAAW,CAAuB;IAE1C,YAAY,WAAyB;QACnC,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,WAAW,GAAG,IAAI,GAAG,EAAE,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,OAAO,CAAC,UAAqC,EAAE;QACnD,MAAM,EACJ,UAAU,GAAG,GAAG,EAChB,gBAAgB,GAAG,CAAC,EACpB,aAAa,GAAG,GAAG,EACpB,GAAG,OAAO,CAAC;QAEZ,uBAAuB;QACvB,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,WAAW,EAAE,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;QAEvE,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,OAAO,EAAE,WAAW,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;QACzD,CAAC;QAED,6CAA6C;QAC7C,IAAI,mBAAmB,GAAG,IAAI,GAAG,EAAgB,CAAC;QAClD,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC,mBAAmB,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QAE7D,sBAAsB;QACtB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAgB,CAAC;QACvC,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;YAC3B,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YAC1C,KAAK,MAAM,CAAC,EAAE,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;gBACnC,GAAG,IAAI,MAAM,CAAC;YAChB,CAAC;YACD,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QAC1B,CAAC;QAED,MAAM,SAAS,GAAkB,EAAE,CAAC;QACpC,IAAI,QAAQ,GAAG,IAAI,CAAC;QACpB,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,YAAY,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;QAC9B,IAAI,YAAY,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;QAClC,IAAI,aAAa,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;QACpC,IAAI,kBAAkB,GAAG,WAAW,CAAC;QAErC,OAAO,QAAQ,IAAI,SAAS,GAAG,aAAa,EAAE,CAAC;YAC7C,QAAQ,GAAG,KAAK,CAAC;YAEjB,wBAAwB;YACxB,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAClC,YAAY,EACZ,YAAY,EACZ,aAAa,EACb,mBAAmB,EACnB,kBAAkB,EAClB,UAAU,CACX,CAAC;YAEF,QAAQ,GAAG,WAAW,CAAC,QAAQ,CAAC;YAChC,mBAAmB,GAAG,WAAW,CAAC,UAAU,CAAC;YAE7C,mCAAmC;YACnC,MAAM,gBAAgB,GAAG,IAAI,CAAC,8BAA8B,CAC1D,YAAY,EACZ,YAAY,EACZ,mBAAmB,CACpB,CAAC;YAEF,SAAS,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;YAEjC,IAAI,QAAQ,EAAE,CAAC;gBACb,uBAAuB;gBACvB,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAC/B,YAAY,EACZ,YAAY,EACZ,mBAAmB,CACpB,CAAC;gBAEF,YAAY,GAAG,UAAU,CAAC,KAAK,CAAC;gBAChC,YAAY,GAAG,UAAU,CAAC,KAAK,CAAC;gBAChC,aAAa,GAAG,UAAU,CAAC,MAAM,CAAC;gBAElC,wCAAwC;gBACxC,mBAAmB,GAAG,IAAI,GAAG,EAAE,CAAC;gBAChC,YAAY,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC,mBAAmB,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;YACtE,CAAC;YAED,SAAS,EAAE,CAAC;QACd,CAAC;QAED,gCAAgC;QAChC,IAAI,cAAc,GAAG,CAAC,QAAQ,CAAC;QAC/B,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,QAAQ,GAAG,IAAI,CAAC,wBAAwB,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7D,IAAI,QAAQ,GAAG,cAAc,EAAE,CAAC;gBAC9B,cAAc,GAAG,QAAQ,CAAC;gBAC1B,SAAS,GAAG,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;QAED,kDAAkD;QAClD,MAAM,gBAAgB,GAAG,SAAS,CAAC,SAAS,CAAC;aAC1C,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,IAAI,gBAAgB,CAAC,CAAC;QAErD,iEAAiE;QACjE,MAAM,mBAAmB,GAAG,MAAM,IAAI,CAAC,iBAAiB,CAAC,gBAAgB,EAAE,KAAK,CAAC,CAAC;QAElF,4BAA4B;QAC5B,MAAM,UAAU,GAAG,IAAI,CAAC,mBAAmB,CACzC,KAAK,EACL,KAAK,EACL,mBAAmB,EACnB,WAAW,CACZ,CAAC;QAEF,MAAM,QAAQ,GAAG,mBAAmB,CAAC,MAAM,CACzC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CACtC,GAAG,KAAK,CAAC,MAAM,CAAC;QAEjB,oBAAoB;QACpB,KAAK,MAAM,SAAS,IAAI,mBAAmB,EAAE,CAAC;YAC5C,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;QAChD,CAAC;QAED,OAAO;YACL,WAAW,EAAE,mBAAmB;YAChC,UAAU;YACV,QAAQ;YACR,SAAS,EAAE;gBACT,MAAM,EAAE,SAAS;gBACjB,SAAS;aACV;SACF,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,gBAAgB,CACpB,UAAqC,EAAE;QAEvC,MAAM,EAAE,aAAa,GAAG,GAAG,EAAE,gBAAgB,GAAG,CAAC,EAAE,GAAG,OAAO,CAAC;QAE9D,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;QAE9D,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,OAAO,EAAE,WAAW,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;QACzD,CAAC;QAED,oBAAoB;QACpB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAgB,CAAC;QACvC,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QAEhD,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,OAAO,OAAO,IAAI,SAAS,GAAG,aAAa,EAAE,CAAC;YAC5C,OAAO,GAAG,KAAK,CAAC;YAEhB,iCAAiC;YACjC,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC;YAE5D,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;gBAC9B,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAC;gBACjD,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;gBAE1C,gDAAgD;gBAChD,KAAK,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;oBAC7C,MAAM,aAAa,GAAG,MAAM,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC;oBAC9C,cAAc,CAAC,GAAG,CAChB,aAAa,EACb,CAAC,cAAc,CAAC,GAAG,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAClD,CAAC;gBACJ,CAAC;gBAED,IAAI,cAAc,CAAC,IAAI,KAAK,CAAC;oBAAE,SAAS;gBAExC,yBAAyB;gBACzB,IAAI,SAAS,GAAG,CAAC,CAAC;gBAClB,IAAI,UAAU,GAAa,EAAE,CAAC;gBAE9B,KAAK,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,IAAI,cAAc,EAAE,CAAC;oBAC7C,IAAI,MAAM,GAAG,SAAS,EAAE,CAAC;wBACvB,SAAS,GAAG,MAAM,CAAC;wBACnB,UAAU,GAAG,CAAC,KAAK,CAAC,CAAC;oBACvB,CAAC;yBAAM,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;wBAChC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACzB,CAAC;gBACH,CAAC;gBAED,sBAAsB;gBACtB,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC;gBAC3E,MAAM,YAAY,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;gBAEzC,IAAI,QAAQ,KAAK,YAAY,EAAE,CAAC;oBAC9B,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;oBAC7B,OAAO,GAAG,IAAI,CAAC;gBACjB,CAAC;YACH,CAAC;YAED,SAAS,EAAE,CAAC;QACd,CAAC;QAED,gCAAgC;QAChC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC9C,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;YACrC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC5B,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YAC7B,CAAC;YACD,WAAW,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACvC,CAAC;QAED,MAAM,WAAW,GAAgB,EAAE,CAAC;QACpC,KAAK,MAAM,OAAO,IAAI,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC;YAC3C,IAAI,OAAO,CAAC,MAAM,IAAI,gBAAgB,EAAE,CAAC;gBACvC,WAAW,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,cAAc,CAAC,OAAO,EAAE,KAAK,EAAE,mBAAmB,CAAC,CAAC,CAAC;YACnF,CAAC;QACH,CAAC;QAED,MAAM,UAAU,GAAG,IAAI,CAAC,mBAAmB,CAAC,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,WAAW,CAAC,CAAC;QACpF,MAAM,QAAQ,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;QAE1F,oBAAoB;QACpB,KAAK,MAAM,SAAS,IAAI,WAAW,EAAE,CAAC;YACpC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;QAChD,CAAC;QAED,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC;IAC/C,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,EAAQ;QACnB,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAClC,CAAC;IAED;;OAEG;IACH,iBAAiB;QACf,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC;IAC/C,CAAC;IAED;;OAEG;IACH,sBAAsB,CAAC,QAAc;QACnC,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC;YAClD,IAAI,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACzC,OAAO,SAAS,CAAC;YACnB,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,cAAc;QAClB,MAAM,OAAO,GAAW,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,eAAe,EAAE,CAAC;QAErD,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;YACrB,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC;YAChE,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC;YAEhE,MAAM,WAAW,GAAG,IAAI,CAAC,sBAAsB,CAAC,EAAE,CAAC,CAAC;YACpD,IAAI,CAAC,WAAW;gBAAE,SAAS;YAE3B,MAAM,oBAAoB,GAAG,IAAI,GAAG,EAAQ,CAAC;YAE7C,KAAK,MAAM,OAAO,IAAI,CAAC,GAAG,QAAQ,EAAE,GAAG,QAAQ,CAAC,EAAE,CAAC;gBACjD,MAAM,OAAO,GAAG,OAAO,CAAC,QAAQ,KAAK,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC;gBAC9E,MAAM,cAAc,GAAG,IAAI,CAAC,sBAAsB,CAAC,OAAO,CAAC,CAAC;gBAE5D,IAAI,cAAc,IAAI,cAAc,CAAC,EAAE,KAAK,WAAW,CAAC,EAAE,EAAE,CAAC;oBAC3D,oBAAoB,CAAC,GAAG,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;gBAC9C,CAAC;YACH,CAAC;YAED,IAAI,oBAAoB,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;gBAClC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,4DAA4D;IAEpD,KAAK,CAAC,UAAU;QAMtB,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,eAAe,EAAE,CAAC;QACvD,MAAM,KAAK,GAAG,IAAI,GAAG,EAA+B,CAAC;QACrD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC1C,IAAI,WAAW,GAAG,CAAC,CAAC;QAEpB,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;YAC3B,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QACxB,CAAC;QAED,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;YAC3B,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC;YAEpE,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;gBAC/B,MAAM,OAAO,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAE5D,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;oBAC1B,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;oBACrC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;oBAC5D,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;oBAC5D,WAAW,IAAI,OAAO,CAAC,MAAM,CAAC;gBAChC,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC;IAChD,CAAC;IAEO,WAAW,CACjB,KAAa,EACb,KAAuC,EACvC,MAAyB,EACzB,UAA6B,EAC7B,WAAmB,EACnB,UAAkB;QAElB,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,CAAC;QAE1C,2BAA2B;QAC3B,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC;QAE5D,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC9B,MAAM,gBAAgB,GAAG,aAAa,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;YACpD,MAAM,UAAU,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAE3C,4DAA4D;YAC5D,MAAM,mBAAmB,GAAG,IAAI,GAAG,EAAkB,CAAC;YACtD,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YAE1C,KAAK,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;gBAC7C,MAAM,iBAAiB,GAAG,aAAa,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC;gBACzD,mBAAmB,CAAC,GAAG,CACrB,iBAAiB,EACjB,CAAC,mBAAmB,CAAC,GAAG,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAC3D,CAAC;YACJ,CAAC;YAED,IAAI,aAAa,GAAG,gBAAgB,CAAC;YACrC,IAAI,SAAS,GAAG,CAAC,CAAC;YAElB,KAAK,MAAM,CAAC,SAAS,EAAE,UAAU,CAAC,IAAI,mBAAmB,EAAE,CAAC;gBAC1D,IAAI,SAAS,KAAK,gBAAgB;oBAAE,SAAS;gBAE7C,6BAA6B;gBAC7B,IAAI,YAAY,GAAG,CAAC,CAAC;gBACrB,IAAI,WAAW,GAAG,CAAC,CAAC;gBAEpB,KAAK,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,aAAa,EAAE,CAAC;oBACxC,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBAClC,IAAI,IAAI,KAAK,gBAAgB;wBAAE,YAAY,IAAI,IAAI,CAAC;oBACpD,IAAI,IAAI,KAAK,SAAS;wBAAE,WAAW,IAAI,IAAI,CAAC;gBAC9C,CAAC;gBAED,4CAA4C;gBAC5C,MAAM,MAAM,GAAG,CAAC,UAAU,GAAG,CAAC,mBAAmB,CAAC,GAAG,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,WAAW;sBACxF,UAAU,GAAG,UAAU,GAAG,CAAC,WAAW,GAAG,YAAY,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,GAAG,WAAW,GAAG,WAAW,CAAC,CAAC;gBAE1G,IAAI,MAAM,GAAG,SAAS,EAAE,CAAC;oBACvB,SAAS,GAAG,MAAM,CAAC;oBACnB,aAAa,GAAG,SAAS,CAAC;gBAC5B,CAAC;YACH,CAAC;YAED,IAAI,aAAa,KAAK,gBAAgB,EAAE,CAAC;gBACvC,aAAa,CAAC,GAAG,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;gBACzC,QAAQ,GAAG,IAAI,CAAC;YAClB,CAAC;QACH,CAAC;QAED,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,aAAa,EAAE,CAAC;IACjD,CAAC;IAEO,SAAS,CACf,KAAa,EACb,KAAuC,EACvC,UAA6B;QAM7B,iCAAiC;QACjC,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAgB,CAAC;QACjD,MAAM,UAAU,GAAW,EAAE,CAAC;QAE9B,KAAK,MAAM,CAAC,EAAE,SAAS,CAAC,IAAI,UAAU,EAAE,CAAC;YACvC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;gBACrC,MAAM,OAAO,GAAG,YAAY,EAAE,CAAC;gBAC/B,gBAAgB,CAAC,GAAG,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;gBACzC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;QAED,oBAAoB;QACpB,MAAM,UAAU,GAAG,IAAI,GAAG,EAA+B,CAAC;QAC1D,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE/C,KAAK,MAAM,OAAO,IAAI,UAAU,EAAE,CAAC;YACjC,UAAU,CAAC,GAAG,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QAC9B,CAAC;QAED,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;YAC3B,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;YACzC,MAAM,SAAS,GAAG,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;YAClD,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YAE1C,KAAK,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;gBAC7C,MAAM,YAAY,GAAG,UAAU,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC;gBACjD,MAAM,aAAa,GAAG,gBAAgB,CAAC,GAAG,CAAC,YAAY,CAAE,CAAC;gBAE1D,IAAI,SAAS,KAAK,aAAa,EAAE,CAAC;oBAChC,MAAM,OAAO,GAAG,CAAC,SAAS,EAAE,aAAa,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBAC5D,YAAY,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;gBACvE,CAAC;YACH,CAAC;QACH,CAAC;QAED,uBAAuB;QACvB,KAAK,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;YAC7C,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAClC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;YACrC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;QACvC,CAAC;QAED,oBAAoB;QACpB,MAAM,WAAW,GAAG,IAAI,GAAG,EAAgB,CAAC;QAC5C,KAAK,MAAM,OAAO,IAAI,UAAU,EAAE,CAAC;YACjC,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,KAAK,MAAM,CAAC,EAAE,MAAM,CAAC,IAAI,UAAU,CAAC,GAAG,CAAC,OAAO,CAAE,EAAE,CAAC;gBAClD,GAAG,IAAI,MAAM,CAAC;YAChB,CAAC;YACD,WAAW,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;QAChC,CAAC;QAED,OAAO;YACL,KAAK,EAAE,UAAU;YACjB,KAAK,EAAE,UAAU;YACjB,MAAM,EAAE,WAAW;SACpB,CAAC;IACJ,CAAC;IAEO,8BAA8B,CACpC,KAAa,EACb,KAAuC,EACvC,UAA6B;QAE7B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QAEzC,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;YACrC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACtB,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YACvB,CAAC;YACD,MAAM,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACjC,CAAC;QAED,MAAM,WAAW,GAAgB,EAAE,CAAC;QAEpC,KAAK,MAAM,CAAC,EAAE,OAAO,CAAC,IAAI,MAAM,EAAE,CAAC;YACjC,oBAAoB;YACpB,IAAI,aAAa,GAAG,CAAC,CAAC;YACtB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,KAAK,MAAM,CAAC,UAAU,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;oBACnD,IAAI,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;wBACjC,aAAa,EAAE,CAAC;oBAClB,CAAC;gBACH,CAAC;YACH,CAAC;YACD,aAAa,IAAI,CAAC,CAAC,CAAE,0BAA0B;YAE/C,MAAM,QAAQ,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAC7D,MAAM,OAAO,GAAG,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YAE5D,WAAW,CAAC,IAAI,CAAC;gBACf,EAAE,EAAE,YAAY,EAAE;gBAClB,OAAO;gBACP,UAAU,EAAE,CAAC,EAAG,2BAA2B;gBAC3C,OAAO;gBACP,WAAW,EAAE,EAAE;gBACf,QAAQ,EAAE;oBACR,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;oBACnC,SAAS,EAAE,SAAS;iBACrB;aACF,CAAC,CAAC;QACL,CAAC;QAED,OAAO,WAAW,CAAC;IACrB,CAAC;IAEO,KAAK,CAAC,cAAc,CAC1B,OAAe,EACf,KAAuC,EACvC,SAAiB;QAEjB,oBAAoB;QACpB,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,KAAK,MAAM,CAAC,UAAU,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;gBACnD,IAAI,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;oBACjC,aAAa,EAAE,CAAC;gBAClB,CAAC;YACH,CAAC;QACH,CAAC;QACD,aAAa,IAAI,CAAC,CAAC;QAEnB,MAAM,QAAQ,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC7D,MAAM,OAAO,GAAG,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAE5D,oBAAoB;QACpB,MAAM,WAAW,GAAW,EAAE,CAAC;QAC/B,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,KAAK,MAAM,CAAC,UAAU,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;gBACnD,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;oBAClC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBACzB,MAAM;gBACR,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO;YACL,EAAE,EAAE,YAAY,EAAE;YAClB,OAAO;YACP,UAAU,EAAE,CAAC;YACb,OAAO;YACP,WAAW;YACX,QAAQ,EAAE;gBACR,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;gBACnC,SAAS;aACV;SACF,CAAC;IACJ,CAAC;IAEO,wBAAwB,CAAC,WAAwB;QACvD,yCAAyC;QACzC,OAAO,WAAW,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;YAC1E,WAAW,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAC9D,CAAC;IAEO,mBAAmB,CACzB,KAAa,EACb,KAAuC,EACvC,WAAwB,EACxB,WAAmB;QAEnB,IAAI,WAAW,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAEhC,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,MAAM,CAAC,GAAG,WAAW,CAAC;QAEtB,iCAAiC;QACjC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAgB,CAAC;QACvC,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;YAC3B,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,KAAK,MAAM,CAAC,EAAE,MAAM,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;gBACjD,GAAG,IAAI,MAAM,CAAC;YAChB,CAAC;YACD,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QAC1B,CAAC;QAED,KAAK,MAAM,SAAS,IAAI,WAAW,EAAE,CAAC;YACpC,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,OAAO,EAAE,CAAC;gBAClC,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,OAAO,EAAE,CAAC;oBAClC,IAAI,CAAC,KAAK,CAAC;wBAAE,SAAS;oBAEtB,uBAAuB;oBACvB,IAAI,GAAG,GAAG,CAAC,CAAC;oBACZ,KAAK,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;wBACtD,IAAI,UAAU,KAAK,CAAC,EAAE,CAAC;4BACrB,GAAG,GAAG,MAAM,CAAC;4BACb,MAAM;wBACR,CAAC;oBACH,CAAC;oBAED,MAAM,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;oBAC9B,MAAM,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;oBAE9B,CAAC,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACjC,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACrB,CAAC;IAEO,KAAK,CAAC,iBAAiB,CAC7B,WAAwB,EACxB,aAAqB;QAErB,8DAA8D;QAC9D,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;QAChE,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,CAAC;QAE3C,MAAM,cAAc,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAEvE,IAAI,CAAC,cAAc,EAAE,CAAC;YACpB,OAAO,WAAW,CAAC;QACrB,CAAC;QAED,yEAAyE;QACzE,oCAAoC;QACpC,OAAO,WAAW,CAAC;IACrB,CAAC;CACF;AAED;;GAEG;AACH,MAAM,UAAU,+BAA+B,CAC7C,WAAyB;IAEzB,OAAO,IAAI,yBAAyB,CAAC,WAAW,CAAC,CAAC;AACpD,CAAC"}

package/dist/extensions/clustering/index.d.ts

@@ -1,114 +0,0 @@
-/**
- * Clustering Module - Automatic neuron grouping and topic modeling
- * @module extensions/clustering
- */
-import type { UUID, INeuronStore } from '../../types/index.js';
-/**
- * Cluster definition
- */
-export interface Cluster {
-    id: UUID;
-    name?: string;
-    centroid: Float32Array;
-    members: UUID[];
-    avgSimilarity: number;
-    metadata: {
-        createdAt: string;
-        updatedAt: string;
-        algorithmUsed: string;
-    };
-}
-/**
- * Clustering result
- */
-export interface ClusteringResult {
-    clusters: Cluster[];
-    noise?: UUID[];
-    iterations?: number;
-    silhouetteScore?: number;
-}
-/**
- * K-means options
- */
-export interface KMeansOptions {
-    k: number;
-    maxIterations?: number;
-    tolerance?: number;
-    initMethod?: 'random' | 'kmeans++';
-}
-/**
- * DBSCAN options
- */
-export interface DBSCANOptions {
-    eps: number;
-    minPts: number;
-}
-/**
- * Community detection options
- */
-export interface CommunityOptions {
-    resolution?: number;
-    minCommunitySize?: number;
-}
-/**
- * Clustering Service
- */
-export declare class ClusteringService {
-    private neuronStore;
-    private clusters;
-    constructor(neuronStore: INeuronStore);
-    /**
-     * K-means clustering
-     */
-    kmeans(options: KMeansOptions): Promise<ClusteringResult>;
-    /**
-     * DBSCAN clustering
-     */
-    dbscan(options: DBSCANOptions): Promise<ClusteringResult>;
-    /**
-     * Hierarchical clustering (Agglomerative)
-     */
-    hierarchical(targetClusters: number, linkage?: 'single' | 'complete' | 'average'): Promise<ClusteringResult>;
-    /**
-     * Get cluster by ID
-     */
-    getCluster(id: UUID): Cluster | undefined;
-    /**
-     * Get all clusters
-     */
-    getAllClusters(): Cluster[];
-    /**
-     * Find cluster for a neuron
-     */
-    findClusterForNeuron(neuronId: UUID): Cluster | undefined;
-    /**
-     * Assign new neuron to nearest cluster
-     */
-    assignToCluster(neuronId: UUID): Promise<Cluster | null>;
-    /**
-     * Get cluster statistics
-     */
-    getStats(): {
-        totalClusters: number;
-        avgClusterSize: number;
-        largestCluster: number;
-        smallestCluster: number;
-    };
-    private getAllNeurons;
-    private getNeuronsByIds;
-    private initRandom;
-    private initKMeansPlusPlus;
-    private findNearestCentroid;
-    private updateCentroids;
-    private buildClusters;
-    private calculateAvgSimilarity;
-    private calculateSilhouette;
-    private regionQuery;
-    private expandCluster;
-    private calculateLinkage;
-}
-/**
- * Create a ClusteringService instance
- */
-export declare function createClusteringService(neuronStore: INeuronStore): ClusteringService;
-//# sourceMappingURL=index.d.ts.map

package/dist/extensions/clustering/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/extensions/clustering/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EACV,IAAI,EAGJ,YAAY,EACb,MAAM,sBAAsB,CAAC;AAI9B;;GAEG;AACH,MAAM,WAAW,OAAO;IACtB,EAAE,EAAE,IAAI,CAAC;IACT,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,YAAY,CAAC;IACvB,OAAO,EAAE,IAAI,EAAE,CAAC;IAChB,aAAa,EAAE,MAAM,CAAC;IACtB,QAAQ,EAAE;QACR,SAAS,EAAE,MAAM,CAAC;QAClB,SAAS,EAAE,MAAM,CAAC;QAClB,aAAa,EAAE,MAAM,CAAC;KACvB,CAAC;CACH;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,EAAE,OAAO,EAAE,CAAC;IACpB,KAAK,CAAC,EAAE,IAAI,EAAE,CAAC;IACf,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,eAAe,CAAC,EAAE,MAAM,CAAC;CAC1B;AAED;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B,CAAC,EAAE,MAAM,CAAC;IACV,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,UAAU,CAAC,EAAE,QAAQ,GAAG,UAAU,CAAC;CACpC;AAED;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B,GAAG,EAAE,MAAM,CAAC;IACZ,MAAM,EAAE,MAAM,CAAC;CAChB;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,gBAAgB,CAAC,EAAE,MAAM,CAAC;CAC3B;AAED;;GAEG;AACH,qBAAa,iBAAiB;IAC5B,OAAO,CAAC,WAAW,CAAe;IAClC,OAAO,CAAC,QAAQ,CAAqB;gBAEzB,WAAW,EAAE,YAAY;IAKrC;;OAEG;IACG,MAAM,CAAC,OAAO,EAAE,aAAa,GAAG,OAAO,CAAC,gBAAgB,CAAC;IAwE/D;;OAEG;IACG,MAAM,CAAC,OAAO,EAAE,aAAa,GAAG,OAAO,CAAC,gBAAgB,CAAC;IAmF/D;;OAEG;IACG,YAAY,CAChB,cAAc,EAAE,MAAM,EACtB,OAAO,GAAE,QAAQ,GAAG,UAAU,GAAG,SAAqB,GACrD,OAAO,CAAC,gBAAgB,CAAC;IAgF5B;;OAEG;IACH,UAAU,CAAC,EAAE,EAAE,IAAI,GAAG,OAAO,GAAG,SAAS;IAIzC;;OAEG;IACH,cAAc,IAAI,OAAO,EAAE;IAI3B;;OAEG;IACH,oBAAoB,CAAC,QAAQ,EAAE,IAAI,GAAG,OAAO,GAAG,SAAS;IASzD;;OAEG;IACG,eAAe,CAAC,QAAQ,EAAE,IAAI,GAAG,OAAO,CAAC,OAAO,GAAG,IAAI,CAAC;IA4B9D;;OAEG;IACH,QAAQ,IAAI;QACV,aAAa,EAAE,MAAM,CAAC;QACtB,cAAc,EAAE,MAAM,CAAC;QACvB,cAAc,EAAE,MAAM,CAAC;QACvB,eAAe,EAAE,MAAM,CAAC;KACzB;YAgBa,aAAa;YAYb,eAAe;IAS7B,OAAO,CAAC,UAAU;IASlB,OAAO,CAAC,kBAAkB;IAkC1B,OAAO,CAAC,mBAAmB;IAe3B,OAAO,CAAC,eAAe;IAsBvB,OAAO,CAAC,aAAa;IA+BrB,OAAO,CAAC,sBAAsB;IAgB9B,OAAO,CAAC,mBAAmB;IA0C3B,OAAO,CAAC,WAAW;IAUnB,OAAO,CAAC,aAAa;IA0CrB,OAAO,CAAC,gBAAgB;CAuBzB;AAED;;GAEG;AACH,wBAAgB,uBAAuB,CAAC,WAAW,EAAE,YAAY,GAAG,iBAAiB,CAEpF"}