@antv/layout 1.2.9 → 1.2.10

package/lib/dagre/order/init-order.js

@@ -1,50 +0,0 @@
-import { __read, __spreadArray } from "tslib";
-/*
- * Assigns an initial order value for each node by performing a DFS search
- * starting from nodes in the first rank. Nodes are assigned an order in their
- * rank as they are first visited.
- *
- * This approach comes from Gansner, et al., "A Technique for Drawing Directed
- * Graphs."
- *
- * Returns a layering matrix with an array per layer and each layer sorted by
- * the order of its nodes.
- */
-export var initOrder = function (g) {
-    var visited = {};
-    // const simpleNodes = g.getAllNodes().filter((v) => {
-    //   return !g.getChildren(v.id)?.length;
-    // });
-    var simpleNodes = g.getAllNodes();
-    var nodeRanks = simpleNodes.map(function (v) { var _a; return (_a = v.data.rank) !== null && _a !== void 0 ? _a : -Infinity; });
-    var maxRank = Math.max.apply(Math, __spreadArray([], __read(nodeRanks)));
-    var layers = [];
-    for (var i = 0; i < maxRank + 1; i++) {
-        layers.push([]);
-    }
-    var orderedVs = simpleNodes.sort(function (a, b) { return g.getNode(a.id).data.rank - g.getNode(b.id).data.rank; });
-    // const orderedVs = _.sortBy(simpleNodes, function(v) { return g.node(v)!.rank; });
-    // 有fixOrder的，直接排序好放进去
-    var beforeSort = orderedVs.filter(function (n) {
-        return g.getNode(n.id).data.fixorder !== undefined;
-    });
-    var fixOrderNodes = beforeSort.sort(function (a, b) { return g.getNode(a.id).data.fixorder - g.getNode(b.id).data.fixorder; });
-    fixOrderNodes === null || fixOrderNodes === void 0 ? void 0 : fixOrderNodes.forEach(function (n) {
-        if (!isNaN(g.getNode(n.id).data.rank)) {
-            layers[g.getNode(n.id).data.rank].push(n.id);
-        }
-        visited[n.id] = true;
-    });
-    orderedVs === null || orderedVs === void 0 ? void 0 : orderedVs.forEach(function (n) {
-        return g.dfsTree(n.id, function (node) {
-            if (visited.hasOwnProperty(node.id))
-                return true;
-            visited[node.id] = true;
-            if (!isNaN(node.data.rank)) {
-                layers[node.data.rank].push(node.id);
-            }
-        });
-    });
-    return layers;
-};
-//# sourceMappingURL=init-order.js.map

package/lib/dagre/order/init-order.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"init-order.js","sourceRoot":"","sources":["../../../src/dagre/order/init-order.ts"],"names":[],"mappings":";AAGA;;;;;;;;;;GAUG;AACH,MAAM,CAAC,IAAM,SAAS,GAAG,UAAC,CAAQ;IAChC,IAAM,OAAO,GAA4B,EAAE,CAAC;IAC5C,sDAAsD;IACtD,yCAAyC;IACzC,MAAM;IACN,IAAM,WAAW,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC;IACpC,IAAM,SAAS,GAAG,WAAW,CAAC,GAAG,CAAC,UAAC,CAAC,YAAK,OAAA,MAAA,CAAC,CAAC,IAAI,CAAC,IAAK,mCAAI,CAAC,QAAQ,CAAA,EAAA,CAAC,CAAC;IAEpE,IAAM,OAAO,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,2BAAQ,SAAS,GAAC,CAAC;IACvC,IAAM,MAAM,GAAW,EAAE,CAAC;IAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;QACpC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;KACjB;IAED,IAAM,SAAS,GAAG,WAAW,CAAC,IAAI,CAChC,UAAC,CAAC,EAAE,CAAC,IAAK,OAAA,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAK,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAK,EAAvD,CAAuD,CAClE,CAAC;IACF,oFAAoF;IAEpF,sBAAsB;IACtB,IAAM,UAAU,GAAG,SAAS,CAAC,MAAM,CAAC,UAAC,CAAC;QACpC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC;IACrD,CAAC,CAAC,CAAC;IACH,IAAM,aAAa,GAAG,UAAU,CAAC,IAAI,CACnC,UAAC,CAAC,EAAE,CAAC,IAAK,OAAA,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,QAAS,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,QAAS,EAA/D,CAA+D,CAC1E,CAAC;IACF,aAAa,aAAb,aAAa,uBAAb,aAAa,CAAE,OAAO,CAAC,UAAC,CAAC;QACvB,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAK,CAAC,EAAE;YACtC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;SAC/C;QACD,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;IACvB,CAAC,CAAC,CAAC;IAEH,SAAS,aAAT,SAAS,uBAAT,SAAS,CAAE,OAAO,CAAC,UAAC,CAAC;QACnB,OAAA,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,UAAC,IAAI;YACnB,IAAI,OAAO,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAE,OAAO,IAAI,CAAC;YACjD,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;YACxB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAK,CAAC,EAAE;gBAC3B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;aACvC;QACH,CAAC,CAAC;IANF,CAME,CACH,CAAC;IAEF,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC"}

