@antv/layout 0.3.11 → 1.0.0-alpha.0

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

@@ -1,261 +0,0 @@
-import { isNumber } from "../../../util";
-import { Graph } from "../graph";
-const safeSort = (valueA, valueB) => {
-    return Number(valueA) - Number(valueB);
-};
-/*
- * Adds a dummy node to the graph and return v.
- */
-export const addDummyNode = (g, type, attrs, name) => {
-    let v;
-    do {
-        v = `${name}${Math.random()}`;
-    } while (g.hasNode(v));
-    attrs.dummy = type;
-    g.setNode(v, attrs);
-    return v;
-};
-/*
- * Returns a new graph with only simple edges. Handles aggregation of data
- * associated with multi-edges.
- */
-export const simplify = (g) => {
-    const simplified = new Graph().setGraph(g.graph());
-    g.nodes().forEach((v) => { simplified.setNode(v, g.node(v)); });
-    g.edges().forEach((e) => {
-        const simpleLabel = simplified.edgeFromArgs(e.v, e.w) || { weight: 0, minlen: 1 };
-        const label = g.edge(e);
-        simplified.setEdge(e.v, e.w, {
-            weight: simpleLabel.weight + label.weight,
-            minlen: Math.max(simpleLabel.minlen, label.minlen)
-        });
-    });
-    return simplified;
-};
-export const asNonCompoundGraph = (g) => {
-    const simplified = new Graph({ multigraph: g.isMultigraph() }).setGraph(g.graph());
-    g.nodes().forEach((node) => {
-        var _a;
-        if (!((_a = g.children(node)) === null || _a === void 0 ? void 0 : _a.length)) {
-            simplified.setNode(node, g.node(node));
-        }
-    });
-    g.edges().forEach((edge) => {
-        simplified.setEdgeObj(edge, g.edge(edge));
-    });
-    return simplified;
-};
-export const zipObject = (keys, values) => {
-    return keys === null || keys === void 0 ? void 0 : keys.reduce((obj, key, i) => {
-        obj[key] = values[i];
-        return obj;
-    }, {});
-};
-export const successorWeights = (g) => {
-    const weightsMap = {};
-    g.nodes().forEach((node) => {
-        var _a;
-        const sucs = {};
-        (_a = g.outEdges(node)) === null || _a === void 0 ? void 0 : _a.forEach((e) => {
-            var _a;
-            sucs[e.w] = (sucs[e.w] || 0) + (((_a = g.edge(e)) === null || _a === void 0 ? void 0 : _a.weight) || 0);
-        });
-        weightsMap[node] = sucs;
-    });
-    return weightsMap;
-};
-export const predecessorWeights = (g) => {
-    const nodes = g.nodes();
-    const weightMap = nodes.map((v) => {
-        var _a;
-        const preds = {};
-        (_a = g.inEdges(v)) === null || _a === void 0 ? void 0 : _a.forEach((e) => {
-            preds[e.v] = (preds[e.v] || 0) + g.edge(e).weight;
-        });
-        return preds;
-    });
-    return zipObject(nodes, weightMap);
-};
-/*
- * Finds where a line starting at point ({x, y}) would intersect a rectangle
- * ({x, y, width, height}) if it were pointing at the rectangle's center.
- */
-export const intersectRect = (rect, point) => {
-    const x = Number(rect.x);
-    const y = Number(rect.y);
-    // Rectangle intersection algorithm from:
-    // http://math.stackexchange.com/questions/108113/find-edge-between-two-boxes
-    const dx = Number(point.x) - x;
-    const dy = Number(point.y) - y;
-    let w = Number(rect.width) / 2;
-    let h = Number(rect.height) / 2;
-    if (!dx && !dy) {
-        // completely overlapped directly, then return points its self
-        return { x: 0, y: 0 };
-    }
-    let sx;
-    let sy;
-    if (Math.abs(dy) * w > Math.abs(dx) * h) {
-        // Intersection is top or bottom of rect.
-        if (dy < 0) {
-            h = -h;
-        }
-        sx = (h * dx) / dy;
-        sy = h;
-    }
-    else {
-        // Intersection is left or right of rect.
-        if (dx < 0) {
-            w = -w;
-        }
-        sx = w;
-        sy = (w * dy) / dx;
-    }
-    return { x: x + sx, y: y + sy };
-};
-/*
- * Given a DAG with each node assigned "rank" and "order" properties, this
- * const will produce a matrix with the ids of each node.
- */
-export const buildLayerMatrix = (g) => {
-    const layeringNodes = [];
-    const rankMax = maxRank(g) + 1;
-    for (let i = 0; i < rankMax; i++) {
-        layeringNodes.push([]);
-    }
-    // const layering = _.map(_.range(maxRank(g) + 1), function() { return []; });
-    g.nodes().forEach((v) => {
-        const node = g.node(v);
-        if (!node)
-            return;
-        const rank = node.rank;
-        if (rank !== undefined && layeringNodes[rank]) {
-            layeringNodes[rank].push(v);
-        }
-    });
-    for (let i = 0; i < rankMax; i++) {
-        layeringNodes[i] = layeringNodes[i].sort((va, vb) => { var _a, _b; return safeSort((_a = g.node(va)) === null || _a === void 0 ? void 0 : _a.order, (_b = g.node(vb)) === null || _b === void 0 ? void 0 : _b.order); });
-    }
-    return layeringNodes;
-};
-/*
- * Adjusts the ranks for all nodes in the graph such that all nodes v have
- * rank(v) >= 0 and at least one node w has rank(w) = 0.
- */
-export const normalizeRanks = (g) => {
-    const nodeRanks = g
-        .nodes()
-        .filter((v) => { var _a; return ((_a = g.node(v)) === null || _a === void 0 ? void 0 : _a.rank) !== undefined; })
-        .map((v) => g.node(v).rank);
-    const min = Math.min(...nodeRanks);
-    g.nodes().forEach((v) => {
-        const node = g.node(v);
-        if (node.hasOwnProperty("rank") && min !== Infinity) {
-            node.rank -= min;
-        }
-    });
-};
-export const removeEmptyRanks = (g) => {
-    // Ranks may not start at 0, so we need to offset them
-    const nodes = g.nodes();
-    const nodeRanks = nodes
-        .filter((v) => { var _a; return ((_a = g.node(v)) === null || _a === void 0 ? void 0 : _a.rank) !== undefined; })
-        .map((v) => g.node(v).rank);
-    const offset = Math.min(...nodeRanks);
-    const layers = [];
-    nodes.forEach((v) => {
-        var _a;
-        const rank = (((_a = g.node(v)) === null || _a === void 0 ? void 0 : _a.rank) || 0) - offset;
-        if (!layers[rank]) {
-            layers[rank] = [];
-        }
-        layers[rank].push(v);
-    });
-    let delta = 0;
-    const nodeRankFactor = g.graph().nodeRankFactor || 0;
-    for (let i = 0; i < layers.length; i++) {
-        const vs = layers[i];
-        if (vs === undefined) {
-            if (i % nodeRankFactor !== 0) {
-                delta -= 1;
-            }
-        }
-        else if (delta) {
-            vs === null || vs === void 0 ? void 0 : vs.forEach((v) => {
-                const node = g.node(v);
-                if (node) {
-                    node.rank = node.rank || 0;
-                    node.rank += delta;
-                }
-            });
-        }
-    }
-};
-export const addBorderNode = (g, prefix, rank, order) => {
-    const node = {
-        width: 0,
-        height: 0
-    };
-    if (isNumber(rank) && isNumber(order)) {
-        node.rank = rank;
-        node.order = order;
-    }
-    return addDummyNode(g, "border", node, prefix);
-};
-export const maxRank = (g) => {
-    let maxRank;
-    g.nodes().forEach((v) => {
-        var _a;
-        const rank = (_a = g.node(v)) === null || _a === void 0 ? void 0 : _a.rank;
-        if (rank !== undefined) {
-            if (maxRank === undefined || rank > maxRank) {
-                maxRank = rank;
-            }
-        }
-    });
-    if (!maxRank) {
-        maxRank = 0;
-    }
-    return maxRank;
-};
-/*
- * Partition a collection into two groups: `lhs` and `rhs`. If the supplied
- * const returns true for an entry it goes into `lhs`. Otherwise it goes
- * into `rhs.
- */
-export const partition = (collection, fn) => {
-    const result = { lhs: [], rhs: [] };
-    collection === null || collection === void 0 ? void 0 : collection.forEach((value) => {
-        if (fn(value)) {
-            result.lhs.push(value);
-        }
-        else {
-            result.rhs.push(value);
-        }
-    });
-    return result;
-};
-/*
- * Returns a new const that wraps `fn` with a timer. The wrapper logs the
- * time it takes to execute the function.
- */
-export const time = (name, fn) => {
-    const start = Date.now();
-    try {
-        return fn();
-    }
-    finally {
-        console.log(`${name} time: ${Date.now() - start}ms`);
-    }
-};
-export const notime = (name, fn) => {
-    return fn();
-};
-export const minBy = (array, func) => {
-    return array.reduce((a, b) => {
-        const valA = func(a);
-        const valB = func(b);
-        return valA > valB ? b : a;
-    });
-};
-//# sourceMappingURL=util.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"util.js","sourceRoot":"","sources":["../../../../src/layout/dagre/src/util.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AACzC,OAAO,EAAE,KAAK,EAAQ,MAAM,UAAU,CAAC;AAEvC,MAAM,QAAQ,GAAG,CAAC,MAAe,EAAE,MAAe,EAAE,EAAE;IACpD,OAAO,MAAM,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;AACzC,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAC1B,CAAQ,EACR,IAAY,EACZ,KAAgC,EAChC,IAAY,EACZ,EAAE;IACF,IAAI,CAAC,CAAC;IACN,GAAG;QACD,CAAC,GAAG,GAAG,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;KAC/B,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;IAEvB,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC;IACnB,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAEpB,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,CAAQ,EAAE,EAAE;IACnC,MAAM,UAAU,GAAG,IAAI,KAAK,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;IACnD,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChE,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QACtB,MAAM,WAAW,GAAG,UAAU,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;QAClF,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;QACzB,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE;YAC3B,MAAM,EAAE,WAAW,CAAC,MAAO,GAAG,KAAK,CAAC,MAAO;YAC3C,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,MAAO,EAAE,KAAK,CAAC,MAAO,CAAC;SACrD,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IACH,OAAO,UAAU,CAAC;AACpB,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,CAAQ,EAAE,EAAE;IAC7C,MAAM,UAAU,GAAG,IAAI,KAAK,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC,QAAQ,CACrE,CAAC,CAAC,KAAK,EAAE,CACV,CAAC;IACF,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;;QACzB,IAAI,CAAC,CAAA,MAAA,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,0CAAE,MAAM,CAAA,EAAE;YAC7B,UAAU,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;SACxC;IACH,CAAC,CAAC,CAAC;IAEH,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;QACzB,UAAU,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,OAAO,UAAU,CAAC;AACpB,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,SAAS,GAAG,CAAU,IAAc,EAAE,MAAW,EAAE,EAAE;IAChE,OAAO,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE;QAClC,GAAG,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACrB,OAAO,GAAG,CAAC;IACb,CAAC,EAAE,EAAuB,CAAC,CAAC;AAC9B,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,CAAQ,EAAE,EAAE;IAC3C,MAAM,UAAU,GAA2C,EAAE,CAAC;IAE9D,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;;QACzB,MAAM,IAAI,GAA2B,EAAE,CAAC;QACxC,MAAA,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,0CAAE,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;;YAC9B,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA,MAAA,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,0CAAE,MAAM,KAAI,CAAC,CAAC,CAAC;QAC1D,CAAC,CAAC,CAAC;QACH,UAAU,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;IAC1B,CAAC,CAAC,CAAC;IAEH,OAAO,UAAU,CAAC;AACpB,CAAC,CAAC;AAIF,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,CAAQ,EAAE,EAAE;IAC7C,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC;IAExB,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;;QAChC,MAAM,KAAK,GAA2B,EAAE,CAAC;QACzC,MAAA,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,0CAAE,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;YAC1B,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,MAAO,CAAC;QACtD,CAAC,CAAC,CAAC;QACH,OAAO,KAAK,CAAC;IACf,CAAC,CAAC,CAAC;IACH,OAAO,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;AACrC,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAC3B,IAAiE,EACjE,KAAiC,EACjC,EAAE;IACF,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACzB,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAEzB,yCAAyC;IACzC,6EAA6E;IAC7E,MAAM,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC/B,MAAM,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC/B,IAAI,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC/B,IAAI,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAEhC,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE;QACd,8DAA8D;QAC9D,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;KACvB;IAED,IAAI,EAAE,CAAC;IACP,IAAI,EAAE,CAAC;IAEP,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE;QACvC,yCAAyC;QACzC,IAAI,EAAE,GAAG,CAAC,EAAE;YACV,CAAC,GAAG,CAAC,CAAC,CAAC;SACR;QACD,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC;QACnB,EAAE,GAAG,CAAC,CAAC;KACR;SAAM;QACL,yCAAyC;QACzC,IAAI,EAAE,GAAG,CAAC,EAAE;YACV,CAAC,GAAG,CAAC,CAAC,CAAC;SACR;QACD,EAAE,GAAG,CAAC,CAAC;QACP,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC;KACpB;IAED,OAAO,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC;AAClC,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,CAAQ,EAAE,EAAE;IAC3C,MAAM,aAAa,GAAe,EAAE,CAAC;IACrC,MAAM,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE;QAChC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;KACxB;IAED,8EAA8E;IAC9E,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAS,EAAE,EAAE;QAC9B,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;QACxB,IAAI,CAAC,IAAI;YAAE,OAAO;QAClB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,IAAI,IAAI,KAAK,SAAS,IAAI,aAAa,CAAC,IAAI,CAAC,EAAE;YAC7C,aAAa,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;SAC7B;IACH,CAAC,CAAC,CAAC;IAEH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE;QAChC,aAAa,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAU,EAAE,EAAU,EAAE,EAAE,eAClE,OAAA,QAAQ,CAAC,MAAA,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,0CAAE,KAAK,EAAE,MAAA,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,0CAAE,KAAK,CAAC,CAAA,EAAA,CAC/C,CAAC;KACH;IAED,OAAO,aAAa,CAAC;AACvB,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,CAAQ,EAAE,EAAE;IACzC,MAAM,SAAS,GAAG,CAAC;SAChB,KAAK,EAAE;SACP,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,WAAC,OAAA,CAAA,MAAA,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,0CAAE,IAAI,MAAK,SAAS,CAAA,EAAA,CAAC;SAC5C,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,IAAK,CAAC,CAAC;IAChC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC;IACnC,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,cAAc,CAAC,MAAM,CAAC,IAAI,GAAG,KAAK,QAAQ,EAAE;YACnD,IAAI,CAAC,IAAK,IAAI,GAAG,CAAC;SACnB;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,CAAQ,EAAE,EAAE;IAC3C,sDAAsD;IACtD,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC;IACxB,MAAM,SAAS,GAAG,KAAK;SACpB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,WAAC,OAAA,CAAA,MAAA,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,0CAAE,IAAI,MAAK,SAAS,CAAA,EAAA,CAAC;SAC5C,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,IAAc,CAAC,CAAC;IAEzC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC;IACtC,MAAM,MAAM,GAAe,EAAE,CAAC;IAE9B,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;;QAClB,MAAM,IAAI,GAAG,CAAC,CAAA,MAAA,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,0CAAE,IAAI,KAAI,CAAC,CAAC,GAAG,MAAM,CAAC;QAE7C,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE;YACjB,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;SACnB;QACD,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC,CAAC,CAAC;IAEH,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,cAAc,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,cAAc,IAAI,CAAC,CAAC;IAErD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACtC,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,EAAE,KAAK,SAAS,EAAE;YACpB,IAAI,CAAC,GAAG,cAAc,KAAK,CAAC,EAAE;gBAC5B,KAAK,IAAI,CAAC,CAAC;aACZ;SACF;aAAM,IAAI,KAAK,EAAE;YAChB,EAAE,aAAF,EAAE,uBAAF,EAAE,CAAE,OAAO,CAAC,CAAC,CAAS,EAAE,EAAE;gBACxB,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACvB,IAAI,IAAI,EAAE;oBACR,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC;oBAC3B,IAAI,CAAC,IAAI,IAAI,KAAK,CAAC;iBACpB;YACH,CAAC,CAAC,CAAC;SACJ;KACF;AACH,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,aAAa,GAAG,CAC3B,CAAQ,EACR,MAAc,EACd,IAAa,EACb,KAAc,EACd,EAAE;IACF,MAAM,IAAI,GAAS;QACjB,KAAK,EAAE,CAAC;QACR,MAAM,EAAE,CAAC;KACV,CAAC;IACF,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE;QACrC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;KACpB;IACD,OAAO,YAAY,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;AACjD,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,CAAQ,EAAE,EAAE;IAClC,IAAI,OAAe,CAAC;IACpB,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;;QACtB,MAAM,IAAI,GAAG,MAAA,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,0CAAE,IAAI,CAAC;QAC7B,IAAI,IAAI,KAAK,SAAS,EAAE;YACtB,IAAI,OAAO,KAAK,SAAS,IAAI,IAAI,GAAG,OAAO,EAAE;gBAC3C,OAAO,GAAG,IAAI,CAAC;aAChB;SACF;IACH,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,OAAQ,EAAE;QACb,OAAO,GAAG,CAAC,CAAC;KACb;IACD,OAAO,OAAO,CAAC;AACjB,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,CAAC,MAAM,SAAS,GAAG,CACvB,UAAe,EACf,EAAuB,EACvB,EAAE;IACF,MAAM,MAAM,GAAG,EAAE,GAAG,EAAE,EAAS,EAAE,GAAG,EAAE,EAAS,EAAE,CAAC;IAClD,UAAU,aAAV,UAAU,uBAAV,UAAU,CAAE,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;QAC5B,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE;YACb,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACxB;aAAM;YACL,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACxB;IACH,CAAC,CAAC,CAAC;IACH,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,IAAY,EAAE,EAAc,EAAE,EAAE;IACnD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACzB,IAAI;QACF,OAAO,EAAE,EAAE,CAAC;KACb;YAAS;QACR,OAAO,CAAC,GAAG,CAAC,GAAG,IAAI,UAAU,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,IAAI,CAAC,CAAC;KACtD;AACH,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,IAAY,EAAE,EAAc,EAAE,EAAE;IACrD,OAAO,EAAE,EAAE,CAAC;AACd,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,KAAK,GAAG,CAAU,KAAU,EAAE,IAA0B,EAAE,EAAE;IACvE,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,OAAO,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC"}

