@antv/layout 0.3.11 → 1.0.0-alpha.0

package/lib/layout/dagre/src/position/bk.js

@@ -1,409 +0,0 @@
-"use strict";
-var __extends = (this && this.__extends) || (function () {
-    var extendStatics = function (d, b) {
-        extendStatics = Object.setPrototypeOf ||
-            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
-            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
-        return extendStatics(d, b);
-    };
-    return function (d, b) {
-        if (typeof b !== "function" && b !== null)
-            throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
-        extendStatics(d, b);
-        function __() { this.constructor = d; }
-        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
-    };
-})();
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.width = exports.sep = exports.positionX = exports.balance = exports.alignCoordinates = exports.findSmallestWidthAlignment = exports.buildBlockGraph = exports.horizontalCompaction = exports.verticalAlignment = exports.hasConflict = exports.addConflict = exports.findOtherInnerSegmentNode = exports.findType2Conflicts = exports.findType1Conflicts = void 0;
-/*
- * This module provides coordinate assignment based on Brandes and Köpf, "Fast
- * and Simple Horizontal Coordinate Assignment."
- */
-var graphlib_1 = require("@antv/graphlib");
-var util_1 = require("../util");
-var BlockGraph = /** @class */ (function (_super) {
-    __extends(BlockGraph, _super);
-    function BlockGraph() {
-        return _super !== null && _super.apply(this, arguments) || this;
-    }
-    return BlockGraph;
-}(graphlib_1.Graph));
-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 = (0, exports.findOtherInnerSegmentNode)(g, v);
-            var k1 = w ? g.node(w).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.predecessors(scanNode)) === null || _a === void 0 ? void 0 : _a.forEach(function (u) {
-                        var _a;
-                        var uLabel = g.node(u);
-                        var uPos = uLabel.order;
-                        if ((uPos < k0 || k1 < uPos) &&
-                            !(uLabel.dummy && ((_a = g.node(scanNode)) === null || _a === void 0 ? void 0 : _a.dummy))) {
-                            (0, exports.addConflict)(conflicts, u, scanNode);
-                        }
-                    });
-                });
-                scanPos = i + 1;
-                k0 = k1;
-            }
-        });
-        return layer;
-    };
-    if (layering === null || layering === void 0 ? void 0 : layering.length) {
-        layering.reduce(visitLayer);
-    }
-    return conflicts;
-};
-exports.findType1Conflicts = findType1Conflicts;
-var findType2Conflicts = function (g, layering) {
-    var conflicts = {};
-    var scan = function (south, southPos, southEnd, prevNorthBorder, nextNorthBorder) {
-        var v;
-        var range = [];
-        for (var i = southPos; i < southEnd; i++) {
-            range.push(i);
-        }
-        range.forEach(function (i) {
-            var _a, _b;
-            v = south[i];
-            if ((_a = g.node(v)) === null || _a === void 0 ? void 0 : _a.dummy) {
-                (_b = g.predecessors(v)) === null || _b === void 0 ? void 0 : _b.forEach(function (u) {
-                    var uNode = g.node(u);
-                    if (uNode.dummy &&
-                        (uNode.order < prevNorthBorder ||
-                            uNode.order > nextNorthBorder)) {
-                        (0, exports.addConflict)(conflicts, u, v);
-                    }
-                });
-            }
-        });
-    };
-    var visitLayer = function (north, south) {
-        var prevNorthPos = -1;
-        var nextNorthPos;
-        var southPos = 0;
-        south === null || south === void 0 ? void 0 : south.forEach(function (v, southLookahead) {
-            var _a;
-            if (((_a = g.node(v)) === null || _a === void 0 ? void 0 : _a.dummy) === "border") {
-                var predecessors = g.predecessors(v) || [];
-                if (predecessors.length) {
-                    nextNorthPos = g.node(predecessors[0]).order;
-                    scan(south, southPos, southLookahead, prevNorthPos, nextNorthPos);
-                    southPos = southLookahead;
-                    prevNorthPos = nextNorthPos;
-                }
-            }
-            scan(south, southPos, south.length, nextNorthPos, north.length);
-        });
-        return south;
-    };
-    if (layering === null || layering === void 0 ? void 0 : layering.length) {
-        layering.reduce(visitLayer);
-    }
-    return conflicts;
-};
-exports.findType2Conflicts = findType2Conflicts;
-var findOtherInnerSegmentNode = function (g, v) {
-    var _a, _b;
-    if ((_a = g.node(v)) === null || _a === void 0 ? void 0 : _a.dummy) {
-        return (_b = g.predecessors(v)) === null || _b === void 0 ? void 0 : _b.find(function (u) { return g.node(u).dummy; });
-    }
-};
-exports.findOtherInnerSegmentNode = findOtherInnerSegmentNode;
-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;
-};
-exports.addConflict = addConflict;
-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];
-};
-exports.hasConflict = hasConflict;
-/*
- * 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.
- */
-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);
-            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] &&
-                        !(0, exports.hasConflict)(conflicts, v, w)) {
-                        align[w] = v;
-                        align[v] = root[v] = root[w];
-                        prevIdx = pos[w];
-                    }
-                }
-            }
-        });
-    });
-    return { root: root, align: align };
-};
-exports.verticalAlignment = verticalAlignment;
-var horizontalCompaction = function (g, layering, root, align, 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 = (0, exports.buildBlockGraph)(g, layering, root, reverseSep);
-    var borderType = reverseSep ? "borderLeft" : "borderRight";
-    var iterate = function (setXsFunc, nextNodesFunc) {
-        var stack = blockG.nodes();
-        var elem = stack.pop();
-        var visited = {};
-        while (elem) {
-            if (visited[elem]) {
-                setXsFunc(elem);
-            }
-            else {
-                visited[elem] = true;
-                stack.push(elem);
-                stack = stack.concat(nextNodesFunc(elem));
-            }
-            elem = stack.pop();
-        }
-    };
-    // First pass, assign smallest coordinates
-    var pass1 = function (elem) {
-        xs[elem] = (blockG.inEdges(elem) || []).reduce(function (acc, e) {
-            return Math.max(acc, (xs[e.v] || 0) + blockG.edge(e));
-        }, 0);
-    };
-    // Second pass, assign greatest coordinates
-    var pass2 = function (elem) {
-        var min = (blockG.outEdges(elem) || []).reduce(function (acc, e) {
-            return Math.min(acc, (xs[e.w] || 0) - blockG.edge(e));
-        }, Number.POSITIVE_INFINITY);
-        var node = g.node(elem);
-        if (min !== Number.POSITIVE_INFINITY && node.borderType !== borderType) {
-            xs[elem] = Math.max(xs[elem], min);
-        }
-    };
-    iterate(pass1, blockG.predecessors.bind(blockG));
-    iterate(pass2, blockG.successors.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;
-};
-exports.horizontalCompaction = horizontalCompaction;
-var buildBlockGraph = function (g, layering, root, reverseSep) {
-    var blockGraph = new BlockGraph();
-    var graphLabel = g.graph();
-    var sepFn = (0, exports.sep)(graphLabel.nodesep, graphLabel.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];
-            blockGraph.setNode(vRoot);
-            if (u) {
-                var uRoot = root[u];
-                var prevMax = blockGraph.edgeFromArgs(uRoot, vRoot);
-                blockGraph.setEdge(uRoot, vRoot, Math.max(sepFn(g, v, u), prevMax || 0));
-            }
-            u = v;
-        });
-    });
-    return blockGraph;
-};
-exports.buildBlockGraph = buildBlockGraph;
-/*
- * Returns the alignment that has the smallest width of the given alignments.
- */
-var findSmallestWidthAlignment = function (g, xss) {
-    return (0, util_1.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 = (0, exports.width)(g, v) / 2;
-            max = Math.max(x + halfWidth, max);
-            min = Math.min(x - halfWidth, min);
-        });
-        return max - min;
-    });
-};
-exports.findSmallestWidthAlignment = findSmallestWidthAlignment;
-/*
- * 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.
- */
-function alignCoordinates(xss, alignTo) {
-    // @ts-ignore
-    var alignToVals = Object.values(alignTo);
-    var alignToMin = Math.min.apply(Math, alignToVals);
-    var alignToMax = Math.max.apply(Math, 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, xsVals)
-                    : alignToMax - Math.max.apply(Math, xsVals);
-            if (delta) {
-                xss[alignment] = {};
-                Object.keys(xs).forEach(function (key) {
-                    xss[alignment][key] = xs[key] + delta;
-                });
-            }
-        });
-    });
-}
-exports.alignCoordinates = alignCoordinates;
-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;
-};
-exports.balance = balance;
-var positionX = function (g) {
-    var layering = (0, util_1.buildLayerMatrix)(g);
-    var conflicts = Object.assign((0, exports.findType1Conflicts)(g, layering), (0, exports.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.predecessors : g.successors).bind(g);
-            var align = (0, exports.verticalAlignment)(g, adjustedLayering, conflicts, neighborFn);
-            var xs = (0, exports.horizontalCompaction)(g, adjustedLayering, align.root, align.align, horiz === "r");
-            if (horiz === "r") {
-                Object.keys(xs).forEach(function (key) {
-                    xs[key] = -xs[key];
-                });
-            }
-            xss[vert + horiz] = xs;
-        });
-    });
-    var smallestWidth = (0, exports.findSmallestWidthAlignment)(g, xss);
-    alignCoordinates(xss, smallestWidth);
-    return (0, exports.balance)(xss, g.graph().align);
-};
-exports.positionX = positionX;
-var sep = function (nodeSep, edgeSep, reverseSep) {
-    return function (g, v, w) {
-        var vLabel = g.node(v);
-        var wLabel = g.node(w);
-        var sum = 0;
-        var delta;
-        sum += vLabel.width / 2;
-        if (vLabel.hasOwnProperty("labelpos")) {
-            switch ((vLabel.labelpos || "").toLowerCase()) {
-                case "l":
-                    delta = -vLabel.width / 2;
-                    break;
-                case "r":
-                    delta = vLabel.width / 2;
-                    break;
-            }
-        }
-        if (delta) {
-            sum += reverseSep ? delta : -delta;
-        }
-        delta = 0;
-        sum += (vLabel.dummy ? edgeSep : nodeSep) / 2;
-        sum += (wLabel.dummy ? edgeSep : nodeSep) / 2;
-        sum += wLabel.width / 2;
-        if (wLabel.labelpos) {
-            switch ((wLabel.labelpos || "").toLowerCase()) {
-                case "l":
-                    delta = wLabel.width / 2;
-                    break;
-                case "r":
-                    delta = -wLabel.width / 2;
-                    break;
-            }
-        }
-        if (delta) {
-            sum += reverseSep ? delta : -delta;
-        }
-        delta = 0;
-        return sum;
-    };
-};
-exports.sep = sep;
-var width = function (g, v) { return g.node(v).width || 0; };
-exports.width = width;
-//# sourceMappingURL=bk.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"bk.js","sourceRoot":"","sources":["../../../../../src/layout/dagre/src/position/bk.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;AAAA;;;GAGG;AACH,2CAAmD;AAEnD,gCAAkD;AAElD;IAAyB,8BAAgC;IAAzD;;IAA2D,CAAC;IAAD,iBAAC;AAAD,CAAC,AAA5D,CAAyB,gBAAQ,GAA2B;AAsBrD,IAAM,kBAAkB,GAAG,UAAC,CAAQ,EAAE,QAAqB;IAChE,IAAM,SAAS,GAAG,EAAE,CAAC;IAErB,IAAM,UAAU,GAAG,UAAC,SAAmB,EAAE,KAAe;QACtD,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,CAAS,EAAE,CAAS;;YAClC,IAAM,CAAC,GAAG,IAAA,iCAAyB,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,IAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,KAAM,CAAC,CAAC,CAAC,eAAe,CAAC;YAEnD,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,YAAY,CAAC,QAAQ,CAAC,0CAAE,OAAO,CAAC,UAAC,CAAC;;wBAClC,IAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;wBAC1B,IAAM,IAAI,GAAG,MAAM,CAAC,KAAe,CAAC;wBACpC,IACE,CAAC,IAAI,GAAG,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;4BACxB,CAAC,CAAC,MAAM,CAAC,KAAK,KAAI,MAAA,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,0CAAE,KAAK,CAAA,CAAC,EAC1C;4BACA,IAAA,mBAAW,EAAC,SAAS,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;yBACrC;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;AA1CW,QAAA,kBAAkB,sBA0C7B;AAEK,IAAM,kBAAkB,GAAG,UAAC,CAAQ,EAAE,QAAqB;IAChE,IAAM,SAAS,GAAG,EAAE,CAAC;IAErB,IAAM,IAAI,GAAG,UACX,KAAe,EACf,QAAgB,EAChB,QAAgB,EAChB,eAAuB,EACvB,eAAuB;QAEvB,IAAI,CAAS,CAAC;QACd,IAAM,KAAK,GAAG,EAAE,CAAC;QACjB,KAAK,IAAI,CAAC,GAAG,QAAQ,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE;YACxC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;SACf;QACD,KAAK,CAAC,OAAO,CAAC,UAAC,CAAC;;YACd,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACb,IAAI,MAAA,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,0CAAE,KAAK,EAAE;gBACpB,MAAA,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,0CAAE,OAAO,CAAC,UAAC,CAAC;oBAC3B,IAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;oBACzB,IACE,KAAK,CAAC,KAAK;wBACX,CAAE,KAAK,CAAC,KAAgB,GAAG,eAAe;4BACvC,KAAK,CAAC,KAAgB,GAAG,eAAe,CAAC,EAC5C;wBACA,IAAA,mBAAW,EAAC,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;qBAC9B;gBACH,CAAC,CAAC,CAAC;aACJ;QACH,CAAC,CAAC,CAAC;IACL,CAAC,CAAC;IAEF,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,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,OAAO,CAAC,UAAC,CAAS,EAAE,cAAsB;;YAC/C,IAAI,CAAA,MAAA,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,0CAAE,KAAK,MAAK,QAAQ,EAAE;gBACjC,IAAM,YAAY,GAAG,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;gBAC7C,IAAI,YAAY,CAAC,MAAM,EAAE;oBACvB,YAAY,GAAG,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAE,CAAE,CAAC,KAAe,CAAC;oBACzD,IAAI,CAAC,KAAK,EAAE,QAAQ,EAAE,cAAc,EAAE,YAAY,EAAE,YAAY,CAAC,CAAC;oBAClE,QAAQ,GAAG,cAAc,CAAC;oBAC1B,YAAY,GAAG,YAAY,CAAC;iBAC7B;aACF;YACD,IAAI,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,CAAC,MAAM,EAAE,YAAY,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QAClE,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;AAzDW,QAAA,kBAAkB,sBAyD7B;AAEK,IAAM,yBAAyB,GAAG,UAAC,CAAQ,EAAE,CAAS;;IAC3D,IAAI,MAAA,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,0CAAE,KAAK,EAAE;QACpB,OAAO,MAAA,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,0CAAE,IAAI,CAAC,UAAC,CAAC,IAAK,OAAA,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,KAAK,EAAhB,CAAgB,CAAC,CAAC;KACzD;AACH,CAAC,CAAC;AAJW,QAAA,yBAAyB,6BAIpC;AAEK,IAAM,WAAW,GAAG,UAAC,SAAoB,EAAE,CAAS,EAAE,CAAS;IACpE,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;AAdW,QAAA,WAAW,eActB;AAEK,IAAM,WAAW,GAAG,UAAC,SAAoB,EAAE,CAAS,EAAE,CAAS;IACpE,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;AATW,QAAA,WAAW,eAStB;AAEF;;;;;;;GAOG;AACI,IAAM,iBAAiB,GAAG,UAC/B,CAAQ,EACR,QAAoB,EACpB,SAAoB,EACpB,UAAmC;IAEnC,IAAM,IAAI,GAA2B,EAAE,CAAC;IACxC,IAAM,KAAK,GAA2B,EAAE,CAAC;IACzC,IAAM,GAAG,GAA2B,EAAE,CAAC;IAEvC,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;YACvB,IAAI,EAAE,CAAC,MAAM,EAAE;gBACb,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,UAAC,CAAS,EAAE,CAAS,IAAK,OAAA,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,EAAf,CAAe,CAAC,CAAC;gBACxD,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,IAAA,mBAAW,EAAC,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;AA7CW,QAAA,iBAAiB,qBA6C5B;AAEK,IAAM,oBAAoB,GAAG,UAClC,CAAQ,EACR,QAAoB,EACpB,IAA4B,EAC5B,KAA6B,EAC7B,UAAoB;;IAEpB,6EAA6E;IAC7E,uEAAuE;IACvE,mEAAmE;IACnE,6EAA6E;IAC7E,qDAAqD;IACrD,IAAM,EAAE,GAA2B,EAAE,CAAC;IACtC,IAAM,MAAM,GAAG,IAAA,uBAAe,EAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;IAC9D,IAAM,UAAU,GAAG,UAAU,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,aAAa,CAAC;IAE7D,IAAM,OAAO,GAAG,UACd,SAAkC,EAClC,aAAwC;QAExC,IAAI,KAAK,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;QAC3B,IAAI,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;QACvB,IAAM,OAAO,GAA4B,EAAE,CAAC;QAC5C,OAAO,IAAI,EAAE;YACX,IAAI,OAAO,CAAC,IAAI,CAAC,EAAE;gBACjB,SAAS,CAAC,IAAI,CAAC,CAAC;aACjB;iBAAM;gBACL,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;gBACrB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACjB,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC;aAC3C;YAED,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;SACpB;IACH,CAAC,CAAC;IAEF,0CAA0C;IAC1C,IAAM,KAAK,GAAG,UAAC,IAAY;QACzB,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,UAAC,GAAW,EAAE,CAAC;YAC5D,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC;QACzD,CAAC,EAAE,CAAC,CAAC,CAAC;IACR,CAAC,CAAC;IAEF,2CAA2C;IAC3C,IAAM,KAAK,GAAG,UAAC,IAAY;QACzB,IAAM,GAAG,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,UAAC,GAAW,EAAE,CAAC;YAC9D,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC;QACzD,CAAC,EAAE,MAAM,CAAC,iBAAiB,CAAC,CAAC;QAE7B,IAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAE,CAAC;QAC3B,IAAI,GAAG,KAAK,MAAM,CAAC,iBAAiB,IAAI,IAAI,CAAC,UAAU,KAAK,UAAU,EAAE;YACtE,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,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IACjD,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAE/C,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;AAhEW,QAAA,oBAAoB,wBAgE/B;AAEK,IAAM,eAAe,GAAG,UAC7B,CAAQ,EACR,QAAoB,EACpB,IAA4B,EAC5B,UAAoB;IAEpB,IAAM,UAAU,GAAG,IAAI,UAAU,EAAE,CAAC;IACpC,IAAM,UAAU,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC;IAC7B,IAAM,KAAK,GAAG,IAAA,WAAG,EACf,UAAU,CAAC,OAAiB,EAC5B,UAAU,CAAC,OAAiB,EAC5B,UAAqB,CACtB,CAAC;IAEF,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,OAAO,CAAC,UAAC,KAAK;QACtB,IAAI,CAAS,CAAC;QACd,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,OAAO,CAAC,UAAC,CAAC;YACf,IAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACtB,UAAU,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAC1B,IAAI,CAAC,EAAE;gBACL,IAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;gBACtB,IAAM,OAAO,GAAG,UAAU,CAAC,YAAY,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;gBACtD,UAAU,CAAC,OAAO,CAChB,KAAK,EACL,KAAK,EACL,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,OAAO,IAAI,CAAC,CAAC,CACvC,CAAC;aACH;YACD,CAAC,GAAG,CAAC,CAAC;QACR,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,OAAO,UAAU,CAAC;AACpB,CAAC,CAAC;AAjCW,QAAA,eAAe,mBAiC1B;AACF;;GAEG;AACI,IAAM,0BAA0B,GAAG,UACxC,CAAQ,EACR,GAA2C;IAE3C,OAAO,IAAA,YAAK,EAAC,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,IAAA,aAAK,EAAC,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;AAlBW,QAAA,0BAA0B,8BAkBrC;AAEF;;;;;;GAMG;AACH,SAAgB,gBAAgB,CAC9B,GAA2C,EAC3C,OAA+B;IAE/B,aAAa;IACb,IAAM,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CAAa,CAAC;IACvD,IAAM,UAAU,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,EAAQ,WAAW,CAAC,CAAC;IAC5C,IAAM,UAAU,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,EAAQ,WAAW,CAAC,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,CAAa,CAAC;YAC7C,KAAK;gBACH,KAAK,KAAK,GAAG;oBACX,CAAC,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,EAAQ,MAAM,CAAC;oBAClC,CAAC,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,EAAQ,MAAM,CAAC,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;AA9BD,4CA8BC;AAEM,IAAM,OAAO,GAAG,UACrB,GAA2C,EAC3C,KAAc;IAEd,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;AAdW,QAAA,OAAO,WAclB;AAEK,IAAM,SAAS,GAAG,UAAC,CAAQ;IAChC,IAAM,QAAQ,GAAG,IAAA,uBAAgB,EAAC,CAAC,CAAC,CAAC;IACrC,IAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAC7B,IAAA,0BAAkB,EAAC,CAAC,EAAE,QAAQ,CAAC,EAC/B,IAAA,0BAAkB,EAAC,CAAC,EAAE,QAAQ,CAAC,CAChC,CAAC;IAEF,IAAM,GAAG,GAA2C,EAAE,CAAC;IACvD,IAAI,gBAA4B,CAAC;IACjC,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,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC1E,IAAM,KAAK,GAAG,IAAA,yBAAiB,EAC7B,CAAC,EACD,gBAAgB,EAChB,SAAS,EACT,UAAU,CACX,CAAC;YACF,IAAM,EAAE,GAAG,IAAA,4BAAoB,EAC7B,CAAC,EACD,gBAAgB,EAChB,KAAK,CAAC,IAAI,EACV,KAAK,CAAC,KAAK,EACX,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,IAAA,kCAA0B,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACzD,gBAAgB,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC;IACrC,OAAO,IAAA,eAAO,EAAC,GAAG,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,KAAe,CAAC,CAAC;AACjD,CAAC,CAAC;AA7CW,QAAA,SAAS,aA6CpB;AAEK,IAAM,GAAG,GAAG,UAAC,OAAe,EAAE,OAAe,EAAE,UAAmB;IACvE,OAAO,UAAC,CAAQ,EAAE,CAAS,EAAE,CAAS;QACpC,IAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;QAC1B,IAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;QAC1B,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,KAAK,CAAC;QAEV,GAAG,IAAI,MAAM,CAAC,KAAM,GAAG,CAAC,CAAC;QACzB,IAAI,MAAM,CAAC,cAAc,CAAC,UAAU,CAAC,EAAE;YACrC,QAAQ,CAAC,MAAM,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,EAAE;gBAC7C,KAAK,GAAG;oBACN,KAAK,GAAG,CAAC,MAAM,CAAC,KAAM,GAAG,CAAC,CAAC;oBAC3B,MAAM;gBACR,KAAK,GAAG;oBACN,KAAK,GAAG,MAAM,CAAC,KAAM,GAAG,CAAC,CAAC;oBAC1B,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,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAC9C,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAE9C,GAAG,IAAI,MAAM,CAAC,KAAM,GAAG,CAAC,CAAC;QACzB,IAAI,MAAM,CAAC,QAAQ,EAAE;YACnB,QAAQ,CAAC,MAAM,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,EAAE;gBAC7C,KAAK,GAAG;oBACN,KAAK,GAAG,MAAM,CAAC,KAAM,GAAG,CAAC,CAAC;oBAC1B,MAAM;gBACR,KAAK,GAAG;oBACN,KAAK,GAAG,CAAC,MAAM,CAAC,KAAM,GAAG,CAAC,CAAC;oBAC3B,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;AA5CW,QAAA,GAAG,OA4Cd;AAEK,IAAM,KAAK,GAAG,UAAC,CAAQ,EAAE,CAAS,IAAK,OAAA,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,KAAK,IAAI,CAAC,EAArB,CAAqB,CAAC;AAAvD,QAAA,KAAK,SAAkD"}