package/lib/dagre/order/resolve-conflicts.js

@@ -1,121 +0,0 @@
-/*
- * Given a list of entries of the form {v, barycenter, weight} and a
- * constraint graph this function will resolve any conflicts between the
- * constraint graph and the barycenters for the entries. If the barycenters for
- * an entry would violate a constraint in the constraint graph then we coalesce
- * the nodes in the conflict into a new node that respects the contraint and
- * aggregates barycenter and weight information.
- *
- * This implementation is based on the description in Forster, "A Fast and
- * Simple Hueristic for Constrained Two-Level Crossing Reduction," thought it
- * differs in some specific details.
- *
- * Pre-conditions:
- *
- *    1. Each entry has the form {v, barycenter, weight}, or if the node has
- *       no barycenter, then {v}.
- *
- * Returns:
- *
- *    A new list of entries of the form {vs, i, barycenter, weight}. The list
- *    `vs` may either be a singleton or it may be an aggregation of nodes
- *    ordered such that they do not violate constraints from the constraint
- *    graph. The property `i` is the lowest original index of any of the
- *    elements in `vs`.
- */
-var resolveConflicts = function (entries, cg) {
-    var _a, _b, _c;
-    var mappedEntries = {};
-    entries === null || entries === void 0 ? void 0 : entries.forEach(function (entry, i) {
-        mappedEntries[entry.v] = {
-            i: i,
-            indegree: 0,
-            in: [],
-            out: [],
-            vs: [entry.v],
-        };
-        var tmp = mappedEntries[entry.v];
-        if (entry.barycenter !== undefined) {
-            tmp.barycenter = entry.barycenter;
-            tmp.weight = entry.weight;
-        }
-    });
-    (_a = cg.getAllEdges()) === null || _a === void 0 ? void 0 : _a.forEach(function (e) {
-        var entryV = mappedEntries[e.source];
-        var entryW = mappedEntries[e.target];
-        if (entryV !== undefined && entryW !== undefined) {
-            entryW.indegree++;
-            entryV.out.push(mappedEntries[e.target]);
-        }
-    });
-    var sourceSet = (_c = (_b = Object.values(mappedEntries)).filter) === null || _c === void 0 ? void 0 : _c.call(_b, function (entry) { return !entry.indegree; });
-    return doResolveConflicts(sourceSet);
-};
-var doResolveConflicts = function (sourceSet) {
-    var _a, _b;
-    var entries = [];
-    var handleIn = function (vEntry) {
-        return function (uEntry) {
-            if (uEntry.merged)
-                return;
-            if (uEntry.barycenter === undefined ||
-                vEntry.barycenter === undefined ||
-                uEntry.barycenter >= vEntry.barycenter) {
-                mergeEntries(vEntry, uEntry);
-            }
-        };
-    };
-    var handleOut = function (vEntry) {
-        return function (wEntry) {
-            wEntry["in"].push(vEntry);
-            if (--wEntry.indegree === 0) {
-                sourceSet.push(wEntry);
-            }
-        };
-    };
-    var _loop_1 = function () {
-        var entry = sourceSet.pop();
-        entries.push(entry);
-        (_a = entry["in"].reverse()) === null || _a === void 0 ? void 0 : _a.forEach(function (e) { return handleIn(entry)(e); });
-        (_b = entry.out) === null || _b === void 0 ? void 0 : _b.forEach(function (e) { return handleOut(entry)(e); });
-    };
-    while (sourceSet === null || sourceSet === void 0 ? void 0 : sourceSet.length) {
-        _loop_1();
-    }
-    var filtered = entries.filter(function (entry) { return !entry.merged; });
-    var keys = [
-        "vs",
-        "i",
-        "barycenter",
-        "weight",
-    ];
-    return filtered.map(function (entry) {
-        var picked = {};
-        keys === null || keys === void 0 ? void 0 : keys.forEach(function (key) {
-            if (entry[key] === undefined)
-                return;
-            picked[key] = entry[key];
-        });
-        return picked;
-    });
-};
-var mergeEntries = function (target, source) {
-    var _a;
-    var sum = 0;
-    var weight = 0;
-    if (target.weight) {
-        sum += target.barycenter * target.weight;
-        weight += target.weight;
-    }
-    if (source.weight) {
-        sum += source.barycenter * source.weight;
-        weight += source.weight;
-    }
-    target.vs = (_a = source.vs) === null || _a === void 0 ? void 0 : _a.concat(target.vs);
-    target.barycenter = sum / weight;
-    target.weight = weight;
-    target.i = Math.min(source.i, target.i);
-    source.merged = true;
-};
-export default resolveConflicts;
-//# sourceMappingURL=resolve-conflicts.js.map

