@antv/layout 0.1.19 → 0.1.20

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

@@ -0,0 +1,413 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.balance = exports.findSmallestWidthAlignment = exports.alignCoordinates = exports.horizontalCompaction = exports.verticalAlignment = exports.hasConflict = exports.addConflict = exports.findType2Conflicts = exports.findType1Conflicts = exports.positionX = void 0;
+var graphlib_1 = __importDefault(require("../graphlib"));
+var util_1 = __importDefault(require("../util"));
+var Graph = graphlib_1.default.Graph;
+/*
+ * This module provides coordinate assignment based on Brandes and Köpf, "Fast
+ * and Simple Horizontal Coordinate Assignment."
+ */
+/*
+ * Marks all edges in the graph with a type-1 conflict with the "type1Conflict"
+ * property. A type-1 conflict is one where a non-inner segment crosses an
+ * inner segment. An inner segment is an edge with both incident nodes marked
+ * with the "dummy" property.
+ *
+ * This algorithm scans layer by layer, starting with the second, for type-1
+ * conflicts between the current layer and the previous layer. For each layer
+ * it scans the nodes from left to right until it reaches one that is incident
+ * on an inner segment. It then scans predecessors to determine if they have
+ * edges that cross that inner segment. At the end a final scan is done for all
+ * nodes on the current rank to see if they cross the last visited inner
+ * segment.
+ *
+ * This algorithm (safely) assumes that a dummy node will only be incident on a
+ * single node in the layers being scanned.
+ */
+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[(layer === null || layer === void 0 ? void 0 : layer.length) - 1];
+        layer.forEach(function (v, i) {
+            var w = findOtherInnerSegmentNode(g, v);
+            var k1 = w ? g.node(w).order : prevLayerLength;
+            if (w || v === lastNode) {
+                layer.slice(scanPos, i + 1).forEach(function (scanNode) {
+                    var _a;
+                    (_a = g.predecessors(scanNode)) === null || _a === void 0 ? void 0 : _a.forEach(function (u) {
+                        var uLabel = g.node(u);
+                        var uPos = uLabel.order;
+                        if ((uPos < k0 || k1 < uPos) &&
+                            !(uLabel.dummy && g.node(scanNode).dummy)) {
+                            addConflict(conflicts, u, scanNode);
+                        }
+                    });
+                });
+                scanPos = i + 1;
+                k0 = k1;
+            }
+        });
+        return layer;
+    };
+    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;
+            v = south[i];
+            if (g.node(v).dummy) {
+                (_a = g.predecessors(v)) === null || _a === void 0 ? void 0 : _a.forEach(function (u) {
+                    var uNode = g.node(u);
+                    if (uNode.dummy &&
+                        (uNode.order < prevNorthBorder || uNode.order > nextNorthBorder)) {
+                        addConflict(conflicts, u, v);
+                    }
+                });
+            }
+        });
+    };
+    var visitLayer = function (north, south) {
+        var prevNorthPos = -1;
+        var nextNorthPos;
+        var southPos = 0;
+        south.forEach(function (v, southLookahead) {
+            if (g.node(v).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;
+    };
+    layering.reduce(visitLayer);
+    return conflicts;
+};
+exports.findType2Conflicts = findType2Conflicts;
+var findOtherInnerSegmentNode = function (g, v) {
+    var _a;
+    if (g.node(v).dummy) {
+        return (_a = g.predecessors(v)) === null || _a === void 0 ? void 0 : _a.find(function (u) { return g.node(u).dummy; });
+    }
+};
+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] && conflicts[vv].hasOwnProperty(ww);
+};
+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.forEach(function (layer) {
+        layer.forEach(function (v, order) {
+            root[v] = v;
+            align[v] = v;
+            pos[v] = order;
+        });
+    });
+    layering.forEach(function (layer) {
+        var prevIdx = -1;
+        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] &&
+                        !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) {
+    // 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, 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
+    // @ts-ignore
+    Object.values(align).forEach(function (v) {
+        xs[v] = xs[root[v]];
+    });
+    return xs;
+};
+exports.horizontalCompaction = horizontalCompaction;
+var buildBlockGraph = function (g, layering, root, reverseSep) {
+    var blockGraph = new Graph();
+    var graphLabel = g.graph();
+    var sepFn = sep(graphLabel.nodesep, graphLabel.edgesep, reverseSep);
+    layering.forEach(function (layer) {
+        var u;
+        layer.forEach(function (v) {
+            var vRoot = root[v];
+            blockGraph.setNode(vRoot);
+            if (u) {
+                var uRoot = root[u];
+                var prevMax = blockGraph.edge(uRoot, vRoot);
+                blockGraph.setEdge(uRoot, vRoot, Math.max(sepFn(g, v, u), prevMax || 0));
+            }
+            u = v;
+        });
+    });
+    return blockGraph;
+};
+/*
+ * Returns the alignment that has the smallest width of the given alignments.
+ */
+var findSmallestWidthAlignment = function (g, xss) {
+    // @ts-ignore
+    return util_1.default.minBy(Object.values(xss), function (xs) {
+        var max = Number.NEGATIVE_INFINITY;
+        var min = Number.POSITIVE_INFINITY;
+        Object.keys(xs).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;
+    });
+};
+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 {
+            // @ts-ignore
+            var values = Object.values(xss).map(function (x) { return x[key]; });
+            var xs = values.sort(function (a, b) { return (a - b); });
+            result[key] = (xs[1] + xs[2]) / 2;
+        }
+    });
+    return result;
+    // return _.mapValues(xss.ul, function(ignore, v) {
+    //   if (align) {
+    //     return xss[align.toLowerCase()][v];
+    //   } else {
+    //     const xs = _.sortBy(_.map(xss, v));
+    //     return (xs[1] + xs[2]) / 2;
+    //   }
+    // });
+};
+exports.balance = balance;
+var positionX = function (g) {
+    var layering = util_1.default.buildLayerMatrix(g);
+    var conflicts = Object.assign(findType1Conflicts(g, layering), findType2Conflicts(g, layering));
+    var xss = {};
+    var adjustedLayering;
+    ["u", "d"].forEach(function (vert) {
+        // @ts-ignore
+        adjustedLayering = vert === "u" ? layering : Object.values(layering).reverse();
+        ["l", "r"].forEach(function (horiz) {
+            if (horiz === "r") {
+                // @ts-ignore
+                adjustedLayering = adjustedLayering.map(function (inner) { return Object.values(inner).reverse(); });
+            }
+            var neighborFn = (vert === "u" ? g.predecessors : g.successors).bind(g);
+            var align = verticalAlignment(g, adjustedLayering, conflicts, neighborFn);
+            var xs = horizontalCompaction(g, adjustedLayering, align.root, align.align, horiz === "r");
+            if (horiz === "r") {
+                // @ts-ignore
+                xs = Object.values(xs).map(function (x) { return -x; });
+            }
+            xss[vert + horiz] = xs;
+        });
+    });
+    var smallestWidth = findSmallestWidthAlignment(g, xss);
+    alignCoordinates(xss, smallestWidth);
+    return 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.hasOwnProperty("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;
+    };
+};
+var width = function (g, v) { var _a; return ((_a = g.node(v)) === null || _a === void 0 ? void 0 : _a.width) || 0; };
+exports.default = {
+    positionX: positionX,
+    findType1Conflicts: findType1Conflicts,
+    findType2Conflicts: findType2Conflicts,
+    addConflict: addConflict,
+    hasConflict: hasConflict,
+    verticalAlignment: verticalAlignment,
+    horizontalCompaction: horizontalCompaction,
+    alignCoordinates: alignCoordinates,
+    findSmallestWidthAlignment: findSmallestWidthAlignment,
+    balance: balance
+};
+//# sourceMappingURL=bk.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"bk.js","sourceRoot":"","sources":["../../../../../src/layout/dagre/src/position/bk.ts"],"names":[],"mappings":";;;;;;AAAA,yDAAmC;AACnC,iDAA2B;AAI3B,IAAM,KAAK,GAAI,kBAAgB,CAAC,KAAK,CAAC;AAEtC;;;GAGG;AAGH;;;;;;;;;;;;;;;;GAgBG;AACH,IAAM,kBAAkB,GAAG,UAAC,CAAS,EAAE,QAAa;IAClD,IAAM,SAAS,GAAG,EAAE,CAAC;IAErB,IAAM,UAAU,GAAG,UAAC,SAAc,EAAE,KAAU;QAC5C,uEAAuE;QACvE,WAAW;QACX,IAAI,EAAE,GAAG,CAAC,CAAC;QACT,yEAAyE;QACzE,WAAW;QACb,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,IAAM,eAAe,GAAG,SAAS,CAAC,MAAM,CAAC;QACzC,IAAM,QAAQ,GAAG,KAAK,CAAC,CAAA,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,MAAM,IAAG,CAAC,CAAC,CAAC;QAExC,KAAK,CAAC,OAAO,CAAC,UAAC,CAAS,EAAE,CAAS;YACnC,IAAM,CAAC,GAAG,yBAAyB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,IAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,eAAe,CAAC;YAEjD,IAAI,CAAC,IAAI,CAAC,KAAK,QAAQ,EAAE;gBACvB,KAAK,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,GAAE,CAAC,CAAC,CAAC,OAAO,CAAC,UAAC,QAAa;;oBAC/C,MAAA,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,0CAAE,OAAO,CAAC,UAAC,CAAM;wBACvC,IAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;wBACzB,IAAM,IAAI,GAAG,MAAM,CAAC,KAAe,CAAC;wBACpC,IAAI,CAAC,IAAI,GAAG,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;4BACxB,CAAC,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,KAAK,CAAC,EAAE;4BAC7C,WAAW,CAAC,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,QAAQ,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;IAC5B,OAAO,SAAS,CAAC;AACnB,CAAC,CAAC;AA8WA,gDAAkB;AA5WpB,IAAM,kBAAkB,GAAG,UAAC,CAAS,EAAE,QAAa;IAClD,IAAM,SAAS,GAAG,EAAE,CAAC;IAErB,IAAM,IAAI,GAAG,UAAC,KAAe,EAAE,QAAgB,EAAE,QAAgB,EAAE,eAAuB,EAAE,eAAuB;QACjH,IAAI,CAAM,CAAC;QACX,IAAM,KAAK,GAAG,EAAE,CAAC;QACjB,KAAK,IAAI,CAAC,GAAG,QAAQ,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAG;YACzC,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,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE;gBACnB,MAAA,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,0CAAE,OAAO,CAAC,UAAC,CAAM;oBAChC,IAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACxB,IAAI,KAAK,CAAC,KAAK;wBACX,CAAE,KAAK,CAAC,KAAgB,GAAG,eAAe,IAAK,KAAK,CAAC,KAAgB,GAAG,eAAe,CAAC,EAAE;wBAC5F,WAAW,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;qBAC9B;gBACH,CAAC,CAAC,CAAC;aACJ;QACH,CAAC,CAAC,CAAC;IACL,CAAC,CAAC;IAGF,IAAM,UAAU,GAAG,UAAC,KAAe,EAAE,KAAe;QAClD,IAAI,YAAY,GAAG,CAAC,CAAC,CAAC;QACtB,IAAI,YAAoB,CAAC;QACzB,IAAI,QAAQ,GAAG,CAAC,CAAC;QAEf,KAAK,CAAC,OAAO,CAAC,UAAC,CAAS,EAAE,cAAsB;YAChD,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,KAAK,QAAQ,EAAE;gBAChC,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,CAAC,CAAC,CAAC,KAAe,CAAC;oBACvD,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,QAAQ,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;IAC5B,OAAO,SAAS,CAAC;AACnB,CAAC,CAAC;AA8TA,gDAAkB;AA5TpB,IAAM,yBAAyB,GAAG,UAAC,CAAS,EAAE,CAAS;;IACrD,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE;QACnB,OAAO,MAAA,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,0CAAE,IAAI,CAAC,UAAC,CAAC,IAAK,OAAA,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,EAAf,CAAe,CAAC,CAAC;KACxD;AACH,CAAC,CAAC;AAEF,IAAM,WAAW,GAAG,UAAC,SAAc,EAAE,CAAS,EAAE,CAAS;IACvD,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;AAySA,kCAAW;AAvSb,IAAM,WAAW,GAAG,UAAC,SAAc,EAAE,CAAS,EAAE,CAAS;IACvD,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,SAAS,CAAC,EAAE,CAAC,IAAI,SAAS,CAAC,EAAE,CAAC,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;AAC3D,CAAC,CAAC;AA+RA,kCAAW;AA7Rb;;;;;;;GAOG;AACH,IAAM,iBAAiB,GAAG,UAAC,CAAS,EAAE,QAAa,EAAE,SAAc,EAAE,UAAkC;IACrG,IAAM,IAAI,GAAQ,EAAE,CAAC;IACrB,IAAM,KAAK,GAAQ,EAAE,CAAC;IACtB,IAAM,GAAG,GAAQ,EAAE,CAAC;IAEpB,yEAAyE;IACzE,qEAAqE;IACrE,yCAAyC;IACzC,QAAQ,CAAC,OAAO,CAAC,UAAC,KAAU;QAC1B,KAAK,CAAC,OAAO,CAAC,UAAC,CAAS,EAAE,KAAa;YACrC,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,CAAC,OAAO,CAAC,UAAC,KAAU;QAC1B,IAAI,OAAO,GAAG,CAAC,CAAC,CAAC;QACjB,KAAK,CAAC,OAAO,CAAC,UAAC,CAAM;YACnB,IAAI,EAAE,GAAG,UAAU,CAAC,CAAC,CAAQ,CAAC;YAC9B,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,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;wBACd,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC;wBAChB,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE;wBACjC,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;AAgPA,8CAAiB;AA9OnB,IAAM,oBAAoB,GAAG,UAAC,CAAS,EAAE,QAAa,EAAE,IAAY,EAAE,KAAe,EAAE,UAAmB;IACxG,6EAA6E;IAC7E,uEAAuE;IACvE,mEAAmE;IACnE,6EAA6E;IAC7E,qDAAqD;IACrD,IAAM,EAAE,GAAQ,EAAE,CAAC;IACnB,IAAM,MAAM,GAAG,eAAe,CAAC,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,UAAC,SAAqC,EAAE,aAAqC;QAC3F,IAAI,KAAK,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;QAC3B,IAAI,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;QACvB,IAAM,OAAO,GAAQ,EAAE,CAAC;QACxB,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,CAAM;YACjE,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACxD,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,CAAM;YACnE,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACxD,CAAC,EAAE,MAAM,CAAC,iBAAiB,CAAC,CAAC;QAE7B,IAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1B,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,aAAa;IACb,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,UAAC,CAAM;QAClC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC,CAAC,CAAC;IAEH,OAAO,EAAE,CAAC;AACZ,CAAC,CAAC;AAuLA,oDAAoB;AApLtB,IAAM,eAAe,GAAG,UAAC,CAAS,EAAE,QAAa,EAAE,IAAY,EAAE,UAAmB;IAClF,IAAM,UAAU,GAAG,IAAI,KAAK,EAAE,CAAC;IAC/B,IAAM,UAAU,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC;IAC7B,IAAM,KAAK,GAAG,GAAG,CAAC,UAAU,CAAC,OAAiB,EAAE,UAAU,CAAC,OAAiB,EAAE,UAAqB,CAAC,CAAC;IAErG,QAAQ,CAAC,OAAO,CAAC,UAAC,KAAU;QAC1B,IAAI,CAAM,CAAC;QACX,KAAK,CAAC,OAAO,CAAC,UAAC,CAAM;YACnB,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,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;gBAC9C,UAAU,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC;aAC1E;YACD,CAAC,GAAG,CAAC,CAAC;QACR,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,OAAO,UAAU,CAAC;AACpB,CAAC,CAAC;AACF;;GAEG;AACH,IAAM,0BAA0B,GAAG,UAAC,CAAS,EAAE,GAAQ;IACrD,aAAa;IACb,OAAO,cAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,UAAC,EAAE;QACvC,IAAI,GAAG,GAAG,MAAM,CAAC,iBAAiB,CAAC;QACnC,IAAI,GAAG,GAAG,MAAM,CAAC,iBAAiB,CAAC;QAEnC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,UAAC,CAAS;YAChC,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;AA8IA,gEAA0B;AA5I5B;;;;;;GAMG;AACH,SAAS,gBAAgB,CAAC,GAAQ,EAAE,OAAY;IAC9C,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,GAAG,KAAK,KAAK,GAAG,CAAC,CAAC,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,EAAQ,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,EAAQ,MAAM,CAAC,CAAC;YAE5F,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;AA4GC,4CAAgB;AA1GlB,IAAM,OAAO,GAAG,UAAC,GAAQ,EAAE,KAAa;IACtC,IAAM,MAAM,GAAQ,EAAE,CAAC;IACvB,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,aAAa;YACb,IAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,UAAC,CAAM,IAAK,OAAA,CAAC,CAAC,GAAG,CAAC,EAAN,CAAM,CAAC,CAAC;YAC1D,IAAM,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,UAAC,CAAS,EAAE,CAAS,IAAK,OAAA,CAAC,CAAC,GAAG,CAAC,CAAC,EAAP,CAAO,CAAC,CAAC;YAC1D,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;SACnC;IACH,CAAC,CAAC,CAAC;IACH,OAAO,MAAM,CAAC;IAEd,mDAAmD;IACnD,iBAAiB;IACjB,0CAA0C;IAC1C,aAAa;IACb,0CAA0C;IAC1C,kCAAkC;IAClC,MAAM;IACN,MAAM;AACR,CAAC,CAAC;AAsFA,0BAAO;AApFT,IAAM,SAAS,GAAG,UAAC,CAAS;IAC1B,IAAM,QAAQ,GAAG,cAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;IAC1C,IAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAC7B,kBAAkB,CAAC,CAAC,EAAE,QAAQ,CAAC,EAC/B,kBAAkB,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC;IAEnC,IAAM,GAAG,GAAQ,EAAE,CAAC;IACpB,IAAI,gBAAqB,CAAC;IAC1B,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,UAAC,IAAI;QACtB,aAAa;QACb,gBAAgB,GAAG,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,OAAO,EAAE,CAAC;QAC/E,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,UAAC,KAAK;YACvB,IAAI,KAAK,KAAK,GAAG,EAAE;gBACjB,aAAa;gBACb,gBAAgB,GAAG,gBAAgB,CAAC,GAAG,CAAC,UAAC,KAAU,IAAK,OAAA,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,EAA9B,CAA8B,CAAC,CAAC;aACzF;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,iBAAiB,CAAC,CAAC,EAAE,gBAAgB,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;YAC5E,IAAI,EAAE,GAAG,oBAAoB,CAAC,CAAC,EAAE,gBAAgB,EAC/C,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,KAAK,GAAG,CAAC,CAAC;YAC1C,IAAI,KAAK,KAAK,GAAG,EAAE;gBACjB,aAAa;gBACb,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,UAAC,CAAS,IAAK,OAAA,CAAC,CAAC,EAAF,CAAE,CAAC,CAAC;aAC/C;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,CAAC,CAAC,KAAK,EAAE,CAAC,KAAe,CAAC,CAAC;AACjD,CAAC,CAAC;AA2CA,8BAAS;AAzCX,IAAM,GAAG,GAAG,UAAC,OAAe,EAAE,OAAe,EAAE,UAAmB;IAChE,OAAO,UAAC,CAAS,EAAE,CAAS,EAAE,CAAS;QACrC,IAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,IAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,KAAK,CAAC;QAEV,GAAG,IAAI,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC;QACxB,IAAI,MAAM,CAAC,cAAc,CAAC,UAAU,CAAC,EAAE;YACrC,QAAQ,CAAC,MAAM,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,EAAE;gBAC/C,KAAK,GAAG;oBAAE,KAAK,GAAG,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC;oBAAC,MAAM;gBAC3C,KAAK,GAAG;oBAAE,KAAK,GAAG,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC;oBAAC,MAAM;aACzC;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,KAAK,GAAG,CAAC,CAAC;QACxB,IAAI,MAAM,CAAC,cAAc,CAAC,UAAU,CAAC,EAAE;YACrC,QAAQ,CAAC,MAAM,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,EAAE;gBAC/C,KAAK,GAAG;oBAAE,KAAK,GAAG,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC;oBAAC,MAAM;gBAC1C,KAAK,GAAG;oBAAE,KAAK,GAAG,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC;oBAAC,MAAM;aAC1C;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,IAAM,KAAK,GAAG,UAAC,CAAS,EAAE,CAAS,YAAK,OAAA,CAAA,MAAA,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,0CAAE,KAAK,KAAI,CAAC,CAAA,EAAA,CAAC;AAe9D,kBAAe;IACb,SAAS,WAAA;IACT,kBAAkB,oBAAA;IAClB,kBAAkB,oBAAA;IAClB,WAAW,aAAA;IACX,WAAW,aAAA;IACX,iBAAiB,mBAAA;IACjB,oBAAoB,sBAAA;IACpB,gBAAgB,kBAAA;IAChB,0BAA0B,4BAAA;IAC1B,OAAO,SAAA;CACR,CAAC"}

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

