@grafloria/element 0.3.19 → 0.3.21

package/src/libs/engine/src/layout/subgraph-layout.interface.js

@@ -1,452 +0,0 @@
-"use strict";
-/**
- * Subgraph Layout System
- *
- * Enables independent layout of groups, containers, and nested structures.
- * Critical for ERD diagrams, architecture diagrams, and any hierarchical visualization.
- *
- * Key features:
- * - Group-scoped layout (layout only specific groups)
- * - Recursive layout (layout nested groups)
- * - Group padding and boundaries
- * - Compound graph support
- * - Parent-child relationship preservation
- *
- * @module layout/subgraph-layout
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.SubgraphLayoutManager = void 0;
-const tslib_1 = require("tslib");
-/**
- * Subgraph layout computation utilities
- */
-class SubgraphLayoutManager {
-    /**
-     * Build hierarchical tree of groups
-     */
-    static buildGroupTree(groups) {
-        const groupMap = new Map();
-        const roots = [];
-        // Create nodes
-        for (const group of groups) {
-            groupMap.set(group.id, {
-                info: group,
-                children: [],
-                depth: 0,
-            });
-        }
-        // Build parent-child relationships
-        for (const group of groups) {
-            const node = groupMap.get(group.id);
-            if (group.parentId) {
-                const parent = groupMap.get(group.parentId);
-                if (parent) {
-                    parent.children.push(node);
-                    node.depth = parent.depth + 1;
-                }
-                else {
-                    roots.push(node); // Parent not found, treat as root
-                }
-            }
-            else {
-                roots.push(node);
-            }
-        }
-        return roots;
-    }
-    /**
-     * Get all groups at a specific depth level
-     */
-    static getGroupsAtDepth(roots, depth) {
-        const result = [];
-        const traverse = (node) => {
-            if (node.depth === depth) {
-                result.push(node.info);
-            }
-            for (const child of node.children) {
-                traverse(child);
-            }
-        };
-        for (const root of roots) {
-            traverse(root);
-        }
-        return result;
-    }
-    /**
-     * Get maximum depth of group tree
-     */
-    static getMaxDepth(roots) {
-        let maxDepth = 0;
-        const traverse = (node) => {
-            maxDepth = Math.max(maxDepth, node.depth);
-            for (const child of node.children) {
-                traverse(child);
-            }
-        };
-        for (const root of roots) {
-            traverse(root);
-        }
-        return maxDepth;
-    }
-    /**
-     * Filter nodes by group membership
-     */
-    static getNodesInGroup(groupId, group, allNodes, options) {
-        return allNodes.filter((node) => group.memberNodeIds.includes(node.id));
-    }
-    /**
-     * Filter links within a group
-     */
-    static getLinksInGroup(group, allLinks, options) {
-        const memberIds = new Set(group.memberNodeIds);
-        return allLinks.filter((link) => {
-            const sourceInGroup = memberIds.has(link.sourceNodeId);
-            const targetInGroup = memberIds.has(link.targetNodeId);
-            // Only include links where both ends are in the group
-            return sourceInGroup && targetInGroup;
-        });
-    }
-    /**
-     * Calculate group size based on its content
-     */
-    static calculateGroupSize(group, nodePositions, nodeSizes, options) {
-        // If fixed size, return it
-        if (group.fixedSize && group.minSize) {
-            return Object.assign({}, group.minSize);
-        }
-        // Calculate bounds of all member nodes
-        let minX = Infinity;
-        let minY = Infinity;
-        let maxX = -Infinity;
-        let maxY = -Infinity;
-        let positioned = 0;
-        for (const nodeId of group.memberNodeIds) {
-            const pos = nodePositions.get(nodeId);
-            const size = nodeSizes.get(nodeId) || { width: 100, height: 50 };
-            if (pos) {
-                positioned++;
-                minX = Math.min(minX, pos.x - size.width / 2);
-                minY = Math.min(minY, pos.y - size.height / 2);
-                maxX = Math.max(maxX, pos.x + size.width / 2);
-                maxY = Math.max(maxY, pos.y + size.height / 2);
-            }
-        }
-        // No positioned members: the -Infinity bounds would poison the size math
-        if (positioned === 0) {
-            minX = 0;
-            minY = 0;
-            maxX = 0;
-            maxY = 0;
-        }
-        // Add padding
-        const padding = this.getGroupPadding(group, options);
-        const width = maxX - minX + padding.left + padding.right;
-        const height = maxY - minY + padding.top + padding.bottom;
-        // Apply min/max constraints
-        let finalWidth = width;
-        let finalHeight = height;
-        if (group.minSize) {
-            finalWidth = Math.max(finalWidth, group.minSize.width);
-            finalHeight = Math.max(finalHeight, group.minSize.height);
-        }
-        if (group.maxSize) {
-            finalWidth = Math.min(finalWidth, group.maxSize.width);
-            finalHeight = Math.min(finalHeight, group.maxSize.height);
-        }
-        // Maintain aspect ratio if required
-        if (options.maintainAspectRatio && group.minSize) {
-            const aspectRatio = group.minSize.width / group.minSize.height;
-            if (finalWidth / finalHeight > aspectRatio) {
-                finalHeight = finalWidth / aspectRatio;
-            }
-            else {
-                finalWidth = finalHeight * aspectRatio;
-            }
-        }
-        return { width: finalWidth, height: finalHeight };
-    }
-    /**
-     * Get effective padding for a group
-     */
-    static getGroupPadding(group, options) {
-        var _a, _b, _c, _d, _e, _f, _g, _h;
-        const defaultPadding = options.defaultPadding || this.DEFAULT_PADDING;
-        return {
-            top: (_b = (_a = group.padding) === null || _a === void 0 ? void 0 : _a.top) !== null && _b !== void 0 ? _b : defaultPadding,
-            right: (_d = (_c = group.padding) === null || _c === void 0 ? void 0 : _c.right) !== null && _d !== void 0 ? _d : defaultPadding,
-            bottom: (_f = (_e = group.padding) === null || _e === void 0 ? void 0 : _e.bottom) !== null && _f !== void 0 ? _f : defaultPadding,
-            left: (_h = (_g = group.padding) === null || _g === void 0 ? void 0 : _g.left) !== null && _h !== void 0 ? _h : defaultPadding,
-        };
-    }
-    /**
-     * Position groups relative to each other
-     */
-    static positionGroups(groups, groupSizes, options) {
-        const positions = new Map();
-        // Filter out fixed groups
-        const movableGroups = groups.filter((g) => !g.fixed);
-        const fixedGroups = groups.filter((g) => g.fixed);
-        // Position fixed groups first (they may have predetermined positions)
-        // For now, we'll assume they're already positioned
-        // Position movable groups
-        if (options.groupPositioning === 'grid') {
-            this.positionGroupsInGrid(movableGroups, groupSizes, options, positions);
-        }
-        else if (options.groupPositioning === 'compact') {
-            this.positionGroupsCompact(movableGroups, groupSizes, options, positions);
-        }
-        else if (options.groupPositioning === 'spacious') {
-            this.positionGroupsSpacious(movableGroups, groupSizes, options, positions);
-        }
-        else {
-            // Manual - groups should already have positions
-            // Just ensure they're in the map
-            for (const group of movableGroups) {
-                if (!positions.has(group.id)) {
-                    positions.set(group.id, { x: 0, y: 0 });
-                }
-            }
-        }
-        return positions;
-    }
-    /**
-     * Position groups in a grid layout
-     */
-    static positionGroupsInGrid(groups, groupSizes, options, positions) {
-        const spacing = options.groupSpacing || this.DEFAULT_GROUP_SPACING;
-        const cols = Math.ceil(Math.sqrt(groups.length));
-        let x = 0;
-        let y = 0;
-        let maxHeightInRow = 0;
-        for (let i = 0; i < groups.length; i++) {
-            const group = groups[i];
-            const size = groupSizes.get(group.id) || { width: 200, height: 200 };
-            positions.set(group.id, { x, y });
-            maxHeightInRow = Math.max(maxHeightInRow, size.height);
-            x += size.width + spacing;
-            if ((i + 1) % cols === 0) {
-                x = 0;
-                y += maxHeightInRow + spacing;
-                maxHeightInRow = 0;
-            }
-        }
-    }
-    /**
-     * Position groups in a compact layout (minimize total area)
-     */
-    static positionGroupsCompact(groups, groupSizes, options, positions) {
-        // Sort by area (largest first) for better packing
-        const sorted = [...groups].sort((a, b) => {
-            const sizeA = groupSizes.get(a.id) || { width: 200, height: 200 };
-            const sizeB = groupSizes.get(b.id) || { width: 200, height: 200 };
-            return sizeB.width * sizeB.height - sizeA.width * sizeA.height;
-        });
-        const spacing = options.groupSpacing || this.DEFAULT_GROUP_SPACING;
-        let x = 0;
-        let y = 0;
-        let rowHeight = 0;
-        let currentRowWidth = 0;
-        const maxRowWidth = 1200; // Maximum width before wrapping
-        for (const group of sorted) {
-            const size = groupSizes.get(group.id) || { width: 200, height: 200 };
-            // Check if we need to wrap to next row
-            if (currentRowWidth + size.width > maxRowWidth && currentRowWidth > 0) {
-                x = 0;
-                y += rowHeight + spacing;
-                rowHeight = 0;
-                currentRowWidth = 0;
-            }
-            positions.set(group.id, { x, y });
-            x += size.width + spacing;
-            currentRowWidth += size.width + spacing;
-            rowHeight = Math.max(rowHeight, size.height);
-        }
-    }
-    /**
-     * Position groups in a spacious layout (maximize whitespace)
-     */
-    static positionGroupsSpacious(groups, groupSizes, options, positions) {
-        const spacing = (options.groupSpacing || this.DEFAULT_GROUP_SPACING) * 2; // Double spacing
-        let x = 0;
-        let y = 0;
-        for (const group of groups) {
-            const size = groupSizes.get(group.id) || { width: 200, height: 200 };
-            positions.set(group.id, { x, y });
-            x += size.width + spacing;
-        }
-    }
-    /**
-     * Translate node positions to group-local coordinates
-     */
-    static translateToGroupCoordinates(nodePositions, group, groupPosition, options) {
-        const padding = this.getGroupPadding(group, options);
-        const translated = new Map();
-        // Calculate the center of the group content
-        let minX = Infinity;
-        let minY = Infinity;
-        for (const nodeId of group.memberNodeIds) {
-            const pos = nodePositions.get(nodeId);
-            if (pos) {
-                minX = Math.min(minX, pos.x);
-                minY = Math.min(minY, pos.y);
-            }
-        }
-        // Translate nodes to be relative to group position with padding
-        for (const nodeId of group.memberNodeIds) {
-            const pos = nodePositions.get(nodeId);
-            if (pos) {
-                translated.set(nodeId, {
-                    x: groupPosition.x + padding.left + (pos.x - minX),
-                    y: groupPosition.y + padding.top + (pos.y - minY),
-                });
-            }
-        }
-        return translated;
-    }
-    /**
-     * Apply layout to a single group
-     */
-    static layoutGroup(group, allNodes, allLinks, nodeSizes, layoutAdapter, // LayoutAdapter
-    options) {
-        return tslib_1.__awaiter(this, void 0, void 0, function* () {
-            // Get nodes and links in this group
-            const groupNodes = this.getNodesInGroup(group.id, group, allNodes, options);
-            const groupLinks = this.getLinksInGroup(group, allLinks, options);
-            if (groupNodes.length === 0) {
-                return {
-                    nodePositions: new Map(),
-                    bounds: { x: 0, y: 0, width: 0, height: 0 },
-                };
-            }
-            // Use group's layout algorithm if specified, otherwise use the provided adapter
-            const layoutOptions = group.layoutOptions || {};
-            // Apply layout to group contents
-            const result = yield layoutAdapter.apply(groupNodes, groupLinks, layoutOptions);
-            return {
-                nodePositions: result.nodePositions,
-                bounds: result.bounds,
-            };
-        });
-    }
-    /**
-     * Main subgraph layout computation
-     */
-    static computeSubgraphLayout(groups, allNodes, allLinks, nodeSizes, layoutAdapter, options) {
-        return tslib_1.__awaiter(this, void 0, void 0, function* () {
-            const finalNodePositions = new Map();
-            const groupPositions = new Map();
-            const groupSizes = new Map();
-            const laidOutGroups = [];
-            const skippedGroups = [];
-            // Filter target groups if specified
-            const targetGroups = options.targetGroups
-                ? groups.filter((g) => options.targetGroups.includes(g.id))
-                : groups;
-            // Build group tree for recursive processing
-            const groupTree = this.buildGroupTree(targetGroups);
-            if (options.recursive) {
-                // Layout from deepest to shallowest
-                const maxDepth = this.getMaxDepth(groupTree);
-                for (let depth = maxDepth; depth >= 0; depth--) {
-                    const groupsAtDepth = this.getGroupsAtDepth(groupTree, depth);
-                    for (const group of groupsAtDepth) {
-                        if (group.collapsed || group.fixed) {
-                            skippedGroups.push(group.id);
-                            continue;
-                        }
-                        // Layout this group
-                        const layoutResult = yield this.layoutGroup(group, allNodes, allLinks, nodeSizes, layoutAdapter, options);
-                        // Store node positions (relative to group)
-                        for (const [nodeId, pos] of layoutResult.nodePositions) {
-                            finalNodePositions.set(nodeId, Object.assign(Object.assign({}, pos), { groupId: group.id }));
-                        }
-                        // Calculate and store group size
-                        const size = this.calculateGroupSize(group, layoutResult.nodePositions, nodeSizes, options);
-                        groupSizes.set(group.id, size);
-                        laidOutGroups.push(group.id);
-                    }
-                }
-            }
-            else {
-                // Non-recursive: just layout each group independently
-                for (const group of targetGroups) {
-                    if (group.collapsed || group.fixed) {
-                        skippedGroups.push(group.id);
-                        continue;
-                    }
-                    const layoutResult = yield this.layoutGroup(group, allNodes, allLinks, nodeSizes, layoutAdapter, options);
-                    for (const [nodeId, pos] of layoutResult.nodePositions) {
-                        finalNodePositions.set(nodeId, Object.assign(Object.assign({}, pos), { groupId: group.id }));
-                    }
-                    const size = this.calculateGroupSize(group, layoutResult.nodePositions, nodeSizes, options);
-                    groupSizes.set(group.id, size);
-                    laidOutGroups.push(group.id);
-                }
-            }
-            // Position groups relative to each other
-            const relativeGroupPositions = this.positionGroups(targetGroups, groupSizes, options);
-            // Translate node positions to absolute coordinates
-            for (const group of targetGroups) {
-                const groupPos = relativeGroupPositions.get(group.id) || { x: 0, y: 0 };
-                groupPositions.set(group.id, groupPos);
-                // Translate member nodes
-                const memberPositions = new Map();
-                for (const nodeId of group.memberNodeIds) {
-                    const relPos = finalNodePositions.get(nodeId);
-                    if (relPos) {
-                        memberPositions.set(nodeId, { x: relPos.x, y: relPos.y });
-                    }
-                }
-                const translated = this.translateToGroupCoordinates(memberPositions, group, groupPos, options);
-                for (const [nodeId, pos] of translated) {
-                    finalNodePositions.set(nodeId, Object.assign(Object.assign({}, pos), { groupId: group.id }));
-                }
-            }
-            // Calculate overall bounds
-            const bounds = this.calculateOverallBounds(finalNodePositions, groupPositions, groupSizes);
-            return {
-                nodePositions: finalNodePositions,
-                groupPositions,
-                groupSizes,
-                laidOutGroups,
-                skippedGroups,
-                bounds,
-                wasRecursive: options.recursive || false,
-            };
-        });
-    }
-    /**
-     * Calculate overall bounding box
-     */
-    static calculateOverallBounds(nodePositions, groupPositions, groupSizes) {
-        let minX = Infinity;
-        let minY = Infinity;
-        let maxX = -Infinity;
-        let maxY = -Infinity;
-        // Consider group bounds
-        for (const [groupId, pos] of groupPositions) {
-            const size = groupSizes.get(groupId) || { width: 200, height: 200 };
-            minX = Math.min(minX, pos.x);
-            minY = Math.min(minY, pos.y);
-            maxX = Math.max(maxX, pos.x + size.width);
-            maxY = Math.max(maxY, pos.y + size.height);
-        }
-        // Consider node positions
-        for (const [nodeId, pos] of nodePositions) {
-            minX = Math.min(minX, pos.x);
-            minY = Math.min(minY, pos.y);
-            maxX = Math.max(maxX, pos.x);
-            maxY = Math.max(maxY, pos.y);
-        }
-        return {
-            x: minX,
-            y: minY,
-            width: maxX - minX,
-            height: maxY - minY,
-        };
-    }
-}
-exports.SubgraphLayoutManager = SubgraphLayoutManager;
-SubgraphLayoutManager.DEFAULT_PADDING = 20;
-SubgraphLayoutManager.DEFAULT_GROUP_SPACING = 40;
-//# sourceMappingURL=subgraph-layout.interface.js.map