package/lib/dagre/order/resolve-conflicts.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"resolve-conflicts.js","sourceRoot":"","sources":["../../../src/dagre/order/resolve-conflicts.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAkBH,IAAM,gBAAgB,GAAG,UACvB,OAIG,EACH,EAAS;;IAET,IAAM,aAAa,GAAkC,EAAE,CAAC;IACxD,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,OAAO,CAAC,UAAC,KAAK,EAAE,CAAS;QAChC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG;YACvB,CAAC,GAAA;YACD,QAAQ,EAAE,CAAC;YACX,EAAE,EAAE,EAAE;YACN,GAAG,EAAE,EAAE;YACP,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;SACd,CAAC;QACF,IAAM,GAAG,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACnC,IAAI,KAAK,CAAC,UAAU,KAAK,SAAS,EAAE;YAClC,GAAG,CAAC,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC;YAClC,GAAG,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;SAC3B;IACH,CAAC,CAAC,CAAC;IAEH,MAAA,EAAE,CAAC,WAAW,EAAE,0CAAE,OAAO,CAAC,UAAC,CAAC;QAC1B,IAAM,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QACvC,IAAM,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QACvC,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,EAAE;YAChD,MAAM,CAAC,QAAS,EAAE,CAAC;YACnB,MAAM,CAAC,GAAI,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;SAC3C;IACH,CAAC,CAAC,CAAC;IAEH,IAAM,SAAS,GAAG,MAAA,MAAA,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,EAAC,MAAM,mDACnD,UAAC,KAAoB,IAAK,OAAA,CAAC,KAAK,CAAC,QAAQ,EAAf,CAAe,CAC1C,CAAC;IAEF,OAAO,kBAAkB,CAAC,SAAS,CAAC,CAAC;AACvC,CAAC,CAAC;AAEF,IAAM,kBAAkB,GAAG,UAAC,SAA0B;;IACpD,IAAM,OAAO,GAAG,EAAE,CAAC;IAEnB,IAAM,QAAQ,GAAG,UAAC,MAAqB;QACrC,OAAO,UAAC,MAAqB;YAC3B,IAAI,MAAM,CAAC,MAAM;gBAAE,OAAO;YAC1B,IACE,MAAM,CAAC,UAAU,KAAK,SAAS;gBAC/B,MAAM,CAAC,UAAU,KAAK,SAAS;gBAC/B,MAAM,CAAC,UAAU,IAAI,MAAM,CAAC,UAAU,EACtC;gBACA,YAAY,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;aAC9B;QACH,CAAC,CAAC;IACJ,CAAC,CAAC;IAEF,IAAM,SAAS,GAAG,UAAC,MAAqB;QACtC,OAAO,UAAC,MAAqB;YAC3B,MAAM,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC3B,IAAI,EAAE,MAAM,CAAC,QAAS,KAAK,CAAC,EAAE;gBAC5B,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;aACxB;QACH,CAAC,CAAC;IACJ,CAAC,CAAC;;QAGA,IAAM,KAAK,GAAG,SAAS,CAAC,GAAG,EAAG,CAAC;QAC/B,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpB,MAAA,KAAK,CAAC,IAAI,CAAE,CAAC,OAAO,EAAE,0CAAE,OAAO,CAAC,UAAC,CAAgB,IAAK,OAAA,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAlB,CAAkB,CAAC,CAAC;QAC1E,MAAA,KAAK,CAAC,GAAG,0CAAE,OAAO,CAAC,UAAC,CAAgB,IAAK,OAAA,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAnB,CAAmB,CAAC,CAAC;;IAJhE,OAAO,SAAS,aAAT,SAAS,uBAAT,SAAS,CAAE,MAAM;;KAKvB;IAED,IAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,UAAC,KAAK,IAAK,OAAA,CAAC,KAAK,CAAC,MAAM,EAAb,CAAa,CAAC,CAAC;IAC1D,IAAM,IAAI,GAA6C;QACrD,IAAI;QACJ,GAAG;QACH,YAAY;QACZ,QAAQ;KACT,CAAC;IACF,OAAO,QAAQ,CAAC,GAAG,CAAC,UAAC,KAAK;QACxB,IAAM,MAAM,GAAwB,EAAE,CAAC;QACvC,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,OAAO,CAAC,UAAC,GAAG;YAChB,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,SAAS;gBAAE,OAAO;YACrC,MAAM,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;QAC3B,CAAC,CAAC,CAAC;QACH,OAAO,MAAuB,CAAC;IACjC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,YAAY,GAAG,UAAC,MAAqB,EAAE,MAAqB;;IAChE,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,MAAM,GAAG,CAAC,CAAC;IAEf,IAAI,MAAM,CAAC,MAAM,EAAE;QACjB,GAAG,IAAI,MAAM,CAAC,UAAW,GAAG,MAAM,CAAC,MAAM,CAAC;QAC1C,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC;KACzB;IAED,IAAI,MAAM,CAAC,MAAM,EAAE;QACjB,GAAG,IAAI,MAAM,CAAC,UAAW,GAAG,MAAM,CAAC,MAAM,CAAC;QAC1C,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC;KACzB;IAED,MAAM,CAAC,EAAE,GAAG,MAAA,MAAM,CAAC,EAAE,0CAAE,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IACzC,MAAM,CAAC,UAAU,GAAG,GAAG,GAAG,MAAM,CAAC;IACjC,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;IACxC,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC;AACvB,CAAC,CAAC;AAEF,eAAe,gBAAgB,CAAC"}

