@antv/layout 1.2.0 → 1.2.2

package/lib/dagre/position/bk.js

@@ -0,0 +1,398 @@
+import { __assign, __read, __spreadArray } from "tslib";
+/*
+ * This module provides coordinate assignment based on Brandes and Köpf, "Fast
+ * and Simple Horizontal Coordinate Assignment."
+ */
+import { Graph } from "@antv/graphlib";
+import { buildLayerMatrix, minBy } from "../util";
+export var findType1Conflicts = function (g, layering) {
+    var conflicts = {};
+    var visitLayer = function (prevLayer, layer) {
+        // last visited node in the previous layer that is incident on an inner
+        // segment.
+        var k0 = 0;
+        // Tracks the last node in this layer scanned for crossings with a type-1
+        // segment.
+        var scanPos = 0;
+        var prevLayerLength = prevLayer.length;
+        var lastNode = layer === null || layer === void 0 ? void 0 : layer[(layer === null || layer === void 0 ? void 0 : layer.length) - 1];
+        layer === null || layer === void 0 ? void 0 : layer.forEach(function (v, i) {
+            var _a;
+            var w = findOtherInnerSegmentNode(g, v);
+            var k1 = w ? g.getNode(w.id).data.order : prevLayerLength;
+            if (w || v === lastNode) {
+                (_a = layer.slice(scanPos, i + 1)) === null || _a === void 0 ? void 0 : _a.forEach(function (scanNode) {
+                    var _a;
+                    (_a = g.getPredecessors(scanNode)) === null || _a === void 0 ? void 0 : _a.forEach(function (u) {
+                        var _a;
+                        var uLabel = g.getNode(u.id);
+                        var uPos = uLabel.data.order;
+                        if ((uPos < k0 || k1 < uPos) &&
+                            !(uLabel.data.dummy && ((_a = g.getNode(scanNode)) === null || _a === void 0 ? void 0 : _a.data.dummy))) {
+                            addConflict(conflicts, u.id, scanNode);
+                        }
+                    });
+                });
+                scanPos = i + 1;
+                k0 = k1;
+            }
+        });
+        return layer;
+    };
+    if (layering === null || layering === void 0 ? void 0 : layering.length) {
+        layering.reduce(visitLayer);
+    }
+    return conflicts;
+};
+export var findType2Conflicts = function (g, layering) {
+    var conflicts = {};
+    function scan(south, southPos, southEnd, prevNorthBorder, nextNorthBorder) {
+        var _a, _b;
+        var v;
+        for (var i = southPos; i < southEnd; i++) {
+            v = south[i];
+            if ((_a = g.getNode(v)) === null || _a === void 0 ? void 0 : _a.data.dummy) {
+                (_b = g.getPredecessors(v)) === null || _b === void 0 ? void 0 : _b.forEach(function (u) {
+                    var uNode = g.getNode(u.id);
+                    if (uNode.data.dummy &&
+                        (uNode.data.order < prevNorthBorder ||
+                            uNode.data.order > nextNorthBorder)) {
+                        addConflict(conflicts, u.id, v);
+                    }
+                });
+            }
+        }
+    }
+    function getScannedKey(params) {
+        // south数组可能很大，不适合做key
+        return JSON.stringify(params.slice(1));
+    }
+    function scanIfNeeded(params, scanCache) {
+        var cacheKey = getScannedKey(params);
+        if (scanCache.get(cacheKey))
+            return;
+        scan.apply(void 0, __spreadArray([], __read(params)));
+        scanCache.set(cacheKey, true);
+    }
+    var visitLayer = function (north, south) {
+        var prevNorthPos = -1;
+        var nextNorthPos;
+        var southPos = 0;
+        var scanned = new Map();
+        south === null || south === void 0 ? void 0 : south.forEach(function (v, southLookahead) {
+            var _a;
+            if (((_a = g.getNode(v)) === null || _a === void 0 ? void 0 : _a.data.dummy) === "border") {
+                var predecessors = g.getPredecessors(v) || [];
+                if (predecessors.length) {
+                    nextNorthPos = g.getNode(predecessors[0].id).data.order;
+                    scanIfNeeded([south, southPos, southLookahead, prevNorthPos, nextNorthPos], scanned);
+                    southPos = southLookahead;
+                    prevNorthPos = nextNorthPos;
+                }
+            }
+            scanIfNeeded([south, southPos, south.length, nextNorthPos, north.length], scanned);
+        });
+        return south;
+    };
+    if (layering === null || layering === void 0 ? void 0 : layering.length) {
+        layering.reduce(visitLayer);
+    }
+    return conflicts;
+};
+export var findOtherInnerSegmentNode = function (g, v) {
+    var _a, _b;
+    if ((_a = g.getNode(v)) === null || _a === void 0 ? void 0 : _a.data.dummy) {
+        return (_b = g.getPredecessors(v)) === null || _b === void 0 ? void 0 : _b.find(function (u) { return g.getNode(u.id).data.dummy; });
+    }
+};
+export var addConflict = function (conflicts, v, w) {
+    var vv = v;
+    var ww = w;
+    if (vv > ww) {
+        var tmp = vv;
+        vv = ww;
+        ww = tmp;
+    }
+    var conflictsV = conflicts[vv];
+    if (!conflictsV) {
+        conflicts[vv] = conflictsV = {};
+    }
+    conflictsV[ww] = true;
+};
+export var hasConflict = function (conflicts, v, w) {
+    var vv = v;
+    var ww = w;
+    if (vv > ww) {
+        var tmp = v;
+        vv = ww;
+        ww = tmp;
+    }
+    return !!conflicts[vv];
+};
+/*
+ * Try to align nodes into vertical "blocks" where possible. This algorithm
+ * attempts to align a node with one of its median neighbors. If the edge
+ * connecting a neighbor is a type-1 conflict then we ignore that possibility.
+ * If a previous node has already formed a block with a node after the node
+ * we're trying to form a block with, we also ignore that possibility - our
+ * blocks would be split in that scenario.
+ */
+export var verticalAlignment = function (g, layering, conflicts, neighborFn) {
+    var root = {};
+    var align = {};
+    var pos = {};
+    // We cache the position here based on the layering because the graph and
+    // layering may be out of sync. The layering matrix is manipulated to
+    // generate different extreme alignments.
+    layering === null || layering === void 0 ? void 0 : layering.forEach(function (layer) {
+        layer === null || layer === void 0 ? void 0 : layer.forEach(function (v, order) {
+            root[v] = v;
+            align[v] = v;
+            pos[v] = order;
+        });
+    });
+    layering === null || layering === void 0 ? void 0 : layering.forEach(function (layer) {
+        var prevIdx = -1;
+        layer === null || layer === void 0 ? void 0 : layer.forEach(function (v) {
+            var ws = neighborFn(v).map(function (n) { return n.id; });
+            if (ws.length) {
+                ws = ws.sort(function (a, b) { return pos[a] - pos[b]; });
+                var mp = (ws.length - 1) / 2;
+                for (var i = Math.floor(mp), il = Math.ceil(mp); i <= il; ++i) {
+                    var w = ws[i];
+                    if (align[v] === v &&
+                        prevIdx < pos[w] &&
+                        !hasConflict(conflicts, v, w)) {
+                        align[w] = v;
+                        align[v] = root[v] = root[w];
+                        prevIdx = pos[w];
+                    }
+                }
+            }
+        });
+    });
+    return { root: root, align: align };
+};
+export var horizontalCompaction = function (g, layering, root, align, nodesep, edgesep, reverseSep) {
+    var _a;
+    // This portion of the algorithm differs from BK due to a number of problems.
+    // Instead of their algorithm we construct a new block graph and do two
+    // sweeps. The first sweep places blocks with the smallest possible
+    // coordinates. The second sweep removes unused space by moving blocks to the
+    // greatest coordinates without violating separation.
+    var xs = {};
+    var blockG = buildBlockGraph(g, layering, root, nodesep, edgesep, reverseSep);
+    var borderType = reverseSep ? "borderLeft" : "borderRight";
+    var iterate = function (setXsFunc, nextNodesFunc) {
+        var stack = blockG.getAllNodes();
+        var elem = stack.pop();
+        var visited = {};
+        while (elem) {
+            if (visited[elem.id]) {
+                setXsFunc(elem.id);
+            }
+            else {
+                visited[elem.id] = true;
+                stack.push(elem);
+                stack = stack.concat(nextNodesFunc(elem.id));
+            }
+            elem = stack.pop();
+        }
+    };
+    // First pass, assign smallest coordinates
+    var pass1 = function (elem) {
+        xs[elem] = (blockG.getRelatedEdges(elem, "in") || []).reduce(function (acc, e) {
+            return Math.max(acc, (xs[e.source] || 0) + e.data.weight);
+        }, 0);
+    };
+    // Second pass, assign greatest coordinates
+    var pass2 = function (elem) {
+        var min = (blockG.getRelatedEdges(elem, "out") || []).reduce(function (acc, e) {
+            return Math.min(acc, (xs[e.target] || 0) - e.data.weight);
+        }, Number.POSITIVE_INFINITY);
+        var node = g.getNode(elem);
+        if (min !== Number.POSITIVE_INFINITY &&
+            node.data.borderType !== borderType) {
+            xs[elem] = Math.max(xs[elem], min);
+        }
+    };
+    iterate(pass1, blockG.getPredecessors.bind(blockG));
+    iterate(pass2, blockG.getSuccessors.bind(blockG));
+    // Assign x coordinates to all nodes
+    (_a = Object.values(align)) === null || _a === void 0 ? void 0 : _a.forEach(function (v) {
+        xs[v] = xs[root[v]];
+    });
+    return xs;
+};
+export var buildBlockGraph = function (g, layering, root, nodesep, edgesep, reverseSep) {
+    var blockGraph = new Graph();
+    var sepFn = sep(nodesep, edgesep, reverseSep);
+    layering === null || layering === void 0 ? void 0 : layering.forEach(function (layer) {
+        var u;
+        layer === null || layer === void 0 ? void 0 : layer.forEach(function (v) {
+            var vRoot = root[v];
+            if (!blockGraph.hasNode(vRoot)) {
+                blockGraph.addNode({
+                    id: vRoot,
+                    data: {},
+                });
+            }
+            if (u) {
+                var uRoot = root[u];
+                var edge = blockGraph
+                    .getRelatedEdges(uRoot, "out")
+                    .find(function (edge) { return edge.target === vRoot; });
+                if (!edge) {
+                    blockGraph.addEdge({
+                        id: "e" + Math.random(),
+                        source: uRoot,
+                        target: vRoot,
+                        data: {
+                            weight: Math.max(sepFn(g, v, u), 0),
+                        },
+                    });
+                }
+                else {
+                    blockGraph.updateEdgeData(edge.id, __assign(__assign({}, edge.data), { weight: Math.max(sepFn(g, v, u), edge.data.weight || 0) }));
+                }
+            }
+            u = v;
+        });
+    });
+    return blockGraph;
+};
+/*
+ * Returns the alignment that has the smallest width of the given alignments.
+ */
+export var findSmallestWidthAlignment = function (g, xss) {
+    return minBy(Object.values(xss), function (xs) {
+        var _a;
+        var max = Number.NEGATIVE_INFINITY;
+        var min = Number.POSITIVE_INFINITY;
+        (_a = Object.keys(xs)) === null || _a === void 0 ? void 0 : _a.forEach(function (v) {
+            var x = xs[v];
+            var halfWidth = width(g, v) / 2;
+            max = Math.max(x + halfWidth, max);
+            min = Math.min(x - halfWidth, min);
+        });
+        return max - min;
+    });
+};
+/*
+ * Align the coordinates of each of the layout alignments such that
+ * left-biased alignments have their minimum coordinate at the same point as
+ * the minimum coordinate of the smallest width alignment and right-biased
+ * alignments have their maximum coordinate at the same point as the maximum
+ * coordinate of the smallest width alignment.
+ */
+export function alignCoordinates(xss, alignTo) {
+    var alignToVals = Object.values(alignTo);
+    var alignToMin = Math.min.apply(Math, __spreadArray([], __read(alignToVals)));
+    var alignToMax = Math.max.apply(Math, __spreadArray([], __read(alignToVals)));
+    ["u", "d"].forEach(function (vert) {
+        ["l", "r"].forEach(function (horiz) {
+            var alignment = vert + horiz;
+            var xs = xss[alignment];
+            var delta;
+            if (xs === alignTo)
+                return;
+            var xsVals = Object.values(xs);
+            delta =
+                horiz === "l"
+                    ? alignToMin - Math.min.apply(Math, __spreadArray([], __read(xsVals)))
+                    : alignToMax - Math.max.apply(Math, __spreadArray([], __read(xsVals)));
+            if (delta) {
+                xss[alignment] = {};
+                Object.keys(xs).forEach(function (key) {
+                    xss[alignment][key] = xs[key] + delta;
+                });
+            }
+        });
+    });
+}
+export var balance = function (xss, align) {
+    var result = {};
+    Object.keys(xss.ul).forEach(function (key) {
+        if (align) {
+            result[key] = xss[align.toLowerCase()][key];
+        }
+        else {
+            var values = Object.values(xss).map(function (x) { return x[key]; });
+            result[key] = (values[0] + values[1]) / 2; // (ur + ul) / 2
+        }
+    });
+    return result;
+};
+export var positionX = function (g, options) {
+    var _a = options || {}, graphAlign = _a.align, _b = _a.nodesep, nodesep = _b === void 0 ? 0 : _b, _c = _a.edgesep, edgesep = _c === void 0 ? 0 : _c;
+    var layering = buildLayerMatrix(g);
+    var conflicts = Object.assign(findType1Conflicts(g, layering), findType2Conflicts(g, layering));
+    var xss = {};
+    var adjustedLayering;
+    ["u", "d"].forEach(function (vert) {
+        adjustedLayering =
+            vert === "u" ? layering : Object.values(layering).reverse();
+        ["l", "r"].forEach(function (horiz) {
+            if (horiz === "r") {
+                adjustedLayering = adjustedLayering.map(function (inner) {
+                    return Object.values(inner).reverse();
+                });
+            }
+            var neighborFn = (vert === "u" ? g.getPredecessors : g.getSuccessors).bind(g);
+            var align = verticalAlignment(g, adjustedLayering, conflicts, neighborFn);
+            var xs = horizontalCompaction(g, adjustedLayering, align.root, align.align, nodesep, edgesep, horiz === "r");
+            if (horiz === "r") {
+                Object.keys(xs).forEach(function (key) {
+                    xs[key] = -xs[key];
+                });
+            }
+            xss[vert + horiz] = xs;
+        });
+    });
+    var smallestWidth = findSmallestWidthAlignment(g, xss);
+    alignCoordinates(xss, smallestWidth);
+    return balance(xss, graphAlign);
+};
+export var sep = function (nodeSep, edgeSep, reverseSep) {
+    return function (g, v, w) {
+        var vLabel = g.getNode(v);
+        var wLabel = g.getNode(w);
+        var sum = 0;
+        var delta = 0;
+        sum += vLabel.data.width / 2;
+        if (vLabel.data.hasOwnProperty("labelpos")) {
+            switch ((vLabel.data.labelpos || "").toLowerCase()) {
+                case "l":
+                    delta = -vLabel.data.width / 2;
+                    break;
+                case "r":
+                    delta = vLabel.data.width / 2;
+                    break;
+            }
+        }
+        if (delta) {
+            sum += reverseSep ? delta : -delta;
+        }
+        delta = 0;
+        sum += (vLabel.data.dummy ? edgeSep : nodeSep) / 2;
+        sum += (wLabel.data.dummy ? edgeSep : nodeSep) / 2;
+        sum += wLabel.data.width / 2;
+        if (wLabel.data.labelpos) {
+            switch ((wLabel.data.labelpos || "").toLowerCase()) {
+                case "l":
+                    delta = wLabel.data.width / 2;
+                    break;
+                case "r":
+                    delta = -wLabel.data.width / 2;
+                    break;
+            }
+        }
+        if (delta) {
+            sum += reverseSep ? delta : -delta;
+        }
+        delta = 0;
+        return sum;
+    };
+};
+export var width = function (g, v) { return g.getNode(v).data.width || 0; };
+//# sourceMappingURL=bk.js.map

