@antv/layout 0.1.19-beta.4 → 0.1.21

package/es/layout/dagre/src/greedy-fas.js

@@ -0,0 +1,113 @@
+import graphlib from './graphlib';
+import List from './data/list';
+const Graph = graphlib.Graph;
+/*
+ * A greedy heuristic for finding a feedback arc set for a graph. A feedback
+ * arc set is a set of edges that can be removed to make a graph acyclic.
+ * The algorithm comes from: P. Eades, X. Lin, and W. F. Smyth, "A fast and
+ * effective heuristic for the feedback arc set problem." This implementation
+ * adjusts that from the paper to allow for weighted edges.
+ */
+// module.exports = greedyFAS;
+const DEFAULT_WEIGHT_FN = () => 1;
+const greedyFAS = (g, weightFn) => {
+    var _a;
+    if (g.nodeCount() <= 1)
+        return [];
+    const state = buildState(g, weightFn || DEFAULT_WEIGHT_FN);
+    const results = doGreedyFAS(state.graph, state.buckets, state.zeroIdx);
+    // Expand multi-edges
+    // @ts-ignore
+    return (_a = results.map((e) => g.outEdges(e.v, e.w))) === null || _a === void 0 ? void 0 : _a.flat();
+};
+const doGreedyFAS = (g, buckets, zeroIdx) => {
+    let results = [];
+    const sources = buckets[buckets.length - 1];
+    const sinks = buckets[0];
+    let entry;
+    while (g.nodeCount()) {
+        while ((entry = sinks.dequeue())) {
+            removeNode(g, buckets, zeroIdx, entry);
+        }
+        while ((entry = sources.dequeue())) {
+            removeNode(g, buckets, zeroIdx, entry);
+        }
+        if (g.nodeCount()) {
+            for (let i = buckets.length - 2; i > 0; --i) {
+                entry = buckets[i].dequeue();
+                if (entry) {
+                    results = results.concat(removeNode(g, buckets, zeroIdx, entry, true));
+                    break;
+                }
+            }
+        }
+    }
+    return results;
+};
+const removeNode = (g, buckets, zeroIdx, entry, collectPredecessors) => {
+    var _a, _b;
+    const results = collectPredecessors ? [] : undefined;
+    (_a = g.inEdges(entry.v)) === null || _a === void 0 ? void 0 : _a.forEach((edge) => {
+        const weight = g.edge(edge);
+        const uEntry = g.node(edge.v);
+        if (collectPredecessors) {
+            results.push({ v: edge.v, w: edge.w });
+        }
+        if (uEntry.out === undefined)
+            uEntry.out = 0;
+        uEntry.out -= weight;
+        assignBucket(buckets, zeroIdx, uEntry);
+    });
+    (_b = g.outEdges(entry.v)) === null || _b === void 0 ? void 0 : _b.forEach((edge) => {
+        const weight = g.edge(edge);
+        const w = edge.w;
+        const wEntry = g.node(w);
+        if (wEntry.in === undefined)
+            wEntry.in = 0;
+        wEntry.in -= weight;
+        assignBucket(buckets, zeroIdx, wEntry);
+    });
+    g.removeNode(entry.v);
+    return results;
+};
+const buildState = (g, weightFn) => {
+    const fasGraph = new Graph();
+    let maxIn = 0;
+    let maxOut = 0;
+    g.nodes().forEach((v) => {
+        fasGraph.setNode(v, { v, "in": 0, out: 0 });
+    });
+    // Aggregate weights on nodes, but also sum the weights across multi-edges
+    // into a single edge for the fasGraph.
+    g.edges().forEach((e) => {
+        const prevWeight = fasGraph.edge(e.v, e.w) || 0;
+        const weight = weightFn === null || weightFn === void 0 ? void 0 : weightFn(e);
+        const edgeWeight = prevWeight + weight;
+        fasGraph.setEdge(e.v, e.w, edgeWeight);
+        maxOut = Math.max(maxOut, fasGraph.node(e.v).out += weight);
+        maxIn = Math.max(maxIn, fasGraph.node(e.w)["in"] += weight);
+    });
+    const buckets = [];
+    const rangeMax = maxOut + maxIn + 3;
+    for (let i = 0; i < rangeMax; i++) {
+        buckets.push(new List());
+    }
+    const zeroIdx = maxIn + 1;
+    fasGraph.nodes().forEach((v) => {
+        assignBucket(buckets, zeroIdx, fasGraph.node(v));
+    });
+    return { buckets, zeroIdx, graph: fasGraph };
+};
+const assignBucket = (buckets, zeroIdx, entry) => {
+    if (!entry.out) {
+        buckets[0].enqueue(entry);
+    }
+    else if (!entry["in"]) {
+        buckets[buckets.length - 1].enqueue(entry);
+    }
+    else {
+        buckets[entry.out - entry["in"] + zeroIdx].enqueue(entry);
+    }
+};
+export default greedyFAS;
+//# sourceMappingURL=greedy-fas.js.map