package/lib/dagre/order/sort-subgraph.js

@@ -1,84 +0,0 @@
-import { barycenter } from './barycenter';
-import resolveConflicts from './resolve-conflicts';
-import { sort } from './sort';
-export var sortSubgraph = function (g, v, cg, biasRight, usePrev, keepNodeOrder) {
-    var _a, _b, _c, _d;
-    var movable = g.getChildren(v).map(function (n) { return n.id; });
-    // fixorder的点不参与排序（这个方案不合适，只排了新增节点，和原来的分离）
-    var node = g.getNode(v);
-    var bl = node ? node.data.borderLeft : undefined;
-    var br = node ? node.data.borderRight : undefined;
-    var subgraphs = {};
-    if (bl) {
-        movable = movable === null || movable === void 0 ? void 0 : movable.filter(function (w) {
-            return w !== bl && w !== br;
-        });
-    }
-    var barycenters = barycenter(g, movable || []);
-    barycenters === null || barycenters === void 0 ? void 0 : barycenters.forEach(function (entry) {
-        var _a;
-        if ((_a = g.getChildren(entry.v)) === null || _a === void 0 ? void 0 : _a.length) {
-            var subgraphResult = sortSubgraph(g, entry.v, cg, biasRight, keepNodeOrder);
-            subgraphs[entry.v] = subgraphResult;
-            if (subgraphResult.hasOwnProperty('barycenter')) {
-                mergeBarycenters(entry, subgraphResult);
-            }
-        }
-    });
-    var entries = resolveConflicts(barycenters, cg);
-    expandSubgraphs(entries, subgraphs);
-    // 添加fixorder信息到entries里边
-    // TODO: 不考虑复合情况，只用第一个点的fixorder信息，后续考虑更完备的实现
-    (_a = entries
-        .filter(function (e) { return e.vs.length > 0; })) === null || _a === void 0 ? void 0 : _a.forEach(function (e) {
-        var node = g.getNode(e.vs[0]);
-        if (node) {
-            e.fixorder = node.data.fixorder;
-            e.order = node.data.order;
-        }
-    });
-    var result = sort(entries, biasRight, usePrev, keepNodeOrder);
-    if (bl) {
-        result.vs = [bl, result.vs, br].flat();
-        if ((_b = g.getPredecessors(bl)) === null || _b === void 0 ? void 0 : _b.length) {
-            var blPred = g.getNode(((_c = g.getPredecessors(bl)) === null || _c === void 0 ? void 0 : _c[0].id) || '');
-            var brPred = g.getNode(((_d = g.getPredecessors(br)) === null || _d === void 0 ? void 0 : _d[0].id) || '');
-            if (!result.hasOwnProperty('barycenter')) {
-                result.barycenter = 0;
-                result.weight = 0;
-            }
-            result.barycenter =
-                (result.barycenter * result.weight +
-                    blPred.data.order +
-                    brPred.data.order) /
-                    (result.weight + 2);
-            result.weight += 2;
-        }
-    }
-    return result;
-};
-var expandSubgraphs = function (entries, subgraphs) {
-    entries === null || entries === void 0 ? void 0 : entries.forEach(function (entry) {
-        var _a;
-        var vss = (_a = entry.vs) === null || _a === void 0 ? void 0 : _a.map(function (v) {
-            if (subgraphs[v]) {
-                return subgraphs[v].vs;
-            }
-            return v;
-        });
-        entry.vs = vss.flat();
-    });
-};
-var mergeBarycenters = function (target, other) {
-    if (target.barycenter !== undefined) {
-        target.barycenter =
-            (target.barycenter * target.weight + other.barycenter * other.weight) /
-                (target.weight + other.weight);
-        target.weight += other.weight;
-    }
-    else {
-        target.barycenter = other.barycenter;
-        target.weight = other.weight;
-    }
-};
-//# sourceMappingURL=sort-subgraph.js.map