package/src/libs/engine/src/layout/subgraph-layout.interface.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"subgraph-layout.interface.js","sourceRoot":"","sources":["../../../../../../engine/src/layout/subgraph-layout.interface.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;GAcG;;;;AAkIH;;GAEG;AACH,MAAa,qBAAqB;IAIhC;;OAEG;IACH,MAAM,CAAC,cAAc,CAAC,MAAmB;QACvC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAyB,CAAC;QAClD,MAAM,KAAK,GAAoB,EAAE,CAAC;QAElC,eAAe;QACf,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE;gBACrB,IAAI,EAAE,KAAK;gBACX,QAAQ,EAAE,EAAE;gBACZ,KAAK,EAAE,CAAC;aACT,CAAC,CAAC;QACL,CAAC;QAED,mCAAmC;QACnC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAE,CAAC;YAErC,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;gBACnB,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;gBAC5C,IAAI,MAAM,EAAE,CAAC;oBACX,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAC3B,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC;gBAChC,CAAC;qBAAM,CAAC;oBACN,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,kCAAkC;gBACtD,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,gBAAgB,CAAC,KAAsB,EAAE,KAAa;QAC3D,MAAM,MAAM,GAAgB,EAAE,CAAC;QAE/B,MAAM,QAAQ,GAAG,CAAC,IAAmB,EAAE,EAAE;YACvC,IAAI,IAAI,CAAC,KAAK,KAAK,KAAK,EAAE,CAAC;gBACzB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACzB,CAAC;YACD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAClB,CAAC;QACH,CAAC,CAAC;QAEF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,QAAQ,CAAC,IAAI,CAAC,CAAC;QACjB,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,WAAW,CAAC,KAAsB;QACvC,IAAI,QAAQ,GAAG,CAAC,CAAC;QAEjB,MAAM,QAAQ,GAAG,CAAC,IAAmB,EAAE,EAAE;YACvC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;YAC1C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAClB,CAAC;QACH,CAAC,CAAC;QAEF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,QAAQ,CAAC,IAAI,CAAC,CAAC;QACjB,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,eAAe,CACpB,OAAe,EACf,KAAgB,EAChB,QAAmD,EACnD,OAA8B;QAE9B,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,aAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1E,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,eAAe,CACpB,KAAgB,EAChB,QAAmF,EACnF,OAA8B;QAE9B,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;QAE/C,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE;YAC9B,MAAM,aAAa,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YACvD,MAAM,aAAa,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAEvD,sDAAsD;YACtD,OAAO,aAAa,IAAI,aAAa,CAAC;QACxC,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,kBAAkB,CACvB,KAAgB,EAChB,aAAoD,EACpD,SAAyD,EACzD,OAA8B;QAE9B,2BAA2B;QAC3B,IAAI,KAAK,CAAC,SAAS,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YACrC,yBAAY,KAAK,CAAC,OAAO,EAAG;QAC9B,CAAC;QAED,uCAAuC;QACvC,IAAI,IAAI,GAAG,QAAQ,CAAC;QACpB,IAAI,IAAI,GAAG,QAAQ,CAAC;QACpB,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC;QACrB,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC;QACrB,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;YACzC,MAAM,GAAG,GAAG,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACtC,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;YAEjE,IAAI,GAAG,EAAE,CAAC;gBACR,UAAU,EAAE,CAAC;gBACb,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAC9C,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gBAC/C,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAC9C,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACjD,CAAC;QACH,CAAC;QAED,yEAAyE;QACzE,IAAI,UAAU,KAAK,CAAC,EAAE,CAAC;YACrB,IAAI,GAAG,CAAC,CAAC;YAAC,IAAI,GAAG,CAAC,CAAC;YAAC,IAAI,GAAG,CAAC,CAAC;YAAC,IAAI,GAAG,CAAC,CAAC;QACzC,CAAC;QAED,cAAc;QACd,MAAM,OAAO,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QACrD,MAAM,KAAK,GAAG,IAAI,GAAG,IAAI,GAAG,OAAO,CAAC,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC;QACzD,MAAM,MAAM,GAAG,IAAI,GAAG,IAAI,GAAG,OAAO,CAAC,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC;QAE1D,4BAA4B;QAC5B,IAAI,UAAU,GAAG,KAAK,CAAC;QACvB,IAAI,WAAW,GAAG,MAAM,CAAC;QAEzB,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YAClB,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YACvD,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAC5D,CAAC;QAED,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YAClB,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YACvD,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAC5D,CAAC;QAED,oCAAoC;QACpC,IAAI,OAAO,CAAC,mBAAmB,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YACjD,MAAM,WAAW,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;YAC/D,IAAI,UAAU,GAAG,WAAW,GAAG,WAAW,EAAE,CAAC;gBAC3C,WAAW,GAAG,UAAU,GAAG,WAAW,CAAC;YACzC,CAAC;iBAAM,CAAC;gBACN,UAAU,GAAG,WAAW,GAAG,WAAW,CAAC;YACzC,CAAC;QACH,CAAC;QAED,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC;IACpD,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,eAAe,CACpB,KAAgB,EAChB,OAA8B;;QAE9B,MAAM,cAAc,GAAG,OAAO,CAAC,cAAc,IAAI,IAAI,CAAC,eAAe,CAAC;QAEtE,OAAO;YACL,GAAG,EAAE,MAAA,MAAA,KAAK,CAAC,OAAO,0CAAE,GAAG,mCAAI,cAAc;YACzC,KAAK,EAAE,MAAA,MAAA,KAAK,CAAC,OAAO,0CAAE,KAAK,mCAAI,cAAc;YAC7C,MAAM,EAAE,MAAA,MAAA,KAAK,CAAC,OAAO,0CAAE,MAAM,mCAAI,cAAc;YAC/C,IAAI,EAAE,MAAA,MAAA,KAAK,CAAC,OAAO,0CAAE,IAAI,mCAAI,cAAc;SAC5C,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,cAAc,CACnB,MAAmB,EACnB,UAA0D,EAC1D,OAA8B;QAE9B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoC,CAAC;QAE9D,0BAA0B;QAC1B,MAAM,aAAa,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QACrD,MAAM,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAElD,sEAAsE;QACtE,mDAAmD;QAEnD,0BAA0B;QAC1B,IAAI,OAAO,CAAC,gBAAgB,KAAK,MAAM,EAAE,CAAC;YACxC,IAAI,CAAC,oBAAoB,CAAC,aAAa,EAAE,UAAU,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;QAC3E,CAAC;aAAM,IAAI,OAAO,CAAC,gBAAgB,KAAK,SAAS,EAAE,CAAC;YAClD,IAAI,CAAC,qBAAqB,CAAC,aAAa,EAAE,UAAU,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;QAC5E,CAAC;aAAM,IAAI,OAAO,CAAC,gBAAgB,KAAK,UAAU,EAAE,CAAC;YACnD,IAAI,CAAC,sBAAsB,CAAC,aAAa,EAAE,UAAU,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;QAC7E,CAAC;aAAM,CAAC;YACN,gDAAgD;YAChD,iCAAiC;YACjC,KAAK,MAAM,KAAK,IAAI,aAAa,EAAE,CAAC;gBAClC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;oBAC7B,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBAC1C,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,oBAAoB,CACjC,MAAmB,EACnB,UAA0D,EAC1D,OAA8B,EAC9B,SAAgD;QAEhD,MAAM,OAAO,GAAG,OAAO,CAAC,YAAY,IAAI,IAAI,CAAC,qBAAqB,CAAC;QACnE,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;QAEjD,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,cAAc,GAAG,CAAC,CAAC;QAEvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACxB,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;YAErE,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YAElC,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YAEvD,CAAC,IAAI,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC;YAE1B,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,KAAK,CAAC,EAAE,CAAC;gBACzB,CAAC,GAAG,CAAC,CAAC;gBACN,CAAC,IAAI,cAAc,GAAG,OAAO,CAAC;gBAC9B,cAAc,GAAG,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,qBAAqB,CAClC,MAAmB,EACnB,UAA0D,EAC1D,OAA8B,EAC9B,SAAgD;QAEhD,kDAAkD;QAClD,MAAM,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACvC,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;YAClE,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;YAClE,OAAO,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC;QACjE,CAAC,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,OAAO,CAAC,YAAY,IAAI,IAAI,CAAC,qBAAqB,CAAC;QACnE,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,eAAe,GAAG,CAAC,CAAC;QACxB,MAAM,WAAW,GAAG,IAAI,CAAC,CAAC,gCAAgC;QAE1D,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;YAErE,uCAAuC;YACvC,IAAI,eAAe,GAAG,IAAI,CAAC,KAAK,GAAG,WAAW,IAAI,eAAe,GAAG,CAAC,EAAE,CAAC;gBACtE,CAAC,GAAG,CAAC,CAAC;gBACN,CAAC,IAAI,SAAS,GAAG,OAAO,CAAC;gBACzB,SAAS,GAAG,CAAC,CAAC;gBACd,eAAe,GAAG,CAAC,CAAC;YACtB,CAAC;YAED,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YAElC,CAAC,IAAI,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC;YAC1B,eAAe,IAAI,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC;YACxC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAC/C,CAAC;IACH,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,sBAAsB,CACnC,MAAmB,EACnB,UAA0D,EAC1D,OAA8B,EAC9B,SAAgD;QAEhD,MAAM,OAAO,GAAG,CAAC,OAAO,CAAC,YAAY,IAAI,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC,CAAC,CAAC,iBAAiB;QAE3F,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,CAAC,GAAG,CAAC,CAAC;QAEV,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;YAErE,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YAElC,CAAC,IAAI,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC;QAC5B,CAAC;IACH,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,2BAA2B,CAChC,aAAoD,EACpD,KAAgB,EAChB,aAAuC,EACvC,OAA8B;QAE9B,MAAM,OAAO,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QACrD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoC,CAAC;QAE/D,4CAA4C;QAC5C,IAAI,IAAI,GAAG,QAAQ,CAAC;QACpB,IAAI,IAAI,GAAG,QAAQ,CAAC;QAEpB,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;YACzC,MAAM,GAAG,GAAG,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACtC,IAAI,GAAG,EAAE,CAAC;gBACR,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;gBAC7B,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;QAED,gEAAgE;QAChE,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;YACzC,MAAM,GAAG,GAAG,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACtC,IAAI,GAAG,EAAE,CAAC;gBACR,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE;oBACrB,CAAC,EAAE,aAAa,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;oBAClD,CAAC,EAAE,aAAa,CAAC,CAAC,GAAG,OAAO,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;iBAClD,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO,UAAU,CAAC;IACpB,CAAC;IAED;;OAEG;IACH,MAAM,CAAO,WAAW,CACtB,KAAgB,EAChB,QAAmD,EACnD,QAAmF,EACnF,SAAyD,EACzD,aAAkB,EAAE,gBAAgB;IACpC,OAA8B;;YAK9B,oCAAoC;YACpC,MAAM,UAAU,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;YAC5E,MAAM,UAAU,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;YAElE,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC5B,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;iBAC5C,CAAC;YACJ,CAAC;YAED,gFAAgF;YAChF,MAAM,aAAa,GAAG,KAAK,CAAC,aAAa,IAAI,EAAE,CAAC;YAEhD,iCAAiC;YACjC,MAAM,MAAM,GAAG,MAAM,aAAa,CAAC,KAAK,CAAC,UAAU,EAAE,UAAU,EAAE,aAAa,CAAC,CAAC;YAEhF,OAAO;gBACL,aAAa,EAAE,MAAM,CAAC,aAAa;gBACnC,MAAM,EAAE,MAAM,CAAC,MAAM;aACtB,CAAC;QACJ,CAAC;KAAA;IAED;;OAEG;IACH,MAAM,CAAO,qBAAqB,CAChC,MAAmB,EACnB,QAAmD,EACnD,QAAmF,EACnF,SAAyD,EACzD,aAAkB,EAClB,OAA8B;;YAE9B,MAAM,kBAAkB,GAAG,IAAI,GAAG,EAAsD,CAAC;YACzF,MAAM,cAAc,GAAG,IAAI,GAAG,EAAoC,CAAC;YACnE,MAAM,UAAU,GAAG,IAAI,GAAG,EAA6C,CAAC;YACxE,MAAM,aAAa,GAAa,EAAE,CAAC;YACnC,MAAM,aAAa,GAAa,EAAE,CAAC;YAEnC,oCAAoC;YACpC,MAAM,YAAY,GAAG,OAAO,CAAC,YAAY;gBACvC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,YAAa,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBAC5D,CAAC,CAAC,MAAM,CAAC;YAEX,4CAA4C;YAC5C,MAAM,SAAS,GAAG,IAAI,CAAC,cAAc,CAAC,YAAY,CAAC,CAAC;YAEpD,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;gBACtB,oCAAoC;gBACpC,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;gBAE7C,KAAK,IAAI,KAAK,GAAG,QAAQ,EAAE,KAAK,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;oBAC/C,MAAM,aAAa,GAAG,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;oBAE9D,KAAK,MAAM,KAAK,IAAI,aAAa,EAAE,CAAC;wBAClC,IAAI,KAAK,CAAC,SAAS,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;4BACnC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;4BAC7B,SAAS;wBACX,CAAC;wBAED,oBAAoB;wBACpB,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,WAAW,CACzC,KAAK,EACL,QAAQ,EACR,QAAQ,EACR,SAAS,EACT,aAAa,EACb,OAAO,CACR,CAAC;wBAEF,2CAA2C;wBAC3C,KAAK,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,YAAY,CAAC,aAAa,EAAE,CAAC;4BACvD,kBAAkB,CAAC,GAAG,CAAC,MAAM,kCAAO,GAAG,KAAE,OAAO,EAAE,KAAK,CAAC,EAAE,IAAG,CAAC;wBAChE,CAAC;wBAED,iCAAiC;wBACjC,MAAM,IAAI,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,YAAY,CAAC,aAAa,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;wBAC5F,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;wBAE/B,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;oBAC/B,CAAC;gBACH,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,sDAAsD;gBACtD,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;oBACjC,IAAI,KAAK,CAAC,SAAS,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;wBACnC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;wBAC7B,SAAS;oBACX,CAAC;oBAED,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,WAAW,CACzC,KAAK,EACL,QAAQ,EACR,QAAQ,EACR,SAAS,EACT,aAAa,EACb,OAAO,CACR,CAAC;oBAEF,KAAK,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,YAAY,CAAC,aAAa,EAAE,CAAC;wBACvD,kBAAkB,CAAC,GAAG,CAAC,MAAM,kCAAO,GAAG,KAAE,OAAO,EAAE,KAAK,CAAC,EAAE,IAAG,CAAC;oBAChE,CAAC;oBAED,MAAM,IAAI,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,YAAY,CAAC,aAAa,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;oBAC5F,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;oBAE/B,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBAC/B,CAAC;YACH,CAAC;YAED,yCAAyC;YACzC,MAAM,sBAAsB,GAAG,IAAI,CAAC,cAAc,CAAC,YAAY,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC;YAEtF,mDAAmD;YACnD,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;gBACjC,MAAM,QAAQ,GAAG,sBAAsB,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;gBACxE,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;gBAEvC,yBAAyB;gBACzB,MAAM,eAAe,GAAG,IAAI,GAAG,EAAoC,CAAC;gBACpE,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;oBACzC,MAAM,MAAM,GAAG,kBAAkB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;oBAC9C,IAAI,MAAM,EAAE,CAAC;wBACX,eAAe,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC;oBAC5D,CAAC;gBACH,CAAC;gBAED,MAAM,UAAU,GAAG,IAAI,CAAC,2BAA2B,CAAC,eAAe,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;gBAE/F,KAAK,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,UAAU,EAAE,CAAC;oBACvC,kBAAkB,CAAC,GAAG,CAAC,MAAM,kCAAO,GAAG,KAAE,OAAO,EAAE,KAAK,CAAC,EAAE,IAAG,CAAC;gBAChE,CAAC;YACH,CAAC;YAED,2BAA2B;YAC3B,MAAM,MAAM,GAAG,IAAI,CAAC,sBAAsB,CAAC,kBAAkB,EAAE,cAAc,EAAE,UAAU,CAAC,CAAC;YAE3F,OAAO;gBACL,aAAa,EAAE,kBAAkB;gBACjC,cAAc;gBACd,UAAU;gBACV,aAAa;gBACb,aAAa;gBACb,MAAM;gBACN,YAAY,EAAE,OAAO,CAAC,SAAS,IAAI,KAAK;aACzC,CAAC;QACJ,CAAC;KAAA;IAED;;OAEG;IACK,MAAM,CAAC,sBAAsB,CACnC,aAAsE,EACtE,cAAqD,EACrD,UAA0D;QAE1D,IAAI,IAAI,GAAG,QAAQ,CAAC;QACpB,IAAI,IAAI,GAAG,QAAQ,CAAC;QACpB,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC;QACrB,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC;QAErB,wBAAwB;QACxB,KAAK,MAAM,CAAC,OAAO,EAAE,GAAG,CAAC,IAAI,cAAc,EAAE,CAAC;YAC5C,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;YACpE,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,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;YAC1C,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;QAC7C,CAAC;QAED,0BAA0B;QAC1B,KAAK,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,aAAa,EAAE,CAAC;YAC1C,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;QAED,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;;AA9jBH,sDA+jBC;AA9jByB,qCAAe,GAAG,EAAE,CAAC;AACrB,2CAAqB,GAAG,EAAE,CAAC"}