package/lib/dagre/position/bk.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bk.js","sourceRoot":"","sources":["../../../src/dagre/position/bk.ts"],"names":[],"mappings":";AAAA;;;GAGG;AACH,OAAO,EAAE,KAAK,EAAY,MAAM,gBAAgB,CAAC;AAEjD,OAAO,EAAE,gBAAgB,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAsBlD,MAAM,CAAC,IAAM,kBAAkB,GAAG,UAAC,CAAS,EAAE,QAAiB;IAC7D,IAAM,SAAS,GAAG,EAAE,CAAC;IAErB,IAAM,UAAU,GAAG,UAAC,SAAe,EAAE,KAAW;QAC9C,uEAAuE;QACvE,WAAW;QACX,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,yEAAyE;QACzE,WAAW;QACX,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,IAAM,eAAe,GAAG,SAAS,CAAC,MAAM,CAAC;QACzC,IAAM,QAAQ,GAAG,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAG,CAAA,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,MAAM,IAAG,CAAC,CAAC,CAAC;QAE5C,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,OAAO,CAAC,UAAC,CAAK,EAAE,CAAS;;YAC9B,IAAM,CAAC,GAAG,yBAAyB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,IAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC,IAAI,CAAC,KAAM,CAAC,CAAC,CAAC,eAAe,CAAC;YAE9D,IAAI,CAAC,IAAI,CAAC,KAAK,QAAQ,EAAE;gBACvB,MAAA,KAAK,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,0CAAE,OAAO,CAAC,UAAC,QAAQ;;oBAC5C,MAAA,CAAC,CAAC,eAAe,CAAC,QAAQ,CAAC,0CAAE,OAAO,CAAC,UAAC,CAAC;;wBACrC,IAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC;wBAChC,IAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,KAAM,CAAC;wBAChC,IACE,CAAC,IAAI,GAAG,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;4BACxB,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,KAAI,MAAA,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,0CAAE,IAAI,CAAC,KAAK,CAAA,CAAC,EACvD;4BACA,WAAW,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;yBACxC;oBACH,CAAC,CAAC,CAAC;gBACL,CAAC,CAAC,CAAC;gBACH,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC;gBAChB,EAAE,GAAG,EAAE,CAAC;aACT;QACH,CAAC,CAAC,CAAC;QAEH,OAAO,KAAK,CAAC;IACf,CAAC,CAAC;IAEF,IAAI,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,MAAM,EAAE;QACpB,QAAQ,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;KAC7B;IACD,OAAO,SAAS,CAAC;AACnB,CAAC,CAAC;AAEF,MAAM,CAAC,IAAM,kBAAkB,GAAG,UAAC,CAAS,EAAE,QAAiB;IAC7D,IAAM,SAAS,GAAG,EAAE,CAAC;IAErB,SAAS,IAAI,CACX,KAAe,EACf,QAAgB,EAChB,QAAgB,EAChB,eAAuB,EACvB,eAAuB;;QAEvB,IAAI,CAAS,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,QAAQ,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE;YACxC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACb,IAAI,MAAA,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,0CAAE,IAAI,CAAC,KAAK,EAAE;gBAC5B,MAAA,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,0CAAE,OAAO,CAAC,UAAC,CAAC;oBAC9B,IAAM,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC;oBAC/B,IACE,KAAK,CAAC,IAAI,CAAC,KAAK;wBAChB,CAAC,KAAK,CAAC,IAAI,CAAC,KAAM,GAAG,eAAe;4BAClC,KAAK,CAAC,IAAI,CAAC,KAAM,GAAG,eAAe,CAAC,EACtC;wBACA,WAAW,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;qBACjC;gBACH,CAAC,CAAC,CAAC;aACJ;SACF;IACH,CAAC;IAED,SAAS,aAAa,CAAC,MAA+B;QACpD,sBAAsB;QACtB,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACzC,CAAC;IAED,SAAS,YAAY,CACnB,MAA+B,EAC/B,SAA+B;QAE/B,IAAM,QAAQ,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;QAEvC,IAAI,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC;YAAE,OAAO;QAEpC,IAAI,wCAAI,MAAM,IAAE;QAChB,SAAS,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IAChC,CAAC;IAED,IAAM,UAAU,GAAG,UAAC,KAAe,EAAE,KAAe;QAClD,IAAI,YAAY,GAAG,CAAC,CAAC,CAAC;QACtB,IAAI,YAAoB,CAAC;QACzB,IAAI,QAAQ,GAAG,CAAC,CAAC;QAEjB,IAAM,OAAO,GAAG,IAAI,GAAG,EAAmB,CAAC;QAE3C,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,OAAO,CAAC,UAAC,CAAS,EAAE,cAAsB;;YAC/C,IAAI,CAAA,MAAA,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,0CAAE,IAAI,CAAC,KAAK,MAAK,QAAQ,EAAE;gBACzC,IAAM,YAAY,GAAG,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;gBAChD,IAAI,YAAY,CAAC,MAAM,EAAE;oBACvB,YAAY,GAAG,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC,IAAI,CAAC,KAAM,CAAC;oBAC1D,YAAY,CACV,CAAC,KAAK,EAAE,QAAQ,EAAE,cAAc,EAAE,YAAY,EAAE,YAAY,CAAC,EAC7D,OAAO,CACR,CAAC;oBACF,QAAQ,GAAG,cAAc,CAAC;oBAC1B,YAAY,GAAG,YAAY,CAAC;iBAC7B;aACF;YACD,YAAY,CACV,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,CAAC,MAAM,EAAE,YAAY,EAAE,KAAK,CAAC,MAAM,CAAC,EAC3D,OAAO,CACR,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,OAAO,KAAK,CAAC;IACf,CAAC,CAAC;IAEF,IAAI,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,MAAM,EAAE;QACpB,QAAQ,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;KAC7B;IACD,OAAO,SAAS,CAAC;AACnB,CAAC,CAAC;AAEF,MAAM,CAAC,IAAM,yBAAyB,GAAG,UAAC,CAAS,EAAE,CAAK;;IACxD,IAAI,MAAA,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,0CAAE,IAAI,CAAC,KAAK,EAAE;QAC5B,OAAO,MAAA,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,0CAAE,IAAI,CAAC,UAAC,CAAC,IAAK,OAAA,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,EAA1B,CAA0B,CAAC,CAAC;KACtE;AACH,CAAC,CAAC;AAEF,MAAM,CAAC,IAAM,WAAW,GAAG,UAAC,SAAoB,EAAE,CAAK,EAAE,CAAK;IAC5D,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,EAAE,EAAE;QACX,IAAM,GAAG,GAAG,EAAE,CAAC;QACf,EAAE,GAAG,EAAE,CAAC;QACR,EAAE,GAAG,GAAG,CAAC;KACV;IAED,IAAI,UAAU,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC;IAC/B,IAAI,CAAC,UAAU,EAAE;QACf,SAAS,CAAC,EAAE,CAAC,GAAG,UAAU,GAAG,EAAE,CAAC;KACjC;IACD,UAAU,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;AACxB,CAAC,CAAC;AAEF,MAAM,CAAC,IAAM,WAAW,GAAG,UAAC,SAAoB,EAAE,CAAK,EAAE,CAAK;IAC5D,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,EAAE,EAAE;QACX,IAAM,GAAG,GAAG,CAAC,CAAC;QACd,EAAE,GAAG,EAAE,CAAC;QACR,EAAE,GAAG,GAAG,CAAC;KACV;IACD,OAAO,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;AACzB,CAAC,CAAC;AAEF;;;;;;;GAOG;AACH,MAAM,CAAC,IAAM,iBAAiB,GAAG,UAC/B,CAAS,EACT,QAAgB,EAChB,SAAoB,EACpB,UAAuC;IAEvC,IAAM,IAAI,GAAmB,EAAE,CAAC;IAChC,IAAM,KAAK,GAAmB,EAAE,CAAC;IACjC,IAAM,GAAG,GAAuB,EAAE,CAAC;IAEnC,yEAAyE;IACzE,qEAAqE;IACrE,yCAAyC;IACzC,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,OAAO,CAAC,UAAC,KAAK;QACtB,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,OAAO,CAAC,UAAC,CAAC,EAAE,KAAa;YAC9B,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACZ,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACb,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;QACjB,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,OAAO,CAAC,UAAC,KAAK;QACtB,IAAI,OAAO,GAAG,CAAC,CAAC,CAAC;QACjB,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,OAAO,CAAC,UAAC,CAAC;YACf,IAAI,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,UAAC,CAAC,IAAK,OAAA,CAAC,CAAC,EAAE,EAAJ,CAAI,CAAC,CAAC;YAExC,IAAI,EAAE,CAAC,MAAM,EAAE;gBACb,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,UAAC,CAAK,EAAE,CAAK,IAAK,OAAA,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,EAAf,CAAe,CAAC,CAAC;gBAChD,IAAM,EAAE,GAAG,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;gBAC/B,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,EAAE;oBAC7D,IAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;oBAChB,IACE,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;wBACd,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC;wBAChB,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC,EAC7B;wBACA,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;wBACb,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;wBAC7B,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;qBAClB;iBACF;aACF;QACH,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,OAAO,EAAE,IAAI,MAAA,EAAE,KAAK,OAAA,EAAE,CAAC;AACzB,CAAC,CAAC;AAEF,MAAM,CAAC,IAAM,oBAAoB,GAAG,UAClC,CAAS,EACT,QAAgB,EAChB,IAAoB,EACpB,KAAqB,EACrB,OAAe,EACf,OAAe,EACf,UAAoB;;IAEpB,6EAA6E;IAC7E,uEAAuE;IACvE,mEAAmE;IACnE,6EAA6E;IAC7E,qDAAqD;IACrD,IAAM,EAAE,GAAuB,EAAE,CAAC;IAClC,IAAM,MAAM,GAAG,eAAe,CAC5B,CAAC,EACD,QAAQ,EACR,IAAI,EACJ,OAAO,EACP,OAAO,EACP,UAAU,CACX,CAAC;IACF,IAAM,UAAU,GAAG,UAAU,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,aAAa,CAAC;IAE7D,IAAM,OAAO,GAAG,UACd,SAA8B,EAC9B,aAA4C;QAE5C,IAAI,KAAK,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;QACjC,IAAI,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;QACvB,IAAM,OAAO,GAAwB,EAAE,CAAC;QACxC,OAAO,IAAI,EAAE;YACX,IAAI,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;gBACpB,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;aACpB;iBAAM;gBACL,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;gBACxB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACjB,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;aAC9C;YAED,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;SACpB;IACH,CAAC,CAAC;IAEF,0CAA0C;IAC1C,IAAM,KAAK,GAAG,UAAC,IAAQ;QACrB,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAC1D,UAAC,GAAW,EAAE,CAAC;YACb,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,MAAO,CAAC,CAAC;QAC7D,CAAC,EACD,CAAC,CACF,CAAC;IACJ,CAAC,CAAC;IAEF,2CAA2C;IAC3C,IAAM,KAAK,GAAG,UAAC,IAAQ;QACrB,IAAM,GAAG,GAAG,CAAC,MAAM,CAAC,eAAe,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAC5D,UAAC,GAAW,EAAE,CAAC;YACb,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,MAAO,CAAC,CAAC;QAC7D,CAAC,EACD,MAAM,CAAC,iBAAiB,CACzB,CAAC;QAEF,IAAM,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAE,CAAC;QAC9B,IACE,GAAG,KAAK,MAAM,CAAC,iBAAiB;YAChC,IAAI,CAAC,IAAI,CAAC,UAAU,KAAK,UAAU,EACnC;YACA,EAAE,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;SACpC;IACH,CAAC,CAAC;IAEF,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IACpD,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAElD,oCAAoC;IACpC,MAAA,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,0CAAE,OAAO,CAAC,UAAC,CAAC;QAC9B,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC,CAAC,CAAC;IAEH,OAAO,EAAE,CAAC;AACZ,CAAC,CAAC;AAEF,MAAM,CAAC,IAAM,eAAe,GAAG,UAC7B,CAAS,EACT,QAAgB,EAChB,IAAoB,EACpB,OAAe,EACf,OAAe,EACf,UAAoB;IAEpB,IAAM,UAAU,GAAG,IAAI,KAAK,EAAsB,CAAC;IACnD,IAAM,KAAK,GAAG,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,UAAqB,CAAC,CAAC;IAE3D,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,OAAO,CAAC,UAAC,KAAK;QACtB,IAAI,CAAK,CAAC;QACV,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,OAAO,CAAC,UAAC,CAAC;YACf,IAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;gBAC9B,UAAU,CAAC,OAAO,CAAC;oBACjB,EAAE,EAAE,KAAK;oBACT,IAAI,EAAE,EAAE;iBACT,CAAC,CAAC;aACJ;YACD,IAAI,CAAC,EAAE;gBACL,IAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;gBAEtB,IAAM,IAAI,GAAG,UAAU;qBACpB,eAAe,CAAC,KAAK,EAAE,KAAK,CAAC;qBAC7B,IAAI,CAAC,UAAC,IAAI,IAAK,OAAA,IAAI,CAAC,MAAM,KAAK,KAAK,EAArB,CAAqB,CAAC,CAAC;gBACzC,IAAI,CAAC,IAAI,EAAE;oBACT,UAAU,CAAC,OAAO,CAAC;wBACjB,EAAE,EAAE,MAAI,IAAI,CAAC,MAAM,EAAI;wBACvB,MAAM,EAAE,KAAK;wBACb,MAAM,EAAE,KAAK;wBACb,IAAI,EAAE;4BACJ,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;yBACpC;qBACF,CAAC,CAAC;iBACJ;qBAAM;oBACL,UAAU,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,wBAC5B,IAAI,CAAC,IAAI,KACZ,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,MAAO,IAAI,CAAC,CAAC,IACxD,CAAC;iBACJ;aACF;YACD,CAAC,GAAG,CAAC,CAAC;QACR,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,OAAO,UAAU,CAAC;AACpB,CAAC,CAAC;AACF;;GAEG;AACH,MAAM,CAAC,IAAM,0BAA0B,GAAG,UACxC,CAAS,EACT,GAA2C;IAE3C,OAAO,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,UAAC,EAAE;;QAClC,IAAI,GAAG,GAAG,MAAM,CAAC,iBAAiB,CAAC;QACnC,IAAI,GAAG,GAAG,MAAM,CAAC,iBAAiB,CAAC;QAEnC,MAAA,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,0CAAE,OAAO,CAAC,UAAC,CAAS;YACjC,IAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YAChB,IAAM,SAAS,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;YAElC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,EAAE,GAAG,CAAC,CAAC;YACnC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,EAAE,GAAG,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;QAEH,OAAO,GAAG,GAAG,GAAG,CAAC;IACnB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,UAAU,gBAAgB,CAC9B,GAA2C,EAC3C,OAA+B;IAE/B,IAAM,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IAC3C,IAAM,UAAU,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,2BAAQ,WAAW,GAAC,CAAC;IAC5C,IAAM,UAAU,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,2BAAQ,WAAW,GAAC,CAAC;IAE5C,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,UAAC,IAAI;QACtB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,UAAC,KAAK;YACvB,IAAM,SAAS,GAAG,IAAI,GAAG,KAAK,CAAC;YAC/B,IAAM,EAAE,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC;YAC1B,IAAI,KAAa,CAAC;YAClB,IAAI,EAAE,KAAK,OAAO;gBAAE,OAAO;YAE3B,IAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACjC,KAAK;gBACH,KAAK,KAAK,GAAG;oBACX,CAAC,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,2BAAQ,MAAM,GAAC;oBAClC,CAAC,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,2BAAQ,MAAM,GAAC,CAAC;YAEvC,IAAI,KAAK,EAAE;gBACT,GAAG,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC;gBACpB,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,UAAC,GAAG;oBAC1B,GAAG,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;gBACxC,CAAC,CAAC,CAAC;aACJ;QACH,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC;AAED,MAAM,CAAC,IAAM,OAAO,GAAG,UACrB,GAA2C,EAC3C,KAAkB;IAElB,IAAM,MAAM,GAA2B,EAAE,CAAC;IAC1C,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,UAAC,GAAG;QAC9B,IAAI,KAAK,EAAE;YACT,MAAM,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;SAC7C;aAAM;YACL,IAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,UAAC,CAAC,IAAK,OAAA,CAAC,CAAC,GAAG,CAAC,EAAN,CAAM,CAAC,CAAC;YACrD,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,gBAAgB;SAC5D;IACH,CAAC,CAAC,CAAC;IACH,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF,MAAM,CAAC,IAAM,SAAS,GAAG,UACvB,CAAS,EACT,OAIE;IAEI,IAAA,KAAkD,OAAO,IAAI,EAAE,EAAtD,UAAU,WAAA,EAAE,eAAW,EAAX,OAAO,mBAAG,CAAC,KAAA,EAAE,eAAW,EAAX,OAAO,mBAAG,CAAC,KAAkB,CAAC;IAEtE,IAAM,QAAQ,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;IACrC,IAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAC7B,kBAAkB,CAAC,CAAC,EAAE,QAAQ,CAAC,EAC/B,kBAAkB,CAAC,CAAC,EAAE,QAAQ,CAAC,CAChC,CAAC;IAEF,IAAM,GAAG,GAAuC,EAAE,CAAC;IACnD,IAAI,gBAAwB,CAAC;IAC7B,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,UAAC,IAAI;QACtB,gBAAgB;YACd,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,OAAO,EAAE,CAAC;QAC9D,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,UAAC,KAAK;YACvB,IAAI,KAAK,KAAK,GAAG,EAAE;gBACjB,gBAAgB,GAAG,gBAAgB,CAAC,GAAG,CAAC,UAAC,KAAK;oBAC5C,OAAA,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE;gBAA9B,CAA8B,CAC/B,CAAC;aACH;YAED,IAAM,UAAU,GAAG,CACjB,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CACnD,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACV,IAAM,KAAK,GAAG,iBAAiB,CAC7B,CAAC,EACD,gBAAgB,EAChB,SAAS,EACT,UAAU,CACX,CAAC;YACF,IAAM,EAAE,GAAG,oBAAoB,CAC7B,CAAC,EACD,gBAAgB,EAChB,KAAK,CAAC,IAAI,EACV,KAAK,CAAC,KAAK,EACX,OAAO,EACP,OAAO,EACP,KAAK,KAAK,GAAG,CACd,CAAC;YACF,IAAI,KAAK,KAAK,GAAG,EAAE;gBACjB,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,UAAC,GAAG;oBAC1B,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;gBACrB,CAAC,CAAC,CAAC;aACJ;YACD,GAAG,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;QACzB,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAM,aAAa,GAAG,0BAA0B,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACzD,gBAAgB,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC;IACrC,OAAO,OAAO,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;AAClC,CAAC,CAAC;AAEF,MAAM,CAAC,IAAM,GAAG,GAAG,UAAC,OAAe,EAAE,OAAe,EAAE,UAAmB;IACvE,OAAO,UAAC,CAAS,EAAE,CAAK,EAAE,CAAK;QAC7B,IAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC;QAC7B,IAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC;QAC7B,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,KAAK,GAAW,CAAC,CAAC;QAEtB,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,KAAM,GAAG,CAAC,CAAC;QAC9B,IAAI,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,UAAU,CAAC,EAAE;YAC1C,QAAQ,CAAE,MAAM,CAAC,IAAI,CAAC,QAAmB,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,EAAE;gBAC9D,KAAK,GAAG;oBACN,KAAK,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,KAAM,GAAG,CAAC,CAAC;oBAChC,MAAM;gBACR,KAAK,GAAG;oBACN,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,KAAM,GAAG,CAAC,CAAC;oBAC/B,MAAM;aACT;SACF;QACD,IAAI,KAAK,EAAE;YACT,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;SACpC;QACD,KAAK,GAAG,CAAC,CAAC;QAEV,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACnD,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAEnD,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,KAAM,GAAG,CAAC,CAAC;QAC9B,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE;YACxB,QAAQ,CAAE,MAAM,CAAC,IAAI,CAAC,QAAmB,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,EAAE;gBAC9D,KAAK,GAAG;oBACN,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,KAAM,GAAG,CAAC,CAAC;oBAC/B,MAAM;gBACR,KAAK,GAAG;oBACN,KAAK,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,KAAM,GAAG,CAAC,CAAC;oBAChC,MAAM;aACT;SACF;QACD,IAAI,KAAK,EAAE;YACT,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;SACpC;QACD,KAAK,GAAG,CAAC,CAAC;QAEV,OAAO,GAAG,CAAC;IACb,CAAC,CAAC;AACJ,CAAC,CAAC;AAEF,MAAM,CAAC,IAAM,KAAK,GAAG,UAAC,CAAS,EAAE,CAAK,IAAK,OAAA,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,KAAM,IAAI,CAAC,EAA9B,CAA8B,CAAC"}