package/lib/dagre/order/sort-subgraph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sort-subgraph.js","sourceRoot":"","sources":["../../../src/dagre/order/sort-subgraph.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,gBAAmC,MAAM,qBAAqB,CAAC;AACtE,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAE9B,MAAM,CAAC,IAAM,YAAY,GAAG,UAC1B,CAAQ,EACR,CAAK,EACL,EAAS,EACT,SAAmB,EACnB,OAAiB,EACjB,aAAuB;;IAEvB,IAAI,OAAO,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,UAAC,CAAC,IAAK,OAAA,CAAC,CAAC,EAAE,EAAJ,CAAI,CAAC,CAAC;IAChD,0CAA0C;IAC1C,IAAM,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC;IAC3B,IAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAE,IAAI,CAAC,IAAI,CAAC,UAAiB,CAAC,CAAC,CAAC,SAAS,CAAC;IAC3D,IAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAE,IAAI,CAAC,IAAI,CAAC,WAAkB,CAAC,CAAC,CAAC,SAAS,CAAC;IAC5D,IAAM,SAAS,GAA2C,EAAE,CAAC;IAE7D,IAAI,EAAE,EAAE;QACN,OAAO,GAAG,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,MAAM,CAAC,UAAC,CAAC;YAC1B,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,CAAC,CAAC,CAAC;KACJ;IAED,IAAM,WAAW,GAAG,UAAU,CAAC,CAAC,EAAE,OAAO,IAAI,EAAE,CAAC,CAAC;IACjD,WAAW,aAAX,WAAW,uBAAX,WAAW,CAAE,OAAO,CAAC,UAAC,KAAK;;QACzB,IAAI,MAAA,CAAC,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,0CAAE,MAAM,EAAE;YAClC,IAAM,cAAc,GAAG,YAAY,CACjC,CAAC,EACD,KAAK,CAAC,CAAC,EACP,EAAE,EACF,SAAS,EACT,aAAa,CACd,CAAC;YACF,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC;YACpC,IAAI,cAAc,CAAC,cAAc,CAAC,YAAY,CAAC,EAAE;gBAC/C,gBAAgB,CAAC,KAAK,EAAE,cAAc,CAAC,CAAC;aACzC;SACF;IACH,CAAC,CAAC,CAAC;IAEH,IAAM,OAAO,GAAG,gBAAgB,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC;IAClD,eAAe,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IAEpC,yBAAyB;IACzB,6CAA6C;IAC7C,MAAA,OAAO;SACJ,MAAM,CAAC,UAAC,CAAC,IAAK,OAAA,CAAC,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,EAAf,CAAe,CAAC,0CAC7B,OAAO,CAAC,UAAC,CAAC;QACV,IAAM,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC;QACjC,IAAI,IAAI,EAAE;YACR,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,QAAS,CAAC;YACjC,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAM,CAAC;SAC5B;IACH,CAAC,CAAC,CAAC;IAEL,IAAM,MAAM,GAAG,IAAI,CAAC,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,aAAa,CAAC,CAAC;IAEhE,IAAI,EAAE,EAAE;QACN,MAAM,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,EAAU,CAAC;QAC/C,IAAI,MAAA,CAAC,CAAC,eAAe,CAAC,EAAE,CAAC,0CAAE,MAAM,EAAE;YACjC,IAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,CAAA,MAAA,CAAC,CAAC,eAAe,CAAC,EAAE,CAAC,0CAAG,CAAC,EAAE,EAAE,KAAI,EAAE,CAAE,CAAC;YAC/D,IAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,CAAA,MAAA,CAAC,CAAC,eAAe,CAAC,EAAG,CAAC,0CAAG,CAAC,EAAE,EAAE,KAAI,EAAE,CAAE,CAAC;YAChE,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,YAAY,CAAC,EAAE;gBACxC,MAAM,CAAC,UAAU,GAAG,CAAC,CAAC;gBACtB,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;aACnB;YACD,MAAM,CAAC,UAAU;gBACf,CAAC,MAAM,CAAC,UAAW,GAAG,MAAM,CAAC,MAAO;oBAClC,MAAM,CAAC,IAAI,CAAC,KAAM;oBAClB,MAAM,CAAC,IAAI,CAAC,KAAM,CAAC;oBACrB,CAAC,MAAM,CAAC,MAAO,GAAG,CAAC,CAAC,CAAC;YACvB,MAAM,CAAC,MAAO,IAAI,CAAC,CAAC;SACrB;KACF;IAED,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF,IAAM,eAAe,GAAG,UACtB,OAAwB,EACxB,SAAiD;IAEjD,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,OAAO,CAAC,UAAC,KAAK;;QACrB,IAAM,GAAG,GAAG,MAAA,KAAK,CAAC,EAAE,0CAAE,GAAG,CAAC,UAAC,CAAS;YAClC,IAAI,SAAS,CAAC,CAAC,CAAC,EAAE;gBAChB,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC,EAAG,CAAC;aACzB;YACD,OAAO,CAAC,CAAC;QACX,CAAC,CAAC,CAAC;QACH,KAAK,CAAC,EAAE,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;IACxB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,IAAM,gBAAgB,GAAG,UACvB,MAAgD,EAChD,KAA+C;IAE/C,IAAI,MAAM,CAAC,UAAU,KAAK,SAAS,EAAE;QACnC,MAAM,CAAC,UAAU;YACf,CAAC,MAAM,CAAC,UAAU,GAAG,MAAM,CAAC,MAAO,GAAG,KAAK,CAAC,UAAW,GAAG,KAAK,CAAC,MAAO,CAAC;gBACxE,CAAC,MAAM,CAAC,MAAO,GAAG,KAAK,CAAC,MAAO,CAAC,CAAC;QACnC,MAAM,CAAC,MAAO,IAAI,KAAK,CAAC,MAAO,CAAC;KACjC;SAAM;QACL,MAAM,CAAC,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC;QACrC,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;KAC9B;AACH,CAAC,CAAC"}