package/es/layout/dagre/src/greedy-fas.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"greedy-fas.js","sourceRoot":"","sources":["../../../../src/layout/dagre/src/greedy-fas.ts"],"names":[],"mappings":"AAAA,OAAO,QAAQ,MAAM,YAAY,CAAC;AAClC,OAAO,IAAI,MAAM,aAAa,CAAC;AAI/B,MAAM,KAAK,GAAI,QAAgB,CAAC,KAAK,CAAC;AAGtC;;;;;;GAMG;AACH,8BAA8B;AAE9B,MAAM,iBAAiB,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC;AAElC,MAAM,SAAS,GAAG,CAAC,CAAS,EAAE,QAAuB,EAAE,EAAE;;IACvD,IAAI,CAAC,CAAC,SAAS,EAAE,IAAI,CAAC;QAAE,OAAO,EAAE,CAAC;IAClC,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,EAAE,QAAQ,IAAI,iBAAiB,CAAC,CAAC;IAC3D,MAAM,OAAO,GAAG,WAAW,CAAC,KAAK,CAAC,KAAY,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;IAE9E,qBAAqB;IACrB,aAAa;IACb,OAAO,MAAA,OAAO,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,0CAAE,IAAI,EAAE,CAAC;AAC/D,CAAC,CAAC;AAEF,MAAM,WAAW,GAAG,CAAC,CAAS,EAAE,OAAY,EAAE,OAAe,EAAE,EAAE;IAC/D,IAAI,OAAO,GAAW,EAAE,CAAC;IACzB,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC5C,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IAEzB,IAAI,KAAK,CAAC;IACV,OAAO,CAAC,CAAC,SAAS,EAAE,EAAE;QACpB,OAAO,CAAC,KAAK,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC,EAAI;YAAE,UAAU,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;SAAE;QAC/E,OAAO,CAAC,KAAK,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC,EAAE;YAAE,UAAU,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;SAAE;QAC/E,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE;YACjB,KAAK,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE;gBAC3C,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;gBAC7B,IAAI,KAAK,EAAE;oBACT,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;oBACvE,MAAM;iBACP;aACF;SACF;KACF;IAED,OAAO,OAAO,CAAC;AACjB,CAAC,CAAC;AAEF,MAAM,UAAU,GAAG,CAAC,CAAS,EAAE,OAAY,EAAE,OAAe,EAAE,KAAU,EAAE,mBAA6B,EAAE,EAAE;;IACzG,MAAM,OAAO,GAAQ,mBAAmB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;IAE1D,MAAA,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,0CAAE,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;QACnC,MAAM,MAAM,GAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,MAAM,MAAM,GAAS,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAEpC,IAAI,mBAAmB,EAAE;YACvB,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;SACxC;QACD,IAAI,MAAM,CAAC,GAAG,KAAK,SAAS;YAAE,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC;QAC7C,MAAM,CAAC,GAAG,IAAI,MAAM,CAAC;QACrB,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,MAAA,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,0CAAE,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;QACpC,MAAM,MAAM,GAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QACjB,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,MAAM,CAAC,EAAE,KAAK,SAAS;YAAE,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC;QAC3C,MAAM,CAAC,EAAE,IAAI,MAAM,CAAC;QACpB,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAEtB,OAAO,OAAO,CAAC;AACjB,CAAC,CAAC;AAEF,MAAM,UAAU,GAAG,CAAC,CAAS,EAAE,QAAkC,EAAE,EAAE;IACnE,MAAM,QAAQ,GAAG,IAAI,KAAK,EAAE,CAAC;IAC7B,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,MAAM,GAAG,CAAC,CAAC;IAEf,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QACtB,QAAQ,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,0EAA0E;IAC1E,uCAAuC;IACvC,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QACtB,MAAM,UAAU,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAChD,MAAM,MAAM,GAAG,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAG,CAAC,CAAC,CAAC;QAC7B,MAAM,UAAU,GAAG,UAAU,GAAG,MAAM,CAAC;QACvC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;QACvC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,MAAM,CAAC,CAAC;QAC5D,KAAK,GAAI,IAAI,CAAC,GAAG,CAAC,KAAK,EAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAK,MAAM,CAAC,CAAC;IACjE,CAAC,CAAC,CAAC;IAEH,MAAM,OAAO,GAAQ,EAAE,CAAC;IACxB,MAAM,QAAQ,GAAG,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC;IACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAG,EAAE;QAClC,OAAO,CAAC,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;KAC1B;IACD,MAAM,OAAO,GAAG,KAAK,GAAG,CAAC,CAAC;IAE1B,QAAQ,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAS,EAAE,EAAE;QACrC,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;IAEH,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;AAC/C,CAAC,CAAC;AAEF,MAAM,YAAY,GAAG,CAAC,OAAY,EAAE,OAAe,EAAE,KAAU,EAAE,EAAE;IACjE,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE;QACd,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;KAC3B;SAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE;QACvB,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;KAC5C;SAAM;QACL,OAAO,CAAC,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;KAC3D;AACH,CAAC,CAAC;AAGF,eAAe,SAAS,CAAC"}