@@ -0,0 +1,4 @@
+import { graphlib as IGraphLib } from '../../graphlib';
+declare type Graph = IGraphLib.Graph;
+declare const position: (g: Graph) => void;
+export default position;

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

@@ -0,0 +1,58 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var util_1 = __importDefault(require("../util"));
+var bk_1 = require("./bk");
+var positionY = function (g) {
+    var layering = util_1.default.buildLayerMatrix(g);
+    var rankSep = g.graph().ranksep;
+    var prevY = 0;
+    layering.forEach(function (layer) {
+        var heights = layer.map(function (v) { return g.node(v).height; });
+        var maxHeight = Math.max.apply(Math, heights);
+        layer.forEach(function (v) {
+            g.node(v).y = prevY + maxHeight / 2;
+        });
+        prevY += maxHeight + rankSep;
+    });
+};
+var positionX = function (g) {
+    var layering = util_1.default.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) {
+        // @ts-ignore
+        adjustedLayering = vert === "u" ? layering : Object.values(layering).reverse();
+        ["l", "r"].forEach(function (horiz) {
+            if (horiz === "r") {
+                // @ts-ignore
+                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;
+    // tslint:disable-next-line
+    g = util_1.default.asNonCompoundGraph(g);
+    positionY(g);
+    var xs = positionX(g);
+    (_a = Object.keys(xs)) === null || _a === void 0 ? void 0 : _a.forEach(function (key) {
+        g.node(key).x = xs[key];
+    });
+};
+exports.default = position;
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/layout/dagre/src/position/index.ts"],"names":[],"mappings":";;;;;AACA,iDAA2B;AAC3B,2BAA8J;AAI9J,IAAM,SAAS,GAAG,UAAC,CAAQ;IACzB,IAAM,QAAQ,GAAG,cAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;IAC1C,IAAM,OAAO,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,OAAiB,CAAC;IAC5C,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,QAAQ,CAAC,OAAO,CAAC,UAAC,KAAU;QAC1B,IAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,UAAC,CAAS,IAAK,OAAA,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,EAAhB,CAAgB,CAAC,CAAC;QAC3D,IAAM,SAAS,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,EAAQ,OAAO,CAAC,CAAC;QACvC,KAAK,CAAC,OAAO,CAAC,UAAC,CAAS;YACtB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,SAAS,GAAG,CAAC,CAAC;QACtC,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,cAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;IAC1C,IAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAC7B,IAAA,uBAAkB,EAAC,CAAC,EAAE,QAAQ,CAAC,EAC/B,IAAA,uBAAkB,EAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC;IAEnC,IAAM,GAAG,GAAQ,EAAE,CAAC;IACpB,IAAI,gBAAqB,CAAC;IAC1B,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,UAAC,IAAI;QACtB,aAAa;QACb,gBAAgB,GAAG,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,OAAO,EAAE,CAAC;QAC/E,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,UAAC,KAAK;YACvB,IAAI,KAAK,KAAK,GAAG,EAAE;gBACjB,aAAa;gBACb,gBAAgB,GAAG,gBAAgB,CAAC,GAAG,CAAC,UAAC,KAAU,IAAK,OAAA,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,EAA9B,CAA8B,CAAC,CAAC;aACzF;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,EAAC,CAAC,EAAE,gBAAgB,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;YAC5E,IAAM,EAAE,GAAG,IAAA,yBAAoB,EAAC,CAAC,EAAE,gBAAgB,EACjD,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,KAAK,GAAG,CAAC,CAAC;YAC1C,IAAI,KAAK,KAAK,GAAG,EAAE;gBACjB,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,UAAC,KAAK,IAAM,OAAA,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,EAAtB,CAAsB,CAAC,CAAC;aAC7D;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,2BAA2B;IAC3B,CAAC,GAAG,cAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC;IAE/B,SAAS,CAAC,CAAC,CAAC,CAAC;IACb,IAAM,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;IACxB,MAAA,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,0CAAE,OAAO,CAAC,UAAC,GAAW;QACnC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;IAC1B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,kBAAe,QAAQ,CAAC"}

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

@@ -0,0 +1,10 @@
+import { graphlib as IGraphLib } from '../../graphlib';
+declare type IGraph = IGraphLib.Graph;
+declare const feasibleTree: (g: IGraph) => IGraph;
+declare const feasibleTreeWithLayer: (g: IGraph) => any;
+export { feasibleTree, feasibleTreeWithLayer };
+declare const _default: {
+    feasibleTree: (g: IGraph) => IGraph;
+    feasibleTreeWithLayer: (g: IGraph) => any;
+};
+export default _default;

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

@@ -0,0 +1,156 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.feasibleTreeWithLayer = exports.feasibleTree = void 0;
+var graphlib_1 = __importDefault(require("../graphlib"));
+var util_1 = require("./util");
+var util_2 = require("../util");
+var Graph = graphlib_1.default.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({ 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({ 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 (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