package/lib/dagre/order/sort.js

@@ -1,74 +0,0 @@
-import { partition } from "../util";
-export var sort = function (entries, biasRight, usePrev, keepNodeOrder) {
-    var parts = partition(entries, function (entry) {
-        var hasFixOrder = entry.hasOwnProperty("fixorder") && !isNaN(entry.fixorder);
-        if (keepNodeOrder) {
-            return !hasFixOrder && entry.hasOwnProperty("barycenter");
-        }
-        // NOTE: 有fixorder的也可以排
-        return hasFixOrder || entry.hasOwnProperty("barycenter");
-    });
-    var sortable = parts.lhs;
-    var unsortable = parts.rhs.sort(function (a, b) { return -a.i - -b.i; });
-    var vs = [];
-    var sum = 0;
-    var weight = 0;
-    var vsIndex = 0;
-    sortable === null || sortable === void 0 ? void 0 : sortable.sort(compareWithBias(!!biasRight, !!usePrev));
-    vsIndex = consumeUnsortable(vs, unsortable, vsIndex);
-    sortable === null || sortable === void 0 ? void 0 : sortable.forEach(function (entry) {
-        var _a;
-        vsIndex += (_a = entry.vs) === null || _a === void 0 ? void 0 : _a.length;
-        vs.push(entry.vs);
-        sum += entry.barycenter * entry.weight;
-        weight += entry.weight;
-        vsIndex = consumeUnsortable(vs, unsortable, vsIndex);
-    });
-    var result = {
-        vs: vs.flat(),
-    };
-    if (weight) {
-        result.barycenter = sum / weight;
-        result.weight = weight;
-    }
-    return result;
-};
-var consumeUnsortable = function (vs, unsortable, index) {
-    var iindex = index;
-    var last;
-    while (unsortable.length &&
-        (last = unsortable[unsortable.length - 1]).i <= iindex) {
-        unsortable.pop();
-        vs === null || vs === void 0 ? void 0 : vs.push(last.vs);
-        iindex++;
-    }
-    return iindex;
-};
-/**
- * 配置是否考虑使用之前的布局结果
- */
-var compareWithBias = function (bias, usePrev) {
-    return function (entryV, entryW) {
-        // 排序的时候先判断fixorder，不行再判断重心
-        if (entryV.fixorder !== undefined && entryW.fixorder !== undefined) {
-            return entryV.fixorder - entryW.fixorder;
-        }
-        if (entryV.barycenter < entryW.barycenter) {
-            return -1;
-        }
-        if (entryV.barycenter > entryW.barycenter) {
-            return 1;
-        }
-        // 重心相同，考虑之前排好的顺序
-        if (usePrev && entryV.order !== undefined && entryW.order !== undefined) {
-            if (entryV.order < entryW.order) {
-                return -1;
-            }
-            if (entryV.order > entryW.order) {
-                return 1;
-            }
-        }
-        return !bias ? entryV.i - entryW.i : entryW.i - entryV.i;
-    };
-};
-//# sourceMappingURL=sort.js.map

