@antv/layout 0.3.11 → 1.0.0-alpha.0

package/es/layout/dagre/src/layout.js

@@ -1,518 +0,0 @@
-import acyclic from "./acyclic";
-import normalize from "./normalize";
-import rank from "./rank";
-import { normalizeRanks, removeEmptyRanks, time as usetime, notime, asNonCompoundGraph, addDummyNode, intersectRect, buildLayerMatrix, } from "./util";
-import parentDummyChains from "./parent-dummy-chains";
-import nestingGraph from "./nesting-graph";
-import addBorderSegments from "./add-border-segments";
-import coordinateSystem from "./coordinate-system";
-import order from "./order";
-import position from "./position";
-import initDataOrder from "./order/init-data-order";
-import { Graph } from "../graph";
-const layout = (g, opts) => {
-    const time = opts && opts.debugTiming ? usetime : notime;
-    time("layout", () => {
-        // 如果在原图基础上修改，继承原图的order结果
-        if (opts && !opts.keepNodeOrder && opts.prevGraph) {
-            time("  inheritOrder", () => {
-                inheritOrder(g, opts.prevGraph);
-            });
-        }
-        const layoutGraph = time("  buildLayoutGraph", () => {
-            return buildLayoutGraph(g);
-        });
-        // 控制是否为边的label留位置（这会影响是否在边中间添加dummy node）
-        if (!(opts && opts.edgeLabelSpace === false)) {
-            time("  makeSpaceForEdgeLabels", () => {
-                makeSpaceForEdgeLabels(layoutGraph);
-            });
-        }
-        // TODO: 暂时处理层级设置不正确时的异常报错，提示设置正确的层级
-        try {
-            time("  runLayout", () => {
-                runLayout(layoutGraph, time, opts);
-            });
-        }
-        catch (e) {
-            if (e.message ===
-                "Not possible to find intersection inside of the rectangle") {
-                console.error("The following error may be caused by improper layer setting, please make sure your manual layer setting does not violate the graph's structure:\n", e);
-                return;
-            }
-            throw e;
-        }
-        time("  updateInputGraph", () => {
-            updateInputGraph(g, layoutGraph);
-        });
-    });
-};
-const runLayout = (g, time, opts) => {
-    time("    removeSelfEdges", () => {
-        removeSelfEdges(g);
-    });
-    time("    acyclic", () => {
-        acyclic.run(g);
-    });
-    time("    nestingGraph.run", () => {
-        nestingGraph.run(g);
-    });
-    time("    rank", () => {
-        rank(asNonCompoundGraph(g));
-    });
-    time("    injectEdgeLabelProxies", () => {
-        injectEdgeLabelProxies(g);
-    });
-    time("    removeEmptyRanks", () => {
-        removeEmptyRanks(g);
-    });
-    time("    nestingGraph.cleanup", () => {
-        nestingGraph.cleanup(g);
-    });
-    time("    normalizeRanks", () => {
-        normalizeRanks(g);
-    });
-    time("    assignRankMinMax", () => {
-        assignRankMinMax(g);
-    });
-    time("    removeEdgeLabelProxies", () => {
-        removeEdgeLabelProxies(g);
-    });
-    time("    normalize.run", () => {
-        normalize.run(g);
-    });
-    time("    parentDummyChains", () => {
-        parentDummyChains(g);
-    });
-    time("    addBorderSegments", () => {
-        addBorderSegments(g);
-    });
-    if (opts && opts.keepNodeOrder) {
-        time("    initDataOrder", () => {
-            initDataOrder(g, opts.nodeOrder);
-        });
-    }
-    time("    order", () => {
-        order(g);
-    });
-    time("    insertSelfEdges", () => {
-        insertSelfEdges(g);
-    });
-    time("    adjustCoordinateSystem", () => {
-        coordinateSystem.adjust(g);
-    });
-    time("    position", () => {
-        position(g);
-    });
-    time("    positionSelfEdges", () => {
-        positionSelfEdges(g);
-    });
-    time("    removeBorderNodes", () => {
-        removeBorderNodes(g);
-    });
-    time("    normalize.undo", () => {
-        normalize.undo(g);
-    });
-    time("    fixupEdgeLabelCoords", () => {
-        fixupEdgeLabelCoords(g);
-    });
-    time("    undoCoordinateSystem", () => {
-        coordinateSystem.undo(g);
-    });
-    time("    translateGraph", () => {
-        translateGraph(g);
-    });
-    time("    assignNodeIntersects", () => {
-        assignNodeIntersects(g);
-    });
-    time("    reversePoints", () => {
-        reversePointsForReversedEdges(g);
-    });
-    time("    acyclic.undo", () => {
-        acyclic.undo(g);
-    });
-};
-/**
- * 继承上一个布局中的order，防止翻转
- * TODO: 暂时没有考虑涉及层级变动的布局，只保证原来布局层级和相对顺序不变
- */
-const inheritOrder = (currG, prevG) => {
-    currG.nodes().forEach((n) => {
-        const node = currG.node(n);
-        const prevNode = prevG.node(n);
-        if (prevNode !== undefined) {
-            node.fixorder = prevNode._order;
-            delete prevNode._order;
-        }
-        else {
-            delete node.fixorder;
-        }
-    });
-};
-/*
- * Copies final layout information from the layout graph back to the input
- * graph. This process only copies whitelisted attributes from the layout graph
- * to the input graph, so it serves as a good place to determine what
- * attributes can influence layout.
- */
-const updateInputGraph = (inputGraph, layoutGraph) => {
-    inputGraph.nodes().forEach((v) => {
-        var _a;
-        const inputLabel = inputGraph.node(v);
-        if (inputLabel) {
-            const layoutLabel = layoutGraph.node(v);
-            inputLabel.x = layoutLabel.x;
-            inputLabel.y = layoutLabel.y;
-            inputLabel._order = layoutLabel.order;
-            inputLabel._rank = layoutLabel.rank;
-            if ((_a = layoutGraph.children(v)) === null || _a === void 0 ? void 0 : _a.length) {
-                inputLabel.width = layoutLabel.width;
-                inputLabel.height = layoutLabel.height;
-            }
-        }
-    });
-    inputGraph.edges().forEach((e) => {
-        const inputLabel = inputGraph.edge(e);
-        const layoutLabel = layoutGraph.edge(e);
-        inputLabel.points = layoutLabel ? layoutLabel.points : [];
-        if (layoutLabel && layoutLabel.hasOwnProperty("x")) {
-            inputLabel.x = layoutLabel.x;
-            inputLabel.y = layoutLabel.y;
-        }
-    });
-    inputGraph.graph().width = layoutGraph.graph().width;
-    inputGraph.graph().height = layoutGraph.graph().height;
-};
-const graphNumAttrs = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"];
-const graphDefaults = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" };
-const graphAttrs = ["acyclicer", "ranker", "rankdir", "align"];
-const nodeNumAttrs = ["width", "height", "layer", "fixorder"]; // 需要传入layer, fixOrder作为参数参考
-const nodeDefaults = { width: 0, height: 0 };
-const edgeNumAttrs = ["minlen", "weight", "width", "height", "labeloffset"];
-const edgeDefaults = {
-    minlen: 1,
-    weight: 1,
-    width: 0,
-    height: 0,
-    labeloffset: 10,
-    labelpos: "r",
-};
-const edgeAttrs = ["labelpos"];
-/*
- * Constructs a new graph from the input graph, which can be used for layout.
- * This process copies only whitelisted attributes from the input graph to the
- * layout graph. Thus this function serves as a good place to determine what
- * attributes can influence layout.
- */
-const buildLayoutGraph = (inputGraph) => {
-    const g = new Graph({ multigraph: true, compound: true });
-    const graph = canonicalize(inputGraph.graph());
-    const pickedProperties = {};
-    graphAttrs === null || graphAttrs === void 0 ? void 0 : graphAttrs.forEach((key) => {
-        if (graph[key] !== undefined)
-            pickedProperties[key] = graph[key];
-    });
-    g.setGraph(Object.assign({}, graphDefaults, selectNumberAttrs(graph, graphNumAttrs), pickedProperties));
-    inputGraph.nodes().forEach((v) => {
-        const node = canonicalize(inputGraph.node(v));
-        const defaultNode = Object.assign(Object.assign({}, nodeDefaults), node);
-        const defaultAttrs = selectNumberAttrs(defaultNode, nodeNumAttrs);
-        g.setNode(v, defaultAttrs);
-        g.setParent(v, inputGraph.parent(v));
-    });
-    inputGraph.edges().forEach((e) => {
-        const edge = canonicalize(inputGraph.edge(e));
-        const pickedProperties = {};
-        edgeAttrs === null || edgeAttrs === void 0 ? void 0 : edgeAttrs.forEach((key) => {
-            if (edge[key] !== undefined)
-                pickedProperties[key] = edge[key];
-        });
-        g.setEdgeObj(e, Object.assign({}, edgeDefaults, selectNumberAttrs(edge, edgeNumAttrs), pickedProperties));
-    });
-    return g;
-};
-/*
- * This idea comes from the Gansner paper: to account for edge labels in our
- * layout we split each rank in half by doubling minlen and halving ranksep.
- * Then we can place labels at these mid-points between nodes.
- *
- * We also add some minimal padding to the width to push the label for the edge
- * away from the edge itself a bit.
- */
-const makeSpaceForEdgeLabels = (g) => {
-    const graph = g.graph();
-    if (!graph.ranksep)
-        graph.ranksep = 0;
-    graph.ranksep /= 2;
-    g.nodes().forEach((n) => {
-        const node = g.node(n);
-        if (!isNaN(node.layer)) {
-            if (!node.layer)
-                node.layer = 0;
-        }
-    });
-    g.edges().forEach((e) => {
-        var _a;
-        const edge = g.edge(e);
-        edge.minlen *= 2;
-        if (((_a = edge.labelpos) === null || _a === void 0 ? void 0 : _a.toLowerCase()) !== "c") {
-            if (graph.rankdir === "TB" || graph.rankdir === "BT") {
-                edge.width += edge.labeloffset;
-            }
-            else {
-                edge.height += edge.labeloffset;
-            }
-        }
-    });
-};
-/*
- * Creates temporary dummy nodes that capture the rank in which each edge's
- * label is going to, if it has one of non-zero width and height. We do this
- * so that we can safely remove empty ranks while preserving balance for the
- * label's position.
- */
-const injectEdgeLabelProxies = (g) => {
-    g.edges().forEach((e) => {
-        const edge = g.edge(e);
-        if (edge.width && edge.height) {
-            const v = g.node(e.v);
-            const w = g.node(e.w);
-            const label = {
-                e,
-                rank: (w.rank - v.rank) / 2 + v.rank,
-            };
-            addDummyNode(g, "edge-proxy", label, "_ep");
-        }
-    });
-};
-const assignRankMinMax = (g) => {
-    let maxRank = 0;
-    g.nodes().forEach((v) => {
-        var _a, _b;
-        const node = g.node(v);
-        if (node.borderTop) {
-            node.minRank = (_a = g.node(node.borderTop)) === null || _a === void 0 ? void 0 : _a.rank;
-            node.maxRank = (_b = g.node(node.borderBottom)) === null || _b === void 0 ? void 0 : _b.rank;
-            maxRank = Math.max(maxRank, node.maxRank || -Infinity);
-        }
-    });
-    g.graph().maxRank = maxRank;
-};
-const removeEdgeLabelProxies = (g) => {
-    g.nodes().forEach((v) => {
-        const node = g.node(v);
-        if (node.dummy === "edge-proxy") {
-            g.edge(node.e).labelRank = node.rank;
-            g.removeNode(v);
-        }
-    });
-};
-const translateGraph = (g) => {
-    let minX;
-    let maxX = 0;
-    let minY;
-    let maxY = 0;
-    const graphLabel = g.graph();
-    const marginX = graphLabel.marginx || 0;
-    const marginY = graphLabel.marginy || 0;
-    const getExtremes = (attrs) => {
-        if (!attrs)
-            return;
-        const x = attrs.x;
-        const y = attrs.y;
-        const w = attrs.width;
-        const h = attrs.height;
-        if (!isNaN(x) && !isNaN(w)) {
-            if (minX === undefined) {
-                minX = x - w / 2;
-            }
-            minX = Math.min(minX, x - w / 2);
-            maxX = Math.max(maxX, x + w / 2);
-        }
-        if (!isNaN(y) && !isNaN(h)) {
-            if (minY === undefined) {
-                minY = y - h / 2;
-            }
-            minY = Math.min(minY, y - h / 2);
-            maxY = Math.max(maxY, y + h / 2);
-        }
-    };
-    g.nodes().forEach((v) => {
-        getExtremes(g.node(v));
-    });
-    g.edges().forEach((e) => {
-        const edge = g.edge(e);
-        if (edge === null || edge === void 0 ? void 0 : edge.hasOwnProperty("x")) {
-            getExtremes(edge);
-        }
-    });
-    minX -= marginX;
-    minY -= marginY;
-    g.nodes().forEach((v) => {
-        const node = g.node(v);
-        if (node) {
-            node.x -= minX;
-            node.y -= minY;
-        }
-    });
-    g.edges().forEach((e) => {
-        var _a;
-        const edge = g.edge(e);
-        (_a = edge.points) === null || _a === void 0 ? void 0 : _a.forEach((p) => {
-            p.x -= minX;
-            p.y -= minY;
-        });
-        if (edge.hasOwnProperty("x")) {
-            edge.x -= minX;
-        }
-        if (edge.hasOwnProperty("y")) {
-            edge.y -= minY;
-        }
-    });
-    graphLabel.width = maxX - minX + marginX;
-    graphLabel.height = maxY - minY + marginY;
-};
-const assignNodeIntersects = (g) => {
-    g.edges().forEach((e) => {
-        const edge = g.edge(e);
-        const nodeV = g.node(e.v);
-        const nodeW = g.node(e.w);
-        let p1;
-        let p2;
-        if (!edge.points) {
-            edge.points = [];
-            p1 = nodeW;
-            p2 = nodeV;
-        }
-        else {
-            p1 = edge.points[0];
-            p2 = edge.points[edge.points.length - 1];
-        }
-        edge.points.unshift(intersectRect(nodeV, p1));
-        edge.points.push(intersectRect(nodeW, p2));
-    });
-};
-const fixupEdgeLabelCoords = (g) => {
-    g.edges().forEach((e) => {
-        const edge = g.edge(e);
-        if (edge === null || edge === void 0 ? void 0 : edge.hasOwnProperty("x")) {
-            if (edge.labelpos === "l" || edge.labelpos === "r") {
-                edge.width -= edge.labeloffset;
-            }
-            switch (edge.labelpos) {
-                case "l":
-                    edge.x -= edge.width / 2 + edge.labeloffset;
-                    break;
-                case "r":
-                    edge.x += edge.width / 2 + edge.labeloffset;
-                    break;
-            }
-        }
-    });
-};
-const reversePointsForReversedEdges = (g) => {
-    g.edges().forEach((e) => {
-        var _a;
-        const edge = g.edge(e);
-        if (edge.reversed) {
-            (_a = edge.points) === null || _a === void 0 ? void 0 : _a.reverse();
-        }
-    });
-};
-const removeBorderNodes = (g) => {
-    g.nodes().forEach((v) => {
-        var _a, _b, _c;
-        if ((_a = g.children(v)) === null || _a === void 0 ? void 0 : _a.length) {
-            const node = g.node(v);
-            const t = g.node(node.borderTop);
-            const b = g.node(node.borderBottom);
-            const l = g.node(node.borderLeft[((_b = node.borderLeft) === null || _b === void 0 ? void 0 : _b.length) - 1]);
-            const r = g.node(node.borderRight[((_c = node.borderRight) === null || _c === void 0 ? void 0 : _c.length) - 1]);
-            node.width = Math.abs((r === null || r === void 0 ? void 0 : r.x) - (l === null || l === void 0 ? void 0 : l.x)) || 10;
-            node.height = Math.abs((b === null || b === void 0 ? void 0 : b.y) - (t === null || t === void 0 ? void 0 : t.y)) || 10;
-            node.x = ((l === null || l === void 0 ? void 0 : l.x) || 0) + node.width / 2;
-            node.y = ((t === null || t === void 0 ? void 0 : t.y) || 0) + node.height / 2;
-        }
-    });
-    g.nodes().forEach((v) => {
-        var _a;
-        if (((_a = g.node(v)) === null || _a === void 0 ? void 0 : _a.dummy) === "border") {
-            g.removeNode(v);
-        }
-    });
-};
-const removeSelfEdges = (g) => {
-    g.edges().forEach((e) => {
-        if (e.v === e.w) {
-            const node = g.node(e.v);
-            if (!node.selfEdges) {
-                node.selfEdges = [];
-            }
-            node.selfEdges.push({ e, label: g.edge(e) });
-            g.removeEdgeObj(e);
-        }
-    });
-};
-const insertSelfEdges = (g) => {
-    const layers = buildLayerMatrix(g);
-    layers === null || layers === void 0 ? void 0 : layers.forEach((layer) => {
-        let orderShift = 0;
-        layer === null || layer === void 0 ? void 0 : layer.forEach((v, i) => {
-            var _a;
-            const node = g.node(v);
-            node.order = i + orderShift;
-            (_a = node.selfEdges) === null || _a === void 0 ? void 0 : _a.forEach((selfEdge) => {
-                addDummyNode(g, "selfedge", {
-                    width: selfEdge.label.width,
-                    height: selfEdge.label.height,
-                    rank: node.rank,
-                    order: i + ++orderShift,
-                    e: selfEdge.e,
-                    label: selfEdge.label,
-                }, "_se");
-            });
-            delete node.selfEdges;
-        });
-    });
-};
-const positionSelfEdges = (g) => {
-    g.nodes().forEach((v) => {
-        const node = g.node(v);
-        if (node.dummy === "selfedge") {
-            const selfNode = g.node(node.e.v);
-            const x = selfNode.x + selfNode.width / 2;
-            const y = selfNode.y;
-            const dx = node.x - x;
-            const dy = selfNode.height / 2;
-            g.setEdgeObj(node.e, node.label);
-            g.removeNode(v);
-            node.label.points = [
-                { x: x + (2 * dx) / 3, y: y - dy },
-                { x: x + (5 * dx) / 6, y: y - dy },
-                { y, x: x + dx },
-                { x: x + (5 * dx) / 6, y: y + dy },
-                { x: x + (2 * dx) / 3, y: y + dy },
-            ];
-            node.label.x = node.x;
-            node.label.y = node.y;
-        }
-    });
-};
-const selectNumberAttrs = (obj, attrs) => {
-    const pickedProperties = {};
-    attrs === null || attrs === void 0 ? void 0 : attrs.forEach((key) => {
-        if (obj[key] === undefined)
-            return;
-        pickedProperties[key] = (+obj[key]);
-    });
-    return pickedProperties;
-};
-const canonicalize = (attrs = {}) => {
-    const newAttrs = {};
-    Object.keys(attrs).forEach((k) => {
-        newAttrs[k.toLowerCase()] = attrs[k];
-    });
-    return newAttrs;
-};
-export default layout;
-//# sourceMappingURL=layout.js.map

