@grafloria/element 0.3.19 → 0.3.21

package/src/libs/engine/src/layout/community-layout-adapter.js

@@ -1,486 +0,0 @@
-"use strict";
-/**
- * Community Detection Layout Adapter
- *
- * Detects communities/clusters in graph and positions them separately.
- * Reveals modular structure and logical groupings in networks.
- *
- * Best for:
- * - Microservices architecture
- * - Organization charts
- * - Social network analysis
- * - Module detection
- *
- * Algorithm: Louvain community detection + force-directed sub-layouts
- *
- * @module layout/community-layout-adapter
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.CommunityLayoutAdapter = void 0;
-const tslib_1 = require("tslib");
-const rng_1 = require("./rng");
-const layout_quality_metrics_1 = require("./layout-quality-metrics");
-const force_layout_adapter_1 = require("./force-layout-adapter");
-/**
- * Community Detection Layout Adapter
- *
- * Uses Louvain algorithm to detect communities and arranges them.
- */
-class CommunityLayoutAdapter {
-    constructor() {
-        this.name = 'community';
-        /**
-         * Card 0: the run's seeded generator. Established once per apply() so every
-         * helper below draws from the SAME reproducible stream — the seed alone is not
-         * enough if each helper mints its own generator.
-         */
-        this.rng = (0, rng_1.createLayoutRng)();
-        this.forceAdapter = new force_layout_adapter_1.ForceLayoutAdapter();
-    }
-    /**
-     * Apply community detection layout
-     */
-    apply(nodes_1, links_1) {
-        return tslib_1.__awaiter(this, arguments, void 0, function* (nodes, links, options = {}) {
-            var _a, _b, _c, _d, _e, _f, _g;
-            this.rng = (0, rng_1.createLayoutRng)(options === null || options === void 0 ? void 0 : options.seed);
-            const startTime = performance.now();
-            // Merge with defaults
-            const opts = Object.assign({ algorithm: (_a = options.algorithm) !== null && _a !== void 0 ? _a : 'louvain', resolution: (_b = options.resolution) !== null && _b !== void 0 ? _b : 1.0, separateCommunities: (_c = options.separateCommunities) !== null && _c !== void 0 ? _c : true, communitySpacing: (_d = options.communitySpacing) !== null && _d !== void 0 ? _d : 200, communityLayout: (_e = options.communityLayout) !== null && _e !== void 0 ? _e : 'circular', innerLayout: (_f = options.innerLayout) !== null && _f !== void 0 ? _f : 'force', forceOptions: (_g = options.forceOptions) !== null && _g !== void 0 ? _g : {
-                    iterations: 100,
-                    repulsion: 50,
-                    attraction: 0.1,
-                } }, options);
-            if (nodes.length === 0) {
-                return {
-                    nodePositions: new Map(),
-                    bounds: { x: 0, y: 0, width: 0, height: 0 },
-                    metadata: {
-                        algorithm: 'community',
-                        executionTime: performance.now() - startTime,
-                        nodeCount: 0,
-                        linkCount: 0,
-                    },
-                };
-            }
-            // Build node index map
-            const nodeIndexMap = new Map(nodes.map((node, i) => [node.id, i]));
-            // Detect communities
-            const communityAssignments = opts.algorithm === 'louvain'
-                ? this.louvainCommunityDetection(nodes, links, opts.resolution)
-                : this.labelPropagation(nodes, links);
-            // Group nodes by community
-            const communities = this.buildCommunities(nodes, communityAssignments);
-            console.log(`Detected ${communities.length} communities`);
-            // Layout each community internally
-            const communityLayouts = yield Promise.all(communities.map(community => this.layoutCommunity(community, nodes, links, opts)));
-            // Position communities relative to each other
-            if (opts.separateCommunities) {
-                this.positionCommunities(communityLayouts, opts);
-            }
-            // Build final positions
-            const nodePositions = new Map();
-            for (const community of communityLayouts) {
-                community.nodeIds.forEach(nodeId => {
-                    const node = nodes.find(n => n.id === nodeId);
-                    if (node) {
-                        nodePositions.set(nodeId, {
-                            x: node.position.x + community.x,
-                            y: node.position.y + community.y,
-                        });
-                    }
-                });
-            }
-            // Apply positions to nodes
-            nodes.forEach(node => {
-                const position = nodePositions.get(node.id);
-                if (position) {
-                    node.setPosition(position.x, position.y);
-                }
-            });
-            // Calculate bounds
-            const bounds = this.calculateBounds(nodePositions);
-            const endTime = performance.now();
-            // Calculate quality metrics if requested
-            let quality = undefined;
-            if (options.calculateQuality) {
-                quality = layout_quality_metrics_1.LayoutQualityMetrics.assess(nodes, links, {
-                    includeSuggestions: true,
-                    canvasDimensions: options.canvasDimensions,
-                });
-            }
-            return {
-                nodePositions,
-                bounds,
-                metadata: {
-                    algorithm: 'community',
-                    communityCount: communities.length,
-                    detectionAlgorithm: opts.algorithm,
-                    executionTime: endTime - startTime,
-                    nodeCount: nodes.length,
-                    linkCount: links.length,
-                },
-                quality,
-            };
-        });
-    }
-    /**
-     * Louvain community detection algorithm
-     */
-    louvainCommunityDetection(nodes, links, resolution) {
-        const n = nodes.length;
-        const nodeIndexMap = new Map(nodes.map((node, i) => [node.id, i]));
-        // Initialize each node in its own community
-        const communities = new Map(nodes.map((node, i) => [node.id, i]));
-        // Build adjacency list
-        const adjacency = new Map();
-        nodes.forEach(node => adjacency.set(node.id, new Set()));
-        links.forEach(link => {
-            var _a, _b;
-            if (link.sourceNodeId && link.targetNodeId) {
-                (_a = adjacency.get(link.sourceNodeId)) === null || _a === void 0 ? void 0 : _a.add(link.targetNodeId);
-                (_b = adjacency.get(link.targetNodeId)) === null || _b === void 0 ? void 0 : _b.add(link.sourceNodeId);
-            }
-        });
-        // Calculate degrees
-        const degrees = new Map(nodes.map(node => [node.id, adjacency.get(node.id).size]));
-        const totalEdges = links.length;
-        let improved = true;
-        let iteration = 0;
-        // Phase 1: Move nodes to maximize modularity
-        while (improved && iteration < 100) {
-            improved = false;
-            for (const node of nodes) {
-                const nodeId = node.id;
-                const currentCommunity = communities.get(nodeId);
-                // Calculate modularity gains for moving to neighbor communities
-                const neighborCommunities = new Set();
-                adjacency.get(nodeId).forEach(neighborId => {
-                    neighborCommunities.add(communities.get(neighborId));
-                });
-                let bestCommunity = currentCommunity;
-                let bestGain = 0;
-                for (const targetCommunity of neighborCommunities) {
-                    if (targetCommunity === currentCommunity)
-                        continue;
-                    const gain = this.modularityGain(nodeId, currentCommunity, targetCommunity, communities, adjacency, degrees, totalEdges, resolution);
-                    if (gain > bestGain) {
-                        bestGain = gain;
-                        bestCommunity = targetCommunity;
-                    }
-                }
-                if (bestCommunity !== currentCommunity) {
-                    communities.set(nodeId, bestCommunity);
-                    improved = true;
-                }
-            }
-            iteration++;
-        }
-        // Renumber communities sequentially
-        const communityIds = new Set(communities.values());
-        const communityMap = new Map(Array.from(communityIds).map((id, i) => [id, i]));
-        const result = new Map();
-        communities.forEach((community, nodeId) => {
-            result.set(nodeId, communityMap.get(community));
-        });
-        return result;
-    }
-    /**
-     * Calculate modularity gain
-     */
-    modularityGain(nodeId, fromCommunity, toCommunity, communities, adjacency, degrees, totalEdges, resolution) {
-        let deltaQ = 0;
-        const nodeDegree = degrees.get(nodeId) || 0;
-        // Edges to nodes in target community
-        let edgesToCommunity = 0;
-        adjacency.get(nodeId).forEach(neighborId => {
-            if (communities.get(neighborId) === toCommunity) {
-                edgesToCommunity++;
-            }
-        });
-        // Edges from nodes in target community
-        let edgesFromCommunity = 0;
-        adjacency.get(nodeId).forEach(neighborId => {
-            if (communities.get(neighborId) === fromCommunity) {
-                edgesFromCommunity++;
-            }
-        });
-        deltaQ =
-            (edgesToCommunity - edgesFromCommunity) / totalEdges -
-                resolution *
-                    nodeDegree *
-                    (this.communityDegree(toCommunity, communities, degrees) -
-                        this.communityDegree(fromCommunity, communities, degrees)) /
-                    (2 * totalEdges * totalEdges);
-        return deltaQ;
-    }
-    /**
-     * Calculate total degree of nodes in community
-     */
-    communityDegree(community, communities, degrees) {
-        let total = 0;
-        communities.forEach((comm, nodeId) => {
-            if (comm === community) {
-                total += degrees.get(nodeId) || 0;
-            }
-        });
-        return total;
-    }
-    /**
-     * Label propagation algorithm (simpler alternative)
-     */
-    labelPropagation(nodes, links) {
-        // Initialize labels
-        const labels = new Map(nodes.map((node, i) => [node.id, i]));
-        // Build adjacency list
-        const adjacency = new Map();
-        nodes.forEach(node => adjacency.set(node.id, new Set()));
-        links.forEach(link => {
-            var _a, _b;
-            if (link.sourceNodeId && link.targetNodeId) {
-                (_a = adjacency.get(link.sourceNodeId)) === null || _a === void 0 ? void 0 : _a.add(link.targetNodeId);
-                (_b = adjacency.get(link.targetNodeId)) === null || _b === void 0 ? void 0 : _b.add(link.sourceNodeId);
-            }
-        });
-        // Propagate labels
-        let changed = true;
-        let iteration = 0;
-        while (changed && iteration < 100) {
-            changed = false;
-            // Randomize order
-            // Card 0: a SEEDED shuffle. `sort(() => Math.random() - 0.5)` was doubly
-            // wrong — non-deterministic AND not even a uniform shuffle (a comparator
-            // that answers inconsistently violates the sort contract, so the result is
-            // engine-dependent). Fisher-Yates against the seeded generator instead.
-            const nodeOrder = shuffle([...nodes], this.rng);
-            for (const node of nodeOrder) {
-                // Count neighbor labels
-                const labelCounts = new Map();
-                adjacency.get(node.id).forEach(neighborId => {
-                    const label = labels.get(neighborId);
-                    labelCounts.set(label, (labelCounts.get(label) || 0) + 1);
-                });
-                if (labelCounts.size > 0) {
-                    // Find most common label
-                    let maxCount = 0;
-                    let maxLabel = labels.get(node.id);
-                    labelCounts.forEach((count, label) => {
-                        if (count > maxCount) {
-                            maxCount = count;
-                            maxLabel = label;
-                        }
-                    });
-                    if (maxLabel !== labels.get(node.id)) {
-                        labels.set(node.id, maxLabel);
-                        changed = true;
-                    }
-                }
-            }
-            iteration++;
-        }
-        // Renumber communities
-        const communityIds = new Set(labels.values());
-        const communityMap = new Map(Array.from(communityIds).map((id, i) => [id, i]));
-        const result = new Map();
-        labels.forEach((label, nodeId) => {
-            result.set(nodeId, communityMap.get(label));
-        });
-        return result;
-    }
-    /**
-     * Build community objects
-     */
-    buildCommunities(nodes, assignments) {
-        const communityMap = new Map();
-        assignments.forEach((community, nodeId) => {
-            if (!communityMap.has(community)) {
-                communityMap.set(community, []);
-            }
-            communityMap.get(community).push(nodeId);
-        });
-        const communities = [];
-        communityMap.forEach((nodeIds, id) => {
-            communities.push({
-                id,
-                nodeIds,
-                x: 0,
-                y: 0,
-                width: 0,
-                height: 0,
-            });
-        });
-        return communities;
-    }
-    /**
-     * Layout nodes within a community
-     */
-    layoutCommunity(community, allNodes, allLinks, options) {
-        return tslib_1.__awaiter(this, void 0, void 0, function* () {
-            var _a, _b;
-            // Get nodes and links for this community
-            const communityNodes = allNodes.filter(n => community.nodeIds.includes(n.id));
-            const communityLinks = allLinks.filter(link => link.sourceNodeId &&
-                link.targetNodeId &&
-                community.nodeIds.includes(link.sourceNodeId) &&
-                community.nodeIds.includes(link.targetNodeId));
-            if (communityNodes.length === 0) {
-                return community;
-            }
-            // Apply inner layout
-            if (options.innerLayout === 'force') {
-                yield this.forceAdapter.apply(communityNodes, communityLinks, Object.assign(Object.assign({}, options.forceOptions), { iterations: ((_a = options.forceOptions) === null || _a === void 0 ? void 0 : _a.iterations) || 100, repulsion: ((_b = options.forceOptions) === null || _b === void 0 ? void 0 : _b.repulsion) || 50, randomize: false }));
-            }
-            else {
-                // Circular layout
-                this.circularLayout(communityNodes);
-            }
-            // Calculate bounds
-            let minX = Infinity, minY = Infinity;
-            let maxX = -Infinity, maxY = -Infinity;
-            communityNodes.forEach(node => {
-                minX = Math.min(minX, node.position.x);
-                minY = Math.min(minY, node.position.y);
-                maxX = Math.max(maxX, node.position.x);
-                maxY = Math.max(maxY, node.position.y);
-            });
-            community.width = maxX - minX + 100;
-            community.height = maxY - minY + 100;
-            // Center nodes at origin
-            const cx = (minX + maxX) / 2;
-            const cy = (minY + maxY) / 2;
-            communityNodes.forEach(node => {
-                node.setPosition(node.position.x - cx, node.position.y - cy);
-            });
-            return community;
-        });
-    }
-    /**
-     * Simple circular layout
-     */
-    circularLayout(nodes) {
-        const n = nodes.length;
-        const radius = Math.max(100, n * 20);
-        nodes.forEach((node, i) => {
-            const angle = (i / n) * 2 * Math.PI;
-            node.setPosition(Math.cos(angle) * radius, Math.sin(angle) * radius);
-        });
-    }
-    /**
-     * Position communities relative to each other
-     */
-    positionCommunities(communities, options) {
-        if (communities.length === 0)
-            return;
-        const spacing = options.communitySpacing;
-        if (options.communityLayout === 'circular') {
-            // Arrange communities in a circle
-            const radius = Math.max(300, communities.length * 150);
-            communities.forEach((community, i) => {
-                const angle = (i / communities.length) * 2 * Math.PI;
-                community.x = Math.cos(angle) * radius;
-                community.y = Math.sin(angle) * radius;
-            });
-        }
-        else if (options.communityLayout === 'grid') {
-            // Arrange in grid
-            const cols = Math.ceil(Math.sqrt(communities.length));
-            let x = 0, y = 0;
-            let maxHeight = 0;
-            communities.forEach((community, i) => {
-                community.x = x;
-                community.y = y;
-                maxHeight = Math.max(maxHeight, community.height);
-                x += community.width + spacing;
-                if ((i + 1) % cols === 0) {
-                    x = 0;
-                    y += maxHeight + spacing;
-                    maxHeight = 0;
-                }
-            });
-        }
-        else {
-            // Force-directed layout of communities
-            // Simplified: just space them out
-            let x = 0;
-            communities.forEach(community => {
-                community.x = x;
-                community.y = 0;
-                x += community.width + spacing;
-            });
-        }
-    }
-    /**
-     * Calculate bounding box
-     */
-    calculateBounds(positions) {
-        if (positions.size === 0) {
-            return { x: 0, y: 0, width: 0, height: 0 };
-        }
-        let minX = Infinity, minY = Infinity;
-        let maxX = -Infinity, maxY = -Infinity;
-        positions.forEach(pos => {
-            minX = Math.min(minX, pos.x);
-            minY = Math.min(minY, pos.y);
-            maxX = Math.max(maxX, pos.x);
-            maxY = Math.max(maxY, pos.y);
-        });
-        const padding = 50;
-        minX -= padding;
-        minY -= padding;
-        maxX += padding;
-        maxY += padding;
-        return {
-            x: minX,
-            y: minY,
-            width: maxX - minX,
-            height: maxY - minY,
-        };
-    }
-    /**
-     * Apply incremental layout (Phase 1 compatibility)
-     */
-    applyIncremental(nodes, links, incrementalOptions, layoutOptions) {
-        return tslib_1.__awaiter(this, void 0, void 0, function* () {
-            // Community detection layout doesn't support true incremental layout
-            // Just apply full layout
-            const result = yield this.apply(nodes, links, layoutOptions);
-            return Object.assign(Object.assign({}, result), { incremental: {
-                    newNodeIds: incrementalOptions.newNodeIds || [],
-                    pinnedNodeIds: [],
-                    movedNodeIds: nodes.map(n => n.id),
-                    strategy: 'full-relayout',
-                    constraintsApplied: 0,
-                } });
-        });
-    }
-    /**
-     * Validate options
-     */
-    validateOptions(options) {
-        if (options.resolution !== undefined && options.resolution <= 0) {
-            return false;
-        }
-        if (options.communitySpacing !== undefined && options.communitySpacing < 0) {
-            return false;
-        }
-        return true;
-    }
-}
-exports.CommunityLayoutAdapter = CommunityLayoutAdapter;
-/**
- * Fisher-Yates against a seeded generator.
- *
- * The code this replaces used `array.sort(() => Math.random() - 0.5)`, which is a
- * classic: it is not merely non-deterministic, it is not a uniform shuffle at all
- * (an inconsistent comparator breaks the sort contract, so the distribution is
- * whatever the engine's sort happens to do). Label propagation's convergence
- * depends on visit order, so the community layout was biased AND irreproducible.
- */
-function shuffle(items, rng) {
-    for (let i = items.length - 1; i > 0; i--) {
-        const j = Math.floor(rng.next() * (i + 1));
-        [items[i], items[j]] = [items[j], items[i]];
-    }
-    return items;
-}
-//# sourceMappingURL=community-layout-adapter.js.map