package/src/libs/engine/src/layout/sugiyama/layered-layout.d.ts

@@ -1,9 +0,0 @@
-import type { RegisteredLayout, UnifiedLayoutOptions } from '../layout-registry';
-import { type SemanticConstraints } from './sugiyama';
-export interface LayeredLayoutOptions extends UnifiedLayoutOptions {
-    /** Card 5. Honoured DURING ranking/ordering — not clamped afterwards. */
-    semantic?: SemanticConstraints;
-    /** Ordering/coordinate sweeps. */
-    iterations?: number;
-}
-export declare function createLayeredLayout(name?: string): RegisteredLayout;

package/src/libs/engine/src/layout/sugiyama/layered-layout.js

@@ -1,83 +0,0 @@
-"use strict";
-// Wave 7 (Auto-layout) — Cards 1 & 5: the layered engine, registered.
-//
-// This is what `engine.layout()` runs when you do not name an algorithm — the
-// zero-config default Card 1 asks for. It is also the ONLY engine that can honour
-// Card 5's semantic constraints, because those are decisions taken during ranking
-// and ordering (see sugiyama.ts), and no amount of post-processing can recover
-// them once you are holding coordinates.
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.createLayeredLayout = createLayeredLayout;
-const tslib_1 = require("tslib");
-const sugiyama_1 = require("./sugiyama");
-/** Read the graph out of the model in the shape sugiyama wants. */
-function readGraph(diagram) {
-    var _a, _b, _c, _d, _e, _f;
-    const nodes = diagram.getNodes().map((n) => ({
-        id: n.id,
-        width: n.size.width,
-        height: n.size.height,
-    }));
-    const edges = [];
-    for (const link of diagram.getLinks()) {
-        const source = (_a = link.sourceNodeId) !== null && _a !== void 0 ? _a : (_c = (_b = diagram.getNodeByPortId) === null || _b === void 0 ? void 0 : _b.call(diagram, link.sourcePortId)) === null || _c === void 0 ? void 0 : _c.id;
-        const target = (_d = link.targetNodeId) !== null && _d !== void 0 ? _d : (_f = (_e = diagram.getNodeByPortId) === null || _e === void 0 ? void 0 : _e.call(diagram, link.targetPortId)) === null || _f === void 0 ? void 0 : _f.id;
-        if (!source || !target)
-            continue;
-        edges.push({ id: link.id, source, target });
-    }
-    return { nodes, edges };
-}
-function createLayeredLayout(name = 'layered') {
-    return {
-        name,
-        apply(diagram, options) {
-            return tslib_1.__awaiter(this, void 0, void 0, function* () {
-                var _a;
-                const opts = options;
-                const { nodes, edges } = readGraph(diagram);
-                // Card 1: zero configuration. If the caller did not pick a direction, infer
-                // one — a deep, narrow graph is a pipeline and reads better left-to-right; a
-                // wide, shallow one is a tree and reads better top-to-bottom.
-                const direction = (_a = opts.direction) !== null && _a !== void 0 ? _a : (0, sugiyama_1.inferDirection)(nodes, edges);
-                const started = Date.now();
-                const result = (0, sugiyama_1.sugiyama)(nodes, edges, {
-                    direction,
-                    nodeSpacing: opts.nodeSpacing,
-                    rankSpacing: opts.rankSpacing,
-                    constraints: opts.semantic,
-                    iterations: opts.iterations,
-                });
-                let minX = Infinity;
-                let minY = Infinity;
-                let maxX = -Infinity;
-                let maxY = -Infinity;
-                for (const n of nodes) {
-                    const p = result.positions.get(n.id);
-                    if (!p)
-                        continue;
-                    minX = Math.min(minX, p.x);
-                    minY = Math.min(minY, p.y);
-                    maxX = Math.max(maxX, p.x + n.width);
-                    maxY = Math.max(maxY, p.y + n.height);
-                }
-                if (!Number.isFinite(minX)) {
-                    minX = minY = maxX = maxY = 0;
-                }
-                return {
-                    nodePositions: result.positions,
-                    bounds: { x: minX, y: minY, width: maxX - minX, height: maxY - minY },
-                    metadata: {
-                        algorithm: name,
-                        executionTime: Date.now() - started,
-                        direction,
-                        crossings: result.crossings,
-                        ranks: result.ranks,
-                        bends: result.bends,
-                    },
-                };
-            });
-        },
-    };
-}
-//# sourceMappingURL=layered-layout.js.map

