@hkyhy/marsun-components-core 0.1.134 → 0.1.136

package/dist/node_modules/@antv/layout/lib/node_modules/dagre/lib/order/resolve-conflicts.js

@@ -1,62 +0,0 @@
-import { __require as v } from "../lodash.js";
-var a, u;
-function p() {
-  if (u) return a;
-  u = 1;
-  var f = v();
-  a = s;
-  function s(i, t) {
-    var o = {};
-    f.forEach(i, function(e, n) {
-      var r = o[e.v] = {
-        indegree: 0,
-        in: [],
-        out: [],
-        vs: [e.v],
-        i: n
-      };
-      f.isUndefined(e.barycenter) || (r.barycenter = e.barycenter, r.weight = e.weight);
-    }), f.forEach(t.edges(), function(e) {
-      var n = o[e.v], r = o[e.w];
-      !f.isUndefined(n) && !f.isUndefined(r) && (r.indegree++, n.out.push(o[e.w]));
-    });
-    var c = f.filter(o, function(e) {
-      return !e.indegree;
-    });
-    return h(c);
-  }
-  function h(i) {
-    var t = [];
-    function o(n) {
-      return function(r) {
-        r.merged || (f.isUndefined(r.barycenter) || f.isUndefined(n.barycenter) || r.barycenter >= n.barycenter) && d(n, r);
-      };
-    }
-    function c(n) {
-      return function(r) {
-        r.in.push(n), --r.indegree === 0 && i.push(r);
-      };
-    }
-    for (; i.length; ) {
-      var e = i.pop();
-      t.push(e), f.forEach(e.in.reverse(), o(e)), f.forEach(e.out, c(e));
-    }
-    return f.map(
-      f.filter(t, function(n) {
-        return !n.merged;
-      }),
-      function(n) {
-        return f.pick(n, ["vs", "i", "barycenter", "weight"]);
-      }
-    );
-  }
-  function d(i, t) {
-    var o = 0, c = 0;
-    i.weight && (o += i.barycenter * i.weight, c += i.weight), t.weight && (o += t.barycenter * t.weight, c += t.weight), i.vs = t.vs.concat(i.vs), i.barycenter = o / c, i.weight = c, i.i = Math.min(t.i, i.i), t.merged = !0;
-  }
-  return a;
-}
-export {
-  p as __require
-};
-//# sourceMappingURL=resolve-conflicts.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/dagre/lib/order/resolve-conflicts.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"resolve-conflicts.js","sources":["../../../../../../../../../node_modules/@antv/layout/lib/node_modules/dagre/lib/order/resolve-conflicts.js"],"sourcesContent":["import { __require as requireLodash } from '../lodash.js';\n\nvar resolveConflicts_1;\nvar hasRequiredResolveConflicts;\n\nfunction requireResolveConflicts () {\n\tif (hasRequiredResolveConflicts) return resolveConflicts_1;\n\thasRequiredResolveConflicts = 1;\n\n\tvar _ = requireLodash();\n\n\tresolveConflicts_1 = resolveConflicts;\n\n\t/*\n\t * Given a list of entries of the form {v, barycenter, weight} and a\n\t * constraint graph this function will resolve any conflicts between the\n\t * constraint graph and the barycenters for the entries. If the barycenters for\n\t * an entry would violate a constraint in the constraint graph then we coalesce\n\t * the nodes in the conflict into a new node that respects the contraint and\n\t * aggregates barycenter and weight information.\n\t *\n\t * This implementation is based on the description in Forster, \"A Fast and\n\t * Simple Hueristic for Constrained Two-Level Crossing Reduction,\" thought it\n\t * differs in some specific details.\n\t *\n\t * Pre-conditions:\n\t *\n\t *    1. Each entry has the form {v, barycenter, weight}, or if the node has\n\t *       no barycenter, then {v}.\n\t *\n\t * Returns:\n\t *\n\t *    A new list of entries of the form {vs, i, barycenter, weight}. The list\n\t *    `vs` may either be a singleton or it may be an aggregation of nodes\n\t *    ordered such that they do not violate constraints from the constraint\n\t *    graph. The property `i` is the lowest original index of any of the\n\t *    elements in `vs`.\n\t */\n\tfunction resolveConflicts(entries, cg) {\n\t  var mappedEntries = {};\n\t  _.forEach(entries, function(entry, i) {\n\t    var tmp = mappedEntries[entry.v] = {\n\t      indegree: 0,\n\t      \"in\": [],\n\t      out: [],\n\t      vs: [entry.v],\n\t      i: i\n\t    };\n\t    if (!_.isUndefined(entry.barycenter)) {\n\t      tmp.barycenter = entry.barycenter;\n\t      tmp.weight = entry.weight;\n\t    }\n\t  });\n\n\t  _.forEach(cg.edges(), function(e) {\n\t    var entryV = mappedEntries[e.v];\n\t    var entryW = mappedEntries[e.w];\n\t    if (!_.isUndefined(entryV) && !_.isUndefined(entryW)) {\n\t      entryW.indegree++;\n\t      entryV.out.push(mappedEntries[e.w]);\n\t    }\n\t  });\n\n\t  var sourceSet = _.filter(mappedEntries, function(entry) {\n\t    return !entry.indegree;\n\t  });\n\n\t  return doResolveConflicts(sourceSet);\n\t}\n\n\tfunction doResolveConflicts(sourceSet) {\n\t  var entries = [];\n\n\t  function handleIn(vEntry) {\n\t    return function(uEntry) {\n\t      if (uEntry.merged) {\n\t        return;\n\t      }\n\t      if (_.isUndefined(uEntry.barycenter) ||\n\t          _.isUndefined(vEntry.barycenter) ||\n\t          uEntry.barycenter >= vEntry.barycenter) {\n\t        mergeEntries(vEntry, uEntry);\n\t      }\n\t    };\n\t  }\n\n\t  function handleOut(vEntry) {\n\t    return function(wEntry) {\n\t      wEntry[\"in\"].push(vEntry);\n\t      if (--wEntry.indegree === 0) {\n\t        sourceSet.push(wEntry);\n\t      }\n\t    };\n\t  }\n\n\t  while (sourceSet.length) {\n\t    var entry = sourceSet.pop();\n\t    entries.push(entry);\n\t    _.forEach(entry[\"in\"].reverse(), handleIn(entry));\n\t    _.forEach(entry.out, handleOut(entry));\n\t  }\n\n\t  return _.map(_.filter(entries, function(entry) { return !entry.merged; }),\n\t    function(entry) {\n\t      return _.pick(entry, [\"vs\", \"i\", \"barycenter\", \"weight\"]);\n\t    });\n\n\t}\n\n\tfunction mergeEntries(target, source) {\n\t  var sum = 0;\n\t  var weight = 0;\n\n\t  if (target.weight) {\n\t    sum += target.barycenter * target.weight;\n\t    weight += target.weight;\n\t  }\n\n\t  if (source.weight) {\n\t    sum += source.barycenter * source.weight;\n\t    weight += source.weight;\n\t  }\n\n\t  target.vs = source.vs.concat(target.vs);\n\t  target.barycenter = sum / weight;\n\t  target.weight = weight;\n\t  target.i = Math.min(source.i, target.i);\n\t  source.merged = true;\n\t}\n\treturn resolveConflicts_1;\n}\n\nexport { requireResolveConflicts as __require };\n//# sourceMappingURL=resolve-conflicts.js.map\n"],"names":["resolveConflicts_1","hasRequiredResolveConflicts","requireResolveConflicts","_","requireLodash","resolveConflicts","entries","cg","mappedEntries","entry","i","tmp","entryV","entryW","sourceSet","doResolveConflicts","handleIn","vEntry","uEntry","mergeEntries","handleOut","wEntry","target","source","sum","weight"],"mappings":";AAEA,IAAIA,GACAC;AAEJ,SAASC,IAA2B;AACnC,MAAID,EAA6B,QAAOD;AACxC,EAAAC,IAA8B;AAE9B,MAAIE,IAAIC,EAAa;AAErB,EAAAJ,IAAqBK;AA2BrB,WAASA,EAAiBC,GAASC,GAAI;AACrC,QAAIC,IAAgB,CAAA;AACpB,IAAAL,EAAE,QAAQG,GAAS,SAASG,GAAOC,GAAG;AACpC,UAAIC,IAAMH,EAAcC,EAAM,CAAC,IAAI;AAAA,QACjC,UAAU;AAAA,QACV,IAAM,CAAA;AAAA,QACN,KAAK,CAAA;AAAA,QACL,IAAI,CAACA,EAAM,CAAC;AAAA,QACZ,GAAGC;AAAA,MACV;AACK,MAAKP,EAAE,YAAYM,EAAM,UAAU,MACjCE,EAAI,aAAaF,EAAM,YACvBE,EAAI,SAASF,EAAM;AAAA,IAEvB,CAAC,GAEDN,EAAE,QAAQI,EAAG,MAAK,GAAI,SAAS,GAAG;AAChC,UAAIK,IAASJ,EAAc,EAAE,CAAC,GAC1BK,IAASL,EAAc,EAAE,CAAC;AAC9B,MAAI,CAACL,EAAE,YAAYS,CAAM,KAAK,CAACT,EAAE,YAAYU,CAAM,MACjDA,EAAO,YACPD,EAAO,IAAI,KAAKJ,EAAc,EAAE,CAAC,CAAC;AAAA,IAEtC,CAAC;AAED,QAAIM,IAAYX,EAAE,OAAOK,GAAe,SAASC,GAAO;AACtD,aAAO,CAACA,EAAM;AAAA,IAChB,CAAC;AAED,WAAOM,EAAmBD,CAAS;AAAA,EACrC;AAEA,WAASC,EAAmBD,GAAW;AACrC,QAAIR,IAAU,CAAA;AAEd,aAASU,EAASC,GAAQ;AACxB,aAAO,SAASC,GAAQ;AACtB,QAAIA,EAAO,WAGPf,EAAE,YAAYe,EAAO,UAAU,KAC/Bf,EAAE,YAAYc,EAAO,UAAU,KAC/BC,EAAO,cAAcD,EAAO,eAC9BE,EAAaF,GAAQC,CAAM;AAAA,MAE/B;AAAA,IACF;AAEA,aAASE,EAAUH,GAAQ;AACzB,aAAO,SAASI,GAAQ;AACtB,QAAAA,EAAO,GAAM,KAAKJ,CAAM,GACpB,EAAEI,EAAO,aAAa,KACxBP,EAAU,KAAKO,CAAM;AAAA,MAEzB;AAAA,IACF;AAEA,WAAOP,EAAU,UAAQ;AACvB,UAAIL,IAAQK,EAAU,IAAG;AACzB,MAAAR,EAAQ,KAAKG,CAAK,GAClBN,EAAE,QAAQM,EAAM,GAAM,WAAWO,EAASP,CAAK,CAAC,GAChDN,EAAE,QAAQM,EAAM,KAAKW,EAAUX,CAAK,CAAC;AAAA,IACvC;AAEA,WAAON,EAAE;AAAA,MAAIA,EAAE,OAAOG,GAAS,SAASG,GAAO;AAAE,eAAO,CAACA,EAAM;AAAA,MAAQ,CAAC;AAAA,MACtE,SAASA,GAAO;AACd,eAAON,EAAE,KAAKM,GAAO,CAAC,MAAM,KAAK,cAAc,QAAQ,CAAC;AAAA,MAC1D;AAAA,IAAC;AAAA,EAEL;AAEA,WAASU,EAAaG,GAAQC,GAAQ;AACpC,QAAIC,IAAM,GACNC,IAAS;AAEb,IAAIH,EAAO,WACTE,KAAOF,EAAO,aAAaA,EAAO,QAClCG,KAAUH,EAAO,SAGfC,EAAO,WACTC,KAAOD,EAAO,aAAaA,EAAO,QAClCE,KAAUF,EAAO,SAGnBD,EAAO,KAAKC,EAAO,GAAG,OAAOD,EAAO,EAAE,GACtCA,EAAO,aAAaE,IAAMC,GAC1BH,EAAO,SAASG,GAChBH,EAAO,IAAI,KAAK,IAAIC,EAAO,GAAGD,EAAO,CAAC,GACtCC,EAAO,SAAS;AAAA,EAClB;AACA,SAAOvB;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/dagre/lib/order/sort-subgraph.js