package/src/libs/engine/src/layout/community-layout-adapter.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"community-layout-adapter.js","sourceRoot":"","sources":["../../../../../../engine/src/layout/community-layout-adapter.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;GAeG;;;;AAGH,+BAAwD;AAGxD,qEAAgE;AAChE,iEAA4D;AA4C5D;;;;GAIG;AACH,MAAa,sBAAsB;IAAnC;QACW,SAAI,GAAG,WAAW,CAAC;QAE5B;;;;WAIG;QACK,QAAG,GAAc,IAAA,qBAAe,GAAE,CAAC;QACnC,iBAAY,GAAG,IAAI,yCAAkB,EAAE,CAAC;IAkkBlD,CAAC;IAhkBC;;OAEG;IACG,KAAK;qEACT,KAAkB,EAClB,KAAkB,EAClB,UAA2C,EAAE;;YAE7C,IAAI,CAAC,GAAG,GAAG,IAAA,qBAAe,EAAE,OAAyC,aAAzC,OAAO,uBAAP,OAAO,CAAoC,IAAI,CAAC,CAAC;YAC7E,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;YAEpC,sBAAsB;YACtB,MAAM,IAAI,mBACR,SAAS,EAAE,MAAA,OAAO,CAAC,SAAS,mCAAI,SAAS,EACzC,UAAU,EAAE,MAAA,OAAO,CAAC,UAAU,mCAAI,GAAG,EACrC,mBAAmB,EAAE,MAAA,OAAO,CAAC,mBAAmB,mCAAI,IAAI,EACxD,gBAAgB,EAAE,MAAA,OAAO,CAAC,gBAAgB,mCAAI,GAAG,EACjD,eAAe,EAAE,MAAA,OAAO,CAAC,eAAe,mCAAI,UAAU,EACtD,WAAW,EAAE,MAAA,OAAO,CAAC,WAAW,mCAAI,OAAO,EAC3C,YAAY,EAAE,MAAA,OAAO,CAAC,YAAY,mCAAI;oBACpC,UAAU,EAAE,GAAG;oBACf,SAAS,EAAE,EAAE;oBACb,UAAU,EAAE,GAAG;iBAChB,IACE,OAAO,CACX,CAAC;YAEF,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACvB,OAAO;oBACL,aAAa,EAAE,IAAI,GAAG,EAAE;oBACxB,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE;oBAC3C,QAAQ,EAAE;wBACR,SAAS,EAAE,WAAW;wBACtB,aAAa,EAAE,WAAW,CAAC,GAAG,EAAE,GAAG,SAAS;wBAC5C,SAAS,EAAE,CAAC;wBACZ,SAAS,EAAE,CAAC;qBACb;iBACF,CAAC;YACJ,CAAC;YAED,uBAAuB;YACvB,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAEnE,qBAAqB;YACrB,MAAM,oBAAoB,GACxB,IAAI,CAAC,SAAS,KAAK,SAAS;gBAC1B,CAAC,CAAC,IAAI,CAAC,yBAAyB,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,UAAW,CAAC;gBAChE,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAE1C,2BAA2B;YAC3B,MAAM,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,oBAAoB,CAAC,CAAC;YAEvE,OAAO,CAAC,GAAG,CAAC,YAAY,WAAW,CAAC,MAAM,cAAc,CAAC,CAAC;YAE1D,mCAAmC;YACnC,MAAM,gBAAgB,GAAG,MAAM,OAAO,CAAC,GAAG,CACxC,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAClF,CAAC;YAEF,8CAA8C;YAC9C,IAAI,IAAI,CAAC,mBAAmB,EAAE,CAAC;gBAC7B,IAAI,CAAC,mBAAmB,CAAC,gBAAgB,EAAE,IAAI,CAAC,CAAC;YACnD,CAAC;YAED,wBAAwB;YACxB,MAAM,aAAa,GAAG,IAAI,GAAG,EAAoC,CAAC;YAElE,KAAK,MAAM,SAAS,IAAI,gBAAgB,EAAE,CAAC;gBACzC,SAAS,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;oBACjC,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;oBAC9C,IAAI,IAAI,EAAE,CAAC;wBACT,aAAa,CAAC,GAAG,CAAC,MAAM,EAAE;4BACxB,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC;4BAChC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC;yBACjC,CAAC,CAAC;oBACL,CAAC;gBACH,CAAC,CAAC,CAAC;YACL,CAAC;YAED,2BAA2B;YAC3B,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;gBACnB,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC5C,IAAI,QAAQ,EAAE,CAAC;oBACb,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAC3C,CAAC;YACH,CAAC,CAAC,CAAC;YAEH,mBAAmB;YACnB,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,aAAa,CAAC,CAAC;YAEnD,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;YAElC,yCAAyC;YACzC,IAAI,OAAO,GAAG,SAAS,CAAC;YACxB,IAAI,OAAO,CAAC,gBAAgB,EAAE,CAAC;gBAC7B,OAAO,GAAG,6CAAoB,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE;oBAClD,kBAAkB,EAAE,IAAI;oBACxB,gBAAgB,EAAE,OAAO,CAAC,gBAAgB;iBAC3C,CAAC,CAAC;YACL,CAAC;YAED,OAAO;gBACL,aAAa;gBACb,MAAM;gBACN,QAAQ,EAAE;oBACR,SAAS,EAAE,WAAW;oBACtB,cAAc,EAAE,WAAW,CAAC,MAAM;oBAClC,kBAAkB,EAAE,IAAI,CAAC,SAAS;oBAClC,aAAa,EAAE,OAAO,GAAG,SAAS;oBAClC,SAAS,EAAE,KAAK,CAAC,MAAM;oBACvB,SAAS,EAAE,KAAK,CAAC,MAAM;iBACxB;gBACD,OAAO;aACR,CAAC;QACJ,CAAC;KAAA;IAED;;OAEG;IACK,yBAAyB,CAC/B,KAAkB,EAClB,KAAkB,EAClB,UAAkB;QAElB,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;QACvB,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAEnE,4CAA4C;QAC5C,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAElE,uBAAuB;QACvB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAC;QACjD,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC;QAEzD,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;;YACnB,IAAI,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;gBAC3C,MAAA,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,YAAa,CAAC,0CAAE,GAAG,CAAC,IAAI,CAAC,YAAa,CAAC,CAAC;gBAC3D,MAAA,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,YAAa,CAAC,0CAAE,GAAG,CAAC,IAAI,CAAC,YAAa,CAAC,CAAC;YAC7D,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,oBAAoB;QACpB,MAAM,OAAO,GAAG,IAAI,GAAG,CACrB,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAE,CAAC,IAAI,CAAC,CAAC,CAC3D,CAAC;QAEF,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC;QAChC,IAAI,QAAQ,GAAG,IAAI,CAAC;QACpB,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,6CAA6C;QAC7C,OAAO,QAAQ,IAAI,SAAS,GAAG,GAAG,EAAE,CAAC;YACnC,QAAQ,GAAG,KAAK,CAAC;YAEjB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC;gBACvB,MAAM,gBAAgB,GAAG,WAAW,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;gBAElD,gEAAgE;gBAChE,MAAM,mBAAmB,GAAG,IAAI,GAAG,EAAU,CAAC;gBAC9C,SAAS,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE;oBAC1C,mBAAmB,CAAC,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC,CAAC;gBACxD,CAAC,CAAC,CAAC;gBAEH,IAAI,aAAa,GAAG,gBAAgB,CAAC;gBACrC,IAAI,QAAQ,GAAG,CAAC,CAAC;gBAEjB,KAAK,MAAM,eAAe,IAAI,mBAAmB,EAAE,CAAC;oBAClD,IAAI,eAAe,KAAK,gBAAgB;wBAAE,SAAS;oBAEnD,MAAM,IAAI,GAAG,IAAI,CAAC,cAAc,CAC9B,MAAM,EACN,gBAAgB,EAChB,eAAe,EACf,WAAW,EACX,SAAS,EACT,OAAO,EACP,UAAU,EACV,UAAU,CACX,CAAC;oBAEF,IAAI,IAAI,GAAG,QAAQ,EAAE,CAAC;wBACpB,QAAQ,GAAG,IAAI,CAAC;wBAChB,aAAa,GAAG,eAAe,CAAC;oBAClC,CAAC;gBACH,CAAC;gBAED,IAAI,aAAa,KAAK,gBAAgB,EAAE,CAAC;oBACvC,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;oBACvC,QAAQ,GAAG,IAAI,CAAC;gBAClB,CAAC;YACH,CAAC;YAED,SAAS,EAAE,CAAC;QACd,CAAC;QAED,oCAAoC;QACpC,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC;QACnD,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAE/E,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzC,WAAW,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE;YACxC,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC,CAAC;QACnD,CAAC,CAAC,CAAC;QAEH,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,cAAc,CACpB,MAAc,EACd,aAAqB,EACrB,WAAmB,EACnB,WAAgC,EAChC,SAAmC,EACnC,OAA4B,EAC5B,UAAkB,EAClB,UAAkB;QAElB,IAAI,MAAM,GAAG,CAAC,CAAC;QAEf,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAE,IAAI,CAAC,CAAC;QAE7C,qCAAqC;QACrC,IAAI,gBAAgB,GAAG,CAAC,CAAC;QACzB,SAAS,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE;YAC1C,IAAI,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,KAAK,WAAW,EAAE,CAAC;gBAChD,gBAAgB,EAAE,CAAC;YACrB,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,uCAAuC;QACvC,IAAI,kBAAkB,GAAG,CAAC,CAAC;QAC3B,SAAS,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE;YAC1C,IAAI,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,KAAK,aAAa,EAAE,CAAC;gBAClD,kBAAkB,EAAE,CAAC;YACvB,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,MAAM;YACJ,CAAC,gBAAgB,GAAG,kBAAkB,CAAC,GAAG,UAAU;gBACpD,UAAU;oBACR,UAAU;oBACV,CAAC,IAAI,CAAC,eAAe,CAAC,WAAW,EAAE,WAAW,EAAE,OAAO,CAAC;wBACtD,IAAI,CAAC,eAAe,CAAC,aAAa,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;oBAC5D,CAAC,CAAC,GAAG,UAAU,GAAG,UAAU,CAAC,CAAC;QAElC,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,eAAe,CACrB,SAAiB,EACjB,WAAgC,EAChC,OAA4B;QAE5B,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,WAAW,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE;YACnC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACvB,KAAK,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACpC,CAAC;QACH,CAAC,CAAC,CAAC;QACH,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,KAAkB,EAAE,KAAkB;QAC7D,oBAAoB;QACpB,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAE7D,uBAAuB;QACvB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAC;QACjD,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC;QAEzD,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;;YACnB,IAAI,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;gBAC3C,MAAA,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,YAAa,CAAC,0CAAE,GAAG,CAAC,IAAI,CAAC,YAAa,CAAC,CAAC;gBAC3D,MAAA,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,YAAa,CAAC,0CAAE,GAAG,CAAC,IAAI,CAAC,YAAa,CAAC,CAAC;YAC7D,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,mBAAmB;QACnB,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,OAAO,OAAO,IAAI,SAAS,GAAG,GAAG,EAAE,CAAC;YAClC,OAAO,GAAG,KAAK,CAAC;YAEhB,kBAAkB;YAClB,yEAAyE;YACzE,yEAAyE;YACzE,2EAA2E;YAC3E,wEAAwE;YACxE,MAAM,SAAS,GAAG,OAAO,CAAC,CAAC,GAAG,KAAK,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;YAEhD,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;gBAC7B,wBAAwB;gBACxB,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;gBAC9C,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAE,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE;oBAC3C,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC;oBACtC,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC5D,CAAC,CAAC,CAAC;gBAEH,IAAI,WAAW,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;oBACzB,yBAAyB;oBACzB,IAAI,QAAQ,GAAG,CAAC,CAAC;oBACjB,IAAI,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAE,CAAC;oBAEpC,WAAW,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;wBACnC,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;4BACrB,QAAQ,GAAG,KAAK,CAAC;4BACjB,QAAQ,GAAG,KAAK,CAAC;wBACnB,CAAC;oBACH,CAAC,CAAC,CAAC;oBAEH,IAAI,QAAQ,KAAK,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;wBACrC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;wBAC9B,OAAO,GAAG,IAAI,CAAC;oBACjB,CAAC;gBACH,CAAC;YACH,CAAC;YAED,SAAS,EAAE,CAAC;QACd,CAAC;QAED,uBAAuB;QACvB,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;QAC9C,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAE/E,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzC,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE;YAC/B,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,CAAC;QAC/C,CAAC,CAAC,CAAC;QAEH,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,gBAAgB,CACtB,KAAkB,EAClB,WAAgC;QAEhC,MAAM,YAAY,GAAG,IAAI,GAAG,EAAoB,CAAC;QAEjD,WAAW,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE;YACxC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;gBACjC,YAAY,CAAC,GAAG,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;YAClC,CAAC;YACD,YAAY,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC5C,CAAC,CAAC,CAAC;QAEH,MAAM,WAAW,GAAgB,EAAE,CAAC;QACpC,YAAY,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,EAAE,EAAE;YACnC,WAAW,CAAC,IAAI,CAAC;gBACf,EAAE;gBACF,OAAO;gBACP,CAAC,EAAE,CAAC;gBACJ,CAAC,EAAE,CAAC;gBACJ,KAAK,EAAE,CAAC;gBACR,MAAM,EAAE,CAAC;aACV,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,OAAO,WAAW,CAAC;IACrB,CAAC;IAED;;OAEG;IACW,eAAe,CAC3B,SAAoB,EACpB,QAAqB,EACrB,QAAqB,EACrB,OAA+B;;;YAE/B,yCAAyC;YACzC,MAAM,cAAc,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9E,MAAM,cAAc,GAAG,QAAQ,CAAC,MAAM,CACpC,IAAI,CAAC,EAAE,CACL,IAAI,CAAC,YAAY;gBACjB,IAAI,CAAC,YAAY;gBACjB,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC;gBAC7C,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,CAChD,CAAC;YAEF,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAChC,OAAO,SAAS,CAAC;YACnB,CAAC;YAED,qBAAqB;YACrB,IAAI,OAAO,CAAC,WAAW,KAAK,OAAO,EAAE,CAAC;gBACpC,MAAM,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,cAAc,EAAE,cAAc,kCACvD,OAAO,CAAC,YAAY,KACvB,UAAU,EAAE,CAAA,MAAA,OAAO,CAAC,YAAY,0CAAE,UAAU,KAAI,GAAG,EACnD,SAAS,EAAE,CAAA,MAAA,OAAO,CAAC,YAAY,0CAAE,SAAS,KAAI,EAAE,EAChD,SAAS,EAAE,KAAK,IAChB,CAAC;YACL,CAAC;iBAAM,CAAC;gBACN,kBAAkB;gBAClB,IAAI,CAAC,cAAc,CAAC,cAAc,CAAC,CAAC;YACtC,CAAC;YAED,mBAAmB;YACnB,IAAI,IAAI,GAAG,QAAQ,EAAE,IAAI,GAAG,QAAQ,CAAC;YACrC,IAAI,IAAI,GAAG,CAAC,QAAQ,EAAE,IAAI,GAAG,CAAC,QAAQ,CAAC;YAEvC,cAAc,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;gBAC5B,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACvC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACvC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACvC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACzC,CAAC,CAAC,CAAC;YAEH,SAAS,CAAC,KAAK,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,CAAC;YACpC,SAAS,CAAC,MAAM,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,CAAC;YAErC,yBAAyB;YACzB,MAAM,EAAE,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;YAC7B,MAAM,EAAE,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;YAE7B,cAAc,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;gBAC5B,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,EAAE,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;YAC/D,CAAC,CAAC,CAAC;YAEH,OAAO,SAAS,CAAC;QACnB,CAAC;KAAA;IAED;;OAEG;IACK,cAAc,CAAC,KAAkB;QACvC,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;QACvB,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;QAErC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;YACxB,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;YACpC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC,CAAC;QACvE,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACK,mBAAmB,CACzB,WAAwB,EACxB,OAA+B;QAE/B,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAErC,MAAM,OAAO,GAAG,OAAO,CAAC,gBAAiB,CAAC;QAE1C,IAAI,OAAO,CAAC,eAAe,KAAK,UAAU,EAAE,CAAC;YAC3C,kCAAkC;YAClC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,WAAW,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC;YAEvD,WAAW,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE;gBACnC,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;gBACrD,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC;gBACvC,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC;YACzC,CAAC,CAAC,CAAC;QACL,CAAC;aAAM,IAAI,OAAO,CAAC,eAAe,KAAK,MAAM,EAAE,CAAC;YAC9C,kBAAkB;YAClB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC;YACtD,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;YACjB,IAAI,SAAS,GAAG,CAAC,CAAC;YAElB,WAAW,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE;gBACnC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC;gBAChB,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC;gBAEhB,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;gBAElD,CAAC,IAAI,SAAS,CAAC,KAAK,GAAG,OAAO,CAAC;gBAE/B,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,KAAK,CAAC,EAAE,CAAC;oBACzB,CAAC,GAAG,CAAC,CAAC;oBACN,CAAC,IAAI,SAAS,GAAG,OAAO,CAAC;oBACzB,SAAS,GAAG,CAAC,CAAC;gBAChB,CAAC;YACH,CAAC,CAAC,CAAC;QACL,CAAC;aAAM,CAAC;YACN,uCAAuC;YACvC,kCAAkC;YAClC,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,WAAW,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;gBAC9B,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC;gBAChB,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC;gBAChB,CAAC,IAAI,SAAS,CAAC,KAAK,GAAG,OAAO,CAAC;YACjC,CAAC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED;;OAEG;IACK,eAAe,CACrB,SAAgD;QAOhD,IAAI,SAAS,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YACzB,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;QAC7C,CAAC;QAED,IAAI,IAAI,GAAG,QAAQ,EAAE,IAAI,GAAG,QAAQ,CAAC;QACrC,IAAI,IAAI,GAAG,CAAC,QAAQ,EAAE,IAAI,GAAG,CAAC,QAAQ,CAAC;QAEvC,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;YACtB,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QAC/B,CAAC,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,EAAE,CAAC;QACnB,IAAI,IAAI,OAAO,CAAC;QAChB,IAAI,IAAI,OAAO,CAAC;QAChB,IAAI,IAAI,OAAO,CAAC;QAChB,IAAI,IAAI,OAAO,CAAC;QAEhB,OAAO;YACL,CAAC,EAAE,IAAI;YACP,CAAC,EAAE,IAAI;YACP,KAAK,EAAE,IAAI,GAAG,IAAI;YAClB,MAAM,EAAE,IAAI,GAAG,IAAI;SACpB,CAAC;IACJ,CAAC;IAED;;OAEG;IACG,gBAAgB,CACpB,KAAkB,EAClB,KAAkB,EAClB,kBAAuB,EACvB,aAA+C;;YAE/C,qEAAqE;YACrE,yBAAyB;YACzB,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC;YAE7D,uCACK,MAAM,KACT,WAAW,EAAE;oBACX,UAAU,EAAE,kBAAkB,CAAC,UAAU,IAAI,EAAE;oBAC/C,aAAa,EAAE,EAAE;oBACjB,YAAY,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;oBAClC,QAAQ,EAAE,eAAe;oBACzB,kBAAkB,EAAE,CAAC;iBACtB,IACD;QACJ,CAAC;KAAA;IAED;;OAEG;IACH,eAAe,CAAC,OAAwC;QACtD,IAAI,OAAO,CAAC,UAAU,KAAK,SAAS,IAAI,OAAO,CAAC,UAAU,IAAI,CAAC,EAAE,CAAC;YAChE,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,OAAO,CAAC,gBAAgB,KAAK,SAAS,IAAI,OAAO,CAAC,gBAAgB,GAAG,CAAC,EAAE,CAAC;YAC3E,OAAO,KAAK,CAAC;QACf,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AA3kBD,wDA2kBC;AAGD;;;;;;;;GAQG;AACH,SAAS,OAAO,CAAI,KAAU,EAAE,GAAc;IAC5C,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC3C,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9C,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC"}