package/es/layout/dagre.d.ts

@@ -1,71 +0,0 @@
-/**
- * @fileOverview dagre layout
- * @author shiwu.wyy@antfin.com
- */
-import { Edge, OutNode, DagreLayoutOptions, PointTuple, Node } from "./types";
-import { Base } from "./base";
-/**
- * 层次布局
- */
-export declare class DagreLayout extends Base {
-    /** layout 方向, 可选 TB, BT, LR, RL */
-    rankdir: "TB" | "BT" | "LR" | "RL";
-    /** 节点对齐方式，可选 UL, UR, DL, DR */
-    align: undefined | "UL" | "UR" | "DL" | "DR";
-    /** 布局的起始（左上角）位置 */
-    begin: PointTuple;
-    /** 节点大小 */
-    nodeSize: number | number[] | undefined;
-    /** 节点水平间距(px) */
-    nodesepFunc: ((d?: any) => number) | undefined;
-    /** 每一层节点之间间距 */
-    ranksepFunc: ((d?: any) => number) | undefined;
-    /** 节点水平间距(px) */
-    nodesep: number;
-    /** 每一层节点之间间距 */
-    ranksep: number;
-    /** 是否保留布局连线的控制点 */
-    controlPoints: boolean;
-    /** 每层节点是否根据节点数据中的 comboId 进行排序，以防止同层 combo 重叠 */
-    sortByCombo: boolean;
-    /** 是否保留每条边上的dummy node */
-    edgeLabelSpace: boolean;
-    /** 是否基于 dagre 进行辐射布局，若是，第一层节点将被放置在最内环上，其余层依次向外辐射 */
-    radial: boolean;
-    /** radial 下生效，中心节点，被指定的节点及其同层节点将被放置在最内环上 */
-    focusNode: string | Node | null;
-    /** 给定的节点顺序，配合keepNodeOrder使用 */
-    nodeOrder: string[];
-    /** 上次的布局结果 */
-    preset: {
-        nodes: OutNode[];
-        edges: any[];
-    };
-    nodes: OutNode[];
-    edges: Edge[];
-    /** 迭代结束的回调函数 */
-    onLayoutEnd: () => void;
-    constructor(options?: DagreLayoutOptions);
-    getDefaultCfg(): {
-        rankdir: string;
-        align: undefined;
-        nodeSize: undefined;
-        nodesepFunc: undefined;
-        ranksepFunc: undefined;
-        nodesep: number;
-        ranksep: number;
-        controlPoints: boolean;
-        radial: boolean;
-        focusNode: null;
-    };
-    layoutNode: (nodeId: string) => boolean;
-    /**
-     * 执行布局
-     */
-    execute(): {
-        nodes: OutNode[];
-        edges: any[];
-    } | undefined;
-    private getRadialPos;
-    getType(): string;
-}