package/lib/dagre/position/index.js

@@ -0,0 +1,54 @@
+import { __read, __spreadArray } from "tslib";
+import { asNonCompoundGraph, buildLayerMatrix } from "../util";
+import { alignCoordinates, balance, findSmallestWidthAlignment, findType1Conflicts, findType2Conflicts, horizontalCompaction, verticalAlignment, } from "./bk";
+var positionY = function (g, options) {
+    var _a = (options || {}).ranksep, ranksep = _a === void 0 ? 0 : _a;
+    var layering = buildLayerMatrix(g);
+    var prevY = 0;
+    layering === null || layering === void 0 ? void 0 : layering.forEach(function (layer) {
+        var heights = layer.map(function (v) { return g.getNode(v).data.height; });
+        var maxHeight = Math.max.apply(Math, __spreadArray(__spreadArray([], __read(heights)), [0]));
+        layer === null || layer === void 0 ? void 0 : layer.forEach(function (v) {
+            g.getNode(v).data.y = prevY + maxHeight / 2;
+        });
+        prevY += maxHeight + ranksep;
+    });
+};
+var positionX = function (g, options) {
+    var _a = options || {}, graphAlign = _a.align, _b = _a.nodesep, nodesep = _b === void 0 ? 0 : _b, _c = _a.edgesep, edgesep = _c === void 0 ? 0 : _c;
+    var layering = buildLayerMatrix(g);
+    var conflicts = Object.assign(findType1Conflicts(g, layering), findType2Conflicts(g, layering));
+    var xss = {};
+    var adjustedLayering = [];
+    ["u", "d"].forEach(function (vert) {
+        adjustedLayering =
+            vert === "u" ? layering : Object.values(layering).reverse();
+        ["l", "r"].forEach(function (horiz) {
+            if (horiz === "r") {
+                adjustedLayering = adjustedLayering.map(function (inner) {
+                    return Object.values(inner).reverse();
+                });
+            }
+            var neighborFn = (vert === "u" ? g.getPredecessors : g.getSuccessors).bind(g);
+            var align = verticalAlignment(g, adjustedLayering, conflicts, neighborFn);
+            var xs = horizontalCompaction(g, adjustedLayering, align.root, align.align, nodesep, edgesep, horiz === "r");
+            if (horiz === "r") {
+                Object.keys(xs).forEach(function (xsKey) { return (xs[xsKey] = -xs[xsKey]); });
+            }
+            xss[vert + horiz] = xs;
+        });
+    });
+    var smallestWidth = findSmallestWidthAlignment(g, xss);
+    smallestWidth && alignCoordinates(xss, smallestWidth);
+    return balance(xss, graphAlign);
+};
+export var position = function (g, options) {
+    var _a;
+    var ng = asNonCompoundGraph(g);
+    positionY(ng, options);
+    var xs = positionX(ng, options);
+    (_a = Object.keys(xs)) === null || _a === void 0 ? void 0 : _a.forEach(function (key) {
+        ng.getNode(key).data.x = xs[key];
+    });
+};
+//# sourceMappingURL=index.js.map