package/src/libs/engine/src/layout/sugiyama/layered-layout.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"layered-layout.js","sourceRoot":"","sources":["../../../../../../../engine/src/layout/sugiyama/layered-layout.ts"],"names":[],"mappings":";AAAA,sEAAsE;AACtE,EAAE;AACF,8EAA8E;AAC9E,kFAAkF;AAClF,kFAAkF;AAClF,+EAA+E;AAC/E,yCAAyC;;AAuCzC,kDAmDC;;AArFD,yCAOoB;AASpB,mEAAmE;AACnE,SAAS,SAAS,CAAC,OAAqB;;IACtC,MAAM,KAAK,GAAmB,OAAO,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC3D,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK;QACnB,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM;KACtB,CAAC,CAAC,CAAC;IAEJ,MAAM,KAAK,GAAmB,EAAE,CAAC;IACjC,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC;QACtC,MAAM,MAAM,GAAG,MAAA,IAAI,CAAC,YAAY,mCAAI,MAAA,MAAA,OAAO,CAAC,eAAe,wDAAG,IAAI,CAAC,YAAY,CAAC,0CAAE,EAAE,CAAC;QACrF,MAAM,MAAM,GAAG,MAAA,IAAI,CAAC,YAAY,mCAAI,MAAA,MAAA,OAAO,CAAC,eAAe,wDAAG,IAAI,CAAC,YAAY,CAAC,0CAAE,EAAE,CAAC;QACrF,IAAI,CAAC,MAAM,IAAI,CAAC,MAAM;YAAE,SAAS;QACjC,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;IAC9C,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AAC1B,CAAC;AAED,SAAgB,mBAAmB,CAAC,IAAI,GAAG,SAAS;IAClD,OAAO;QACL,IAAI;QACE,KAAK,CAAC,OAAqB,EAAE,OAA6B;;;gBAC9D,MAAM,IAAI,GAAG,OAA+B,CAAC;gBAC7C,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC;gBAE5C,4EAA4E;gBAC5E,6EAA6E;gBAC7E,8DAA8D;gBAC9D,MAAM,SAAS,GAAoB,MAAA,IAAI,CAAC,SAAS,mCAAI,IAAA,yBAAc,EAAC,KAAK,EAAE,KAAK,CAAC,CAAC;gBAElF,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;gBAC3B,MAAM,MAAM,GAAG,IAAA,mBAAQ,EAAC,KAAK,EAAE,KAAK,EAAE;oBACpC,SAAS;oBACT,WAAW,EAAE,IAAI,CAAC,WAAW;oBAC7B,WAAW,EAAE,IAAI,CAAC,WAAW;oBAC7B,WAAW,EAAE,IAAI,CAAC,QAAQ;oBAC1B,UAAU,EAAE,IAAI,CAAC,UAAU;iBAC5B,CAAC,CAAC;gBAEH,IAAI,IAAI,GAAG,QAAQ,CAAC;gBACpB,IAAI,IAAI,GAAG,QAAQ,CAAC;gBACpB,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC;gBACrB,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC;gBACrB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;oBACtB,MAAM,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;oBACrC,IAAI,CAAC,CAAC;wBAAE,SAAS;oBACjB,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC3B,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC3B,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;oBACrC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;gBACxC,CAAC;gBACD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC3B,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC;gBAChC,CAAC;gBAED,OAAO;oBACL,aAAa,EAAE,MAAM,CAAC,SAAS;oBAC/B,MAAM,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,GAAG,IAAI,EAAE,MAAM,EAAE,IAAI,GAAG,IAAI,EAAE;oBACrE,QAAQ,EAAE;wBACR,SAAS,EAAE,IAAI;wBACf,aAAa,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,OAAO;wBACnC,SAAS;wBACT,SAAS,EAAE,MAAM,CAAC,SAAS;wBAC3B,KAAK,EAAE,MAAM,CAAC,KAAK;wBACnB,KAAK,EAAE,MAAM,CAAC,KAAK;qBACpB;iBACF,CAAC;YACJ,CAAC;SAAA;KACF,CAAC;AACJ,CAAC"}