package/es/layout/dagre/src/layout.d.ts

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

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

@@ -0,0 +1,435 @@
+import acyclic from './acyclic';
+import normalize from './normalize';
+import rank from './rank';
+import util, { normalizeRanks, removeEmptyRanks } 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 graphlib from './graphlib';
+import initDataOrder from './order/init-data-order';
+const Graph = graphlib.Graph;
+const layout = (g, opts) => {
+    const time = opts && opts.debugTiming ? util.time : util.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(util.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) => {
+    const prevNodeMap = prevG._nodes || {};
+    currG.nodes().forEach((n) => {
+        const node = currG.node(n);
+        if (prevNodeMap[n] !== undefined) {
+            node.fixorder = prevNodeMap[n]._order;
+            delete prevNodeMap[n]._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);
+        const layoutLabel = layoutGraph.node(v);
+        if (inputLabel) {
+            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.points;
+        if (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.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 defaultAttrs = selectNumberAttrs(node, nodeNumAttrs);
+        Object.keys(nodeDefaults).forEach((key) => {
+            if (defaultAttrs[key] === undefined) {
+                defaultAttrs[key] = nodeDefaults[key];
+            }
+        });
+        g.setNode(v, defaultAttrs);
+        g.setParent(v, inputGraph.parent(v));
+    });
+    inputGraph.edges().forEach((e) => {
+        const edge = canonicalize(inputGraph.edge(e));
+        const pickedProperties = {};
+        edgeAttrs.forEach((key) => {
+            if (edge[key] !== undefined)
+                pickedProperties[key] = edge[key];
+        });
+        g.setEdge(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;
+            else
+                node.layer *= 2; // TODO: 因为默认的rank变为两倍，设定的layer也*2
+        }
+    });
+    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 };
+            util.addDummyNode(g, "edge-proxy", label, "_ep");
+        }
+    });
+};
+const assignRankMinMax = (g) => {
+    let maxRank = 0;
+    g.nodes().forEach((v) => {
+        const node = g.node(v);
+        if (node.borderTop) {
+            node.minRank = g.node(node.borderTop).rank;
+            node.maxRank = g.node(node.borderBottom).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 = Number.POSITIVE_INFINITY;
+    let maxX = 0;
+    let minY = Number.POSITIVE_INFINITY;
+    let maxY = 0;
+    const graphLabel = g.graph();
+    const marginX = graphLabel.marginx || 0;
+    const marginY = graphLabel.marginy || 0;
+    const getExtremes = (attrs) => {
+        const x = attrs.x;
+        const y = attrs.y;
+        const w = attrs.width;
+        const h = attrs.height;
+        minX = Math.min(minX, x - w / 2);
+        maxX = Math.max(maxX, x + w / 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.hasOwnProperty("x")) {
+            getExtremes(edge);
+        }
+    });
+    minX -= marginX;
+    minY -= marginY;
+    g.nodes().forEach((v) => {
+        const node = g.node(v);
+        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(util.intersectRect(nodeV, p1));
+        edge.points.push(util.intersectRect(nodeW, p2));
+    });
+};
+const fixupEdgeLabelCoords = (g) => {
+    g.edges().forEach((e) => {
+        const edge = g.edge(e);
+        if (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) => {
+        const edge = g.edge(e);
+        if (edge.reversed) {
+            edge.points.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.x - l.x);
+            node.height = Math.abs(b.y - t.y);
+            node.x = l.x + node.width / 2;
+            node.y = t.y + node.height / 2;
+        }
+    });
+    g.nodes().forEach((v) => {
+        if (g.node(v).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.removeEdge(e);
+        }
+    });
+};
+const insertSelfEdges = (g) => {
+    const layers = util.buildLayerMatrix(g);
+    layers.forEach((layer) => {
+        let orderShift = 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) => {
+                util.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.setEdge(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.forEach((key) => {
+        if (obj[key] === undefined)
+            return;
+        pickedProperties[key] = (+obj[key]);
+    });
+    return pickedProperties;
+};
+const canonicalize = (attrs) => {
+    const newAttrs = {};
+    Object.keys(attrs).forEach((k) => {
+        const v = attrs[k];
+        newAttrs[k.toLowerCase()] = v;
+    });
+    return newAttrs;
+};
+export default layout;
+//# sourceMappingURL=layout.js.map

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

@@ -0,0 +1 @@
+{"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,IAAI,EAAE,EAAE,cAAc,EAAE,gBAAgB,EAAE,MAAM,QAAQ,CAAC;AAChE,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,QAAQ,MAAM,YAAY,CAAC;AAClC,OAAO,aAAa,MAAM,yBAAyB,CAAC;AAIpD,MAAM,KAAK,GAAI,QAAgB,CAAC,KAAK,CAAC;AAEtC,MAAM,MAAM,GAAG,CAAC,CAAS,EAAE,IAAS,EAAE,EAAE;IACtC,MAAM,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;IAChE,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,GAAG,YAAY,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SACpE;QACD,MAAM,WAAW,GACf,IAAI,CAAC,oBAAoB,EAAE,GAAG,EAAE,GAAG,OAAO,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpE,0CAA0C;QAC1C,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,cAAc,KAAK,KAAK,CAAC,CAAC,EAAE;YAC9C,IAAI,CAAC,0BAA0B,EAAE,GAAG,EAAE,GAAG,sBAAsB,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAClF;QACD,oCAAoC;QACpC,IAAI;YACF,IAAI,CAAC,aAAa,EAAS,GAAG,EAAE,GAAG,SAAS,CAAC,WAAW,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAC3E;QAAC,OAAM,CAAC,EAAE;YACT,IAAI,CAAC,CAAC,OAAO,KAAK,2DAA2D,EAAE;gBAC7E,OAAO,CAAC,KAAK,CAAC,oJAAoJ,EAAE,CAAC,CAAC,CAAC;gBACvK,OAAO;aACR;YACC,MAAK,CAAC,CAAC,CAAC,CAAC;SAEZ;QACD,IAAI,CAAC,oBAAoB,EAAE,GAAG,EAAE,GAAG,gBAAgB,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1E,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,SAAS,GAAG,CAAC,CAAS,EAAE,IAAS,EAAE,IAAS,EAAE,EAAE;IACpD,IAAI,CAAC,qBAAqB,EAAS,GAAG,EAAE,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAClE,IAAI,CAAC,aAAa,EAAiB,GAAG,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9D,IAAI,CAAC,sBAAsB,EAAQ,GAAG,EAAE,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnE,IAAI,CAAC,UAAU,EAAoB,GAAG,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvF,IAAI,CAAC,4BAA4B,EAAE,GAAG,EAAE,GAAG,sBAAsB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzE,IAAI,CAAC,sBAAsB,EAAQ,GAAG,EAAE,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnE,IAAI,CAAC,0BAA0B,EAAI,GAAG,EAAE,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvE,IAAI,CAAC,oBAAoB,EAAU,GAAG,EAAE,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,IAAI,CAAC,sBAAsB,EAAQ,GAAG,EAAE,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnE,IAAI,CAAC,4BAA4B,EAAE,GAAG,EAAE,GAAG,sBAAsB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzE,IAAI,CAAC,mBAAmB,EAAW,GAAG,EAAE,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChE,IAAI,CAAC,uBAAuB,EAAO,GAAG,EAAE,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpE,IAAI,CAAC,uBAAuB,EAAO,GAAG,EAAE,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpE,IAAI,IAAI,IAAI,IAAI,CAAC,aAAa,EAAE;QAC9B,IAAI,CAAC,mBAAmB,EAAE,GAAG,EAAE,GAAG,aAAa,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KACxE;IACD,IAAI,CAAC,WAAW,EAAmB,GAAG,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxD,IAAI,CAAC,qBAAqB,EAAS,GAAG,EAAE,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAClE,IAAI,CAAC,4BAA4B,EAAE,GAAG,EAAE,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1E,IAAI,CAAC,cAAc,EAAgB,GAAG,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3D,IAAI,CAAC,uBAAuB,EAAO,GAAG,EAAE,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpE,IAAI,CAAC,uBAAuB,EAAO,GAAG,EAAE,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpE,IAAI,CAAC,oBAAoB,EAAU,GAAG,EAAE,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,IAAI,CAAC,0BAA0B,EAAI,GAAG,EAAE,GAAG,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvE,IAAI,CAAC,0BAA0B,EAAI,GAAG,EAAE,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxE,IAAI,CAAC,oBAAoB,EAAU,GAAG,EAAE,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,IAAI,CAAC,0BAA0B,EAAI,GAAG,EAAE,GAAG,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvE,IAAI,CAAC,mBAAmB,EAAW,GAAG,EAAE,GAAG,6BAA6B,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChF,IAAI,CAAC,kBAAkB,EAAY,GAAG,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACjE,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,YAAY,GAAG,CAAC,KAAa,EAAE,KAAa,EAAE,EAAE;IACpD,MAAM,WAAW,GAAQ,KAAK,CAAC,MAAM,IAAI,EAAE,CAAC;IAC5C,KAAK,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAS,EAAE,EAAE;QAClC,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,WAAW,CAAC,CAAC,CAAC,KAAK,SAAS,EAAE;YAChC,IAAI,CAAC,QAAQ,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;YACtC,OAAO,WAAW,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;SAC9B;aAAM;YACL,OAAO,IAAI,CAAC,QAAQ,CAAC;SACtB;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF;;;;;GAKG;AACH,MAAM,gBAAgB,GAAG,CAAC,UAAkB,EAAE,WAAmB,EAAE,EAAE;IACnE,UAAU,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;;QAC/B,MAAM,UAAU,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtC,MAAM,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAExC,IAAI,UAAU,EAAE;YACd,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,CAAC,CAAC;QACtC,MAAM,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAExC,UAAU,CAAC,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC;QACvC,IAAI,WAAW,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;YACnC,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,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC;IACzC,WAAW,EAAE,EAAE,EAAE,QAAQ,EAAE,GAAG;CAC/B,CAAC;AACF,MAAM,SAAS,GAAG,CAAC,UAAU,CAAC,CAAC;AAE/B;;;;;GAKG;AACH,MAAM,gBAAgB,GAAG,CAAC,UAAkB,EAAE,EAAE;IAC9C,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,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE;QACzB,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,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,EACzB,aAAa,EACb,iBAAiB,CAAC,KAAK,EAAE,aAAa,CAAC,EACvC,gBAAgB,CACjB,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;QAC9C,MAAM,YAAY,GAAG,iBAAiB,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;QAC3D,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE;YACxC,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE;gBACnC,YAAY,CAAC,GAAG,CAAC,GAAI,YAAoB,CAAC,GAAG,CAAC,CAAC;aAChD;QACH,CAAC,CAAC,CAAC;QACH,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,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE;YACxB,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,OAAO,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,EAC3B,YAAY,EACZ,iBAAiB,CAAC,IAAI,EAAE,YAAY,CAAC,EACrC,gBAAgB,CAAC,CAAC,CAAC;IACvB,CAAC,CAAC,CAAC;IAEH,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAEF;;;;;;;GAOG;AACH,MAAM,sBAAsB,GAAG,CAAC,CAAS,EAAE,EAAE;IAC3C,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,CAAC,CAAC;QACvB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAY,CAAC,EAAE;YAC7B,IAAI,CAAC,IAAI,CAAC,KAAK;gBAAE,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;;gBAC3B,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,kCAAkC;SACzD;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,CAAC,CAAC;QACvB,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;QACjB,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,CAAS,EAAE,EAAE;IAC3C,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,CAAC,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE;YAC7B,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACtB,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACtB,MAAM,KAAK,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,CAAE,CAAC,CAAC,IAAe,GAAI,CAAC,CAAC,IAAe,CAAC,GAAG,CAAC,GAAI,CAAC,CAAC,IAAe,EAAE,CAAC;YAC9F,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;SAClD;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,gBAAgB,GAAG,CAAC,CAAS,EAAE,EAAE;IACrC,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,CAAC,CAAC;QACvB,IAAI,IAAI,CAAC,SAAS,EAAE;YAClB,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC;YAC3C,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC;YAC9C,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,CAAS,EAAE,EAAE;IAC3C,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,CAAC,KAAK,KAAK,YAAY,EAAE;YAC/B,CAAC,CAAC,IAAI,CAAE,IAAY,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC;YAC9C,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;SACjB;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,cAAc,GAAG,CAAC,CAAS,EAAE,EAAE;IACnC,IAAI,IAAI,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACpC,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,IAAI,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACpC,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,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,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACjC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACjC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACjC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC;IAEF,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,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,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;YAC5B,WAAW,CAAC,IAAI,CAAC,CAAC;SACnB;IACH,CAAC,CAAC,CAAC;IAEH,IAAI,IAAI,OAAO,CAAC;IAChB,IAAI,IAAI,OAAO,CAAC;IAEhB,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QACtB,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC;QACf,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC;IACjB,CAAC,CAAC,CAAC;IAEH,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;;QACtB,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,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;YAAE,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC;SAAE;QACjD,IAAI,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;YAAE,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC;SAAE;IACnD,CAAC,CAAC,CAAC;IAEH,UAAU,CAAC,KAAK,GAAG,IAAI,GAAG,IAAI,GAAG,OAAO,CAAC;IACzC,UAAU,CAAC,MAAM,GAAG,IAAI,GAAG,IAAI,GAAG,OAAO,CAAC;AAC5C,CAAC,CAAC;AAEF,MAAM,oBAAoB,GAAG,CAAC,CAAS,EAAE,EAAE;IACzC,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QACtB,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1B,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,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC;QACnD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,oBAAoB,GAAG,CAAC,CAAS,EAAE,EAAE;IACzC,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,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;YAC5B,IAAI,IAAI,CAAC,QAAQ,KAAK,GAAG,IAAI,IAAI,CAAC,QAAQ,KAAK,GAAG,EAAE;gBAClD,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,WAAW,CAAC;aAChC;YACD,QAAQ,IAAI,CAAC,QAAQ,EAAE;gBACvB,KAAK,GAAG;oBAAE,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC;oBAAC,MAAM;gBAC7D,KAAK,GAAG;oBAAE,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC;oBAAC,MAAM;aAC5D;SACF;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,6BAA6B,GAAG,CAAC,CAAS,EAAE,EAAE;IAClD,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,CAAC,QAAQ,EAAE;YACjB,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;SACvB;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,iBAAiB,GAAG,CAAC,CAAS,EAAE,EAAE;IACtC,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,CAAC,CAAC;YACvB,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,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACjC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAClC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;YAC9B,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;SAChC;IACH,CAAC,CAAC,CAAC;IAEH,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QACtB,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,KAAK,QAAQ,EAAE;YAChC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;SACjB;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,eAAe,GAAG,CAAC,CAAS,EAAE,EAAE;IACpC,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,CAAC,CAAC;YACzB,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,UAAU,CAAC,CAAC,CAAC,CAAC;SACjB;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,eAAe,GAAG,CAAC,CAAS,EAAE,EAAE;IACpC,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;IACxC,MAAM,CAAC,OAAO,CAAC,CAAC,KAAe,EAAE,EAAE;QACjC,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE;;YACrC,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACvB,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,UAAU,CAAC;YAC5B,MAAA,IAAI,CAAC,SAAS,0CAAE,OAAO,CAAC,CAAC,QAAa,EAAE,EAAE;gBACxC,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,UAAU,EAAE;oBAC/B,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,CAAC,EAAE,UAAU,CAAC;oBACzB,CAAC,EAAE,QAAQ,CAAC,CAAC;oBACb,KAAK,EAAE,QAAQ,CAAC,KAAK;iBACtB,EAAE,KAAK,CAAC,CAAC;YACZ,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,CAAS,EAAE,EAAE;IACtC,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,CAAC,KAAK,KAAK,UAAU,EAAE;YAC7B,MAAM,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAE,IAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3C,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,GAAG,QAAQ,CAAC,KAAK,GAAG,CAAC,CAAC;YAC1C,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;YACrB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACtB,MAAM,EAAE,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;YAC/B,CAAC,CAAC,OAAO,CAAE,IAAY,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;YACvC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAChB,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG;gBAClB,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;gBAChC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;gBAChC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;gBAChB,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;gBAChC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;aACjC,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,GAAQ,EAAE,KAAU,EAAE,EAAE;IACjD,MAAM,gBAAgB,GAAQ,EAAE,CAAC;IACjC,KAAK,CAAC,OAAO,CAAC,CAAC,GAAW,EAAE,EAAE;QAC5B,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,KAAU,EAAE,EAAE;IAClC,MAAM,QAAQ,GAAQ,EAAE,CAAC;IACzB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAS,EAAE,EAAE;QACvC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACnB,QAAQ,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,GAAG,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IACH,OAAO,QAAQ,CAAC;AAClB,CAAC,CAAC;AAEF,eAAe,MAAM,CAAC"}

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

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