package/lib/dagre/position/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/dagre/position/index.ts"],"names":[],"mappings":";AAEA,OAAO,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,MAAM,SAAS,CAAC;AAC/D,OAAO,EACL,gBAAgB,EAChB,OAAO,EACP,0BAA0B,EAC1B,kBAAkB,EAClB,kBAAkB,EAClB,oBAAoB,EACpB,iBAAiB,GAClB,MAAM,MAAM,CAAC;AAEd,IAAM,SAAS,GAAG,UAChB,CAAS,EACT,OAEE;IAEM,IAAA,KAAgB,CAAA,OAAO,IAAI,EAAE,CAAA,QAAlB,EAAX,OAAO,mBAAG,CAAC,KAAA,CAAmB;IACtC,IAAM,QAAQ,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;IAErC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,OAAO,CAAC,UAAC,KAAK;QACtB,IAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,UAAC,CAAC,IAAK,OAAA,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAO,EAAzB,CAAyB,CAAC,CAAC;QAC5D,IAAM,SAAS,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,yCAAQ,OAAO,KAAE,CAAC,GAAC,CAAC;QAC1C,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,OAAO,CAAC,UAAC,CAAS;YACvB,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,GAAG,SAAS,GAAG,CAAC,CAAC;QAC9C,CAAC,CAAC,CAAC;QACH,KAAK,IAAI,SAAS,GAAG,OAAO,CAAC;IAC/B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,SAAS,GAAG,UAChB,CAAS,EACT,OAIE;IAEI,IAAA,KAAkD,OAAO,IAAI,EAAE,EAAtD,UAAU,WAAA,EAAE,eAAW,EAAX,OAAO,mBAAG,CAAC,KAAA,EAAE,eAAW,EAAX,OAAO,mBAAG,CAAC,KAAkB,CAAC;IAEtE,IAAM,QAAQ,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;IACrC,IAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAC7B,kBAAkB,CAAC,CAAC,EAAE,QAAQ,CAAC,EAC/B,kBAAkB,CAAC,CAAC,EAAE,QAAQ,CAAC,CAChC,CAAC;IAEF,IAAM,GAAG,GAA2C,EAAE,CAAC;IACvD,IAAI,gBAAgB,GAAW,EAAE,CAAC;IAClC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,UAAC,IAAI;QACtB,gBAAgB;YACd,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,OAAO,EAAE,CAAC;QAC9D,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,UAAC,KAAK;YACvB,IAAI,KAAK,KAAK,GAAG,EAAE;gBACjB,gBAAgB,GAAG,gBAAgB,CAAC,GAAG,CAAC,UAAC,KAAK;oBAC5C,OAAA,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE;gBAA9B,CAA8B,CAC/B,CAAC;aACH;YAED,IAAM,UAAU,GAAG,CACjB,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CACnD,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACV,IAAM,KAAK,GAAG,iBAAiB,CAC7B,CAAC,EACD,gBAAgB,EAChB,SAAS,EACT,UAAU,CACX,CAAC;YACF,IAAM,EAAE,GAAG,oBAAoB,CAC7B,CAAC,EACD,gBAAgB,EAChB,KAAK,CAAC,IAAI,EACV,KAAK,CAAC,KAAK,EACX,OAAO,EACP,OAAO,EACP,KAAK,KAAK,GAAG,CACd,CAAC;YACF,IAAI,KAAK,KAAK,GAAG,EAAE;gBACjB,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,UAAC,KAAK,IAAK,OAAA,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAxB,CAAwB,CAAC,CAAC;aAC9D;YACD,GAAG,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;QACzB,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAM,aAAa,GAAG,0BAA0B,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACzD,aAAa,IAAI,gBAAgB,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC;IACtD,OAAO,OAAO,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;AAClC,CAAC,CAAC;AAEF,MAAM,CAAC,IAAM,QAAQ,GAAG,UACtB,CAAS,EACT,OAKE;;IAEF,IAAM,EAAE,GAAG,kBAAkB,CAAC,CAAC,CAAC,CAAC;IAEjC,SAAS,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;IACvB,IAAM,EAAE,GAAG,SAAS,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;IAClC,MAAA,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,0CAAE,OAAO,CAAC,UAAC,GAAO;QAC/B,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC"}