package/lib/dagre/order/sort.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sort.js","sourceRoot":"","sources":["../../../src/dagre/order/sort.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AAGpC,MAAM,CAAC,IAAM,IAAI,GAAG,UAClB,OAAwB,EACxB,SAAmB,EACnB,OAAiB,EACjB,aAAuB;IAEvB,IAAM,KAAK,GAAG,SAAS,CAAC,OAAO,EAAE,UAAC,KAAK;QACrC,IAAM,WAAW,GACf,KAAK,CAAC,cAAc,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,QAAS,CAAC,CAAC;QAC9D,IAAI,aAAa,EAAE;YACjB,OAAO,CAAC,WAAW,IAAI,KAAK,CAAC,cAAc,CAAC,YAAY,CAAC,CAAC;SAC3D;QACD,uBAAuB;QACvB,OAAO,WAAW,IAAI,KAAK,CAAC,cAAc,CAAC,YAAY,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;IACH,IAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC;IAC3B,IAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,UAAC,CAAC,EAAE,CAAC,IAAK,OAAA,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAX,CAAW,CAAC,CAAC;IACzD,IAAM,EAAE,GAAW,EAAE,CAAC;IACtB,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,OAAO,GAAG,CAAC,CAAC;IAEhB,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;IAExD,OAAO,GAAG,iBAAiB,CAAC,EAAE,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC;IAErD,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,OAAO,CAAC,UAAC,KAAK;;QACtB,OAAO,IAAI,MAAA,KAAK,CAAC,EAAE,0CAAE,MAAM,CAAC;QAC5B,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAClB,GAAG,IAAI,KAAK,CAAC,UAAW,GAAG,KAAK,CAAC,MAAO,CAAC;QACzC,MAAM,IAAI,KAAK,CAAC,MAAO,CAAC;QACxB,OAAO,GAAG,iBAAiB,CAAC,EAAE,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;IAEH,IAAM,MAAM,GAAuD;QACjE,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE;KACd,CAAC;IACF,IAAI,MAAM,EAAE;QACV,MAAM,CAAC,UAAU,GAAG,GAAG,GAAG,MAAM,CAAC;QACjC,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC;KACxB;IACD,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF,IAAM,iBAAiB,GAAG,UACxB,EAAU,EACV,UAA2B,EAC3B,KAAa;IAEb,IAAI,MAAM,GAAG,KAAK,CAAC;IACnB,IAAI,IAAI,CAAC;IACT,OACE,UAAU,CAAC,MAAM;QACjB,CAAC,IAAI,GAAG,UAAU,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,EACtD;QACA,UAAU,CAAC,GAAG,EAAE,CAAC;QACjB,EAAE,aAAF,EAAE,uBAAF,EAAE,CAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClB,MAAM,EAAE,CAAC;KACV;IACD,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF;;GAEG;AACH,IAAM,eAAe,GAAG,UAAC,IAAa,EAAE,OAAgB;IACtD,OAAO,UAAC,MAAqB,EAAE,MAAqB;QAClD,2BAA2B;QAC3B,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS,EAAE;YAClE,OAAO,MAAM,CAAC,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC;SAC1C;QACD,IAAI,MAAM,CAAC,UAAW,GAAG,MAAM,CAAC,UAAW,EAAE;YAC3C,OAAO,CAAC,CAAC,CAAC;SACX;QACD,IAAI,MAAM,CAAC,UAAW,GAAG,MAAM,CAAC,UAAW,EAAE;YAC3C,OAAO,CAAC,CAAC;SACV;QACD,iBAAiB;QACjB,IAAI,OAAO,IAAI,MAAM,CAAC,KAAK,KAAK,SAAS,IAAI,MAAM,CAAC,KAAK,KAAK,SAAS,EAAE;YACvE,IAAI,MAAM,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,EAAE;gBAC/B,OAAO,CAAC,CAAC,CAAC;aACX;YACD,IAAI,MAAM,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,EAAE;gBAC/B,OAAO,CAAC,CAAC;aACV;SACF;QAED,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;IAC3D,CAAC,CAAC;AACJ,CAAC,CAAC"}

package/lib/dagre/parent-dummy-chains.js

@@ -1,80 +0,0 @@
-// deep first search with both order low for pre, lim for post
-var dfsBothOrder = function (g) {
-    var result = {};
-    var lim = 0;
-    var dfs = function (v) {
-        var low = lim;
-        g.getChildren(v).forEach(function (n) { return dfs(n.id); });
-        result[v] = { low: low, lim: lim++ };
-    };
-    g.getRoots().forEach(function (n) { return dfs(n.id); });
-    return result;
-};
-// Find a path from v to w through the lowest common ancestor (LCA). Return the
-// full path and the LCA.
-var findPath = function (g, postorderNums, v, w) {
-    var _a, _b;
-    var vPath = [];
-    var wPath = [];
-    var low = Math.min(postorderNums[v].low, postorderNums[w].low);
-    var lim = Math.max(postorderNums[v].lim, postorderNums[w].lim);
-    var parent;
-    var lca;
-    // Traverse up from v to find the LCA
-    parent = v;
-    do {
-        parent = (_a = g.getParent(parent)) === null || _a === void 0 ? void 0 : _a.id;
-        vPath.push(parent);
-    } while (parent &&
-        (postorderNums[parent].low > low || lim > postorderNums[parent].lim));
-    lca = parent;
-    // Traverse from w to LCA
-    parent = w;
-    while (parent && parent !== lca) {
-        wPath.push(parent);
-        parent = (_b = g.getParent(parent)) === null || _b === void 0 ? void 0 : _b.id;
-    }
-    return { lca: lca, path: vPath.concat(wPath.reverse()) };
-};
-export var parentDummyChains = function (g, dummyChains) {
-    var postorderNums = dfsBothOrder(g);
-    dummyChains.forEach(function (startV) {
-        var _a, _b;
-        var v = startV;
-        var node = g.getNode(v);
-        var originalEdge = node.data.originalEdge;
-        if (!originalEdge)
-            return;
-        var pathData = findPath(g, postorderNums, originalEdge.source, originalEdge.target);
-        var path = pathData.path;
-        var lca = pathData.lca;
-        var pathIdx = 0;
-        var pathV = path[pathIdx];
-        var ascending = true;
-        while (v !== originalEdge.target) {
-            node = g.getNode(v);
-            if (ascending) {
-                while (pathV !== lca &&
-                    ((_a = g.getNode(pathV)) === null || _a === void 0 ? void 0 : _a.data.maxRank) < node.data.rank) {
-                    pathIdx++;
-                    pathV = path[pathIdx];
-                }
-                if (pathV === lca) {
-                    ascending = false;
-                }
-            }
-            if (!ascending) {
-                while (pathIdx < path.length - 1 &&
-                    ((_b = g.getNode(path[pathIdx + 1])) === null || _b === void 0 ? void 0 : _b.data.minRank) <= node.data.rank) {
-                    pathIdx++;
-                }
-                pathV = path[pathIdx];
-            }
-            if (g.hasNode(pathV)) {
-                g.setParent(v, pathV);
-            }
-            v = g.getSuccessors(v)[0].id;
-        }
-    });
-};
-//# sourceMappingURL=parent-dummy-chains.js.map