package/src/libs/engine/src/layout/component-packing.d.ts

@@ -1,98 +0,0 @@
-import type { NodeModel } from '../models/NodeModel';
-import type { LinkModel } from '../models/LinkModel';
-import type { LayoutResult } from './layout-adapter.interface';
-import type { UnifiedLayoutOptions } from './layout-registry';
-/** Dagre's fallbacks, reused so every layout agrees on what an unsized node is. */
-export declare const DEFAULT_NODE_WIDTH = 150;
-export declare const DEFAULT_NODE_HEIGHT = 50;
-/** A node's box, with the same defaults every layout in the portfolio uses. */
-export declare function nodeSize(node: NodeModel): {
-    width: number;
-    height: number;
-};
-/** One connected component: its nodes, and the links that live entirely inside it. */
-export interface GraphComponent {
-    nodes: NodeModel[];
-    links: LinkModel[];
-}
-/**
- * The contract a layout must satisfy to be packable: nodes + links in, positions
- * out. Deliberately array-based (not DiagramModel-based) — a component is a
- * SUBSET of a diagram, and there is no such thing as a sub-DiagramModel.
- */
-export type GraphLayoutFn = (nodes: NodeModel[], links: LinkModel[], options: UnifiedLayoutOptions) => Promise<LayoutResult> | LayoutResult;
-/** A box to pack, plus the id used to break ties deterministically. */
-export interface PackBox {
-    id: string;
-    width: number;
-    height: number;
-}
-export interface PackingOptions {
-    /** Gap between packed components. Defaults to the layout's `nodeSpacing`. */
-    spacing?: number;
-    /** Target width/height of the packed result. 1.6 ≈ a landscape screen. */
-    aspectRatio?: number;
-}
-/**
- * THE OVERLAP PASS — one rule, one place, for every path that produces positions.
- *
- * It lives outside the five algorithms for the same reason packing does: force and
- * community lay out DIMENSIONLESS POINTS and happily return boxes that intersect
- * (see overlap-removal.ts). For every layout that does not overlap — dagre, ELK,
- * tree, grid, circular, radial — it is a no-op, so it costs them one comparison
- * pass and nothing else.
- *
- * wave10/gallery — WHY IT IS EXPORTED, which is the bug.
- *
- * It used to be a closure inside `layoutWithComponentPacking`, reachable only from
- * `adapter.apply()`. But the layout HOST — the path `engine.layout()` actually
- * takes — does not call `apply()` for a steppable algorithm: it drives
- * `createRun()`/`step()`/`snapshot()` so the run can report progress and be
- * cancelled. `snapshot()` was returned RAW.
- *
- * Force is the only steppable built-in. So the one algorithm that genuinely needs
- * overlap removal was the one algorithm that never got it, and
- * `engine.layout('force')` handed back overlapping node boxes — while every unit
- * test stayed green, because they all go through `apply()`.
- *
- * A demo caught it in the first thirty seconds of being pointed at a real browser.
- */
-export declare function separateOverlappingNodes(nodes: readonly NodeModel[], positions: Map<string, {
-    x: number;
-    y: number;
-}>, options?: UnifiedLayoutOptions): Map<string, {
-    x: number;
-    y: number;
-}>;
-/**
- * Split a graph into connected components.
- *
- * Connectivity is UNDIRECTED — an edge joins its endpoints regardless of which
- * way it points. (A tree whose edges all point away from the root is still one
- * component; treating edges as directed would shatter it into leaves.)
- *
- * Deterministic: nodes are visited in id order and each node's neighbours are
- * visited in id order, so the components — and the order they come back in —
- * depend only on the graph, never on insertion order.
- */
-export declare function findConnectedComponents(nodes: readonly NodeModel[], links: readonly LinkModel[]): GraphComponent[];
-/**
- * Shelf packing, first-fit-decreasing-height.
- *
- * Returns the top-left OFFSET for every box. Boxes are laid left-to-right into
- * a shelf; when the next box would overflow the target width a new shelf opens
- * below the tallest box on the current one.
- */
-export declare function packBoxes(boxes: readonly PackBox[], options?: PackingOptions): Map<string, {
-    x: number;
-    y: number;
-}>;
-/**
- * Run a layout with component packing.
- *
- * The wrapper every registered layout goes through. See the header: for a
- * CONNECTED graph this is a straight delegation (packing a single component is
- * the identity), so it cannot regress anything; for a disconnected one it is the
- * difference between a tidy row of trees and a pile.
- */
-export declare function layoutWithComponentPacking(name: string, fn: GraphLayoutFn, nodes: readonly NodeModel[], links: readonly LinkModel[], options?: UnifiedLayoutOptions): Promise<LayoutResult>;