package/lib/dagre/rank/feasible-tree.js

@@ -0,0 +1,164 @@
+import { slack } from "./util";
+import { minBy } from "../util";
+import { Graph } from "@antv/graphlib";
+/*
+ * Constructs a spanning tree with tight edges and adjusted the input node's
+ * ranks to achieve this. A tight edge is one that is has a length that matches
+ * its "minlen" attribute.
+ *
+ * The basic structure for this function is derived from Gansner, et al., "A
+ * Technique for Drawing Directed Graphs."
+ *
+ * Pre-conditions:
+ *
+ *    1. Graph must be a DAG.
+ *    2. Graph must be connected.
+ *    3. Graph must have at least one node.
+ *    5. Graph nodes must have been previously assigned a "rank" property that
+ *       respects the "minlen" property of incident edges.
+ *    6. Graph edges must have a "minlen" property.
+ *
+ * Post-conditions:
+ *
+ *    - Graph nodes will have their rank adjusted to ensure that all edges are
+ *      tight.
+ *
+ * Returns a tree (undirected graph) that is constructed using only "tight"
+ * edges.
+ */
+var feasibleTree = function (g) {
+    var t = new Graph({
+        tree: [],
+    });
+    // Choose arbitrary node from which to start our tree
+    var start = g.getAllNodes()[0];
+    var size = g.getAllNodes().length;
+    t.addNode(start);
+    var edge;
+    var delta;
+    while (tightTree(t, g) < size) {
+        edge = findMinSlackEdge(t, g);
+        delta = t.hasNode(edge.source) ? slack(g, edge) : -slack(g, edge);
+        shiftRanks(t, g, delta);
+    }
+    return t;
+};
+/*
+ * Finds a maximal tree of tight edges and returns the number of nodes in the
+ * tree.
+ */
+var tightTree = function (t, g) {
+    var dfs = function (v) {
+        g.getRelatedEdges(v, "both").forEach(function (e) {
+            var edgeV = e.source;
+            var w = v === edgeV ? e.target : edgeV;
+            if (!t.hasNode(w) && !slack(g, e)) {
+                t.addNode({
+                    id: w,
+                    data: {},
+                });
+                t.addEdge({
+                    id: e.id,
+                    source: v,
+                    target: w,
+                    data: {},
+                });
+                dfs(w);
+            }
+        });
+    };
+    t.getAllNodes().forEach(function (n) { return dfs(n.id); });
+    return t.getAllNodes().length;
+};
+/*
+ * Constructs a spanning tree with tight edges and adjusted the input node's
+ * ranks to achieve this. A tight edge is one that is has a length that matches
+ * its "minlen" attribute.
+ *
+ * The basic structure for this function is derived from Gansner, et al., "A
+ * Technique for Drawing Directed Graphs."
+ *
+ * Pre-conditions:
+ *
+ *    1. Graph must be a DAG.
+ *    2. Graph must be connected.
+ *    3. Graph must have at least one node.
+ *    5. Graph nodes must have been previously assigned a "rank" property that
+ *       respects the "minlen" property of incident edges.
+ *    6. Graph edges must have a "minlen" property.
+ *
+ * Post-conditions:
+ *
+ *    - Graph nodes will have their rank adjusted to ensure that all edges are
+ *      tight.
+ *
+ * Returns a tree (undirected graph) that is constructed using only "tight"
+ * edges.
+ */
+var feasibleTreeWithLayer = function (g) {
+    var t = new Graph({ tree: [] });
+    // Choose arbitrary node from which to start our tree
+    var start = g.getAllNodes()[0];
+    var size = g.getAllNodes().length;
+    t.addNode(start);
+    var edge;
+    var delta;
+    while (tightTreeWithLayer(t, g) < size) {
+        edge = findMinSlackEdge(t, g);
+        delta = t.hasNode(edge.source) ? slack(g, edge) : -slack(g, edge);
+        shiftRanks(t, g, delta);
+    }
+    return t;
+};
+/*
+ * Finds a maximal tree of tight edges and returns the number of nodes in the
+ * tree.
+ */
+var tightTreeWithLayer = function (t, g) {
+    var dfs = function (v) {
+        var _a;
+        (_a = g.getRelatedEdges(v, "both")) === null || _a === void 0 ? void 0 : _a.forEach(function (e) {
+            var edgeV = e.source;
+            var w = v === edgeV ? e.target : edgeV;
+            // 对于指定layer的，直接加入tight-tree，不参与调整
+            if (!t.hasNode(w) &&
+                (g.getNode(w).data.layer !== undefined || !slack(g, e))) {
+                t.addNode({
+                    id: w,
+                    data: {},
+                });
+                t.addEdge({
+                    id: e.id,
+                    source: v,
+                    target: w,
+                    data: {},
+                });
+                dfs(w);
+            }
+        });
+    };
+    t.getAllNodes().forEach(function (n) { return dfs(n.id); });
+    return t.getAllNodes().length;
+};
+/*
+ * Finds the edge with the smallest slack that is incident on tree and returns
+ * it.
+ */
+var findMinSlackEdge = function (t, g) {
+    return minBy(g.getAllEdges(), function (e) {
+        if (t.hasNode(e.source) !== t.hasNode(e.target)) {
+            return slack(g, e);
+        }
+        return Infinity;
+    });
+};
+var shiftRanks = function (t, g, delta) {
+    t.getAllNodes().forEach(function (tn) {
+        var v = g.getNode(tn.id);
+        if (!v.data.rank)
+            v.data.rank = 0;
+        v.data.rank += delta;
+    });
+};
+export { feasibleTree, feasibleTreeWithLayer };
+//# sourceMappingURL=feasible-tree.js.map