package/lib/layout/dagre/src/position/index.d.ts

@@ -1,3 +0,0 @@
-import { Graph } from "../../graph";
-declare const position: (g: Graph) => void;
-export default position;

package/lib/layout/dagre/src/position/index.js

@@ -1,64 +0,0 @@
-"use strict";
-var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
-    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
-        if (ar || !(i in from)) {
-            if (!ar) ar = Array.prototype.slice.call(from, 0, i);
-            ar[i] = from[i];
-        }
-    }
-    return to.concat(ar || Array.prototype.slice.call(from));
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-var util_1 = require("../util");
-var bk_1 = require("./bk");
-var positionY = function (g) {
-    var layering = (0, util_1.buildLayerMatrix)(g);
-    var rankSep = g.graph().ranksep;
-    var prevY = 0;
-    layering === null || layering === void 0 ? void 0 : layering.forEach(function (layer) {
-        var heights = layer.map(function (v) { return g.node(v).height; });
-        var maxHeight = Math.max.apply(Math, __spreadArray(__spreadArray([], heights, false), [0], false));
-        layer === null || layer === void 0 ? void 0 : layer.forEach(function (v) {
-            g.node(v).y = prevY + maxHeight / 2;
-        });
-        prevY += maxHeight + rankSep;
-    });
-};
-var positionX = function (g) {
-    var layering = (0, util_1.buildLayerMatrix)(g);
-    var conflicts = Object.assign((0, bk_1.findType1Conflicts)(g, layering), (0, bk_1.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.predecessors : g.successors).bind(g);
-            var align = (0, bk_1.verticalAlignment)(g, adjustedLayering, conflicts, neighborFn);
-            var xs = (0, bk_1.horizontalCompaction)(g, adjustedLayering, align.root, align.align, horiz === "r");
-            if (horiz === "r") {
-                Object.keys(xs).forEach(function (xsKey) { return (xs[xsKey] = -xs[xsKey]); });
-            }
-            xss[vert + horiz] = xs;
-        });
-    });
-    var smallestWidth = (0, bk_1.findSmallestWidthAlignment)(g, xss);
-    smallestWidth && (0, bk_1.alignCoordinates)(xss, smallestWidth);
-    return (0, bk_1.balance)(xss, g.graph().align);
-};
-var position = function (g) {
-    var _a;
-    var ng = (0, util_1.asNonCompoundGraph)(g);
-    positionY(ng);
-    var xs = positionX(ng);
-    (_a = Object.keys(xs)) === null || _a === void 0 ? void 0 : _a.forEach(function (key) {
-        ng.node(key).x = xs[key];
-    });
-};
-exports.default = position;
-//# sourceMappingURL=index.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/layout/dagre/src/position/index.ts"],"names":[],"mappings":";;;;;;;;;;;AACA,gCAA+D;AAC/D,2BAQc;AAEd,IAAM,SAAS,GAAG,UAAC,CAAQ;IACzB,IAAM,QAAQ,GAAG,IAAA,uBAAgB,EAAC,CAAC,CAAC,CAAC;IACrC,IAAM,OAAO,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,OAAiB,CAAC;IAC5C,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,IAAI,CAAC,CAAC,CAAE,CAAC,MAAO,EAAlB,CAAkB,CAAC,CAAC;QACrD,IAAM,SAAS,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,kCAAQ,OAAO,WAAE,CAAC,UAAC,CAAC;QAC1C,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,OAAO,CAAC,UAAC,CAAS;YACvB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC,GAAG,KAAK,GAAG,SAAS,GAAG,CAAC,CAAC;QACvC,CAAC,CAAC,CAAC;QACH,KAAK,IAAI,SAAS,GAAG,OAAO,CAAC;IAC/B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,SAAS,GAAG,UAAC,CAAQ;IACzB,IAAM,QAAQ,GAAG,IAAA,uBAAgB,EAAC,CAAC,CAAC,CAAC;IACrC,IAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAC7B,IAAA,uBAAkB,EAAC,CAAC,EAAE,QAAQ,CAAC,EAC/B,IAAA,uBAAkB,EAAC,CAAC,EAAE,QAAQ,CAAC,CAChC,CAAC;IAEF,IAAM,GAAG,GAA2C,EAAE,CAAC;IACvD,IAAI,gBAAgB,GAAe,EAAE,CAAC;IACtC,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,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC1E,IAAM,KAAK,GAAG,IAAA,sBAAiB,EAC7B,CAAC,EACD,gBAAgB,EAChB,SAAS,EACT,UAAU,CACX,CAAC;YACF,IAAM,EAAE,GAAG,IAAA,yBAAoB,EAC7B,CAAC,EACD,gBAAgB,EAChB,KAAK,CAAC,IAAI,EACV,KAAK,CAAC,KAAK,EACX,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,IAAA,+BAA0B,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACzD,aAAa,IAAI,IAAA,qBAAgB,EAAC,GAAG,EAAE,aAAa,CAAC,CAAC;IACtD,OAAO,IAAA,YAAO,EAAC,GAAG,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,KAAe,CAAC,CAAC;AACjD,CAAC,CAAC;AAEF,IAAM,QAAQ,GAAG,UAAC,CAAQ;;IACxB,IAAM,EAAE,GAAG,IAAA,yBAAkB,EAAC,CAAC,CAAC,CAAC;IAEjC,SAAS,CAAC,EAAE,CAAC,CAAC;IACd,IAAM,EAAE,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC;IACzB,MAAA,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,0CAAE,OAAO,CAAC,UAAC,GAAW;QACnC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAE,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,kBAAe,QAAQ,CAAC"}