@@ -1,47 +0,0 @@
-import { __require as C } from "../lodash.js";
-import { __require as E } from "./barycenter.js";
-import { __require as L } from "./resolve-conflicts.js";
-import { __require as g } from "./sort.js";
-var d, _;
-function A() {
-  if (_) return d;
-  _ = 1;
-  var n = C(), m = E(), q = L(), w = g();
-  d = b;
-  function b(r, e, f, t) {
-    var c = r.children(e), s = r.node(e), o = s ? s.borderLeft : void 0, u = s ? s.borderRight : void 0, h = {};
-    o && (c = n.filter(c, function(a) {
-      return a !== o && a !== u;
-    }));
-    var l = m(r, c);
-    n.forEach(l, function(a) {
-      if (r.children(a.v).length) {
-        var v = b(r, a.v, f, t);
-        h[a.v] = v, n.has(v, "barycenter") && S(a, v);
-      }
-    });
-    var p = q(l, f);
-    y(p, h);
-    var i = w(p, t);
-    if (o && (i.vs = n.flatten([o, i.vs, u], !0), r.predecessors(o).length)) {
-      var x = r.node(r.predecessors(o)[0]), B = r.node(r.predecessors(u)[0]);
-      n.has(i, "barycenter") || (i.barycenter = 0, i.weight = 0), i.barycenter = (i.barycenter * i.weight + x.order + B.order) / (i.weight + 2), i.weight += 2;
-    }
-    return i;
-  }
-  function y(r, e) {
-    n.forEach(r, function(f) {
-      f.vs = n.flatten(f.vs.map(function(t) {
-        return e[t] ? e[t].vs : t;
-      }), !0);
-    });
-  }
-  function S(r, e) {
-    n.isUndefined(r.barycenter) ? (r.barycenter = e.barycenter, r.weight = e.weight) : (r.barycenter = (r.barycenter * r.weight + e.barycenter * e.weight) / (r.weight + e.weight), r.weight += e.weight);
-  }
-  return d;
-}
-export {
-  A as __require
-};
-//# sourceMappingURL=sort-subgraph.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/dagre/lib/order/sort-subgraph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sort-subgraph.js","sources":["../../../../../../../../../node_modules/@antv/layout/lib/node_modules/dagre/lib/order/sort-subgraph.js"],"sourcesContent":["import { __require as requireLodash } from '../lodash.js';\nimport { __require as requireBarycenter } from './barycenter.js';\nimport { __require as requireResolveConflicts } from './resolve-conflicts.js';\nimport { __require as requireSort } from './sort.js';\n\nvar sortSubgraph_1;\nvar hasRequiredSortSubgraph;\n\nfunction requireSortSubgraph () {\n\tif (hasRequiredSortSubgraph) return sortSubgraph_1;\n\thasRequiredSortSubgraph = 1;\n\tvar _ = requireLodash();\n\tvar barycenter = requireBarycenter();\n\tvar resolveConflicts = requireResolveConflicts();\n\tvar sort = requireSort();\n\n\tsortSubgraph_1 = sortSubgraph;\n\n\tfunction sortSubgraph(g, v, cg, biasRight) {\n\t  var movable = g.children(v);\n\t  var node = g.node(v);\n\t  var bl = node ? node.borderLeft : undefined;\n\t  var br = node ? node.borderRight: undefined;\n\t  var subgraphs = {};\n\n\t  if (bl) {\n\t    movable = _.filter(movable, function(w) {\n\t      return w !== bl && w !== br;\n\t    });\n\t  }\n\n\t  var barycenters = barycenter(g, movable);\n\t  _.forEach(barycenters, function(entry) {\n\t    if (g.children(entry.v).length) {\n\t      var subgraphResult = sortSubgraph(g, entry.v, cg, biasRight);\n\t      subgraphs[entry.v] = subgraphResult;\n\t      if (_.has(subgraphResult, \"barycenter\")) {\n\t        mergeBarycenters(entry, subgraphResult);\n\t      }\n\t    }\n\t  });\n\n\t  var entries = resolveConflicts(barycenters, cg);\n\t  expandSubgraphs(entries, subgraphs);\n\n\t  var result = sort(entries, biasRight);\n\n\t  if (bl) {\n\t    result.vs = _.flatten([bl, result.vs, br], true);\n\t    if (g.predecessors(bl).length) {\n\t      var blPred = g.node(g.predecessors(bl)[0]),\n\t        brPred = g.node(g.predecessors(br)[0]);\n\t      if (!_.has(result, \"barycenter\")) {\n\t        result.barycenter = 0;\n\t        result.weight = 0;\n\t      }\n\t      result.barycenter = (result.barycenter * result.weight +\n\t                           blPred.order + brPred.order) / (result.weight + 2);\n\t      result.weight += 2;\n\t    }\n\t  }\n\n\t  return result;\n\t}\n\n\tfunction expandSubgraphs(entries, subgraphs) {\n\t  _.forEach(entries, function(entry) {\n\t    entry.vs = _.flatten(entry.vs.map(function(v) {\n\t      if (subgraphs[v]) {\n\t        return subgraphs[v].vs;\n\t      }\n\t      return v;\n\t    }), true);\n\t  });\n\t}\n\n\tfunction mergeBarycenters(target, other) {\n\t  if (!_.isUndefined(target.barycenter)) {\n\t    target.barycenter = (target.barycenter * target.weight +\n\t                         other.barycenter * other.weight) /\n\t                        (target.weight + other.weight);\n\t    target.weight += other.weight;\n\t  } else {\n\t    target.barycenter = other.barycenter;\n\t    target.weight = other.weight;\n\t  }\n\t}\n\treturn sortSubgraph_1;\n}\n\nexport { requireSortSubgraph as __require };\n//# sourceMappingURL=sort-subgraph.js.map\n"],"names":["sortSubgraph_1","hasRequiredSortSubgraph","requireSortSubgraph","_","requireLodash","barycenter","requireBarycenter","resolveConflicts","requireResolveConflicts","sort","requireSort","sortSubgraph","g","v","cg","biasRight","movable","node","bl","br","subgraphs","w","barycenters","entry","subgraphResult","mergeBarycenters","entries","expandSubgraphs","result","blPred","brPred","target","other"],"mappings":";;;;AAKA,IAAIA,GACAC;AAEJ,SAASC,IAAuB;AAC/B,MAAID,EAAyB,QAAOD;AACpC,EAAAC,IAA0B;AAC1B,MAAIE,IAAIC,EAAa,GACjBC,IAAaC,EAAiB,GAC9BC,IAAmBC,EAAuB,GAC1CC,IAAOC,EAAW;AAEtB,EAAAV,IAAiBW;AAEjB,WAASA,EAAaC,GAAGC,GAAGC,GAAIC,GAAW;AACzC,QAAIC,IAAUJ,EAAE,SAASC,CAAC,GACtBI,IAAOL,EAAE,KAAKC,CAAC,GACfK,IAAKD,IAAOA,EAAK,aAAa,QAC9BE,IAAKF,IAAOA,EAAK,cAAa,QAC9BG,IAAY,CAAA;AAEhB,IAAIF,MACFF,IAAUb,EAAE,OAAOa,GAAS,SAASK,GAAG;AACtC,aAAOA,MAAMH,KAAMG,MAAMF;AAAA,IAC3B,CAAC;AAGH,QAAIG,IAAcjB,EAAWO,GAAGI,CAAO;AACvC,IAAAb,EAAE,QAAQmB,GAAa,SAASC,GAAO;AACrC,UAAIX,EAAE,SAASW,EAAM,CAAC,EAAE,QAAQ;AAC9B,YAAIC,IAAiBb,EAAaC,GAAGW,EAAM,GAAGT,GAAIC,CAAS;AAC3D,QAAAK,EAAUG,EAAM,CAAC,IAAIC,GACjBrB,EAAE,IAAIqB,GAAgB,YAAY,KACpCC,EAAiBF,GAAOC,CAAc;AAAA,MAE1C;AAAA,IACF,CAAC;AAED,QAAIE,IAAUnB,EAAiBe,GAAaR,CAAE;AAC9C,IAAAa,EAAgBD,GAASN,CAAS;AAElC,QAAIQ,IAASnB,EAAKiB,GAASX,CAAS;AAEpC,QAAIG,MACFU,EAAO,KAAKzB,EAAE,QAAQ,CAACe,GAAIU,EAAO,IAAIT,CAAE,GAAG,EAAI,GAC3CP,EAAE,aAAaM,CAAE,EAAE,SAAQ;AAC7B,UAAIW,IAASjB,EAAE,KAAKA,EAAE,aAAaM,CAAE,EAAE,CAAC,CAAC,GACvCY,IAASlB,EAAE,KAAKA,EAAE,aAAaO,CAAE,EAAE,CAAC,CAAC;AACvC,MAAKhB,EAAE,IAAIyB,GAAQ,YAAY,MAC7BA,EAAO,aAAa,GACpBA,EAAO,SAAS,IAElBA,EAAO,cAAcA,EAAO,aAAaA,EAAO,SAC3BC,EAAO,QAAQC,EAAO,UAAUF,EAAO,SAAS,IACrEA,EAAO,UAAU;AAAA,IACnB;AAGF,WAAOA;AAAA,EACT;AAEA,WAASD,EAAgBD,GAASN,GAAW;AAC3C,IAAAjB,EAAE,QAAQuB,GAAS,SAASH,GAAO;AACjC,MAAAA,EAAM,KAAKpB,EAAE,QAAQoB,EAAM,GAAG,IAAI,SAASV,GAAG;AAC5C,eAAIO,EAAUP,CAAC,IACNO,EAAUP,CAAC,EAAE,KAEfA;AAAA,MACT,CAAC,GAAG,EAAI;AAAA,IACV,CAAC;AAAA,EACH;AAEA,WAASY,EAAiBM,GAAQC,GAAO;AACvC,IAAK7B,EAAE,YAAY4B,EAAO,UAAU,KAMlCA,EAAO,aAAaC,EAAM,YAC1BD,EAAO,SAASC,EAAM,WANtBD,EAAO,cAAcA,EAAO,aAAaA,EAAO,SAC3BC,EAAM,aAAaA,EAAM,WACzBD,EAAO,SAASC,EAAM,SAC3CD,EAAO,UAAUC,EAAM;AAAA,EAK3B;AACA,SAAOhC;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/dagre/lib/order/sort.js