package/lib/dagre/rank/feasible-tree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"feasible-tree.js","sourceRoot":"","sources":["../../../src/dagre/rank/feasible-tree.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,QAAQ,CAAC;AAC/B,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAChC,OAAO,EAAQ,KAAK,EAAM,MAAM,gBAAgB,CAAC;AAGjD;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,IAAM,YAAY,GAAG,UAAC,CAAS;IAC7B,IAAM,CAAC,GAAG,IAAI,KAAK,CAAC;QAClB,IAAI,EAAE,EAAE;KACT,CAAC,CAAC;IAEH,qDAAqD;IACrD,IAAM,KAAK,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC;IACjC,IAAM,IAAI,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,MAAM,CAAC;IACpC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAEjB,IAAI,IAAoB,CAAC;IACzB,IAAI,KAAa,CAAC;IAClB,OAAO,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,EAAE;QAC7B,IAAI,GAAG,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9B,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAClE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;KACzB;IAED,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAEF;;;GAGG;AACH,IAAM,SAAS,GAAG,UAAC,CAAS,EAAE,CAAS;IACrC,IAAM,GAAG,GAAG,UAAC,CAAK;QAChB,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,UAAC,CAAC;YACrC,IAAM,KAAK,GAAG,CAAC,CAAC,MAAM,CAAC;YACvB,IAAM,CAAC,GAAG,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;YACzC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;gBACjC,CAAC,CAAC,OAAO,CAAC;oBACR,EAAE,EAAE,CAAC;oBACL,IAAI,EAAE,EAAE;iBACT,CAAC,CAAC;gBACH,CAAC,CAAC,OAAO,CAAC;oBACR,EAAE,EAAE,CAAC,CAAC,EAAE;oBACR,MAAM,EAAE,CAAC;oBACT,MAAM,EAAE,CAAC;oBACT,IAAI,EAAE,EAAE;iBACT,CAAC,CAAC;gBACH,GAAG,CAAC,CAAC,CAAC,CAAC;aACR;QACH,CAAC,CAAC,CAAC;IACL,CAAC,CAAC;IAEF,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC,IAAK,OAAA,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAT,CAAS,CAAC,CAAC;IAC1C,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC,MAAM,CAAC;AAChC,CAAC,CAAC;AAEF;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,IAAM,qBAAqB,GAAG,UAAC,CAAS;IACtC,IAAM,CAAC,GAAG,IAAI,KAAK,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;IAElC,qDAAqD;IACrD,IAAM,KAAK,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC;IACjC,IAAM,IAAI,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,MAAM,CAAC;IACpC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAEjB,IAAI,IAAoB,CAAC;IACzB,IAAI,KAAa,CAAC;IAClB,OAAO,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAE,GAAG,IAAI,EAAE;QACvC,IAAI,GAAG,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9B,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAClE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;KACzB;IAED,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAEF;;;GAGG;AACH,IAAM,kBAAkB,GAAG,UAAC,CAAS,EAAE,CAAS;IAC9C,IAAM,GAAG,GAAG,UAAC,CAAK;;QAChB,MAAA,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,MAAM,CAAC,0CAAE,OAAO,CAAC,UAAC,CAAC;YACtC,IAAM,KAAK,GAAG,CAAC,CAAC,MAAM,CAAC;YACvB,IAAM,CAAC,GAAG,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;YACzC,kCAAkC;YAClC,IACE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;gBACb,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EACxD;gBACA,CAAC,CAAC,OAAO,CAAC;oBACR,EAAE,EAAE,CAAC;oBACL,IAAI,EAAE,EAAE;iBACT,CAAC,CAAC;gBACH,CAAC,CAAC,OAAO,CAAC;oBACR,EAAE,EAAE,CAAC,CAAC,EAAE;oBACR,MAAM,EAAE,CAAC;oBACT,MAAM,EAAE,CAAC;oBACT,IAAI,EAAE,EAAE;iBACT,CAAC,CAAC;gBACH,GAAG,CAAC,CAAC,CAAC,CAAC;aACR;QACH,CAAC,CAAC,CAAC;IACL,CAAC,CAAC;IAEF,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC,IAAK,OAAA,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAT,CAAS,CAAC,CAAC;IAC1C,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC,MAAM,CAAC;AAChC,CAAC,CAAC;AAEF;;;GAGG;AACH,IAAM,gBAAgB,GAAG,UAAC,CAAS,EAAE,CAAS;IAC5C,OAAO,KAAK,CAAC,CAAC,CAAC,WAAW,EAAE,EAAE,UAAC,CAAC;QAC9B,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE;YAC/C,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;SACpB;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,UAAU,GAAG,UAAC,CAAS,EAAE,CAAS,EAAE,KAAa;IACrD,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,EAAE;QACzB,IAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QAC3B,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI;YAAE,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QAClC,CAAC,CAAC,IAAI,CAAC,IAAK,IAAI,KAAK,CAAC;IACxB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,OAAO,EAAE,YAAY,EAAE,qBAAqB,EAAE,CAAC"}