package/lib/layout/dagre/src/rank/feasible-tree.d.ts

@@ -1,9 +0,0 @@
-import { Graph } from '../../graph';
-declare const feasibleTree: (g: Graph) => Graph;
-declare const feasibleTreeWithLayer: (g: Graph) => any;
-export { feasibleTree, feasibleTreeWithLayer };
-declare const _default: {
-    feasibleTree: (g: Graph) => Graph;
-    feasibleTreeWithLayer: (g: Graph) => any;
-};
-export default _default;

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

@@ -1,152 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.feasibleTreeWithLayer = exports.feasibleTree = void 0;
-var util_1 = require("./util");
-var util_2 = require("../util");
-var graph_1 = require("../../graph");
-/*
- * 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_1.Graph({ directed: false });
-    // Choose arbitrary node from which to start our tree
-    var start = g.nodes()[0];
-    var size = g.nodeCount();
-    t.setNode(start, {});
-    var edge;
-    var delta;
-    while (tightTree(t, g) < size) {
-        edge = findMinSlackEdge(t, g);
-        delta = t.hasNode(edge.v) ? (0, util_1.slack)(g, edge) : -(0, util_1.slack)(g, edge);
-        shiftRanks(t, g, delta);
-    }
-    return t;
-};
-exports.feasibleTree = feasibleTree;
-/*
- * 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.nodeEdges(v).forEach(function (e) {
-            var edgeV = e.v;
-            var w = (v === edgeV) ? e.w : edgeV;
-            if (!t.hasNode(w) && !(0, util_1.slack)(g, e)) {
-                t.setNode(w, {});
-                t.setEdge(v, w, {});
-                dfs(w);
-            }
-        });
-    };
-    t.nodes().forEach(dfs);
-    return t.nodeCount();
-};
-/*
- * 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_1.Graph({ directed: false });
-    // Choose arbitrary node from which to start our tree
-    var start = g.nodes()[0];
-    var size = g.nodes().filter(function (n) { return !!g.node(n); }).length;
-    t.setNode(start, {});
-    var edge;
-    var delta;
-    while (tightTreeWithLayer(t, g) < size) {
-        edge = findMinSlackEdge(t, g);
-        delta = t.hasNode(edge.v) ? (0, util_1.slack)(g, edge) : -(0, util_1.slack)(g, edge);
-        shiftRanks(t, g, delta);
-    }
-    return t;
-};
-exports.feasibleTreeWithLayer = feasibleTreeWithLayer;
-/*
- * 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.nodeEdges(v)) === null || _a === void 0 ? void 0 : _a.forEach(function (e) {
-            var edgeV = e.v;
-            var w = (v === edgeV) ? e.w : edgeV;
-            // 对于指定layer的，直接加入tight-tree，不参与调整
-            if (!t.hasNode(w) && (g.node(w).layer !== undefined || !(0, util_1.slack)(g, e))) {
-                t.setNode(w, {});
-                t.setEdge(v, w, {});
-                dfs(w);
-            }
-        });
-    };
-    t.nodes().forEach(dfs);
-    return t.nodeCount();
-};
-/*
- * Finds the edge with the smallest slack that is incident on tree and returns
- * it.
- */
-var findMinSlackEdge = function (t, g) {
-    return (0, util_2.minBy)(g.edges(), function (e) {
-        if (t.hasNode(e.v) !== t.hasNode(e.w)) {
-            return (0, util_1.slack)(g, e);
-        }
-        return Infinity;
-    });
-};
-var shiftRanks = function (t, g, delta) {
-    t.nodes().forEach(function (v) {
-        if (!g.node(v).rank)
-            g.node(v).rank = 0;
-        g.node(v).rank += delta;
-    });
-};
-exports.default = {
-    feasibleTree: feasibleTree,
-    feasibleTreeWithLayer: feasibleTreeWithLayer
-};
-//# sourceMappingURL=feasible-tree.js.map