package/es/layout/dagre/src/layout.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"layout.js","sourceRoot":"","sources":["../../../../src/layout/dagre/src/layout.ts"],"names":[],"mappings":"AAAA,OAAO,OAAO,MAAM,WAAW,CAAC;AAChC,OAAO,SAAS,MAAM,aAAa,CAAC;AACpC,OAAO,IAAI,MAAM,QAAQ,CAAC;AAC1B,OAAO,EACL,cAAc,EACd,gBAAgB,EAChB,IAAI,IAAI,OAAO,EACf,MAAM,EACN,kBAAkB,EAClB,YAAY,EACZ,aAAa,EACb,gBAAgB,GACjB,MAAM,QAAQ,CAAC;AAChB,OAAO,iBAAiB,MAAM,uBAAuB,CAAC;AACtD,OAAO,YAAY,MAAM,iBAAiB,CAAC;AAC3C,OAAO,iBAAiB,MAAM,uBAAuB,CAAC;AACtD,OAAO,gBAAgB,MAAM,qBAAqB,CAAC;AACnD,OAAO,KAAK,MAAM,SAAS,CAAC;AAC5B,OAAO,QAAQ,MAAM,YAAY,CAAC;AAClC,OAAO,aAAa,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,KAAK,EAAQ,MAAM,UAAU,CAAC;AAEvC,MAAM,MAAM,GAAG,CAAC,CAAQ,EAAE,IAAU,EAAE,EAAE;IACtC,MAAM,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC;IACzD,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE;QAClB,0BAA0B;QAC1B,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,SAAS,EAAE;YACjD,IAAI,CAAC,gBAAgB,EAAE,GAAG,EAAE;gBAC1B,YAAY,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;YAClC,CAAC,CAAC,CAAC;SACJ;QACD,MAAM,WAAW,GAAQ,IAAI,CAAC,oBAAoB,EAAE,GAAG,EAAE;YACvD,OAAO,gBAAgB,CAAC,CAAC,CAAC,CAAC;QAC7B,CAAC,CAAC,CAAC;QACH,0CAA0C;QAC1C,IAAI,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,cAAc,KAAK,KAAK,CAAC,EAAE;YAC5C,IAAI,CAAC,0BAA0B,EAAE,GAAG,EAAE;gBACpC,sBAAsB,CAAC,WAAW,CAAC,CAAC;YACtC,CAAC,CAAC,CAAC;SACJ;QACD,oCAAoC;QACpC,IAAI;YACF,IAAI,CAAC,aAAa,EAAE,GAAG,EAAE;gBACvB,SAAS,CAAC,WAAW,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;YACrC,CAAC,CAAC,CAAC;SACJ;QAAC,OAAO,CAAC,EAAE;YACV,IACE,CAAC,CAAC,OAAO;gBACT,2DAA2D,EAC3D;gBACA,OAAO,CAAC,KAAK,CACX,mJAAmJ,EACnJ,CAAC,CACF,CAAC;gBACF,OAAO;aACR;YACD,MAAM,CAAC,CAAC;SACT;QACD,IAAI,CAAC,oBAAoB,EAAE,GAAG,EAAE;YAC9B,gBAAgB,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,SAAS,GAAG,CAAC,CAAQ,EAAE,IAAS,EAAE,IAAS,EAAE,EAAE;IACnD,IAAI,CAAC,qBAAqB,EAAE,GAAG,EAAE;QAC/B,eAAe,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC,CAAC,CAAC;IACH,IAAI,CAAC,aAAa,EAAE,GAAG,EAAE;QACvB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACjB,CAAC,CAAC,CAAC;IACH,IAAI,CAAC,sBAAsB,EAAE,GAAG,EAAE;QAChC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC,CAAC,CAAC;IACH,IAAI,CAAC,UAAU,EAAE,GAAG,EAAE;QACpB,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IACH,IAAI,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACtC,sBAAsB,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IACH,IAAI,CAAC,sBAAsB,EAAE,GAAG,EAAE;QAChC,gBAAgB,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC,CAAC,CAAC;IACH,IAAI,CAAC,0BAA0B,EAAE,GAAG,EAAE;QACpC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC,CAAC,CAAC;IACH,IAAI,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAC9B,cAAc,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC,CAAC,CAAC;IACH,IAAI,CAAC,sBAAsB,EAAE,GAAG,EAAE;QAChC,gBAAgB,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC,CAAC,CAAC;IACH,IAAI,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACtC,sBAAsB,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IACH,IAAI,CAAC,mBAAmB,EAAE,GAAG,EAAE;QAC7B,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACnB,CAAC,CAAC,CAAC;IACH,IAAI,CAAC,uBAAuB,EAAE,GAAG,EAAE;QACjC,iBAAiB,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC,CAAC,CAAC;IACH,IAAI,CAAC,uBAAuB,EAAE,GAAG,EAAE;QACjC,iBAAiB,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC,CAAC,CAAC;IACH,IAAI,IAAI,IAAI,IAAI,CAAC,aAAa,EAAE;QAC9B,IAAI,CAAC,mBAAmB,EAAE,GAAG,EAAE;YAC7B,aAAa,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;KACJ;IACD,IAAI,CAAC,WAAW,EAAE,GAAG,EAAE;QACrB,KAAK,CAAC,CAAC,CAAC,CAAC;IACX,CAAC,CAAC,CAAC;IACH,IAAI,CAAC,qBAAqB,EAAE,GAAG,EAAE;QAC/B,eAAe,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC,CAAC,CAAC;IACH,IAAI,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACtC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;IACH,IAAI,CAAC,cAAc,EAAE,GAAG,EAAE;QACxB,QAAQ,CAAC,CAAC,CAAC,CAAC;IACd,CAAC,CAAC,CAAC;IACH,IAAI,CAAC,uBAAuB,EAAE,GAAG,EAAE;QACjC,iBAAiB,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC,CAAC,CAAC;IACH,IAAI,CAAC,uBAAuB,EAAE,GAAG,EAAE;QACjC,iBAAiB,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC,CAAC,CAAC;IACH,IAAI,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAC9B,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC,CAAC,CAAC;IACH,IAAI,CAAC,0BAA0B,EAAE,GAAG,EAAE;QACpC,oBAAoB,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC,CAAC,CAAC;IACH,IAAI,CAAC,0BAA0B,EAAE,GAAG,EAAE;QACpC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC3B,CAAC,CAAC,CAAC;IACH,IAAI,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAC9B,cAAc,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC,CAAC,CAAC;IACH,IAAI,CAAC,0BAA0B,EAAE,GAAG,EAAE;QACpC,oBAAoB,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC,CAAC,CAAC;IACH,IAAI,CAAC,mBAAmB,EAAE,GAAG,EAAE;QAC7B,6BAA6B,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IACH,IAAI,CAAC,kBAAkB,EAAE,GAAG,EAAE;QAC5B,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,YAAY,GAAG,CAAC,KAAY,EAAE,KAAY,EAAE,EAAE;IAClD,KAAK,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAS,EAAE,EAAE;QAClC,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;QAC5B,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;QAChC,IAAI,QAAQ,KAAK,SAAS,EAAE;YAC1B,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC;YAChC,OAAO,QAAQ,CAAC,MAAM,CAAC;SACxB;aAAM;YACL,OAAO,IAAI,CAAC,QAAQ,CAAC;SACtB;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF;;;;;GAKG;AACH,MAAM,gBAAgB,GAAG,CAAC,UAAiB,EAAE,WAAkB,EAAE,EAAE;IACjE,UAAU,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;;QAC/B,MAAM,UAAU,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAEtC,IAAI,UAAU,EAAE;YACd,MAAM,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;YACzC,UAAU,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;YAC7B,UAAU,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;YAC7B,UAAU,CAAC,MAAM,GAAG,WAAW,CAAC,KAAK,CAAC;YACtC,UAAU,CAAC,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC;YAEpC,IAAI,MAAA,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,0CAAE,MAAM,EAAE;gBACnC,UAAU,CAAC,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC;gBACrC,UAAU,CAAC,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC;aACxC;SACF;IACH,CAAC,CAAC,CAAC;IAEH,UAAU,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QAC/B,MAAM,UAAU,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;QACvC,MAAM,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;QAEzC,UAAU,CAAC,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1D,IAAI,WAAW,IAAI,WAAW,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;YAClD,UAAU,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;YAC7B,UAAU,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;SAC9B;IACH,CAAC,CAAC,CAAC;IAEH,UAAU,CAAC,KAAK,EAAE,CAAC,KAAK,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC;IACrD,UAAU,CAAC,KAAK,EAAE,CAAC,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC,MAAM,CAAC;AACzD,CAAC,CAAC;AAEF,MAAM,aAAa,GAAG,CAAC,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;AAC9E,MAAM,aAAa,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;AAC/E,MAAM,UAAU,GAAG,CAAC,WAAW,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;AAC/D,MAAM,YAAY,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC,CAAC,4BAA4B;AAC3F,MAAM,YAAY,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;AAC7C,MAAM,YAAY,GAAG,CAAC,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,aAAa,CAAC,CAAC;AAC5E,MAAM,YAAY,GAAG;IACnB,MAAM,EAAE,CAAC;IACT,MAAM,EAAE,CAAC;IACT,KAAK,EAAE,CAAC;IACR,MAAM,EAAE,CAAC;IACT,WAAW,EAAE,EAAE;IACf,QAAQ,EAAE,GAAG;CACd,CAAC;AACF,MAAM,SAAS,GAAG,CAAC,UAAU,CAAC,CAAC;AAE/B;;;;;GAKG;AACH,MAAM,gBAAgB,GAAG,CAAC,UAAiB,EAAE,EAAE;IAC7C,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,EAAE,UAAU,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC;IAC1D,MAAM,KAAK,GAAG,YAAY,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC;IAE/C,MAAM,gBAAgB,GAAQ,EAAE,CAAC;IACjC,UAAU,aAAV,UAAU,uBAAV,UAAU,CAAE,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE;QAC1B,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,SAAS;YAAE,gBAAgB,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;IACnE,CAAC,CAAC,CAAC;IAEH,CAAC,CAAC,QAAQ,CACR,MAAM,CAAC,MAAM,CACX,EAAE,EACF,aAAa,EACb,iBAAiB,CAAC,KAAK,EAAE,aAAa,CAAC,EACvC,gBAAgB,CACjB,CACF,CAAC;IAEF,UAAU,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QAC/B,MAAM,IAAI,GAAG,YAAY,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,MAAM,WAAW,GAAG,gCACf,YAAY,GACZ,IAAI,CACA,CAAC;QACV,MAAM,YAAY,GAAG,iBAAiB,CAAC,WAAW,EAAE,YAAY,CAAS,CAAC;QAE1E,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;QAC3B,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,UAAU,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QAC/B,MAAM,IAAI,GAAG,YAAY,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAE9C,MAAM,gBAAgB,GAAQ,EAAE,CAAC;QACjC,SAAS,aAAT,SAAS,uBAAT,SAAS,CAAE,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE;YACzB,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,SAAS;gBAAE,gBAAgB,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;QACjE,CAAC,CAAC,CAAC;QAEH,CAAC,CAAC,UAAU,CACV,CAAC,EACD,MAAM,CAAC,MAAM,CACX,EAAE,EACF,YAAY,EACZ,iBAAiB,CAAC,IAAI,EAAE,YAAY,CAAC,EACrC,gBAAgB,CACjB,CACF,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAEF;;;;;;;GAOG;AACH,MAAM,sBAAsB,GAAG,CAAC,CAAQ,EAAE,EAAE;IAC1C,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC;IACxB,IAAI,CAAC,KAAK,CAAC,OAAO;QAAE,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC;IACtC,KAAK,CAAC,OAAO,IAAI,CAAC,CAAC;IACnB,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QACtB,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;QACxB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAY,CAAC,EAAE;YAC7B,IAAI,CAAC,IAAI,CAAC,KAAK;gBAAE,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;SACjC;IACH,CAAC,CAAC,CAAC;IACH,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;;QACtB,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;QACxB,IAAI,CAAC,MAAO,IAAI,CAAC,CAAC;QAClB,IAAI,CAAA,MAAA,IAAI,CAAC,QAAQ,0CAAE,WAAW,EAAE,MAAK,GAAG,EAAE;YACxC,IAAI,KAAK,CAAC,OAAO,KAAK,IAAI,IAAI,KAAK,CAAC,OAAO,KAAK,IAAI,EAAE;gBACpD,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,WAAW,CAAC;aAChC;iBAAM;gBACL,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,WAAW,CAAC;aACjC;SACF;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF;;;;;GAKG;AACH,MAAM,sBAAsB,GAAG,CAAC,CAAQ,EAAE,EAAE;IAC1C,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QACtB,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;QACxB,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE;YAC7B,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC;YACvB,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC;YACvB,MAAM,KAAK,GAAG;gBACZ,CAAC;gBACD,IAAI,EACF,CAAE,CAAC,CAAC,IAAe,GAAI,CAAC,CAAC,IAAe,CAAC,GAAG,CAAC,GAAI,CAAC,CAAC,IAAe;aACrE,CAAC;YACF,YAAY,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;SAC7C;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,gBAAgB,GAAG,CAAC,CAAQ,EAAE,EAAE;IACpC,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;;QACtB,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;QACxB,IAAI,IAAI,CAAC,SAAS,EAAE;YAClB,IAAI,CAAC,OAAO,GAAG,MAAA,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,0CAAE,IAAI,CAAC;YAC5C,IAAI,CAAC,OAAO,GAAG,MAAA,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,0CAAE,IAAI,CAAC;YAC/C,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC;SACxD;IACH,CAAC,CAAC,CAAC;IACH,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,GAAG,OAAO,CAAC;AAC9B,CAAC,CAAC;AAEF,MAAM,sBAAsB,GAAG,CAAC,CAAQ,EAAE,EAAE;IAC1C,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QACtB,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;QACxB,IAAI,IAAI,CAAC,KAAK,KAAK,YAAY,EAAE;YAC/B,CAAC,CAAC,IAAI,CAAE,IAAY,CAAC,CAAC,CAAE,CAAC,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC;YAC/C,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;SACjB;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,cAAc,GAAG,CAAC,CAAQ,EAAE,EAAE;IAClC,IAAI,IAAY,CAAC;IACjB,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,IAAY,CAAC;IACjB,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,MAAM,UAAU,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC;IAC7B,MAAM,OAAO,GAAG,UAAU,CAAC,OAAO,IAAI,CAAC,CAAC;IACxC,MAAM,OAAO,GAAG,UAAU,CAAC,OAAO,IAAI,CAAC,CAAC;IAExC,MAAM,WAAW,GAAG,CAAC,KAAU,EAAE,EAAE;QACjC,IAAI,CAAC,KAAK;YAAE,OAAO;QACnB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QAClB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QAClB,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC;QACtB,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;QACvB,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE;YAC1B,IAAI,IAAI,KAAK,SAAS,EAAE;gBACtB,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;aAClB;YACD,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YACjC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;SAClC;QACD,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE;YAC1B,IAAI,IAAI,KAAK,SAAS,EAAE;gBACtB,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;aAClB;YACD,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YACjC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;SAClC;IACH,CAAC,CAAC;IAEF,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QACtB,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,CAAC,CAAC,CAAC;IACH,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QACtB,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;QACxB,IAAI,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,cAAc,CAAC,GAAG,CAAC,EAAE;YAC7B,WAAW,CAAC,IAAI,CAAC,CAAC;SACnB;IACH,CAAC,CAAC,CAAC;IAEH,IAAK,IAAI,OAAO,CAAC;IACjB,IAAK,IAAI,OAAO,CAAC;IAEjB,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QACtB,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,IAAI,EAAE;YACR,IAAI,CAAC,CAAE,IAAI,IAAI,CAAC;YAChB,IAAI,CAAC,CAAE,IAAI,IAAI,CAAC;SACjB;IACH,CAAC,CAAC,CAAC;IAEH,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;;QACtB,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;QACxB,MAAA,IAAI,CAAC,MAAM,0CAAE,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;YACzB,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;YACZ,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;QACd,CAAC,CAAC,CAAC;QACH,IAAI,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;YAC5B,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC;SAChB;QACD,IAAI,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;YAC5B,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC;SAChB;IACH,CAAC,CAAC,CAAC;IAEH,UAAU,CAAC,KAAK,GAAG,IAAI,GAAG,IAAK,GAAG,OAAO,CAAC;IAC1C,UAAU,CAAC,MAAM,GAAG,IAAI,GAAG,IAAK,GAAG,OAAO,CAAC;AAC7C,CAAC,CAAC;AAEF,MAAM,oBAAoB,GAAG,CAAC,CAAQ,EAAE,EAAE;IACxC,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QACtB,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;QACxB,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC;QAC3B,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC;QAC3B,IAAI,EAAE,CAAC;QACP,IAAI,EAAE,CAAC;QACP,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YAChB,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;YACjB,EAAE,GAAG,KAAK,CAAC;YACX,EAAE,GAAG,KAAK,CAAC;SACZ;aAAM;YACL,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACpB,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;SAC1C;QACD,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,aAAa,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC;QAC9C,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,oBAAoB,GAAG,CAAC,CAAQ,EAAE,EAAE;IACxC,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QACtB,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;QACxB,IAAI,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,cAAc,CAAC,GAAG,CAAC,EAAE;YAC7B,IAAI,IAAI,CAAC,QAAQ,KAAK,GAAG,IAAI,IAAI,CAAC,QAAQ,KAAK,GAAG,EAAE;gBAClD,IAAI,CAAC,KAAM,IAAI,IAAI,CAAC,WAAW,CAAC;aACjC;YACD,QAAQ,IAAI,CAAC,QAAQ,EAAE;gBACrB,KAAK,GAAG;oBACN,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,KAAM,GAAG,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC;oBAC7C,MAAM;gBACR,KAAK,GAAG;oBACN,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,KAAM,GAAG,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC;oBAC7C,MAAM;aACT;SACF;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,6BAA6B,GAAG,CAAC,CAAQ,EAAE,EAAE;IACjD,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;;QACtB,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;QACxB,IAAI,IAAI,CAAC,QAAQ,EAAE;YACjB,MAAA,IAAI,CAAC,MAAM,0CAAE,OAAO,EAAE,CAAC;SACxB;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,iBAAiB,GAAG,CAAC,CAAQ,EAAE,EAAE;IACrC,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;;QACtB,IAAI,MAAA,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,0CAAE,MAAM,EAAE;YACzB,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;YACxB,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACjC,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YACpC,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAA,MAAA,IAAI,CAAC,UAAU,0CAAE,MAAM,IAAG,CAAC,CAAC,CAAC,CAAC;YAC/D,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAA,MAAA,IAAI,CAAC,WAAW,0CAAE,MAAM,IAAG,CAAC,CAAC,CAAC,CAAC;YAEjE,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAA,CAAC,aAAD,CAAC,uBAAD,CAAC,CAAE,CAAE,KAAG,CAAC,aAAD,CAAC,uBAAD,CAAC,CAAE,CAAE,CAAA,CAAC,IAAI,EAAE,CAAC;YAC3C,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAA,CAAC,aAAD,CAAC,uBAAD,CAAC,CAAE,CAAE,KAAG,CAAC,aAAD,CAAC,uBAAD,CAAC,CAAE,CAAE,CAAA,CAAC,IAAI,EAAE,CAAC;YAC5C,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA,CAAC,aAAD,CAAC,uBAAD,CAAC,CAAE,CAAC,KAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;YACtC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA,CAAC,aAAD,CAAC,uBAAD,CAAC,CAAE,CAAC,KAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;SACxC;IACH,CAAC,CAAC,CAAC;IAEH,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;;QACtB,IAAI,CAAA,MAAA,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,0CAAE,KAAK,MAAK,QAAQ,EAAE;YACjC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;SACjB;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,eAAe,GAAG,CAAC,CAAQ,EAAE,EAAE;IACnC,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QACtB,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE;YACf,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC;YAC1B,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE;gBACnB,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;aACrB;YACD,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAC7C,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;SACpB;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,eAAe,GAAG,CAAC,CAAQ,EAAE,EAAE;IACnC,MAAM,MAAM,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;IACnC,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,OAAO,CAAC,CAAC,KAAe,EAAE,EAAE;QAClC,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,OAAO,CAAC,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE;;YACtC,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;YACxB,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,UAAU,CAAC;YAC5B,MAAA,IAAI,CAAC,SAAS,0CAAE,OAAO,CAAC,CAAC,QAAa,EAAE,EAAE;gBACxC,YAAY,CACV,CAAC,EACD,UAAU,EACV;oBACE,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,KAAK;oBAC3B,MAAM,EAAE,QAAQ,CAAC,KAAK,CAAC,MAAM;oBAC7B,IAAI,EAAE,IAAI,CAAC,IAAI;oBACf,KAAK,EAAE,CAAC,GAAG,EAAE,UAAU;oBACvB,CAAC,EAAE,QAAQ,CAAC,CAAC;oBACb,KAAK,EAAE,QAAQ,CAAC,KAAK;iBACtB,EACD,KAAK,CACN,CAAC;YACJ,CAAC,CAAC,CAAC;YACH,OAAO,IAAI,CAAC,SAAS,CAAC;QACxB,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,iBAAiB,GAAG,CAAC,CAAQ,EAAE,EAAE;IACrC,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QACtB,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;QACxB,IAAI,IAAI,CAAC,KAAK,KAAK,UAAU,EAAE;YAC7B,MAAM,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC;YACnC,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAE,GAAG,QAAQ,CAAC,KAAM,GAAG,CAAC,CAAC;YAC5C,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAE,CAAC;YACtB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAE,GAAG,CAAC,CAAC;YACvB,MAAM,EAAE,GAAG,QAAQ,CAAC,MAAO,GAAG,CAAC,CAAC;YAChC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;YACjC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAChB,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG;gBAClB,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;gBAClC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;gBAClC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;gBAChB,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;gBAClC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;aACnC,CAAC;YACF,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;YACtB,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;SACvB;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,iBAAiB,GAAG,CAAC,GAAwB,EAAE,KAAe,EAAE,EAAE;IACtE,MAAM,gBAAgB,GAAwB,EAAE,CAAC;IACjD,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,OAAO,CAAC,CAAC,GAAW,EAAE,EAAE;QAC7B,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,SAAS;YAAE,OAAO;QACnC,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IACH,OAAO,gBAAgB,CAAC;AAC1B,CAAC,CAAC;AAEF,MAAM,YAAY,GAAG,CAAC,QAA6B,EAAE,EAAE,EAAE;IACvD,MAAM,QAAQ,GAAwB,EAAE,CAAC;IACzC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAS,EAAE,EAAE;QACvC,QAAQ,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IACH,OAAO,QAAQ,CAAC;AAClB,CAAC,CAAC;AAEF,eAAe,MAAM,CAAC"}