@@ -1,36 +0,0 @@
-import { __require as q } from "../lodash.js";
-import { __require as g } from "../util.js";
-var f, p;
-function S() {
-  if (p) return f;
-  p = 1;
-  var i = q(), b = g();
-  f = _;
-  function _(u, e) {
-    var r = b.partition(u, function(t) {
-      return i.has(t, "barycenter");
-    }), a = r.lhs, v = i.sortBy(r.rhs, function(t) {
-      return -t.i;
-    }), n = [], l = 0, o = 0, s = 0;
-    a.sort(m(!!e)), s = h(n, v, s), i.forEach(a, function(t) {
-      s += t.vs.length, n.push(t.vs), l += t.barycenter * t.weight, o += t.weight, s = h(n, v, s);
-    });
-    var c = { vs: i.flatten(n, !0) };
-    return o && (c.barycenter = l / o, c.weight = o), c;
-  }
-  function h(u, e, r) {
-    for (var a; e.length && (a = i.last(e)).i <= r; )
-      e.pop(), u.push(a.vs), r++;
-    return r;
-  }
-  function m(u) {
-    return function(e, r) {
-      return e.barycenter < r.barycenter ? -1 : e.barycenter > r.barycenter ? 1 : u ? r.i - e.i : e.i - r.i;
-    };
-  }
-  return f;
-}
-export {
-  S as __require
-};
-//# sourceMappingURL=sort.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/dagre/lib/order/sort.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sort.js","sources":["../../../../../../../../../node_modules/@antv/layout/lib/node_modules/dagre/lib/order/sort.js"],"sourcesContent":["import { __require as requireLodash } from '../lodash.js';\nimport { __require as requireUtil } from '../util.js';\n\nvar sort_1;\nvar hasRequiredSort;\n\nfunction requireSort () {\n\tif (hasRequiredSort) return sort_1;\n\thasRequiredSort = 1;\n\tvar _ = requireLodash();\n\tvar util = requireUtil();\n\n\tsort_1 = sort;\n\n\tfunction sort(entries, biasRight) {\n\t  var parts = util.partition(entries, function(entry) {\n\t    return _.has(entry, \"barycenter\");\n\t  });\n\t  var sortable = parts.lhs,\n\t    unsortable = _.sortBy(parts.rhs, function(entry) { return -entry.i; }),\n\t    vs = [],\n\t    sum = 0,\n\t    weight = 0,\n\t    vsIndex = 0;\n\n\t  sortable.sort(compareWithBias(!!biasRight));\n\n\t  vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n\n\t  _.forEach(sortable, function (entry) {\n\t    vsIndex += entry.vs.length;\n\t    vs.push(entry.vs);\n\t    sum += entry.barycenter * entry.weight;\n\t    weight += entry.weight;\n\t    vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n\t  });\n\n\t  var result = { vs: _.flatten(vs, true) };\n\t  if (weight) {\n\t    result.barycenter = sum / weight;\n\t    result.weight = weight;\n\t  }\n\t  return result;\n\t}\n\n\tfunction consumeUnsortable(vs, unsortable, index) {\n\t  var last;\n\t  while (unsortable.length && (last = _.last(unsortable)).i <= index) {\n\t    unsortable.pop();\n\t    vs.push(last.vs);\n\t    index++;\n\t  }\n\t  return index;\n\t}\n\n\tfunction compareWithBias(bias) {\n\t  return function(entryV, entryW) {\n\t    if (entryV.barycenter < entryW.barycenter) {\n\t      return -1;\n\t    } else if (entryV.barycenter > entryW.barycenter) {\n\t      return 1;\n\t    }\n\n\t    return !bias ? entryV.i - entryW.i : entryW.i - entryV.i;\n\t  };\n\t}\n\treturn sort_1;\n}\n\nexport { requireSort as __require };\n//# sourceMappingURL=sort.js.map\n"],"names":["sort_1","hasRequiredSort","requireSort","_","requireLodash","util","requireUtil","sort","entries","biasRight","parts","entry","sortable","unsortable","vs","sum","weight","vsIndex","compareWithBias","consumeUnsortable","result","index","last","bias","entryV","entryW"],"mappings":";;AAGA,IAAIA,GACAC;AAEJ,SAASC,IAAe;AACvB,MAAID,EAAiB,QAAOD;AAC5B,EAAAC,IAAkB;AAClB,MAAIE,IAAIC,EAAa,GACjBC,IAAOC,EAAW;AAEtB,EAAAN,IAASO;AAET,WAASA,EAAKC,GAASC,GAAW;AAChC,QAAIC,IAAQL,EAAK,UAAUG,GAAS,SAASG,GAAO;AAClD,aAAOR,EAAE,IAAIQ,GAAO,YAAY;AAAA,IAClC,CAAC,GACGC,IAAWF,EAAM,KACnBG,IAAaV,EAAE,OAAOO,EAAM,KAAK,SAASC,GAAO;AAAE,aAAO,CAACA,EAAM;AAAA,IAAG,CAAC,GACrEG,IAAK,CAAA,GACLC,IAAM,GACNC,IAAS,GACTC,IAAU;AAEZ,IAAAL,EAAS,KAAKM,EAAgB,CAAC,CAACT,CAAS,CAAC,GAE1CQ,IAAUE,EAAkBL,GAAID,GAAYI,CAAO,GAEnDd,EAAE,QAAQS,GAAU,SAAUD,GAAO;AACnC,MAAAM,KAAWN,EAAM,GAAG,QACpBG,EAAG,KAAKH,EAAM,EAAE,GAChBI,KAAOJ,EAAM,aAAaA,EAAM,QAChCK,KAAUL,EAAM,QAChBM,IAAUE,EAAkBL,GAAID,GAAYI,CAAO;AAAA,IACrD,CAAC;AAED,QAAIG,IAAS,EAAE,IAAIjB,EAAE,QAAQW,GAAI,EAAI,EAAC;AACtC,WAAIE,MACFI,EAAO,aAAaL,IAAMC,GAC1BI,EAAO,SAASJ,IAEXI;AAAA,EACT;AAEA,WAASD,EAAkBL,GAAID,GAAYQ,GAAO;AAEhD,aADIC,GACGT,EAAW,WAAWS,IAAOnB,EAAE,KAAKU,CAAU,GAAG,KAAKQ;AAC3D,MAAAR,EAAW,IAAG,GACdC,EAAG,KAAKQ,EAAK,EAAE,GACfD;AAEF,WAAOA;AAAA,EACT;AAEA,WAASH,EAAgBK,GAAM;AAC7B,WAAO,SAASC,GAAQC,GAAQ;AAC9B,aAAID,EAAO,aAAaC,EAAO,aACtB,KACED,EAAO,aAAaC,EAAO,aAC7B,IAGDF,IAA6BE,EAAO,IAAID,EAAO,IAAxCA,EAAO,IAAIC,EAAO;AAAA,IACnC;AAAA,EACF;AACA,SAAOzB;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/dagre/lib/parent-dummy-chains.js

@@ -1,49 +0,0 @@
-import { __require as w } from "./lodash.js";
-var f, v;
-function _() {
-  if (v) return f;
-  v = 1;
-  var c = w();
-  f = d;
-  function d(r) {
-    var e = p(r);
-    c.forEach(r.graph().dummyChains, function(n) {
-      for (var i = r.node(n), h = i.edgeObj, l = s(r, e, h.v, h.w), o = l.path, u = l.lca, a = 0, t = o[a], m = !0; n !== h.w; ) {
-        if (i = r.node(n), m) {
-          for (; (t = o[a]) !== u && r.node(t).maxRank < i.rank; )
-            a++;
-          t === u && (m = !1);
-        }
-        if (!m) {
-          for (; a < o.length - 1 && r.node(t = o[a + 1]).minRank <= i.rank; )
-            a++;
-          t = o[a];
-        }
-        r.setParent(n, t), n = r.successors(n)[0];
-      }
-    });
-  }
-  function s(r, e, n, i) {
-    var h = [], l = [], o = Math.min(e[n].low, e[i].low), u = Math.max(e[n].lim, e[i].lim), a, t;
-    a = n;
-    do
-      a = r.parent(a), h.push(a);
-    while (a && (e[a].low > o || u > e[a].lim));
-    for (t = a, a = i; (a = r.parent(a)) !== t; )
-      l.push(a);
-    return { path: h.concat(l.reverse()), lca: t };
-  }
-  function p(r) {
-    var e = {}, n = 0;
-    function i(h) {
-      var l = n;
-      c.forEach(r.children(h), i), e[h] = { low: l, lim: n++ };
-    }
-    return c.forEach(r.children(), i), e;
-  }
-  return f;
-}
-export {
-  _ as __require
-};
-//# sourceMappingURL=parent-dummy-chains.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/dagre/lib/parent-dummy-chains.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"parent-dummy-chains.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/dagre/lib/parent-dummy-chains.js"],"sourcesContent":["import { __require as requireLodash } from './lodash.js';\n\nvar parentDummyChains_1;\nvar hasRequiredParentDummyChains;\n\nfunction requireParentDummyChains () {\n\tif (hasRequiredParentDummyChains) return parentDummyChains_1;\n\thasRequiredParentDummyChains = 1;\n\tvar _ = requireLodash();\n\n\tparentDummyChains_1 = parentDummyChains;\n\n\tfunction parentDummyChains(g) {\n\t  var postorderNums = postorder(g);\n\n\t  _.forEach(g.graph().dummyChains, function(v) {\n\t    var node = g.node(v);\n\t    var edgeObj = node.edgeObj;\n\t    var pathData = findPath(g, postorderNums, edgeObj.v, edgeObj.w);\n\t    var path = pathData.path;\n\t    var lca = pathData.lca;\n\t    var pathIdx = 0;\n\t    var pathV = path[pathIdx];\n\t    var ascending = true;\n\n\t    while (v !== edgeObj.w) {\n\t      node = g.node(v);\n\n\t      if (ascending) {\n\t        while ((pathV = path[pathIdx]) !== lca &&\n\t               g.node(pathV).maxRank < node.rank) {\n\t          pathIdx++;\n\t        }\n\n\t        if (pathV === lca) {\n\t          ascending = false;\n\t        }\n\t      }\n\n\t      if (!ascending) {\n\t        while (pathIdx < path.length - 1 &&\n\t               g.node(pathV = path[pathIdx + 1]).minRank <= node.rank) {\n\t          pathIdx++;\n\t        }\n\t        pathV = path[pathIdx];\n\t      }\n\n\t      g.setParent(v, pathV);\n\t      v = g.successors(v)[0];\n\t    }\n\t  });\n\t}\n\n\t// Find a path from v to w through the lowest common ancestor (LCA). Return the\n\t// full path and the LCA.\n\tfunction findPath(g, postorderNums, v, w) {\n\t  var vPath = [];\n\t  var wPath = [];\n\t  var low = Math.min(postorderNums[v].low, postorderNums[w].low);\n\t  var lim = Math.max(postorderNums[v].lim, postorderNums[w].lim);\n\t  var parent;\n\t  var lca;\n\n\t  // Traverse up from v to find the LCA\n\t  parent = v;\n\t  do {\n\t    parent = g.parent(parent);\n\t    vPath.push(parent);\n\t  } while (parent &&\n\t           (postorderNums[parent].low > low || lim > postorderNums[parent].lim));\n\t  lca = parent;\n\n\t  // Traverse from w to LCA\n\t  parent = w;\n\t  while ((parent = g.parent(parent)) !== lca) {\n\t    wPath.push(parent);\n\t  }\n\n\t  return { path: vPath.concat(wPath.reverse()), lca: lca };\n\t}\n\n\tfunction postorder(g) {\n\t  var result = {};\n\t  var lim = 0;\n\n\t  function dfs(v) {\n\t    var low = lim;\n\t    _.forEach(g.children(v), dfs);\n\t    result[v] = { low: low, lim: lim++ };\n\t  }\n\t  _.forEach(g.children(), dfs);\n\n\t  return result;\n\t}\n\treturn parentDummyChains_1;\n}\n\nexport { requireParentDummyChains as __require };\n//# sourceMappingURL=parent-dummy-chains.js.map\n"],"names":["parentDummyChains_1","hasRequiredParentDummyChains","requireParentDummyChains","_","requireLodash","parentDummyChains","g","postorderNums","postorder","v","node","edgeObj","pathData","findPath","path","lca","pathIdx","pathV","ascending","w","vPath","wPath","low","lim","parent","result","dfs"],"mappings":";AAEA,IAAIA,GACAC;AAEJ,SAASC,IAA4B;AACpC,MAAID,EAA8B,QAAOD;AACzC,EAAAC,IAA+B;AAC/B,MAAIE,IAAIC,EAAa;AAErB,EAAAJ,IAAsBK;AAEtB,WAASA,EAAkBC,GAAG;AAC5B,QAAIC,IAAgBC,EAAUF,CAAC;AAE/B,IAAAH,EAAE,QAAQG,EAAE,MAAK,EAAG,aAAa,SAASG,GAAG;AAU3C,eATIC,IAAOJ,EAAE,KAAKG,CAAC,GACfE,IAAUD,EAAK,SACfE,IAAWC,EAASP,GAAGC,GAAeI,EAAQ,GAAGA,EAAQ,CAAC,GAC1DG,IAAOF,EAAS,MAChBG,IAAMH,EAAS,KACfI,IAAU,GACVC,IAAQH,EAAKE,CAAO,GACpBE,IAAY,IAETT,MAAME,EAAQ,KAAG;AAGtB,YAFAD,IAAOJ,EAAE,KAAKG,CAAC,GAEXS,GAAW;AACb,kBAAQD,IAAQH,EAAKE,CAAO,OAAOD,KAC5BT,EAAE,KAAKW,CAAK,EAAE,UAAUP,EAAK;AAClC,YAAAM;AAGF,UAAIC,MAAUF,MACZG,IAAY;AAAA,QAEhB;AAEA,YAAI,CAACA,GAAW;AACd,iBAAOF,IAAUF,EAAK,SAAS,KACxBR,EAAE,KAAKW,IAAQH,EAAKE,IAAU,CAAC,CAAC,EAAE,WAAWN,EAAK;AACvD,YAAAM;AAEF,UAAAC,IAAQH,EAAKE,CAAO;AAAA,QACtB;AAEA,QAAAV,EAAE,UAAUG,GAAGQ,CAAK,GACpBR,IAAIH,EAAE,WAAWG,CAAC,EAAE,CAAC;AAAA,MACvB;AAAA,IACF,CAAC;AAAA,EACH;AAIA,WAASI,EAASP,GAAGC,GAAeE,GAAGU,GAAG;AACxC,QAAIC,IAAQ,CAAA,GACRC,IAAQ,CAAA,GACRC,IAAM,KAAK,IAAIf,EAAcE,CAAC,EAAE,KAAKF,EAAcY,CAAC,EAAE,GAAG,GACzDI,IAAM,KAAK,IAAIhB,EAAcE,CAAC,EAAE,KAAKF,EAAcY,CAAC,EAAE,GAAG,GACzDK,GACAT;AAGJ,IAAAS,IAASf;AACT;AACE,MAAAe,IAASlB,EAAE,OAAOkB,CAAM,GACxBJ,EAAM,KAAKI,CAAM;AAAA,WACVA,MACCjB,EAAciB,CAAM,EAAE,MAAMF,KAAOC,IAAMhB,EAAciB,CAAM,EAAE;AAKzE,SAJAT,IAAMS,GAGNA,IAASL,IACDK,IAASlB,EAAE,OAAOkB,CAAM,OAAOT;AACrC,MAAAM,EAAM,KAAKG,CAAM;AAGnB,WAAO,EAAE,MAAMJ,EAAM,OAAOC,EAAM,QAAO,CAAE,GAAG,KAAKN,EAAG;AAAA,EACxD;AAEA,WAASP,EAAUF,GAAG;AACpB,QAAImB,IAAS,CAAA,GACTF,IAAM;AAEV,aAASG,EAAIjB,GAAG;AACd,UAAIa,IAAMC;AACV,MAAApB,EAAE,QAAQG,EAAE,SAASG,CAAC,GAAGiB,CAAG,GAC5BD,EAAOhB,CAAC,IAAI,EAAE,KAAKa,GAAK,KAAKC,IAAK;AAAA,IACpC;AACA,WAAApB,EAAE,QAAQG,EAAE,SAAQ,GAAIoB,CAAG,GAEpBD;AAAA,EACT;AACA,SAAOzB;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/dagre/lib/position/bk.js