package/lib/dagre/parent-dummy-chains.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"parent-dummy-chains.js","sourceRoot":"","sources":["../../src/dagre/parent-dummy-chains.ts"],"names":[],"mappings":"AAKA,8DAA8D;AAC9D,IAAM,YAAY,GAAG,UAAC,CAAS;IAC7B,IAAM,MAAM,GAA0B,EAAE,CAAC;IACzC,IAAI,GAAG,GAAG,CAAC,CAAC;IAEZ,IAAM,GAAG,GAAG,UAAC,CAAK;QAChB,IAAM,GAAG,GAAG,GAAG,CAAC;QAChB,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,UAAC,CAAC,IAAK,OAAA,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAT,CAAS,CAAC,CAAC;QAC3C,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,KAAA,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC;IAClC,CAAC,CAAC;IACF,CAAC,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,UAAC,CAAC,IAAK,OAAA,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAT,CAAS,CAAC,CAAC;IAEvC,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF,+EAA+E;AAC/E,yBAAyB;AACzB,IAAM,QAAQ,GAAG,UACf,CAAS,EACT,aAAoC,EACpC,CAAK,EACL,CAAK;;IAEL,IAAM,KAAK,GAAS,EAAE,CAAC;IACvB,IAAM,KAAK,GAAS,EAAE,CAAC;IACvB,IAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACjE,IAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACjE,IAAI,MAAsB,CAAC;IAC3B,IAAI,GAAmB,CAAC;IAExB,qCAAqC;IACrC,MAAM,GAAG,CAAC,CAAC;IACX,GAAG;QACD,MAAM,GAAG,MAAA,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,0CAAE,EAAE,CAAC;QACjC,KAAK,CAAC,IAAI,CAAC,MAAO,CAAC,CAAC;KACrB,QACC,MAAM;QACN,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,EACpE;IACF,GAAG,GAAG,MAAM,CAAC;IAEb,yBAAyB;IACzB,MAAM,GAAG,CAAC,CAAC;IACX,OAAO,MAAM,IAAI,MAAM,KAAK,GAAG,EAAE;QAC/B,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACnB,MAAM,GAAG,MAAA,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,0CAAE,EAAE,CAAC;KAClC;IAED,OAAO,EAAE,GAAG,KAAA,EAAE,IAAI,EAAE,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC;AACtD,CAAC,CAAC;AAEF,MAAM,CAAC,IAAM,iBAAiB,GAAG,UAAC,CAAS,EAAE,WAAiB;IAC5D,IAAM,aAAa,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;IAEtC,WAAW,CAAC,OAAO,CAAC,UAAC,MAAM;;QACzB,IAAI,CAAC,GAAG,MAAM,CAAC;QACf,IAAI,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC;QACzB,IAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,YAA8B,CAAC;QAC9D,IAAI,CAAC,YAAY;YAAE,OAAO;QAC1B,IAAM,QAAQ,GAAG,QAAQ,CACvB,CAAC,EACD,aAAa,EACb,YAAY,CAAC,MAAM,EACnB,YAAY,CAAC,MAAM,CACpB,CAAC;QACF,IAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC;QAC3B,IAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC;QACzB,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,IAAI,KAAK,GAAG,IAAI,CAAC,OAAO,CAAE,CAAC;QAC3B,IAAI,SAAS,GAAG,IAAI,CAAC;QAErB,OAAO,CAAC,KAAK,YAAY,CAAC,MAAM,EAAE;YAChC,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC;YAErB,IAAI,SAAS,EAAE;gBACb,OACE,KAAK,KAAK,GAAG;oBACb,CAAA,MAAA,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,0CAAE,IAAI,CAAC,OAAQ,IAAG,IAAI,CAAC,IAAI,CAAC,IAAK,EACjD;oBACA,OAAO,EAAE,CAAC;oBACV,KAAK,GAAG,IAAI,CAAC,OAAO,CAAE,CAAC;iBACxB;gBAED,IAAI,KAAK,KAAK,GAAG,EAAE;oBACjB,SAAS,GAAG,KAAK,CAAC;iBACnB;aACF;YAED,IAAI,CAAC,SAAS,EAAE;gBACd,OACE,OAAO,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC;oBACzB,CAAA,MAAA,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,CAAE,CAAC,0CAAE,IAAI,CAAC,OAAQ,KAAI,IAAI,CAAC,IAAI,CAAC,IAAK,EAC/D;oBACA,OAAO,EAAE,CAAC;iBACX;gBACD,KAAK,GAAG,IAAI,CAAC,OAAO,CAAE,CAAC;aACxB;YAED,IAAI,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;gBACpB,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;aACvB;YAED,CAAC,GAAG,CAAC,CAAC,aAAa,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;SAC/B;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC"}