package/es/layout/dagre/src/nesting-graph.d.ts

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

package/es/layout/dagre/src/nesting-graph.js

@@ -1,117 +0,0 @@
-import { addBorderNode, addDummyNode } from "./util";
-/*
- * A nesting graph creates dummy nodes for the tops and bottoms of subgraphs,
- * adds appropriate edges to ensure that all cluster nodes are placed between
- * these boundries, and ensures that the graph is connected.
- *
- * In addition we ensure, through the use of the minlen property, that nodes
- * and subgraph border nodes to not end up on the same rank.
- *
- * Preconditions:
- *
- *    1. Input graph is a DAG
- *    2. Nodes in the input graph has a minlen attribute
- *
- * Postconditions:
- *
- *    1. Input graph is connected.
- *    2. Dummy nodes are added for the tops and bottoms of subgraphs.
- *    3. The minlen attribute for nodes is adjusted to ensure nodes do not
- *       get placed on the same rank as subgraph border nodes.
- *
- * The nesting graph idea comes from Sander, "Layout of Compound Directed
- * Graphs."
- */
-const run = (g) => {
-    var _a;
-    const root = addDummyNode(g, "root", {}, "_root");
-    const depths = treeDepths(g);
-    let maxDepth = Math.max(...Object.values(depths));
-    if (Math.abs(maxDepth) === Infinity) {
-        maxDepth = 1;
-    }
-    const height = maxDepth - 1; // Note: depths is an Object not an array
-    const nodeSep = 2 * height + 1;
-    g.graph().nestingRoot = root;
-    // Multiply minlen by nodeSep to align nodes on non-border ranks.
-    g.edges().forEach((e) => {
-        g.edge(e).minlen *= nodeSep;
-    });
-    // Calculate a weight that is sufficient to keep subgraphs vertically compact
-    const weight = sumWeights(g) + 1;
-    // Create border nodes and link them up
-    (_a = g.children()) === null || _a === void 0 ? void 0 : _a.forEach((child) => {
-        dfs(g, root, nodeSep, weight, height, depths, child);
-    });
-    // Save the multiplier for node layers for later removal of empty border
-    // layers.
-    g.graph().nodeRankFactor = nodeSep;
-};
-const dfs = (g, root, nodeSep, weight, height, depths, v) => {
-    const children = g.children(v);
-    if (!(children === null || children === void 0 ? void 0 : children.length)) {
-        if (v !== root) {
-            g.setEdge(root, v, { weight: 0, minlen: nodeSep });
-        }
-        return;
-    }
-    const top = addBorderNode(g, "_bt");
-    const bottom = addBorderNode(g, "_bb");
-    const label = g.node(v);
-    g.setParent(top, v);
-    label.borderTop = top;
-    g.setParent(bottom, v);
-    label.borderBottom = bottom;
-    children === null || children === void 0 ? void 0 : children.forEach((child) => {
-        dfs(g, root, nodeSep, weight, height, depths, child);
-        const childNode = g.node(child);
-        const childTop = childNode.borderTop ? childNode.borderTop : child;
-        const childBottom = childNode.borderBottom ? childNode.borderBottom : child;
-        const thisWeight = childNode.borderTop ? weight : 2 * weight;
-        const minlen = childTop !== childBottom ? 1 : height - depths[v] + 1;
-        g.setEdge(top, childTop, {
-            minlen,
-            weight: thisWeight,
-            nestingEdge: true,
-        });
-        g.setEdge(childBottom, bottom, {
-            minlen,
-            weight: thisWeight,
-            nestingEdge: true,
-        });
-    });
-    if (!g.parent(v)) {
-        g.setEdge(root, top, { weight: 0, minlen: height + depths[v] });
-    }
-};
-const treeDepths = (g) => {
-    var _a;
-    const depths = {};
-    const dfs = (v, depth) => {
-        const children = g.children(v);
-        children === null || children === void 0 ? void 0 : children.forEach((child) => dfs(child, depth + 1));
-        depths[v] = depth;
-    };
-    (_a = g.children()) === null || _a === void 0 ? void 0 : _a.forEach((v) => dfs(v, 1));
-    return depths;
-};
-const sumWeights = (g) => {
-    let result = 0;
-    g.edges().forEach((e) => {
-        result += g.edge(e).weight;
-    });
-    return result;
-};
-const cleanup = (g) => {
-    const graphLabel = g.graph();
-    graphLabel.nestingRoot && g.removeNode(graphLabel.nestingRoot);
-    delete graphLabel.nestingRoot;
-    g.edges().forEach((e) => {
-        const edge = g.edge(e);
-        if (edge.nestingEdge) {
-            g.removeEdgeObj(e);
-        }
-    });
-};
-export default { run, cleanup };
-//# sourceMappingURL=nesting-graph.js.map