@@ -1,226 +0,0 @@
-import { __require as A } from "../lodash.js";
-import { __require as O } from "../graphlib.js";
-import { __require as W } from "../util.js";
-var E, M;
-function X() {
-  if (M) return E;
-  M = 1;
-  var n = A(), V = O().Graph, q = W();
-  E = {
-    positionX: G,
-    findType1Conflicts: I,
-    findType2Conflicts: y,
-    addConflict: b,
-    hasConflict: N,
-    verticalAlignment: T,
-    horizontalCompaction: C,
-    alignCoordinates: L,
-    findSmallestWidthAlignment: g,
-    balance: _
-  };
-  function I(r, i) {
-    var u = {};
-    function d(o, f) {
-      var e = 0, c = 0, t = o.length, a = n.last(f);
-      return n.forEach(f, function(l, s) {
-        var h = w(r, l), m = h ? r.node(h).order : t;
-        (h || l === a) && (n.forEach(f.slice(c, s + 1), function(p) {
-          n.forEach(r.predecessors(p), function(v) {
-            var k = r.node(v), x = k.order;
-            (x < e || m < x) && !(k.dummy && r.node(p).dummy) && b(u, v, p);
-          });
-        }), c = s + 1, e = m);
-      }), f;
-    }
-    return n.reduce(i, d), u;
-  }
-  function y(r, i) {
-    var u = {};
-    function d(f, e, c, t, a) {
-      var l;
-      n.forEach(n.range(e, c), function(s) {
-        l = f[s], r.node(l).dummy && n.forEach(r.predecessors(l), function(h) {
-          var m = r.node(h);
-          m.dummy && (m.order < t || m.order > a) && b(u, h, l);
-        });
-      });
-    }
-    function o(f, e) {
-      var c = -1, t, a = 0;
-      return n.forEach(e, function(l, s) {
-        if (r.node(l).dummy === "border") {
-          var h = r.predecessors(l);
-          h.length && (t = r.node(h[0]).order, d(e, a, s, c, t), a = s, c = t);
-        }
-        d(e, a, e.length, t, f.length);
-      }), e;
-    }
-    return n.reduce(i, o), u;
-  }
-  function w(r, i) {
-    if (r.node(i).dummy)
-      return n.find(r.predecessors(i), function(u) {
-        return r.node(u).dummy;
-      });
-  }
-  function b(r, i, u) {
-    if (i > u) {
-      var d = i;
-      i = u, u = d;
-    }
-    var o = r[i];
-    o || (r[i] = o = {}), o[u] = !0;
-  }
-  function N(r, i, u) {
-    if (i > u) {
-      var d = i;
-      i = u, u = d;
-    }
-    return n.has(r[i], u);
-  }
-  function T(r, i, u, d) {
-    var o = {}, f = {}, e = {};
-    return n.forEach(i, function(c) {
-      n.forEach(c, function(t, a) {
-        o[t] = t, f[t] = t, e[t] = a;
-      });
-    }), n.forEach(i, function(c) {
-      var t = -1;
-      n.forEach(c, function(a) {
-        var l = d(a);
-        if (l.length) {
-          l = n.sortBy(l, function(v) {
-            return e[v];
-          });
-          for (var s = (l.length - 1) / 2, h = Math.floor(s), m = Math.ceil(s); h <= m; ++h) {
-            var p = l[h];
-            f[a] === a && t < e[p] && !N(u, a, p) && (f[p] = a, f[a] = o[a] = o[p], t = e[p]);
-          }
-        }
-      });
-    }), { root: o, align: f };
-  }
-  function C(r, i, u, d, o) {
-    var f = {}, e = P(r, i, u, o), c = o ? "borderLeft" : "borderRight";
-    function t(s, h) {
-      for (var m = e.nodes(), p = m.pop(), v = {}; p; )
-        v[p] ? s(p) : (v[p] = !0, m.push(p), m = m.concat(h(p))), p = m.pop();
-    }
-    function a(s) {
-      f[s] = e.inEdges(s).reduce(function(h, m) {
-        return Math.max(h, f[m.v] + e.edge(m));
-      }, 0);
-    }
-    function l(s) {
-      var h = e.outEdges(s).reduce(function(p, v) {
-        return Math.min(p, f[v.w] - e.edge(v));
-      }, Number.POSITIVE_INFINITY), m = r.node(s);
-      h !== Number.POSITIVE_INFINITY && m.borderType !== c && (f[s] = Math.max(f[s], h));
-    }
-    return t(a, e.predecessors.bind(e)), t(l, e.successors.bind(e)), n.forEach(d, function(s) {
-      f[s] = f[u[s]];
-    }), f;
-  }
-  function P(r, i, u, d) {
-    var o = new V(), f = r.graph(), e = B(f.nodesep, f.edgesep, d);
-    return n.forEach(i, function(c) {
-      var t;
-      n.forEach(c, function(a) {
-        var l = u[a];
-        if (o.setNode(l), t) {
-          var s = u[t], h = o.edge(s, l);
-          o.setEdge(s, l, Math.max(e(r, a, t), h || 0));
-        }
-        t = a;
-      });
-    }), o;
-  }
-  function g(r, i) {
-    return n.minBy(n.values(i), function(u) {
-      var d = Number.NEGATIVE_INFINITY, o = Number.POSITIVE_INFINITY;
-      return n.forIn(u, function(f, e) {
-        var c = F(r, e) / 2;
-        d = Math.max(f + c, d), o = Math.min(f - c, o);
-      }), d - o;
-    });
-  }
-  function L(r, i) {
-    var u = n.values(i), d = n.min(u), o = n.max(u);
-    n.forEach(["u", "d"], function(f) {
-      n.forEach(["l", "r"], function(e) {
-        var c = f + e, t = r[c], a;
-        if (t !== i) {
-          var l = n.values(t);
-          a = e === "l" ? d - n.min(l) : o - n.max(l), a && (r[c] = n.mapValues(t, function(s) {
-            return s + a;
-          }));
-        }
-      });
-    });
-  }
-  function _(r, i) {
-    return n.mapValues(r.ul, function(u, d) {
-      if (i)
-        return r[i.toLowerCase()][d];
-      var o = n.sortBy(n.map(r, d));
-      return (o[1] + o[2]) / 2;
-    });
-  }
-  function G(r) {
-    var i = q.buildLayerMatrix(r), u = n.merge(
-      I(r, i),
-      y(r, i)
-    ), d = {}, o;
-    n.forEach(["u", "d"], function(e) {
-      o = e === "u" ? i : n.values(i).reverse(), n.forEach(["l", "r"], function(c) {
-        c === "r" && (o = n.map(o, function(s) {
-          return n.values(s).reverse();
-        }));
-        var t = (e === "u" ? r.predecessors : r.successors).bind(r), a = T(r, o, u, t), l = C(
-          r,
-          o,
-          a.root,
-          a.align,
-          c === "r"
-        );
-        c === "r" && (l = n.mapValues(l, function(s) {
-          return -s;
-        })), d[e + c] = l;
-      });
-    });
-    var f = g(r, d);
-    return L(d, f), _(d, r.graph().align);
-  }
-  function B(r, i, u) {
-    return function(d, o, f) {
-      var e = d.node(o), c = d.node(f), t = 0, a;
-      if (t += e.width / 2, n.has(e, "labelpos"))
-        switch (e.labelpos.toLowerCase()) {
-          case "l":
-            a = -e.width / 2;
-            break;
-          case "r":
-            a = e.width / 2;
-            break;
-        }
-      if (a && (t += u ? a : -a), a = 0, t += (e.dummy ? i : r) / 2, t += (c.dummy ? i : r) / 2, t += c.width / 2, n.has(c, "labelpos"))
-        switch (c.labelpos.toLowerCase()) {
-          case "l":
-            a = c.width / 2;
-            break;
-          case "r":
-            a = -c.width / 2;
-            break;
-        }
-      return a && (t += u ? a : -a), a = 0, t;
-    };
-  }
-  function F(r, i) {
-    return r.node(i).width;
-  }
-  return E;
-}
-export {
-  X as __require
-};
-//# sourceMappingURL=bk.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/dagre/lib/position/bk.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"bk.js","sources":["../../../../../../../../../node_modules/@antv/layout/lib/node_modules/dagre/lib/position/bk.js"],"sourcesContent":["import { __require as requireLodash } from '../lodash.js';\nimport { __require as requireGraphlib } from '../graphlib.js';\nimport { __require as requireUtil } from '../util.js';\n\nvar bk;\nvar hasRequiredBk;\n\nfunction requireBk () {\n\tif (hasRequiredBk) return bk;\n\thasRequiredBk = 1;\n\n\tvar _ = requireLodash();\n\tvar Graph = requireGraphlib().Graph;\n\tvar util = requireUtil();\n\n\t/*\n\t * This module provides coordinate assignment based on Brandes and Köpf, \"Fast\n\t * and Simple Horizontal Coordinate Assignment.\"\n\t */\n\n\tbk = {\n\t  positionX: positionX,\n\t  findType1Conflicts: findType1Conflicts,\n\t  findType2Conflicts: findType2Conflicts,\n\t  addConflict: addConflict,\n\t  hasConflict: hasConflict,\n\t  verticalAlignment: verticalAlignment,\n\t  horizontalCompaction: horizontalCompaction,\n\t  alignCoordinates: alignCoordinates,\n\t  findSmallestWidthAlignment: findSmallestWidthAlignment,\n\t  balance: balance\n\t};\n\n\t/*\n\t * Marks all edges in the graph with a type-1 conflict with the \"type1Conflict\"\n\t * property. A type-1 conflict is one where a non-inner segment crosses an\n\t * inner segment. An inner segment is an edge with both incident nodes marked\n\t * with the \"dummy\" property.\n\t *\n\t * This algorithm scans layer by layer, starting with the second, for type-1\n\t * conflicts between the current layer and the previous layer. For each layer\n\t * it scans the nodes from left to right until it reaches one that is incident\n\t * on an inner segment. It then scans predecessors to determine if they have\n\t * edges that cross that inner segment. At the end a final scan is done for all\n\t * nodes on the current rank to see if they cross the last visited inner\n\t * segment.\n\t *\n\t * This algorithm (safely) assumes that a dummy node will only be incident on a\n\t * single node in the layers being scanned.\n\t */\n\tfunction findType1Conflicts(g, layering) {\n\t  var conflicts = {};\n\n\t  function visitLayer(prevLayer, layer) {\n\t    var\n\t      // last visited node in the previous layer that is incident on an inner\n\t      // segment.\n\t      k0 = 0,\n\t      // Tracks the last node in this layer scanned for crossings with a type-1\n\t      // segment.\n\t      scanPos = 0,\n\t      prevLayerLength = prevLayer.length,\n\t      lastNode = _.last(layer);\n\n\t    _.forEach(layer, function(v, i) {\n\t      var w = findOtherInnerSegmentNode(g, v),\n\t        k1 = w ? g.node(w).order : prevLayerLength;\n\n\t      if (w || v === lastNode) {\n\t        _.forEach(layer.slice(scanPos, i +1), function(scanNode) {\n\t          _.forEach(g.predecessors(scanNode), function(u) {\n\t            var uLabel = g.node(u),\n\t              uPos = uLabel.order;\n\t            if ((uPos < k0 || k1 < uPos) &&\n\t                !(uLabel.dummy && g.node(scanNode).dummy)) {\n\t              addConflict(conflicts, u, scanNode);\n\t            }\n\t          });\n\t        });\n\t        scanPos = i + 1;\n\t        k0 = k1;\n\t      }\n\t    });\n\n\t    return layer;\n\t  }\n\n\t  _.reduce(layering, visitLayer);\n\t  return conflicts;\n\t}\n\n\tfunction findType2Conflicts(g, layering) {\n\t  var conflicts = {};\n\n\t  function scan(south, southPos, southEnd, prevNorthBorder, nextNorthBorder) {\n\t    var v;\n\t    _.forEach(_.range(southPos, southEnd), function(i) {\n\t      v = south[i];\n\t      if (g.node(v).dummy) {\n\t        _.forEach(g.predecessors(v), function(u) {\n\t          var uNode = g.node(u);\n\t          if (uNode.dummy &&\n\t              (uNode.order < prevNorthBorder || uNode.order > nextNorthBorder)) {\n\t            addConflict(conflicts, u, v);\n\t          }\n\t        });\n\t      }\n\t    });\n\t  }\n\n\n\t  function visitLayer(north, south) {\n\t    var prevNorthPos = -1,\n\t      nextNorthPos,\n\t      southPos = 0;\n\n\t    _.forEach(south, function(v, southLookahead) {\n\t      if (g.node(v).dummy === \"border\") {\n\t        var predecessors = g.predecessors(v);\n\t        if (predecessors.length) {\n\t          nextNorthPos = g.node(predecessors[0]).order;\n\t          scan(south, southPos, southLookahead, prevNorthPos, nextNorthPos);\n\t          southPos = southLookahead;\n\t          prevNorthPos = nextNorthPos;\n\t        }\n\t      }\n\t      scan(south, southPos, south.length, nextNorthPos, north.length);\n\t    });\n\n\t    return south;\n\t  }\n\n\t  _.reduce(layering, visitLayer);\n\t  return conflicts;\n\t}\n\n\tfunction findOtherInnerSegmentNode(g, v) {\n\t  if (g.node(v).dummy) {\n\t    return _.find(g.predecessors(v), function(u) {\n\t      return g.node(u).dummy;\n\t    });\n\t  }\n\t}\n\n\tfunction addConflict(conflicts, v, w) {\n\t  if (v > w) {\n\t    var tmp = v;\n\t    v = w;\n\t    w = tmp;\n\t  }\n\n\t  var conflictsV = conflicts[v];\n\t  if (!conflictsV) {\n\t    conflicts[v] = conflictsV = {};\n\t  }\n\t  conflictsV[w] = true;\n\t}\n\n\tfunction hasConflict(conflicts, v, w) {\n\t  if (v > w) {\n\t    var tmp = v;\n\t    v = w;\n\t    w = tmp;\n\t  }\n\t  return _.has(conflicts[v], w);\n\t}\n\n\t/*\n\t * Try to align nodes into vertical \"blocks\" where possible. This algorithm\n\t * attempts to align a node with one of its median neighbors. If the edge\n\t * connecting a neighbor is a type-1 conflict then we ignore that possibility.\n\t * If a previous node has already formed a block with a node after the node\n\t * we're trying to form a block with, we also ignore that possibility - our\n\t * blocks would be split in that scenario.\n\t */\n\tfunction verticalAlignment(g, layering, conflicts, neighborFn) {\n\t  var root = {},\n\t    align = {},\n\t    pos = {};\n\n\t  // We cache the position here based on the layering because the graph and\n\t  // layering may be out of sync. The layering matrix is manipulated to\n\t  // generate different extreme alignments.\n\t  _.forEach(layering, function(layer) {\n\t    _.forEach(layer, function(v, order) {\n\t      root[v] = v;\n\t      align[v] = v;\n\t      pos[v] = order;\n\t    });\n\t  });\n\n\t  _.forEach(layering, function(layer) {\n\t    var prevIdx = -1;\n\t    _.forEach(layer, function(v) {\n\t      var ws = neighborFn(v);\n\t      if (ws.length) {\n\t        ws = _.sortBy(ws, function(w) { return pos[w]; });\n\t        var mp = (ws.length - 1) / 2;\n\t        for (var i = Math.floor(mp), il = Math.ceil(mp); i <= il; ++i) {\n\t          var w = ws[i];\n\t          if (align[v] === v &&\n\t              prevIdx < pos[w] &&\n\t              !hasConflict(conflicts, v, w)) {\n\t            align[w] = v;\n\t            align[v] = root[v] = root[w];\n\t            prevIdx = pos[w];\n\t          }\n\t        }\n\t      }\n\t    });\n\t  });\n\n\t  return { root: root, align: align };\n\t}\n\n\tfunction horizontalCompaction(g, layering, root, align, reverseSep) {\n\t  // This portion of the algorithm differs from BK due to a number of problems.\n\t  // Instead of their algorithm we construct a new block graph and do two\n\t  // sweeps. The first sweep places blocks with the smallest possible\n\t  // coordinates. The second sweep removes unused space by moving blocks to the\n\t  // greatest coordinates without violating separation.\n\t  var xs = {},\n\t    blockG = buildBlockGraph(g, layering, root, reverseSep),\n\t    borderType = reverseSep ? \"borderLeft\" : \"borderRight\";\n\n\t  function iterate(setXsFunc, nextNodesFunc) {\n\t    var stack = blockG.nodes();\n\t    var elem = stack.pop();\n\t    var visited = {};\n\t    while (elem) {\n\t      if (visited[elem]) {\n\t        setXsFunc(elem);\n\t      } else {\n\t        visited[elem] = true;\n\t        stack.push(elem);\n\t        stack = stack.concat(nextNodesFunc(elem));\n\t      }\n\n\t      elem = stack.pop();\n\t    }\n\t  }\n\n\t  // First pass, assign smallest coordinates\n\t  function pass1(elem) {\n\t    xs[elem] = blockG.inEdges(elem).reduce(function(acc, e) {\n\t      return Math.max(acc, xs[e.v] + blockG.edge(e));\n\t    }, 0);\n\t  }\n\n\t  // Second pass, assign greatest coordinates\n\t  function pass2(elem) {\n\t    var min = blockG.outEdges(elem).reduce(function(acc, e) {\n\t      return Math.min(acc, xs[e.w] - blockG.edge(e));\n\t    }, Number.POSITIVE_INFINITY);\n\n\t    var node = g.node(elem);\n\t    if (min !== Number.POSITIVE_INFINITY && node.borderType !== borderType) {\n\t      xs[elem] = Math.max(xs[elem], min);\n\t    }\n\t  }\n\n\t  iterate(pass1, blockG.predecessors.bind(blockG));\n\t  iterate(pass2, blockG.successors.bind(blockG));\n\n\t  // Assign x coordinates to all nodes\n\t  _.forEach(align, function(v) {\n\t    xs[v] = xs[root[v]];\n\t  });\n\n\t  return xs;\n\t}\n\n\n\tfunction buildBlockGraph(g, layering, root, reverseSep) {\n\t  var blockGraph = new Graph(),\n\t    graphLabel = g.graph(),\n\t    sepFn = sep(graphLabel.nodesep, graphLabel.edgesep, reverseSep);\n\n\t  _.forEach(layering, function(layer) {\n\t    var u;\n\t    _.forEach(layer, function(v) {\n\t      var vRoot = root[v];\n\t      blockGraph.setNode(vRoot);\n\t      if (u) {\n\t        var uRoot = root[u],\n\t          prevMax = blockGraph.edge(uRoot, vRoot);\n\t        blockGraph.setEdge(uRoot, vRoot, Math.max(sepFn(g, v, u), prevMax || 0));\n\t      }\n\t      u = v;\n\t    });\n\t  });\n\n\t  return blockGraph;\n\t}\n\n\t/*\n\t * Returns the alignment that has the smallest width of the given alignments.\n\t */\n\tfunction findSmallestWidthAlignment(g, xss) {\n\t  return _.minBy(_.values(xss), function (xs) {\n\t    var max = Number.NEGATIVE_INFINITY;\n\t    var min = Number.POSITIVE_INFINITY;\n\n\t    _.forIn(xs, function (x, v) {\n\t      var halfWidth = width(g, v) / 2;\n\n\t      max = Math.max(x + halfWidth, max);\n\t      min = Math.min(x - halfWidth, min);\n\t    });\n\n\t    return max - min;\n\t  });\n\t}\n\n\t/*\n\t * Align the coordinates of each of the layout alignments such that\n\t * left-biased alignments have their minimum coordinate at the same point as\n\t * the minimum coordinate of the smallest width alignment and right-biased\n\t * alignments have their maximum coordinate at the same point as the maximum\n\t * coordinate of the smallest width alignment.\n\t */\n\tfunction alignCoordinates(xss, alignTo) {\n\t  var alignToVals = _.values(alignTo),\n\t    alignToMin = _.min(alignToVals),\n\t    alignToMax = _.max(alignToVals);\n\n\t  _.forEach([\"u\", \"d\"], function(vert) {\n\t    _.forEach([\"l\", \"r\"], function(horiz) {\n\t      var alignment = vert + horiz,\n\t        xs = xss[alignment],\n\t        delta;\n\t      if (xs === alignTo) return;\n\n\t      var xsVals = _.values(xs);\n\t      delta = horiz === \"l\" ? alignToMin - _.min(xsVals) : alignToMax - _.max(xsVals);\n\n\t      if (delta) {\n\t        xss[alignment] = _.mapValues(xs, function(x) { return x + delta; });\n\t      }\n\t    });\n\t  });\n\t}\n\n\tfunction balance(xss, align) {\n\t  return _.mapValues(xss.ul, function(ignore, v) {\n\t    if (align) {\n\t      return xss[align.toLowerCase()][v];\n\t    } else {\n\t      var xs = _.sortBy(_.map(xss, v));\n\t      return (xs[1] + xs[2]) / 2;\n\t    }\n\t  });\n\t}\n\n\tfunction positionX(g) {\n\t  var layering = util.buildLayerMatrix(g);\n\t  var conflicts = _.merge(\n\t    findType1Conflicts(g, layering),\n\t    findType2Conflicts(g, layering));\n\n\t  var xss = {};\n\t  var adjustedLayering;\n\t  _.forEach([\"u\", \"d\"], function(vert) {\n\t    adjustedLayering = vert === \"u\" ? layering : _.values(layering).reverse();\n\t    _.forEach([\"l\", \"r\"], function(horiz) {\n\t      if (horiz === \"r\") {\n\t        adjustedLayering = _.map(adjustedLayering, function(inner) {\n\t          return _.values(inner).reverse();\n\t        });\n\t      }\n\n\t      var neighborFn = (vert === \"u\" ? g.predecessors : g.successors).bind(g);\n\t      var align = verticalAlignment(g, adjustedLayering, conflicts, neighborFn);\n\t      var xs = horizontalCompaction(g, adjustedLayering,\n\t        align.root, align.align, horiz === \"r\");\n\t      if (horiz === \"r\") {\n\t        xs = _.mapValues(xs, function(x) { return -x; });\n\t      }\n\t      xss[vert + horiz] = xs;\n\t    });\n\t  });\n\n\t  var smallestWidth = findSmallestWidthAlignment(g, xss);\n\t  alignCoordinates(xss, smallestWidth);\n\t  return balance(xss, g.graph().align);\n\t}\n\n\tfunction sep(nodeSep, edgeSep, reverseSep) {\n\t  return function(g, v, w) {\n\t    var vLabel = g.node(v);\n\t    var wLabel = g.node(w);\n\t    var sum = 0;\n\t    var delta;\n\n\t    sum += vLabel.width / 2;\n\t    if (_.has(vLabel, \"labelpos\")) {\n\t      switch (vLabel.labelpos.toLowerCase()) {\n\t      case \"l\": delta = -vLabel.width / 2; break;\n\t      case \"r\": delta = vLabel.width / 2; break;\n\t      }\n\t    }\n\t    if (delta) {\n\t      sum += reverseSep ? delta : -delta;\n\t    }\n\t    delta = 0;\n\n\t    sum += (vLabel.dummy ? edgeSep : nodeSep) / 2;\n\t    sum += (wLabel.dummy ? edgeSep : nodeSep) / 2;\n\n\t    sum += wLabel.width / 2;\n\t    if (_.has(wLabel, \"labelpos\")) {\n\t      switch (wLabel.labelpos.toLowerCase()) {\n\t      case \"l\": delta = wLabel.width / 2; break;\n\t      case \"r\": delta = -wLabel.width / 2; break;\n\t      }\n\t    }\n\t    if (delta) {\n\t      sum += reverseSep ? delta : -delta;\n\t    }\n\t    delta = 0;\n\n\t    return sum;\n\t  };\n\t}\n\n\tfunction width(g, v) {\n\t  return g.node(v).width;\n\t}\n\treturn bk;\n}\n\nexport { requireBk as __require };\n//# sourceMappingURL=bk.js.map\n"],"names":["bk","hasRequiredBk","requireBk","_","requireLodash","Graph","requireGraphlib","util","requireUtil","positionX","findType1Conflicts","findType2Conflicts","addConflict","hasConflict","verticalAlignment","horizontalCompaction","alignCoordinates","findSmallestWidthAlignment","balance","g","layering","conflicts","visitLayer","prevLayer","layer","k0","scanPos","prevLayerLength","lastNode","v","i","w","findOtherInnerSegmentNode","k1","scanNode","u","uLabel","uPos","scan","south","southPos","southEnd","prevNorthBorder","nextNorthBorder","uNode","north","prevNorthPos","nextNorthPos","southLookahead","predecessors","tmp","conflictsV","neighborFn","root","align","pos","order","prevIdx","ws","mp","il","reverseSep","xs","blockG","buildBlockGraph","borderType","iterate","setXsFunc","nextNodesFunc","stack","elem","visited","pass1","acc","e","pass2","min","node","blockGraph","graphLabel","sepFn","sep","vRoot","uRoot","prevMax","xss","max","x","halfWidth","width","alignTo","alignToVals","alignToMin","alignToMax","vert","horiz","alignment","delta","xsVals","ignore","adjustedLayering","inner","smallestWidth","nodeSep","edgeSep","vLabel","wLabel","sum"],"mappings":";;;AAIA,IAAIA,GACAC;AAEJ,SAASC,IAAa;AACrB,MAAID,EAAe,QAAOD;AAC1B,EAAAC,IAAgB;AAEhB,MAAIE,IAAIC,EAAa,GACjBC,IAAQC,EAAe,EAAG,OAC1BC,IAAOC,EAAW;AAOtB,EAAAR,IAAK;AAAA,IACH,WAAWS;AAAA,IACX,oBAAoBC;AAAA,IACpB,oBAAoBC;AAAA,IACpB,aAAaC;AAAA,IACb,aAAaC;AAAA,IACb,mBAAmBC;AAAA,IACnB,sBAAsBC;AAAA,IACtB,kBAAkBC;AAAA,IAClB,4BAA4BC;AAAA,IAC5B,SAASC;AAAA,EACZ;AAmBC,WAASR,EAAmBS,GAAGC,GAAU;AACvC,QAAIC,IAAY,CAAA;AAEhB,aAASC,EAAWC,GAAWC,GAAO;AACpC,UAGEC,IAAK,GAGLC,IAAU,GACVC,IAAkBJ,EAAU,QAC5BK,IAAWzB,EAAE,KAAKqB,CAAK;AAEzB,aAAArB,EAAE,QAAQqB,GAAO,SAASK,GAAGC,GAAG;AAC9B,YAAIC,IAAIC,EAA0Bb,GAAGU,CAAC,GACpCI,IAAKF,IAAIZ,EAAE,KAAKY,CAAC,EAAE,QAAQJ;AAE7B,SAAII,KAAKF,MAAMD,OACbzB,EAAE,QAAQqB,EAAM,MAAME,GAASI,IAAG,CAAC,GAAG,SAASI,GAAU;AACvD,UAAA/B,EAAE,QAAQgB,EAAE,aAAae,CAAQ,GAAG,SAASC,GAAG;AAC9C,gBAAIC,IAASjB,EAAE,KAAKgB,CAAC,GACnBE,IAAOD,EAAO;AAChB,aAAKC,IAAOZ,KAAMQ,IAAKI,MACnB,EAAED,EAAO,SAASjB,EAAE,KAAKe,CAAQ,EAAE,UACrCtB,EAAYS,GAAWc,GAAGD,CAAQ;AAAA,UAEtC,CAAC;AAAA,QACH,CAAC,GACDR,IAAUI,IAAI,GACdL,IAAKQ;AAAA,MAET,CAAC,GAEMT;AAAA,IACT;AAEA,WAAArB,EAAE,OAAOiB,GAAUE,CAAU,GACtBD;AAAA,EACT;AAEA,WAASV,EAAmBQ,GAAGC,GAAU;AACvC,QAAIC,IAAY,CAAA;AAEhB,aAASiB,EAAKC,GAAOC,GAAUC,GAAUC,GAAiBC,GAAiB;AACzE,UAAId;AACJ,MAAA1B,EAAE,QAAQA,EAAE,MAAMqC,GAAUC,CAAQ,GAAG,SAASX,GAAG;AACjD,QAAAD,IAAIU,EAAMT,CAAC,GACPX,EAAE,KAAKU,CAAC,EAAE,SACZ1B,EAAE,QAAQgB,EAAE,aAAaU,CAAC,GAAG,SAASM,GAAG;AACvC,cAAIS,IAAQzB,EAAE,KAAKgB,CAAC;AACpB,UAAIS,EAAM,UACLA,EAAM,QAAQF,KAAmBE,EAAM,QAAQD,MAClD/B,EAAYS,GAAWc,GAAGN,CAAC;AAAA,QAE/B,CAAC;AAAA,MAEL,CAAC;AAAA,IACH;AAGA,aAASP,EAAWuB,GAAON,GAAO;AAChC,UAAIO,IAAe,IACjBC,GACAP,IAAW;AAEb,aAAArC,EAAE,QAAQoC,GAAO,SAASV,GAAGmB,GAAgB;AAC3C,YAAI7B,EAAE,KAAKU,CAAC,EAAE,UAAU,UAAU;AAChC,cAAIoB,IAAe9B,EAAE,aAAaU,CAAC;AACnC,UAAIoB,EAAa,WACfF,IAAe5B,EAAE,KAAK8B,EAAa,CAAC,CAAC,EAAE,OACvCX,EAAKC,GAAOC,GAAUQ,GAAgBF,GAAcC,CAAY,GAChEP,IAAWQ,GACXF,IAAeC;AAAA,QAEnB;AACA,QAAAT,EAAKC,GAAOC,GAAUD,EAAM,QAAQQ,GAAcF,EAAM,MAAM;AAAA,MAChE,CAAC,GAEMN;AAAA,IACT;AAEA,WAAApC,EAAE,OAAOiB,GAAUE,CAAU,GACtBD;AAAA,EACT;AAEA,WAASW,EAA0Bb,GAAGU,GAAG;AACvC,QAAIV,EAAE,KAAKU,CAAC,EAAE;AACZ,aAAO1B,EAAE,KAAKgB,EAAE,aAAaU,CAAC,GAAG,SAAS,GAAG;AAC3C,eAAOV,EAAE,KAAK,CAAC,EAAE;AAAA,MACnB,CAAC;AAAA,EAEL;AAEA,WAASP,EAAYS,GAAWQ,GAAGE,GAAG;AACpC,QAAIF,IAAIE,GAAG;AACT,UAAImB,IAAMrB;AACV,MAAAA,IAAIE,GACJA,IAAImB;AAAA,IACN;AAEA,QAAIC,IAAa9B,EAAUQ,CAAC;AAC5B,IAAKsB,MACH9B,EAAUQ,CAAC,IAAIsB,IAAa,CAAA,IAE9BA,EAAWpB,CAAC,IAAI;AAAA,EAClB;AAEA,WAASlB,EAAYQ,GAAWQ,GAAGE,GAAG;AACpC,QAAIF,IAAIE,GAAG;AACT,UAAImB,IAAMrB;AACV,MAAAA,IAAIE,GACJA,IAAImB;AAAA,IACN;AACA,WAAO/C,EAAE,IAAIkB,EAAUQ,CAAC,GAAGE,CAAC;AAAA,EAC9B;AAUA,WAASjB,EAAkBK,GAAGC,GAAUC,GAAW+B,GAAY;AAC7D,QAAIC,IAAO,CAAA,GACTC,IAAQ,CAAA,GACRC,IAAM,CAAA;AAKR,WAAApD,EAAE,QAAQiB,GAAU,SAASI,GAAO;AAClC,MAAArB,EAAE,QAAQqB,GAAO,SAASK,GAAG2B,GAAO;AAClC,QAAAH,EAAKxB,CAAC,IAAIA,GACVyB,EAAMzB,CAAC,IAAIA,GACX0B,EAAI1B,CAAC,IAAI2B;AAAA,MACX,CAAC;AAAA,IACH,CAAC,GAEDrD,EAAE,QAAQiB,GAAU,SAASI,GAAO;AAClC,UAAIiC,IAAU;AACd,MAAAtD,EAAE,QAAQqB,GAAO,SAASK,GAAG;AAC3B,YAAI6B,IAAKN,EAAWvB,CAAC;AACrB,YAAI6B,EAAG,QAAQ;AACb,UAAAA,IAAKvD,EAAE,OAAOuD,GAAI,SAAS3B,GAAG;AAAE,mBAAOwB,EAAIxB,CAAC;AAAA,UAAG,CAAC;AAEhD,mBADI4B,KAAMD,EAAG,SAAS,KAAK,GAClB5B,IAAI,KAAK,MAAM6B,CAAE,GAAGC,IAAK,KAAK,KAAKD,CAAE,GAAG7B,KAAK8B,GAAI,EAAE9B,GAAG;AAC7D,gBAAIC,IAAI2B,EAAG5B,CAAC;AACZ,YAAIwB,EAAMzB,CAAC,MAAMA,KACb4B,IAAUF,EAAIxB,CAAC,KACf,CAAClB,EAAYQ,GAAWQ,GAAGE,CAAC,MAC9BuB,EAAMvB,CAAC,IAAIF,GACXyB,EAAMzB,CAAC,IAAIwB,EAAKxB,CAAC,IAAIwB,EAAKtB,CAAC,GAC3B0B,IAAUF,EAAIxB,CAAC;AAAA,UAEnB;AAAA,QACF;AAAA,MACF,CAAC;AAAA,IACH,CAAC,GAEM,EAAE,MAAMsB,GAAM,OAAOC,EAAK;AAAA,EACnC;AAEA,WAASvC,EAAqBI,GAAGC,GAAUiC,GAAMC,GAAOO,GAAY;AAMlE,QAAIC,IAAK,CAAA,GACPC,IAASC,EAAgB7C,GAAGC,GAAUiC,GAAMQ,CAAU,GACtDI,IAAaJ,IAAa,eAAe;AAE3C,aAASK,EAAQC,GAAWC,GAAe;AAIzC,eAHIC,IAAQN,EAAO,MAAK,GACpBO,IAAOD,EAAM,IAAG,GAChBE,IAAU,CAAA,GACPD;AACL,QAAIC,EAAQD,CAAI,IACdH,EAAUG,CAAI,KAEdC,EAAQD,CAAI,IAAI,IAChBD,EAAM,KAAKC,CAAI,GACfD,IAAQA,EAAM,OAAOD,EAAcE,CAAI,CAAC,IAG1CA,IAAOD,EAAM,IAAG;AAAA,IAEpB;AAGA,aAASG,EAAMF,GAAM;AACnB,MAAAR,EAAGQ,CAAI,IAAIP,EAAO,QAAQO,CAAI,EAAE,OAAO,SAASG,GAAKC,GAAG;AACtD,eAAO,KAAK,IAAID,GAAKX,EAAGY,EAAE,CAAC,IAAIX,EAAO,KAAKW,CAAC,CAAC;AAAA,MAC/C,GAAG,CAAC;AAAA,IACN;AAGA,aAASC,EAAML,GAAM;AACnB,UAAIM,IAAMb,EAAO,SAASO,CAAI,EAAE,OAAO,SAASG,GAAKC,GAAG;AACtD,eAAO,KAAK,IAAID,GAAKX,EAAGY,EAAE,CAAC,IAAIX,EAAO,KAAKW,CAAC,CAAC;AAAA,MAC/C,GAAG,OAAO,iBAAiB,GAEvBG,IAAO1D,EAAE,KAAKmD,CAAI;AACtB,MAAIM,MAAQ,OAAO,qBAAqBC,EAAK,eAAeZ,MAC1DH,EAAGQ,CAAI,IAAI,KAAK,IAAIR,EAAGQ,CAAI,GAAGM,CAAG;AAAA,IAErC;AAEA,WAAAV,EAAQM,GAAOT,EAAO,aAAa,KAAKA,CAAM,CAAC,GAC/CG,EAAQS,GAAOZ,EAAO,WAAW,KAAKA,CAAM,CAAC,GAG7C5D,EAAE,QAAQmD,GAAO,SAASzB,GAAG;AAC3B,MAAAiC,EAAGjC,CAAC,IAAIiC,EAAGT,EAAKxB,CAAC,CAAC;AAAA,IACpB,CAAC,GAEMiC;AAAA,EACT;AAGA,WAASE,EAAgB7C,GAAGC,GAAUiC,GAAMQ,GAAY;AACtD,QAAIiB,IAAa,IAAIzE,EAAK,GACxB0E,IAAa5D,EAAE,MAAK,GACpB6D,IAAQC,EAAIF,EAAW,SAASA,EAAW,SAASlB,CAAU;AAEhE,WAAA1D,EAAE,QAAQiB,GAAU,SAASI,GAAO;AAClC,UAAIW;AACJ,MAAAhC,EAAE,QAAQqB,GAAO,SAASK,GAAG;AAC3B,YAAIqD,IAAQ7B,EAAKxB,CAAC;AAElB,YADAiD,EAAW,QAAQI,CAAK,GACpB/C,GAAG;AACL,cAAIgD,IAAQ9B,EAAKlB,CAAC,GAChBiD,IAAUN,EAAW,KAAKK,GAAOD,CAAK;AACxC,UAAAJ,EAAW,QAAQK,GAAOD,GAAO,KAAK,IAAIF,EAAM7D,GAAGU,GAAGM,CAAC,GAAGiD,KAAW,CAAC,CAAC;AAAA,QACzE;AACA,QAAAjD,IAAIN;AAAA,MACN,CAAC;AAAA,IACH,CAAC,GAEMiD;AAAA,EACT;AAKA,WAAS7D,EAA2BE,GAAGkE,GAAK;AAC1C,WAAOlF,EAAE,MAAMA,EAAE,OAAOkF,CAAG,GAAG,SAAUvB,GAAI;AAC1C,UAAIwB,IAAM,OAAO,mBACbV,IAAM,OAAO;AAEjB,aAAAzE,EAAE,MAAM2D,GAAI,SAAUyB,GAAG1D,GAAG;AAC1B,YAAI2D,IAAYC,EAAMtE,GAAGU,CAAC,IAAI;AAE9B,QAAAyD,IAAM,KAAK,IAAIC,IAAIC,GAAWF,CAAG,GACjCV,IAAM,KAAK,IAAIW,IAAIC,GAAWZ,CAAG;AAAA,MACnC,CAAC,GAEMU,IAAMV;AAAA,IACf,CAAC;AAAA,EACH;AASA,WAAS5D,EAAiBqE,GAAKK,GAAS;AACtC,QAAIC,IAAcxF,EAAE,OAAOuF,CAAO,GAChCE,IAAazF,EAAE,IAAIwF,CAAW,GAC9BE,IAAa1F,EAAE,IAAIwF,CAAW;AAEhC,IAAAxF,EAAE,QAAQ,CAAC,KAAK,GAAG,GAAG,SAAS2F,GAAM;AACnC,MAAA3F,EAAE,QAAQ,CAAC,KAAK,GAAG,GAAG,SAAS4F,GAAO;AACpC,YAAIC,IAAYF,IAAOC,GACrBjC,IAAKuB,EAAIW,CAAS,GAClBC;AACF,YAAInC,MAAO4B,GAEX;AAAA,cAAIQ,IAAS/F,EAAE,OAAO2D,CAAE;AACxB,UAAAmC,IAAQF,MAAU,MAAMH,IAAazF,EAAE,IAAI+F,CAAM,IAAIL,IAAa1F,EAAE,IAAI+F,CAAM,GAE1ED,MACFZ,EAAIW,CAAS,IAAI7F,EAAE,UAAU2D,GAAI,SAASyB,GAAG;AAAE,mBAAOA,IAAIU;AAAA,UAAO,CAAC;AAAA;AAAA,MAEtE,CAAC;AAAA,IACH,CAAC;AAAA,EACH;AAEA,WAAS/E,EAAQmE,GAAK/B,GAAO;AAC3B,WAAOnD,EAAE,UAAUkF,EAAI,IAAI,SAASc,GAAQtE,GAAG;AAC7C,UAAIyB;AACF,eAAO+B,EAAI/B,EAAM,YAAW,CAAE,EAAEzB,CAAC;AAEjC,UAAIiC,IAAK3D,EAAE,OAAOA,EAAE,IAAIkF,GAAKxD,CAAC,CAAC;AAC/B,cAAQiC,EAAG,CAAC,IAAIA,EAAG,CAAC,KAAK;AAAA,IAE7B,CAAC;AAAA,EACH;AAEA,WAASrD,EAAUU,GAAG;AACpB,QAAIC,IAAWb,EAAK,iBAAiBY,CAAC,GAClCE,IAAYlB,EAAE;AAAA,MAChBO,EAAmBS,GAAGC,CAAQ;AAAA,MAC9BT,EAAmBQ,GAAGC,CAAQ;AAAA,IAAC,GAE7BiE,IAAM,CAAA,GACNe;AACJ,IAAAjG,EAAE,QAAQ,CAAC,KAAK,GAAG,GAAG,SAAS2F,GAAM;AACnC,MAAAM,IAAmBN,MAAS,MAAM1E,IAAWjB,EAAE,OAAOiB,CAAQ,EAAE,QAAO,GACvEjB,EAAE,QAAQ,CAAC,KAAK,GAAG,GAAG,SAAS4F,GAAO;AACpC,QAAIA,MAAU,QACZK,IAAmBjG,EAAE,IAAIiG,GAAkB,SAASC,GAAO;AACzD,iBAAOlG,EAAE,OAAOkG,CAAK,EAAE,QAAO;AAAA,QAChC,CAAC;AAGH,YAAIjD,KAAc0C,MAAS,MAAM3E,EAAE,eAAeA,EAAE,YAAY,KAAKA,CAAC,GAClEmC,IAAQxC,EAAkBK,GAAGiF,GAAkB/E,GAAW+B,CAAU,GACpEU,IAAK/C;AAAA,UAAqBI;AAAA,UAAGiF;AAAA,UAC/B9C,EAAM;AAAA,UAAMA,EAAM;AAAA,UAAOyC,MAAU;AAAA,QAAG;AACxC,QAAIA,MAAU,QACZjC,IAAK3D,EAAE,UAAU2D,GAAI,SAASyB,GAAG;AAAE,iBAAO,CAACA;AAAA,QAAG,CAAC,IAEjDF,EAAIS,IAAOC,CAAK,IAAIjC;AAAA,MACtB,CAAC;AAAA,IACH,CAAC;AAED,QAAIwC,IAAgBrF,EAA2BE,GAAGkE,CAAG;AACrD,WAAArE,EAAiBqE,GAAKiB,CAAa,GAC5BpF,EAAQmE,GAAKlE,EAAE,MAAK,EAAG,KAAK;AAAA,EACrC;AAEA,WAAS8D,EAAIsB,GAASC,GAAS3C,GAAY;AACzC,WAAO,SAAS1C,GAAGU,GAAGE,GAAG;AACvB,UAAI0E,IAAStF,EAAE,KAAKU,CAAC,GACjB6E,IAASvF,EAAE,KAAKY,CAAC,GACjB4E,IAAM,GACNV;AAGJ,UADAU,KAAOF,EAAO,QAAQ,GAClBtG,EAAE,IAAIsG,GAAQ,UAAU;AAC1B,gBAAQA,EAAO,SAAS,YAAW,GAAE;AAAA,UACrC,KAAK;AAAK,YAAAR,IAAQ,CAACQ,EAAO,QAAQ;AAAG;AAAA,UACrC,KAAK;AAAK,YAAAR,IAAQQ,EAAO,QAAQ;AAAG;AAAA,QAC3C;AAWK,UATIR,MACFU,KAAO9C,IAAaoC,IAAQ,CAACA,IAE/BA,IAAQ,GAERU,MAAQF,EAAO,QAAQD,IAAUD,KAAW,GAC5CI,MAAQD,EAAO,QAAQF,IAAUD,KAAW,GAE5CI,KAAOD,EAAO,QAAQ,GAClBvG,EAAE,IAAIuG,GAAQ,UAAU;AAC1B,gBAAQA,EAAO,SAAS,YAAW,GAAE;AAAA,UACrC,KAAK;AAAK,YAAAT,IAAQS,EAAO,QAAQ;AAAG;AAAA,UACpC,KAAK;AAAK,YAAAT,IAAQ,CAACS,EAAO,QAAQ;AAAG;AAAA,QAC5C;AAEK,aAAIT,MACFU,KAAO9C,IAAaoC,IAAQ,CAACA,IAE/BA,IAAQ,GAEDU;AAAA,IACT;AAAA,EACF;AAEA,WAASlB,EAAMtE,GAAGU,GAAG;AACnB,WAAOV,EAAE,KAAKU,CAAC,EAAE;AAAA,EACnB;AACA,SAAO7B;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/dagre/lib/position/index.js