package/src/libs/engine/src/layout/sugiyama/sugiyama.d.ts

@@ -1,91 +0,0 @@
-import type { LayoutRng } from '../rng';
-export type LayoutDirection = 'TB' | 'BT' | 'LR' | 'RL';
-export interface SugiyamaNode {
-    id: string;
-    width: number;
-    height: number;
-}
-export interface SugiyamaEdge {
-    id: string;
-    source: string;
-    target: string;
-}
-/**
- * Card 5's semantic constraints — honoured DURING the pipeline, not clamped after.
- * Every one of these is a decision taken in ranking or ordering.
- */
-export interface SemanticConstraints {
-    /** Groups of node ids that must share a rank/layer. Applied by contraction before ranking. */
-    sameRank?: string[][];
-    /** `[a, b]` means a must come before b within its layer (left-of in TB, above in LR). */
-    order?: Array<[string, string]>;
-    /** Node ids that must stay adjacent in the ordering — a cluster the sweeps may not split. */
-    keepTogether?: string[][];
-    /** Nodes pinned to a coordinate. Unlike the old clamp, everything else routes AROUND them. */
-    anchors?: Record<string, {
-        x?: number;
-        y?: number;
-    }>;
-}
-export interface SugiyamaOptions {
-    direction?: LayoutDirection;
-    /** Gap between nodes in the same layer. */
-    nodeSpacing?: number;
-    /** Gap between layers. */
-    rankSpacing?: number;
-    constraints?: SemanticConstraints;
-    /** Ordering sweeps. More = fewer crossings, diminishing fast. */
-    iterations?: number;
-    rng?: LayoutRng;
-}
-export interface SugiyamaResult {
-    positions: Map<string, {
-        x: number;
-        y: number;
-    }>;
-    /** Rank per node — Card 7's auto-selection and Card 6's incremental pass both want it. */
-    ranks: Map<string, number>;
-    /** Bend points for edges that span more than one rank (the dummy chains). */
-    bends: Map<string, Array<{
-        x: number;
-        y: number;
-    }>>;
-    /** Crossings in the final ordering — the headline quality number. */
-    crossings: number;
-    /** Deterministic work counters — regression tests bound these instead of wall clock. */
-    stats: SugiyamaStats;
-}
-/**
- * Work counters, filled on every run. They exist because "it got slow" is only
- * fixable when you can see WHERE the work went: a wide layer full of dummies made
- * the old transpose recount every inter-layer crossing twice per candidate swap
- * (O(width * E²) per pass), which is the difference between 40ms and being killed
- * at 25s on the same node count. The counters are pure functions of the input —
- * no wall clock — so CI can assert hard bounds without flaking.
- */
-export interface SugiyamaStats {
-    dummyCount: number;
-    layerCount: number;
-    maxLayerWidth: number;
-    /** transpose() while-passes actually run (bounded by guard × ordering iterations). */
-    transposePasses: number;
-    /** adjacent pairs considered for swapping, across all passes */
-    transposeSwapsEvaluated: number;
-    /** swaps that were kept because they reduced crossings */
-    transposeSwapsApplied: number;
-    /** elements pushed through inversion counting in countCrossings, across the run */
-    crossingCountOps: number;
-}
-/**
- * Lay out a graph in layers. Pure, deterministic, no DOM, no time, no randomness.
- */
-export declare function sugiyama(nodes: SugiyamaNode[], edges: SugiyamaEdge[], options?: SugiyamaOptions): SugiyamaResult;
-/**
- * Card 1: DIRECTION INFERENCE — "TB for trees, LR for pipelines".
- *
- * The heuristic, stated so it can be argued with: a graph that is deep and narrow
- * reads better across the page (a pipeline: A → B → C → D as a row, not a column),
- * and a graph that is wide and shallow reads better down it (a tree fans out).
- * The threshold is the aspect of the LAYER structure, not of the node count.
- */
-export declare function inferDirection(nodes: SugiyamaNode[], edges: SugiyamaEdge[]): LayoutDirection;