@@ -1,31 +0,0 @@
-import { __require as v } from "../lodash.js";
-import { __require as _ } from "../util.js";
-import { __require as q } from "./bk.js";
-var a, f;
-function l() {
-  if (f) return a;
-  f = 1;
-  var i = v(), t = _(), c = q().positionX;
-  a = h;
-  function h(r) {
-    r = t.asNonCompoundGraph(r), m(r), i.forEach(c(r), function(o, n) {
-      r.node(n).x = o;
-    });
-  }
-  function m(r) {
-    var o = t.buildLayerMatrix(r), n = r.graph().ranksep, u = 0;
-    i.forEach(o, function(p) {
-      var s = i.max(i.map(p, function(e) {
-        return r.node(e).height;
-      }));
-      i.forEach(p, function(e) {
-        r.node(e).y = u + s / 2;
-      }), u += s + n;
-    });
-  }
-  return a;
-}
-export {
-  l as __require
-};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/dagre/lib/position/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../../../../node_modules/@antv/layout/lib/node_modules/dagre/lib/position/index.js"],"sourcesContent":["import { __require as requireLodash } from '../lodash.js';\nimport { __require as requireUtil } from '../util.js';\nimport { __require as requireBk } from './bk.js';\n\nvar position_1;\nvar hasRequiredPosition;\n\nfunction requirePosition () {\n\tif (hasRequiredPosition) return position_1;\n\thasRequiredPosition = 1;\n\n\tvar _ = requireLodash();\n\tvar util = requireUtil();\n\tvar positionX = requireBk().positionX;\n\n\tposition_1 = position;\n\n\tfunction position(g) {\n\t  g = util.asNonCompoundGraph(g);\n\n\t  positionY(g);\n\t  _.forEach(positionX(g), function(x, v) {\n\t    g.node(v).x = x;\n\t  });\n\t}\n\n\tfunction positionY(g) {\n\t  var layering = util.buildLayerMatrix(g);\n\t  var rankSep = g.graph().ranksep;\n\t  var prevY = 0;\n\t  _.forEach(layering, function(layer) {\n\t    var maxHeight = _.max(_.map(layer, function(v) { return g.node(v).height; }));\n\t    _.forEach(layer, function(v) {\n\t      g.node(v).y = prevY + maxHeight / 2;\n\t    });\n\t    prevY += maxHeight + rankSep;\n\t  });\n\t}\n\treturn position_1;\n}\n\nexport { requirePosition as __require };\n//# sourceMappingURL=index.js.map\n"],"names":["position_1","hasRequiredPosition","requirePosition","_","requireLodash","util","requireUtil","positionX","requireBk","position","g","positionY","x","v","layering","rankSep","prevY","layer","maxHeight"],"mappings":";;;AAIA,IAAIA,GACAC;AAEJ,SAASC,IAAmB;AAC3B,MAAID,EAAqB,QAAOD;AAChC,EAAAC,IAAsB;AAEtB,MAAIE,IAAIC,EAAa,GACjBC,IAAOC,EAAW,GAClBC,IAAYC,EAAS,EAAG;AAE5B,EAAAR,IAAaS;AAEb,WAASA,EAASC,GAAG;AACnB,IAAAA,IAAIL,EAAK,mBAAmBK,CAAC,GAE7BC,EAAUD,CAAC,GACXP,EAAE,QAAQI,EAAUG,CAAC,GAAG,SAASE,GAAGC,GAAG;AACrC,MAAAH,EAAE,KAAKG,CAAC,EAAE,IAAID;AAAA,IAChB,CAAC;AAAA,EACH;AAEA,WAASD,EAAUD,GAAG;AACpB,QAAII,IAAWT,EAAK,iBAAiBK,CAAC,GAClCK,IAAUL,EAAE,MAAK,EAAG,SACpBM,IAAQ;AACZ,IAAAb,EAAE,QAAQW,GAAU,SAASG,GAAO;AAClC,UAAIC,IAAYf,EAAE,IAAIA,EAAE,IAAIc,GAAO,SAASJ,GAAG;AAAE,eAAOH,EAAE,KAAKG,CAAC,EAAE;AAAA,MAAQ,CAAC,CAAC;AAC5E,MAAAV,EAAE,QAAQc,GAAO,SAASJ,GAAG;AAC3B,QAAAH,EAAE,KAAKG,CAAC,EAAE,IAAIG,IAAQE,IAAY;AAAA,MACpC,CAAC,GACDF,KAASE,IAAYH;AAAA,IACvB,CAAC;AAAA,EACH;AACA,SAAOf;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/dagre/lib/rank/feasible-tree.js

@@ -1,42 +0,0 @@
-import { __require as q } from "../lodash.js";
-import { __require as m } from "../graphlib.js";
-import { __require as p } from "./util.js";
-var u, f;
-function k() {
-  if (f) return u;
-  f = 1;
-  var s = q(), c = m().Graph, t = p().slack;
-  u = h;
-  function h(e) {
-    var r = new c({ directed: !1 }), n = e.nodes()[0], i = e.nodeCount();
-    r.setNode(n, {});
-    for (var a, o; l(r, e) < i; )
-      a = v(r, e), o = r.hasNode(a.v) ? t(e, a) : -t(e, a), _(r, e, o);
-    return r;
-  }
-  function l(e, r) {
-    function n(i) {
-      s.forEach(r.nodeEdges(i), function(a) {
-        var o = a.v, d = i === o ? a.w : o;
-        !e.hasNode(d) && !t(r, a) && (e.setNode(d, {}), e.setEdge(i, d, {}), n(d));
-      });
-    }
-    return s.forEach(e.nodes(), n), e.nodeCount();
-  }
-  function v(e, r) {
-    return s.minBy(r.edges(), function(n) {
-      if (e.hasNode(n.v) !== e.hasNode(n.w))
-        return t(r, n);
-    });
-  }
-  function _(e, r, n) {
-    s.forEach(e.nodes(), function(i) {
-      r.node(i).rank += n;
-    });
-  }
-  return u;
-}
-export {
-  k as __require
-};
-//# sourceMappingURL=feasible-tree.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/dagre/lib/rank/feasible-tree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"feasible-tree.js","sources":["../../../../../../../../../node_modules/@antv/layout/lib/node_modules/dagre/lib/rank/feasible-tree.js"],"sourcesContent":["import { __require as requireLodash } from '../lodash.js';\nimport { __require as requireGraphlib } from '../graphlib.js';\nimport { __require as requireUtil } from './util.js';\n\nvar feasibleTree_1;\nvar hasRequiredFeasibleTree;\n\nfunction requireFeasibleTree () {\n\tif (hasRequiredFeasibleTree) return feasibleTree_1;\n\thasRequiredFeasibleTree = 1;\n\n\tvar _ = requireLodash();\n\tvar Graph = requireGraphlib().Graph;\n\tvar slack = requireUtil().slack;\n\n\tfeasibleTree_1 = feasibleTree;\n\n\t/*\n\t * Constructs a spanning tree with tight edges and adjusted the input node's\n\t * ranks to achieve this. A tight edge is one that is has a length that matches\n\t * its \"minlen\" attribute.\n\t *\n\t * The basic structure for this function is derived from Gansner, et al., \"A\n\t * Technique for Drawing Directed Graphs.\"\n\t *\n\t * Pre-conditions:\n\t *\n\t *    1. Graph must be a DAG.\n\t *    2. Graph must be connected.\n\t *    3. Graph must have at least one node.\n\t *    5. Graph nodes must have been previously assigned a \"rank\" property that\n\t *       respects the \"minlen\" property of incident edges.\n\t *    6. Graph edges must have a \"minlen\" property.\n\t *\n\t * Post-conditions:\n\t *\n\t *    - Graph nodes will have their rank adjusted to ensure that all edges are\n\t *      tight.\n\t *\n\t * Returns a tree (undirected graph) that is constructed using only \"tight\"\n\t * edges.\n\t */\n\tfunction feasibleTree(g) {\n\t  var t = new Graph({ directed: false });\n\n\t  // Choose arbitrary node from which to start our tree\n\t  var start = g.nodes()[0];\n\t  var size = g.nodeCount();\n\t  t.setNode(start, {});\n\n\t  var edge, delta;\n\t  while (tightTree(t, g) < size) {\n\t    edge = findMinSlackEdge(t, g);\n\t    delta = t.hasNode(edge.v) ? slack(g, edge) : -slack(g, edge);\n\t    shiftRanks(t, g, delta);\n\t  }\n\n\t  return t;\n\t}\n\n\t/*\n\t * Finds a maximal tree of tight edges and returns the number of nodes in the\n\t * tree.\n\t */\n\tfunction tightTree(t, g) {\n\t  function dfs(v) {\n\t    _.forEach(g.nodeEdges(v), function(e) {\n\t      var edgeV = e.v,\n\t        w = (v === edgeV) ? e.w : edgeV;\n\t      if (!t.hasNode(w) && !slack(g, e)) {\n\t        t.setNode(w, {});\n\t        t.setEdge(v, w, {});\n\t        dfs(w);\n\t      }\n\t    });\n\t  }\n\n\t  _.forEach(t.nodes(), dfs);\n\t  return t.nodeCount();\n\t}\n\n\t/*\n\t * Finds the edge with the smallest slack that is incident on tree and returns\n\t * it.\n\t */\n\tfunction findMinSlackEdge(t, g) {\n\t  return _.minBy(g.edges(), function(e) {\n\t    if (t.hasNode(e.v) !== t.hasNode(e.w)) {\n\t      return slack(g, e);\n\t    }\n\t  });\n\t}\n\n\tfunction shiftRanks(t, g, delta) {\n\t  _.forEach(t.nodes(), function(v) {\n\t    g.node(v).rank += delta;\n\t  });\n\t}\n\treturn feasibleTree_1;\n}\n\nexport { requireFeasibleTree as __require };\n//# sourceMappingURL=feasible-tree.js.map\n"],"names":["feasibleTree_1","hasRequiredFeasibleTree","requireFeasibleTree","_","requireLodash","Graph","requireGraphlib","slack","requireUtil","feasibleTree","g","t","start","size","edge","delta","tightTree","findMinSlackEdge","shiftRanks","dfs","v","e","edgeV","w"],"mappings":";;;AAIA,IAAIA,GACAC;AAEJ,SAASC,IAAuB;AAC/B,MAAID,EAAyB,QAAOD;AACpC,EAAAC,IAA0B;AAE1B,MAAIE,IAAIC,EAAa,GACjBC,IAAQC,EAAe,EAAG,OAC1BC,IAAQC,EAAW,EAAG;AAE1B,EAAAR,IAAiBS;AA2BjB,WAASA,EAAaC,GAAG;AACvB,QAAIC,IAAI,IAAIN,EAAM,EAAE,UAAU,GAAK,CAAE,GAGjCO,IAAQF,EAAE,MAAK,EAAG,CAAC,GACnBG,IAAOH,EAAE,UAAS;AACtB,IAAAC,EAAE,QAAQC,GAAO,EAAE;AAGnB,aADIE,GAAMC,GACHC,EAAUL,GAAGD,CAAC,IAAIG;AACvB,MAAAC,IAAOG,EAAiBN,GAAGD,CAAC,GAC5BK,IAAQJ,EAAE,QAAQG,EAAK,CAAC,IAAIP,EAAMG,GAAGI,CAAI,IAAI,CAACP,EAAMG,GAAGI,CAAI,GAC3DI,EAAWP,GAAGD,GAAGK,CAAK;AAGxB,WAAOJ;AAAA,EACT;AAMA,WAASK,EAAUL,GAAGD,GAAG;AACvB,aAASS,EAAIC,GAAG;AACd,MAAAjB,EAAE,QAAQO,EAAE,UAAUU,CAAC,GAAG,SAASC,GAAG;AACpC,YAAIC,IAAQD,EAAE,GACZE,IAAKH,MAAME,IAASD,EAAE,IAAIC;AAC5B,QAAI,CAACX,EAAE,QAAQY,CAAC,KAAK,CAAChB,EAAMG,GAAGW,CAAC,MAC9BV,EAAE,QAAQY,GAAG,EAAE,GACfZ,EAAE,QAAQS,GAAGG,GAAG,CAAA,CAAE,GAClBJ,EAAII,CAAC;AAAA,MAET,CAAC;AAAA,IACH;AAEA,WAAApB,EAAE,QAAQQ,EAAE,MAAK,GAAIQ,CAAG,GACjBR,EAAE,UAAS;AAAA,EACpB;AAMA,WAASM,EAAiBN,GAAGD,GAAG;AAC9B,WAAOP,EAAE,MAAMO,EAAE,MAAK,GAAI,SAASW,GAAG;AACpC,UAAIV,EAAE,QAAQU,EAAE,CAAC,MAAMV,EAAE,QAAQU,EAAE,CAAC;AAClC,eAAOd,EAAMG,GAAGW,CAAC;AAAA,IAErB,CAAC;AAAA,EACH;AAEA,WAASH,EAAWP,GAAGD,GAAGK,GAAO;AAC/B,IAAAZ,EAAE,QAAQQ,EAAE,MAAK,GAAI,SAASS,GAAG;AAC/B,MAAAV,EAAE,KAAKU,CAAC,EAAE,QAAQL;AAAA,IACpB,CAAC;AAAA,EACH;AACA,SAAOf;AACR;","x_google_ignoreList":[0]}