@hkyhy/marsun-components-core 0.1.113 → 0.1.114

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

@@ -0,0 +1,37 @@
+import { __require as f } from "./util.js";
+import { __require as m } from "./feasible-tree.js";
+import { __require as p } from "./network-simplex.js";
+var r, i;
+function c() {
+  if (i) return r;
+  i = 1;
+  var n = f(), a = n.longestPath, o = m(), k = p();
+  r = s;
+  function s(e) {
+    switch (e.graph().ranker) {
+      case "network-simplex":
+        t(e);
+        break;
+      case "tight-tree":
+        l(e);
+        break;
+      case "longest-path":
+        u(e);
+        break;
+      default:
+        t(e);
+    }
+  }
+  var u = a;
+  function l(e) {
+    a(e), o(e);
+  }
+  function t(e) {
+    k(e);
+  }
+  return r;
+}
+export {
+  c as __require
+};
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../../../node_modules/@antv/layout/lib/node_modules/dagre/lib/rank/index.js"],"sourcesContent":["import { __require as requireUtil } from './util.js';\nimport { __require as requireFeasibleTree } from './feasible-tree.js';\nimport { __require as requireNetworkSimplex } from './network-simplex.js';\n\nvar rank_1;\nvar hasRequiredRank;\n\nfunction requireRank () {\n\tif (hasRequiredRank) return rank_1;\n\thasRequiredRank = 1;\n\n\tvar rankUtil = requireUtil();\n\tvar longestPath = rankUtil.longestPath;\n\tvar feasibleTree = requireFeasibleTree();\n\tvar networkSimplex = requireNetworkSimplex();\n\n\trank_1 = rank;\n\n\t/*\n\t * Assigns a rank to each node in the input graph that respects the \"minlen\"\n\t * constraint specified on edges between nodes.\n\t *\n\t * This basic structure is derived from Gansner, et al., \"A Technique for\n\t * Drawing Directed Graphs.\"\n\t *\n\t * Pre-conditions:\n\t *\n\t *    1. Graph must be a connected DAG\n\t *    2. Graph nodes must be objects\n\t *    3. Graph edges must have \"weight\" and \"minlen\" attributes\n\t *\n\t * Post-conditions:\n\t *\n\t *    1. Graph nodes will have a \"rank\" attribute based on the results of the\n\t *       algorithm. Ranks can start at any index (including negative), we'll\n\t *       fix them up later.\n\t */\n\tfunction rank(g) {\n\t  switch(g.graph().ranker) {\n\t  case \"network-simplex\": networkSimplexRanker(g); break;\n\t  case \"tight-tree\": tightTreeRanker(g); break;\n\t  case \"longest-path\": longestPathRanker(g); break;\n\t  default: networkSimplexRanker(g);\n\t  }\n\t}\n\n\t// A fast and simple ranker, but results are far from optimal.\n\tvar longestPathRanker = longestPath;\n\n\tfunction tightTreeRanker(g) {\n\t  longestPath(g);\n\t  feasibleTree(g);\n\t}\n\n\tfunction networkSimplexRanker(g) {\n\t  networkSimplex(g);\n\t}\n\treturn rank_1;\n}\n\nexport { requireRank as __require };\n//# sourceMappingURL=index.js.map\n"],"names":["rank_1","hasRequiredRank","requireRank","rankUtil","requireUtil","longestPath","feasibleTree","requireFeasibleTree","networkSimplex","requireNetworkSimplex","rank","g","networkSimplexRanker","tightTreeRanker","longestPathRanker"],"mappings":";;;AAIA,IAAIA,GACAC;AAEJ,SAASC,IAAe;AACvB,MAAID,EAAiB,QAAOD;AAC5B,EAAAC,IAAkB;AAElB,MAAIE,IAAWC,EAAW,GACtBC,IAAcF,EAAS,aACvBG,IAAeC,EAAmB,GAClCC,IAAiBC,EAAqB;AAE1C,EAAAT,IAASU;AAqBT,WAASA,EAAKC,GAAG;AACf,YAAOA,EAAE,MAAK,EAAG,QAAM;AAAA,MACvB,KAAK;AAAmB,QAAAC,EAAqBD,CAAC;AAAG;AAAA,MACjD,KAAK;AAAc,QAAAE,EAAgBF,CAAC;AAAG;AAAA,MACvC,KAAK;AAAgB,QAAAG,EAAkBH,CAAC;AAAG;AAAA,MAC3C;AAAS,QAAAC,EAAqBD,CAAC;AAAA,IAClC;AAAA,EACC;AAGA,MAAIG,IAAoBT;AAExB,WAASQ,EAAgBF,GAAG;AAC1B,IAAAN,EAAYM,CAAC,GACbL,EAAaK,CAAC;AAAA,EAChB;AAEA,WAASC,EAAqBD,GAAG;AAC/B,IAAAH,EAAeG,CAAC;AAAA,EAClB;AACA,SAAOX;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/dagre/lib/rank/network-simplex.js

@@ -0,0 +1,92 @@
+import { __require as F } from "../lodash.js";
+import { __require as G } from "./feasible-tree.js";
+import { __require as L } from "./util.js";
+import { __require as C } from "../graphlib.js";
+import { __require as I } from "../util.js";
+var m, S;
+function J() {
+  if (S) return m;
+  S = 1;
+  var l = F(), x = G(), y = L().slack, R = L().longestPath, T = C().alg.preorder, N = C().alg.postorder, U = I().simplify;
+  m = v, v.initLowLimValues = p, v.initCutValues = c, v.calcCutValue = w, v.leaveEdge = E, v.enterEdge = _, v.exchangeEdges = h;
+  function v(e) {
+    e = U(e), R(e);
+    var r = x(e);
+    p(r), c(r, e);
+    for (var n, a; n = E(r); )
+      a = _(r, e, n), h(r, e, n, a);
+  }
+  function c(e, r) {
+    var n = N(e, e.nodes());
+    n = n.slice(0, n.length - 1), l.forEach(n, function(a) {
+      A(e, r, a);
+    });
+  }
+  function A(e, r, n) {
+    var a = e.node(n), i = a.parent;
+    e.edge(n, i).cutvalue = w(e, r, n);
+  }
+  function w(e, r, n) {
+    var a = e.node(n), i = a.parent, t = !0, u = r.edge(n, i), o = 0;
+    return u || (t = !1, u = r.edge(i, n)), o = u.weight, l.forEach(r.nodeEdges(n), function(f) {
+      var d = f.v === n, s = d ? f.w : f.v;
+      if (s !== i) {
+        var k = d === t, b = r.edge(f).weight;
+        if (o += k ? b : -b, D(e, n, s)) {
+          var V = e.edge(n, s).cutvalue;
+          o += k ? -V : V;
+        }
+      }
+    }), o;
+  }
+  function p(e, r) {
+    arguments.length < 2 && (r = e.nodes()[0]), g(e, {}, 1, r);
+  }
+  function g(e, r, n, a, i) {
+    var t = n, u = e.node(a);
+    return r[a] = !0, l.forEach(e.neighbors(a), function(o) {
+      l.has(r, o) || (n = g(e, r, n, o, a));
+    }), u.low = t, u.lim = n++, i ? u.parent = i : delete u.parent, n;
+  }
+  function E(e) {
+    return l.find(e.edges(), function(r) {
+      return e.edge(r).cutvalue < 0;
+    });
+  }
+  function _(e, r, n) {
+    var a = n.v, i = n.w;
+    r.hasEdge(a, i) || (a = n.w, i = n.v);
+    var t = e.node(a), u = e.node(i), o = t, f = !1;
+    t.lim > u.lim && (o = u, f = !0);
+    var d = l.filter(r.edges(), function(s) {
+      return f === q(e, e.node(s.v), o) && f !== q(e, e.node(s.w), o);
+    });
+    return l.minBy(d, function(s) {
+      return y(r, s);
+    });
+  }
+  function h(e, r, n, a) {
+    var i = n.v, t = n.w;
+    e.removeEdge(i, t), e.setEdge(a.v, a.w, {}), p(e), c(e, r), B(e, r);
+  }
+  function B(e, r) {
+    var n = l.find(e.nodes(), function(i) {
+      return !r.node(i).parent;
+    }), a = T(e, n);
+    a = a.slice(1), l.forEach(a, function(i) {
+      var t = e.node(i).parent, u = r.edge(i, t), o = !1;
+      u || (u = r.edge(t, i), o = !0), r.node(i).rank = r.node(t).rank + (o ? u.minlen : -u.minlen);
+    });
+  }
+  function D(e, r, n) {
+    return e.hasEdge(r, n);
+  }
+  function q(e, r, n) {
+    return n.low <= r.lim && r.lim <= n.lim;
+  }
+  return m;
+}
+export {
+  J as __require
+};
+//# sourceMappingURL=network-simplex.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/dagre/lib/rank/network-simplex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"network-simplex.js","sources":["../../../../../../../../../node_modules/@antv/layout/lib/node_modules/dagre/lib/rank/network-simplex.js"],"sourcesContent":["import { __require as requireLodash } from '../lodash.js';\nimport { __require as requireFeasibleTree } from './feasible-tree.js';\nimport { __require as requireUtil } from './util.js';\nimport { __require as requireGraphlib } from '../graphlib.js';\nimport { __require as requireUtil$1 } from '../util.js';\n\nvar networkSimplex_1;\nvar hasRequiredNetworkSimplex;\n\nfunction requireNetworkSimplex () {\n\tif (hasRequiredNetworkSimplex) return networkSimplex_1;\n\thasRequiredNetworkSimplex = 1;\n\n\tvar _ = requireLodash();\n\tvar feasibleTree = requireFeasibleTree();\n\tvar slack = requireUtil().slack;\n\tvar initRank = requireUtil().longestPath;\n\tvar preorder = requireGraphlib().alg.preorder;\n\tvar postorder = requireGraphlib().alg.postorder;\n\tvar simplify = requireUtil$1().simplify;\n\n\tnetworkSimplex_1 = networkSimplex;\n\n\t// Expose some internals for testing purposes\n\tnetworkSimplex.initLowLimValues = initLowLimValues;\n\tnetworkSimplex.initCutValues = initCutValues;\n\tnetworkSimplex.calcCutValue = calcCutValue;\n\tnetworkSimplex.leaveEdge = leaveEdge;\n\tnetworkSimplex.enterEdge = enterEdge;\n\tnetworkSimplex.exchangeEdges = exchangeEdges;\n\n\t/*\n\t * The network simplex algorithm assigns ranks to each node in the input graph\n\t * and iteratively improves the ranking to reduce the length of edges.\n\t *\n\t * Preconditions:\n\t *\n\t *    1. The input graph must be a DAG.\n\t *    2. All nodes in the graph must have an object value.\n\t *    3. All edges in the graph must have \"minlen\" and \"weight\" attributes.\n\t *\n\t * Postconditions:\n\t *\n\t *    1. All nodes in the graph will have an assigned \"rank\" attribute that has\n\t *       been optimized by the network simplex algorithm. Ranks start at 0.\n\t *\n\t *\n\t * A rough sketch of the algorithm is as follows:\n\t *\n\t *    1. Assign initial ranks to each node. We use the longest path algorithm,\n\t *       which assigns ranks to the lowest position possible. In general this\n\t *       leads to very wide bottom ranks and unnecessarily long edges.\n\t *    2. Construct a feasible tight tree. A tight tree is one such that all\n\t *       edges in the tree have no slack (difference between length of edge\n\t *       and minlen for the edge). This by itself greatly improves the assigned\n\t *       rankings by shorting edges.\n\t *    3. Iteratively find edges that have negative cut values. Generally a\n\t *       negative cut value indicates that the edge could be removed and a new\n\t *       tree edge could be added to produce a more compact graph.\n\t *\n\t * Much of the algorithms here are derived from Gansner, et al., \"A Technique\n\t * for Drawing Directed Graphs.\" The structure of the file roughly follows the\n\t * structure of the overall algorithm.\n\t */\n\tfunction networkSimplex(g) {\n\t  g = simplify(g);\n\t  initRank(g);\n\t  var t = feasibleTree(g);\n\t  initLowLimValues(t);\n\t  initCutValues(t, g);\n\n\t  var e, f;\n\t  while ((e = leaveEdge(t))) {\n\t    f = enterEdge(t, g, e);\n\t    exchangeEdges(t, g, e, f);\n\t  }\n\t}\n\n\t/*\n\t * Initializes cut values for all edges in the tree.\n\t */\n\tfunction initCutValues(t, g) {\n\t  var vs = postorder(t, t.nodes());\n\t  vs = vs.slice(0, vs.length - 1);\n\t  _.forEach(vs, function(v) {\n\t    assignCutValue(t, g, v);\n\t  });\n\t}\n\n\tfunction assignCutValue(t, g, child) {\n\t  var childLab = t.node(child);\n\t  var parent = childLab.parent;\n\t  t.edge(child, parent).cutvalue = calcCutValue(t, g, child);\n\t}\n\n\t/*\n\t * Given the tight tree, its graph, and a child in the graph calculate and\n\t * return the cut value for the edge between the child and its parent.\n\t */\n\tfunction calcCutValue(t, g, child) {\n\t  var childLab = t.node(child);\n\t  var parent = childLab.parent;\n\t  // True if the child is on the tail end of the edge in the directed graph\n\t  var childIsTail = true;\n\t  // The graph's view of the tree edge we're inspecting\n\t  var graphEdge = g.edge(child, parent);\n\t  // The accumulated cut value for the edge between this node and its parent\n\t  var cutValue = 0;\n\n\t  if (!graphEdge) {\n\t    childIsTail = false;\n\t    graphEdge = g.edge(parent, child);\n\t  }\n\n\t  cutValue = graphEdge.weight;\n\n\t  _.forEach(g.nodeEdges(child), function(e) {\n\t    var isOutEdge = e.v === child,\n\t      other = isOutEdge ? e.w : e.v;\n\n\t    if (other !== parent) {\n\t      var pointsToHead = isOutEdge === childIsTail,\n\t        otherWeight = g.edge(e).weight;\n\n\t      cutValue += pointsToHead ? otherWeight : -otherWeight;\n\t      if (isTreeEdge(t, child, other)) {\n\t        var otherCutValue = t.edge(child, other).cutvalue;\n\t        cutValue += pointsToHead ? -otherCutValue : otherCutValue;\n\t      }\n\t    }\n\t  });\n\n\t  return cutValue;\n\t}\n\n\tfunction initLowLimValues(tree, root) {\n\t  if (arguments.length < 2) {\n\t    root = tree.nodes()[0];\n\t  }\n\t  dfsAssignLowLim(tree, {}, 1, root);\n\t}\n\n\tfunction dfsAssignLowLim(tree, visited, nextLim, v, parent) {\n\t  var low = nextLim;\n\t  var label = tree.node(v);\n\n\t  visited[v] = true;\n\t  _.forEach(tree.neighbors(v), function(w) {\n\t    if (!_.has(visited, w)) {\n\t      nextLim = dfsAssignLowLim(tree, visited, nextLim, w, v);\n\t    }\n\t  });\n\n\t  label.low = low;\n\t  label.lim = nextLim++;\n\t  if (parent) {\n\t    label.parent = parent;\n\t  } else {\n\t    // TODO should be able to remove this when we incrementally update low lim\n\t    delete label.parent;\n\t  }\n\n\t  return nextLim;\n\t}\n\n\tfunction leaveEdge(tree) {\n\t  return _.find(tree.edges(), function(e) {\n\t    return tree.edge(e).cutvalue < 0;\n\t  });\n\t}\n\n\tfunction enterEdge(t, g, edge) {\n\t  var v = edge.v;\n\t  var w = edge.w;\n\n\t  // For the rest of this function we assume that v is the tail and w is the\n\t  // head, so if we don't have this edge in the graph we should flip it to\n\t  // match the correct orientation.\n\t  if (!g.hasEdge(v, w)) {\n\t    v = edge.w;\n\t    w = edge.v;\n\t  }\n\n\t  var vLabel = t.node(v);\n\t  var wLabel = t.node(w);\n\t  var tailLabel = vLabel;\n\t  var flip = false;\n\n\t  // If the root is in the tail of the edge then we need to flip the logic that\n\t  // checks for the head and tail nodes in the candidates function below.\n\t  if (vLabel.lim > wLabel.lim) {\n\t    tailLabel = wLabel;\n\t    flip = true;\n\t  }\n\n\t  var candidates = _.filter(g.edges(), function(edge) {\n\t    return flip === isDescendant(t, t.node(edge.v), tailLabel) &&\n\t           flip !== isDescendant(t, t.node(edge.w), tailLabel);\n\t  });\n\n\t  return _.minBy(candidates, function(edge) { return slack(g, edge); });\n\t}\n\n\tfunction exchangeEdges(t, g, e, f) {\n\t  var v = e.v;\n\t  var w = e.w;\n\t  t.removeEdge(v, w);\n\t  t.setEdge(f.v, f.w, {});\n\t  initLowLimValues(t);\n\t  initCutValues(t, g);\n\t  updateRanks(t, g);\n\t}\n\n\tfunction updateRanks(t, g) {\n\t  var root = _.find(t.nodes(), function(v) { return !g.node(v).parent; });\n\t  var vs = preorder(t, root);\n\t  vs = vs.slice(1);\n\t  _.forEach(vs, function(v) {\n\t    var parent = t.node(v).parent,\n\t      edge = g.edge(v, parent),\n\t      flipped = false;\n\n\t    if (!edge) {\n\t      edge = g.edge(parent, v);\n\t      flipped = true;\n\t    }\n\n\t    g.node(v).rank = g.node(parent).rank + (flipped ? edge.minlen : -edge.minlen);\n\t  });\n\t}\n\n\t/*\n\t * Returns true if the edge is in the tree.\n\t */\n\tfunction isTreeEdge(tree, u, v) {\n\t  return tree.hasEdge(u, v);\n\t}\n\n\t/*\n\t * Returns true if the specified node is descendant of the root node per the\n\t * assigned low and lim attributes in the tree.\n\t */\n\tfunction isDescendant(tree, vLabel, rootLabel) {\n\t  return rootLabel.low <= vLabel.lim && vLabel.lim <= rootLabel.lim;\n\t}\n\treturn networkSimplex_1;\n}\n\nexport { requireNetworkSimplex as __require };\n//# sourceMappingURL=network-simplex.js.map\n"],"names":["networkSimplex_1","hasRequiredNetworkSimplex","requireNetworkSimplex","_","requireLodash","feasibleTree","requireFeasibleTree","slack","requireUtil","initRank","preorder","requireGraphlib","postorder","simplify","requireUtil$1","networkSimplex","initLowLimValues","initCutValues","calcCutValue","leaveEdge","enterEdge","exchangeEdges","g","t","e","f","vs","v","assignCutValue","child","childLab","parent","childIsTail","graphEdge","cutValue","isOutEdge","other","pointsToHead","otherWeight","isTreeEdge","otherCutValue","tree","root","dfsAssignLowLim","visited","nextLim","low","label","w","edge","vLabel","wLabel","tailLabel","flip","candidates","isDescendant","updateRanks","flipped","u","rootLabel"],"mappings":";;;;;AAMA,IAAIA,GACAC;AAEJ,SAASC,IAAyB;AACjC,MAAID,EAA2B,QAAOD;AACtC,EAAAC,IAA4B;AAE5B,MAAIE,IAAIC,EAAa,GACjBC,IAAeC,EAAmB,GAClCC,IAAQC,EAAW,EAAG,OACtBC,IAAWD,EAAW,EAAG,aACzBE,IAAWC,IAAkB,IAAI,UACjCC,IAAYD,IAAkB,IAAI,WAClCE,IAAWC,EAAa,EAAG;AAE/B,EAAAd,IAAmBe,GAGnBA,EAAe,mBAAmBC,GAClCD,EAAe,gBAAgBE,GAC/BF,EAAe,eAAeG,GAC9BH,EAAe,YAAYI,GAC3BJ,EAAe,YAAYK,GAC3BL,EAAe,gBAAgBM;AAmC/B,WAASN,EAAeO,GAAG;AACzB,IAAAA,IAAIT,EAASS,CAAC,GACdb,EAASa,CAAC;AACV,QAAIC,IAAIlB,EAAaiB,CAAC;AACtB,IAAAN,EAAiBO,CAAC,GAClBN,EAAcM,GAAGD,CAAC;AAGlB,aADIE,GAAGC,GACCD,IAAIL,EAAUI,CAAC;AACrB,MAAAE,IAAIL,EAAUG,GAAGD,GAAGE,CAAC,GACrBH,EAAcE,GAAGD,GAAGE,GAAGC,CAAC;AAAA,EAE5B;AAKA,WAASR,EAAcM,GAAGD,GAAG;AAC3B,QAAII,IAAKd,EAAUW,GAAGA,EAAE,MAAK,CAAE;AAC/B,IAAAG,IAAKA,EAAG,MAAM,GAAGA,EAAG,SAAS,CAAC,GAC9BvB,EAAE,QAAQuB,GAAI,SAASC,GAAG;AACxB,MAAAC,EAAeL,GAAGD,GAAGK,CAAC;AAAA,IACxB,CAAC;AAAA,EACH;AAEA,WAASC,EAAeL,GAAGD,GAAGO,GAAO;AACnC,QAAIC,IAAWP,EAAE,KAAKM,CAAK,GACvBE,IAASD,EAAS;AACtB,IAAAP,EAAE,KAAKM,GAAOE,CAAM,EAAE,WAAWb,EAAaK,GAAGD,GAAGO,CAAK;AAAA,EAC3D;AAMA,WAASX,EAAaK,GAAGD,GAAGO,GAAO;AACjC,QAAIC,IAAWP,EAAE,KAAKM,CAAK,GACvBE,IAASD,EAAS,QAElBE,IAAc,IAEdC,IAAYX,EAAE,KAAKO,GAAOE,CAAM,GAEhCG,IAAW;AAEf,WAAKD,MACHD,IAAc,IACdC,IAAYX,EAAE,KAAKS,GAAQF,CAAK,IAGlCK,IAAWD,EAAU,QAErB9B,EAAE,QAAQmB,EAAE,UAAUO,CAAK,GAAG,SAASL,GAAG;AACxC,UAAIW,IAAYX,EAAE,MAAMK,GACtBO,IAAQD,IAAYX,EAAE,IAAIA,EAAE;AAE9B,UAAIY,MAAUL,GAAQ;AACpB,YAAIM,IAAeF,MAAcH,GAC/BM,IAAchB,EAAE,KAAKE,CAAC,EAAE;AAG1B,YADAU,KAAYG,IAAeC,IAAc,CAACA,GACtCC,EAAWhB,GAAGM,GAAOO,CAAK,GAAG;AAC/B,cAAII,IAAgBjB,EAAE,KAAKM,GAAOO,CAAK,EAAE;AACzC,UAAAF,KAAYG,IAAe,CAACG,IAAgBA;AAAA,QAC9C;AAAA,MACF;AAAA,IACF,CAAC,GAEMN;AAAA,EACT;AAEA,WAASlB,EAAiByB,GAAMC,GAAM;AACpC,IAAI,UAAU,SAAS,MACrBA,IAAOD,EAAK,MAAK,EAAG,CAAC,IAEvBE,EAAgBF,GAAM,IAAI,GAAGC,CAAI;AAAA,EACnC;AAEA,WAASC,EAAgBF,GAAMG,GAASC,GAASlB,GAAGI,GAAQ;AAC1D,QAAIe,IAAMD,GACNE,IAAQN,EAAK,KAAKd,CAAC;AAEvB,WAAAiB,EAAQjB,CAAC,IAAI,IACbxB,EAAE,QAAQsC,EAAK,UAAUd,CAAC,GAAG,SAASqB,GAAG;AACvC,MAAK7C,EAAE,IAAIyC,GAASI,CAAC,MACnBH,IAAUF,EAAgBF,GAAMG,GAASC,GAASG,GAAGrB,CAAC;AAAA,IAE1D,CAAC,GAEDoB,EAAM,MAAMD,GACZC,EAAM,MAAMF,KACRd,IACFgB,EAAM,SAAShB,IAGf,OAAOgB,EAAM,QAGRF;AAAA,EACT;AAEA,WAAS1B,EAAUsB,GAAM;AACvB,WAAOtC,EAAE,KAAKsC,EAAK,MAAK,GAAI,SAASjB,GAAG;AACtC,aAAOiB,EAAK,KAAKjB,CAAC,EAAE,WAAW;AAAA,IACjC,CAAC;AAAA,EACH;AAEA,WAASJ,EAAUG,GAAGD,GAAG2B,GAAM;AAC7B,QAAItB,IAAIsB,EAAK,GACTD,IAAIC,EAAK;AAKb,IAAK3B,EAAE,QAAQK,GAAGqB,CAAC,MACjBrB,IAAIsB,EAAK,GACTD,IAAIC,EAAK;AAGX,QAAIC,IAAS3B,EAAE,KAAKI,CAAC,GACjBwB,IAAS5B,EAAE,KAAKyB,CAAC,GACjBI,IAAYF,GACZG,IAAO;AAIX,IAAIH,EAAO,MAAMC,EAAO,QACtBC,IAAYD,GACZE,IAAO;AAGT,QAAIC,IAAanD,EAAE,OAAOmB,EAAE,MAAK,GAAI,SAAS2B,GAAM;AAClD,aAAOI,MAASE,EAAahC,GAAGA,EAAE,KAAK0B,EAAK,CAAC,GAAGG,CAAS,KAClDC,MAASE,EAAahC,GAAGA,EAAE,KAAK0B,EAAK,CAAC,GAAGG,CAAS;AAAA,IAC3D,CAAC;AAED,WAAOjD,EAAE,MAAMmD,GAAY,SAASL,GAAM;AAAE,aAAO1C,EAAMe,GAAG2B,CAAI;AAAA,IAAG,CAAC;AAAA,EACtE;AAEA,WAAS5B,EAAcE,GAAGD,GAAGE,GAAGC,GAAG;AACjC,QAAIE,IAAIH,EAAE,GACNwB,IAAIxB,EAAE;AACV,IAAAD,EAAE,WAAWI,GAAGqB,CAAC,GACjBzB,EAAE,QAAQE,EAAE,GAAGA,EAAE,GAAG,EAAE,GACtBT,EAAiBO,CAAC,GAClBN,EAAcM,GAAGD,CAAC,GAClBkC,EAAYjC,GAAGD,CAAC;AAAA,EAClB;AAEA,WAASkC,EAAYjC,GAAGD,GAAG;AACzB,QAAIoB,IAAOvC,EAAE,KAAKoB,EAAE,MAAK,GAAI,SAASI,GAAG;AAAE,aAAO,CAACL,EAAE,KAAKK,CAAC,EAAE;AAAA,IAAQ,CAAC,GAClED,IAAKhB,EAASa,GAAGmB,CAAI;AACzB,IAAAhB,IAAKA,EAAG,MAAM,CAAC,GACfvB,EAAE,QAAQuB,GAAI,SAASC,GAAG;AACxB,UAAII,IAASR,EAAE,KAAKI,CAAC,EAAE,QACrBsB,IAAO3B,EAAE,KAAKK,GAAGI,CAAM,GACvB0B,IAAU;AAEZ,MAAKR,MACHA,IAAO3B,EAAE,KAAKS,GAAQJ,CAAC,GACvB8B,IAAU,KAGZnC,EAAE,KAAKK,CAAC,EAAE,OAAOL,EAAE,KAAKS,CAAM,EAAE,QAAQ0B,IAAUR,EAAK,SAAS,CAACA,EAAK;AAAA,IACxE,CAAC;AAAA,EACH;AAKA,WAASV,EAAWE,GAAMiB,GAAG/B,GAAG;AAC9B,WAAOc,EAAK,QAAQiB,GAAG/B,CAAC;AAAA,EAC1B;AAMA,WAAS4B,EAAad,GAAMS,GAAQS,GAAW;AAC7C,WAAOA,EAAU,OAAOT,EAAO,OAAOA,EAAO,OAAOS,EAAU;AAAA,EAChE;AACA,SAAO3D;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/dagre/lib/rank/util.js

@@ -0,0 +1,35 @@
+import { __require as c } from "../lodash.js";
+var t, l;
+function m() {
+  if (l) return t;
+  l = 1;
+  var a = c();
+  t = {
+    longestPath: d,
+    slack: f
+  };
+  function d(r) {
+    var n = {};
+    function u(i) {
+      var o = r.node(i);
+      if (a.has(n, i))
+        return o.rank;
+      n[i] = !0;
+      var e = a.min(a.map(r.outEdges(i), function(s) {
+        return u(s.w) - r.edge(s).minlen;
+      }));
+      return (e === Number.POSITIVE_INFINITY || // return value of _.map([]) for Lodash 3
+      e === void 0 || // return value of _.map([]) for Lodash 4
+      e === null) && (e = 0), o.rank = e;
+    }
+    a.forEach(r.sources(), u);
+  }
+  function f(r, n) {
+    return r.node(n.w).rank - r.node(n.v).rank - r.edge(n).minlen;
+  }
+  return t;
+}
+export {
+  m as __require
+};
+//# sourceMappingURL=util.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/dagre/lib/rank/util.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"util.js","sources":["../../../../../../../../../node_modules/@antv/layout/lib/node_modules/dagre/lib/rank/util.js"],"sourcesContent":["import { __require as requireLodash } from '../lodash.js';\n\nvar util;\nvar hasRequiredUtil;\n\nfunction requireUtil () {\n\tif (hasRequiredUtil) return util;\n\thasRequiredUtil = 1;\n\n\tvar _ = requireLodash();\n\n\tutil = {\n\t  longestPath: longestPath,\n\t  slack: slack\n\t};\n\n\t/*\n\t * Initializes ranks for the input graph using the longest path algorithm. This\n\t * algorithm scales well and is fast in practice, it yields rather poor\n\t * solutions. Nodes are pushed to the lowest layer possible, leaving the bottom\n\t * ranks wide and leaving edges longer than necessary. However, due to its\n\t * speed, this algorithm is good for getting an initial ranking that can be fed\n\t * into other algorithms.\n\t *\n\t * This algorithm does not normalize layers because it will be used by other\n\t * algorithms in most cases. If using this algorithm directly, be sure to\n\t * run normalize at the end.\n\t *\n\t * Pre-conditions:\n\t *\n\t *    1. Input graph is a DAG.\n\t *    2. Input graph node labels can be assigned properties.\n\t *\n\t * Post-conditions:\n\t *\n\t *    1. Each node will be assign an (unnormalized) \"rank\" property.\n\t */\n\tfunction longestPath(g) {\n\t  var visited = {};\n\n\t  function dfs(v) {\n\t    var label = g.node(v);\n\t    if (_.has(visited, v)) {\n\t      return label.rank;\n\t    }\n\t    visited[v] = true;\n\n\t    var rank = _.min(_.map(g.outEdges(v), function(e) {\n\t      return dfs(e.w) - g.edge(e).minlen;\n\t    }));\n\n\t    if (rank === Number.POSITIVE_INFINITY || // return value of _.map([]) for Lodash 3\n\t        rank === undefined || // return value of _.map([]) for Lodash 4\n\t        rank === null) { // return value of _.map([null])\n\t      rank = 0;\n\t    }\n\n\t    return (label.rank = rank);\n\t  }\n\n\t  _.forEach(g.sources(), dfs);\n\t}\n\n\t/*\n\t * Returns the amount of slack for the given edge. The slack is defined as the\n\t * difference between the length of the edge and its minimum length.\n\t */\n\tfunction slack(g, e) {\n\t  return g.node(e.w).rank - g.node(e.v).rank - g.edge(e).minlen;\n\t}\n\treturn util;\n}\n\nexport { requireUtil as __require };\n//# sourceMappingURL=util.js.map\n"],"names":["util","hasRequiredUtil","requireUtil","_","requireLodash","longestPath","slack","g","visited","dfs","v","label","rank","e"],"mappings":";AAEA,IAAIA,GACAC;AAEJ,SAASC,IAAe;AACvB,MAAID,EAAiB,QAAOD;AAC5B,EAAAC,IAAkB;AAElB,MAAIE,IAAIC,EAAa;AAErB,EAAAJ,IAAO;AAAA,IACL,aAAaK;AAAA,IACb,OAAOC;AAAA,EACV;AAuBC,WAASD,EAAYE,GAAG;AACtB,QAAIC,IAAU,CAAA;AAEd,aAASC,EAAIC,GAAG;AACd,UAAIC,IAAQJ,EAAE,KAAKG,CAAC;AACpB,UAAIP,EAAE,IAAIK,GAASE,CAAC;AAClB,eAAOC,EAAM;AAEf,MAAAH,EAAQE,CAAC,IAAI;AAEb,UAAIE,IAAOT,EAAE,IAAIA,EAAE,IAAII,EAAE,SAASG,CAAC,GAAG,SAASG,GAAG;AAChD,eAAOJ,EAAII,EAAE,CAAC,IAAIN,EAAE,KAAKM,CAAC,EAAE;AAAA,MAC9B,CAAC,CAAC;AAEF,cAAID,MAAS,OAAO;AAAA,MAChBA,MAAS;AAAA,MACTA,MAAS,UACXA,IAAO,IAGDD,EAAM,OAAOC;AAAA,IACvB;AAEA,IAAAT,EAAE,QAAQI,EAAE,QAAO,GAAIE,CAAG;AAAA,EAC5B;AAMA,WAASH,EAAMC,GAAGM,GAAG;AACnB,WAAON,EAAE,KAAKM,EAAE,CAAC,EAAE,OAAON,EAAE,KAAKM,EAAE,CAAC,EAAE,OAAON,EAAE,KAAKM,CAAC,EAAE;AAAA,EACzD;AACA,SAAOb;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/dagre/lib/util.js

@@ -0,0 +1,145 @@
+import { __require as G } from "./lodash.js";
+import { __require as _ } from "./graphlib.js";
+var h, l;
+function L() {
+  if (l) return h;
+  l = 1;
+  var i = G(), c = _().Graph;
+  h = {
+    addDummyNode: m,
+    simplify: v,
+    asNonCompoundGraph: w,
+    successorWeights: k,
+    predecessorWeights: y,
+    intersectRect: E,
+    buildLayerMatrix: x,
+    normalizeRanks: b,
+    removeEmptyRanks: N,
+    addBorderNode: R,
+    maxRank: p,
+    partition: g,
+    time: q,
+    notime: M
+  };
+  function m(n, r, e, a) {
+    var o;
+    do
+      o = i.uniqueId(a);
+    while (n.hasNode(o));
+    return e.dummy = r, n.setNode(o, e), o;
+  }
+  function v(n) {
+    var r = new c().setGraph(n.graph());
+    return i.forEach(n.nodes(), function(e) {
+      r.setNode(e, n.node(e));
+    }), i.forEach(n.edges(), function(e) {
+      var a = r.edge(e.v, e.w) || { weight: 0, minlen: 1 }, o = n.edge(e);
+      r.setEdge(e.v, e.w, {
+        weight: a.weight + o.weight,
+        minlen: Math.max(a.minlen, o.minlen)
+      });
+    }), r;
+  }
+  function w(n) {
+    var r = new c({ multigraph: n.isMultigraph() }).setGraph(n.graph());
+    return i.forEach(n.nodes(), function(e) {
+      n.children(e).length || r.setNode(e, n.node(e));
+    }), i.forEach(n.edges(), function(e) {
+      r.setEdge(e, n.edge(e));
+    }), r;
+  }
+  function k(n) {
+    var r = i.map(n.nodes(), function(e) {
+      var a = {};
+      return i.forEach(n.outEdges(e), function(o) {
+        a[o.w] = (a[o.w] || 0) + n.edge(o).weight;
+      }), a;
+    });
+    return i.zipObject(n.nodes(), r);
+  }
+  function y(n) {
+    var r = i.map(n.nodes(), function(e) {
+      var a = {};
+      return i.forEach(n.inEdges(e), function(o) {
+        a[o.v] = (a[o.v] || 0) + n.edge(o).weight;
+      }), a;
+    });
+    return i.zipObject(n.nodes(), r);
+  }
+  function E(n, r) {
+    var e = n.x, a = n.y, o = r.x - e, t = r.y - a, s = n.width / 2, d = n.height / 2;
+    if (!o && !t)
+      throw new Error("Not possible to find intersection inside of the rectangle");
+    var u, f;
+    return Math.abs(t) * s > Math.abs(o) * d ? (t < 0 && (d = -d), u = d * o / t, f = d) : (o < 0 && (s = -s), u = s, f = s * t / o), { x: e + u, y: a + f };
+  }
+  function x(n) {
+    var r = i.map(i.range(p(n) + 1), function() {
+      return [];
+    });
+    return i.forEach(n.nodes(), function(e) {
+      var a = n.node(e), o = a.rank;
+      i.isUndefined(o) || (r[o][a.order] = e);
+    }), r;
+  }
+  function b(n) {
+    var r = i.min(i.map(n.nodes(), function(e) {
+      return n.node(e).rank;
+    }));
+    i.forEach(n.nodes(), function(e) {
+      var a = n.node(e);
+      i.has(a, "rank") && (a.rank -= r);
+    });
+  }
+  function N(n) {
+    var r = i.min(i.map(n.nodes(), function(t) {
+      return n.node(t).rank;
+    })), e = [];
+    i.forEach(n.nodes(), function(t) {
+      var s = n.node(t).rank - r;
+      e[s] || (e[s] = []), e[s].push(t);
+    });
+    var a = 0, o = n.graph().nodeRankFactor;
+    i.forEach(e, function(t, s) {
+      i.isUndefined(t) && s % o !== 0 ? --a : a && i.forEach(t, function(d) {
+        n.node(d).rank += a;
+      });
+    });
+  }
+  function R(n, r, e, a) {
+    var o = {
+      width: 0,
+      height: 0
+    };
+    return arguments.length >= 4 && (o.rank = e, o.order = a), m(n, "border", o, r);
+  }
+  function p(n) {
+    return i.max(i.map(n.nodes(), function(r) {
+      var e = n.node(r).rank;
+      if (!i.isUndefined(e))
+        return e;
+    }));
+  }
+  function g(n, r) {
+    var e = { lhs: [], rhs: [] };
+    return i.forEach(n, function(a) {
+      r(a) ? e.lhs.push(a) : e.rhs.push(a);
+    }), e;
+  }
+  function q(n, r) {
+    var e = i.now();
+    try {
+      return r();
+    } finally {
+      console.log(n + " time: " + (i.now() - e) + "ms");
+    }
+  }
+  function M(n, r) {
+    return r();
+  }
+  return h;
+}
+export {
+  L as __require
+};
+//# sourceMappingURL=util.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"util.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/dagre/lib/util.js"],"sourcesContent":["import { __require as requireLodash } from './lodash.js';\nimport { __require as requireGraphlib } from './graphlib.js';\n\n/* eslint \"no-console\": off */\n\nvar util$1;\nvar hasRequiredUtil$1;\n\nfunction requireUtil$1 () {\n\tif (hasRequiredUtil$1) return util$1;\n\thasRequiredUtil$1 = 1;\n\n\tvar _ = requireLodash();\n\tvar Graph = requireGraphlib().Graph;\n\n\tutil$1 = {\n\t  addDummyNode: addDummyNode,\n\t  simplify: simplify,\n\t  asNonCompoundGraph: asNonCompoundGraph,\n\t  successorWeights: successorWeights,\n\t  predecessorWeights: predecessorWeights,\n\t  intersectRect: intersectRect,\n\t  buildLayerMatrix: buildLayerMatrix,\n\t  normalizeRanks: normalizeRanks,\n\t  removeEmptyRanks: removeEmptyRanks,\n\t  addBorderNode: addBorderNode,\n\t  maxRank: maxRank,\n\t  partition: partition,\n\t  time: time,\n\t  notime: notime\n\t};\n\n\t/*\n\t * Adds a dummy node to the graph and return v.\n\t */\n\tfunction addDummyNode(g, type, attrs, name) {\n\t  var v;\n\t  do {\n\t    v = _.uniqueId(name);\n\t  } while (g.hasNode(v));\n\n\t  attrs.dummy = type;\n\t  g.setNode(v, attrs);\n\t  return v;\n\t}\n\n\t/*\n\t * Returns a new graph with only simple edges. Handles aggregation of data\n\t * associated with multi-edges.\n\t */\n\tfunction simplify(g) {\n\t  var simplified = new Graph().setGraph(g.graph());\n\t  _.forEach(g.nodes(), function(v) { simplified.setNode(v, g.node(v)); });\n\t  _.forEach(g.edges(), function(e) {\n\t    var simpleLabel = simplified.edge(e.v, e.w) || { weight: 0, minlen: 1 };\n\t    var label = g.edge(e);\n\t    simplified.setEdge(e.v, e.w, {\n\t      weight: simpleLabel.weight + label.weight,\n\t      minlen: Math.max(simpleLabel.minlen, label.minlen)\n\t    });\n\t  });\n\t  return simplified;\n\t}\n\n\tfunction asNonCompoundGraph(g) {\n\t  var simplified = new Graph({ multigraph: g.isMultigraph() }).setGraph(g.graph());\n\t  _.forEach(g.nodes(), function(v) {\n\t    if (!g.children(v).length) {\n\t      simplified.setNode(v, g.node(v));\n\t    }\n\t  });\n\t  _.forEach(g.edges(), function(e) {\n\t    simplified.setEdge(e, g.edge(e));\n\t  });\n\t  return simplified;\n\t}\n\n\tfunction successorWeights(g) {\n\t  var weightMap = _.map(g.nodes(), function(v) {\n\t    var sucs = {};\n\t    _.forEach(g.outEdges(v), function(e) {\n\t      sucs[e.w] = (sucs[e.w] || 0) + g.edge(e).weight;\n\t    });\n\t    return sucs;\n\t  });\n\t  return _.zipObject(g.nodes(), weightMap);\n\t}\n\n\tfunction predecessorWeights(g) {\n\t  var weightMap = _.map(g.nodes(), function(v) {\n\t    var preds = {};\n\t    _.forEach(g.inEdges(v), function(e) {\n\t      preds[e.v] = (preds[e.v] || 0) + g.edge(e).weight;\n\t    });\n\t    return preds;\n\t  });\n\t  return _.zipObject(g.nodes(), weightMap);\n\t}\n\n\t/*\n\t * Finds where a line starting at point ({x, y}) would intersect a rectangle\n\t * ({x, y, width, height}) if it were pointing at the rectangle's center.\n\t */\n\tfunction intersectRect(rect, point) {\n\t  var x = rect.x;\n\t  var y = rect.y;\n\n\t  // Rectangle intersection algorithm from:\n\t  // http://math.stackexchange.com/questions/108113/find-edge-between-two-boxes\n\t  var dx = point.x - x;\n\t  var dy = point.y - y;\n\t  var w = rect.width / 2;\n\t  var h = rect.height / 2;\n\n\t  if (!dx && !dy) {\n\t    throw new Error(\"Not possible to find intersection inside of the rectangle\");\n\t  }\n\n\t  var sx, sy;\n\t  if (Math.abs(dy) * w > Math.abs(dx) * h) {\n\t    // Intersection is top or bottom of rect.\n\t    if (dy < 0) {\n\t      h = -h;\n\t    }\n\t    sx = h * dx / dy;\n\t    sy = h;\n\t  } else {\n\t    // Intersection is left or right of rect.\n\t    if (dx < 0) {\n\t      w = -w;\n\t    }\n\t    sx = w;\n\t    sy = w * dy / dx;\n\t  }\n\n\t  return { x: x + sx, y: y + sy };\n\t}\n\n\t/*\n\t * Given a DAG with each node assigned \"rank\" and \"order\" properties, this\n\t * function will produce a matrix with the ids of each node.\n\t */\n\tfunction buildLayerMatrix(g) {\n\t  var layering = _.map(_.range(maxRank(g) + 1), function() { return []; });\n\t  _.forEach(g.nodes(), function(v) {\n\t    var node = g.node(v);\n\t    var rank = node.rank;\n\t    if (!_.isUndefined(rank)) {\n\t      layering[rank][node.order] = v;\n\t    }\n\t  });\n\t  return layering;\n\t}\n\n\t/*\n\t * Adjusts the ranks for all nodes in the graph such that all nodes v have\n\t * rank(v) >= 0 and at least one node w has rank(w) = 0.\n\t */\n\tfunction normalizeRanks(g) {\n\t  var min = _.min(_.map(g.nodes(), function(v) { return g.node(v).rank; }));\n\t  _.forEach(g.nodes(), function(v) {\n\t    var node = g.node(v);\n\t    if (_.has(node, \"rank\")) {\n\t      node.rank -= min;\n\t    }\n\t  });\n\t}\n\n\tfunction removeEmptyRanks(g) {\n\t  // Ranks may not start at 0, so we need to offset them\n\t  var offset = _.min(_.map(g.nodes(), function(v) { return g.node(v).rank; }));\n\n\t  var layers = [];\n\t  _.forEach(g.nodes(), function(v) {\n\t    var rank = g.node(v).rank - offset;\n\t    if (!layers[rank]) {\n\t      layers[rank] = [];\n\t    }\n\t    layers[rank].push(v);\n\t  });\n\n\t  var delta = 0;\n\t  var nodeRankFactor = g.graph().nodeRankFactor;\n\t  _.forEach(layers, function(vs, i) {\n\t    if (_.isUndefined(vs) && i % nodeRankFactor !== 0) {\n\t      --delta;\n\t    } else if (delta) {\n\t      _.forEach(vs, function(v) { g.node(v).rank += delta; });\n\t    }\n\t  });\n\t}\n\n\tfunction addBorderNode(g, prefix, rank, order) {\n\t  var node = {\n\t    width: 0,\n\t    height: 0\n\t  };\n\t  if (arguments.length >= 4) {\n\t    node.rank = rank;\n\t    node.order = order;\n\t  }\n\t  return addDummyNode(g, \"border\", node, prefix);\n\t}\n\n\tfunction maxRank(g) {\n\t  return _.max(_.map(g.nodes(), function(v) {\n\t    var rank = g.node(v).rank;\n\t    if (!_.isUndefined(rank)) {\n\t      return rank;\n\t    }\n\t  }));\n\t}\n\n\t/*\n\t * Partition a collection into two groups: `lhs` and `rhs`. If the supplied\n\t * function returns true for an entry it goes into `lhs`. Otherwise it goes\n\t * into `rhs.\n\t */\n\tfunction partition(collection, fn) {\n\t  var result = { lhs: [], rhs: [] };\n\t  _.forEach(collection, function(value) {\n\t    if (fn(value)) {\n\t      result.lhs.push(value);\n\t    } else {\n\t      result.rhs.push(value);\n\t    }\n\t  });\n\t  return result;\n\t}\n\n\t/*\n\t * Returns a new function that wraps `fn` with a timer. The wrapper logs the\n\t * time it takes to execute the function.\n\t */\n\tfunction time(name, fn) {\n\t  var start = _.now();\n\t  try {\n\t    return fn();\n\t  } finally {\n\t    console.log(name + \" time: \" + (_.now() - start) + \"ms\");\n\t  }\n\t}\n\n\tfunction notime(name, fn) {\n\t  return fn();\n\t}\n\treturn util$1;\n}\n\nexport { requireUtil$1 as __require };\n//# sourceMappingURL=util.js.map\n"],"names":["util$1","hasRequiredUtil$1","requireUtil$1","_","requireLodash","Graph","requireGraphlib","addDummyNode","simplify","asNonCompoundGraph","successorWeights","predecessorWeights","intersectRect","buildLayerMatrix","normalizeRanks","removeEmptyRanks","addBorderNode","maxRank","partition","time","notime","g","type","attrs","name","v","simplified","simpleLabel","label","weightMap","sucs","e","preds","rect","point","x","y","dx","dy","w","h","sx","sy","layering","node","rank","min","offset","layers","delta","nodeRankFactor","vs","i","prefix","order","collection","fn","result","value","start"],"mappings":";;AAKA,IAAIA,GACAC;AAEJ,SAASC,IAAiB;AACzB,MAAID,EAAmB,QAAOD;AAC9B,EAAAC,IAAoB;AAEpB,MAAIE,IAAIC,EAAa,GACjBC,IAAQC,EAAe,EAAG;AAE9B,EAAAN,IAAS;AAAA,IACP,cAAcO;AAAA,IACd,UAAUC;AAAA,IACV,oBAAoBC;AAAA,IACpB,kBAAkBC;AAAA,IAClB,oBAAoBC;AAAA,IACpB,eAAeC;AAAA,IACf,kBAAkBC;AAAA,IAClB,gBAAgBC;AAAA,IAChB,kBAAkBC;AAAA,IAClB,eAAeC;AAAA,IACf,SAASC;AAAA,IACT,WAAWC;AAAA,IACX,MAAMC;AAAA,IACN,QAAQC;AAAA,EACX;AAKC,WAASb,EAAac,GAAGC,GAAMC,GAAOC,GAAM;AAC1C,QAAIC;AACJ;AACE,MAAAA,IAAItB,EAAE,SAASqB,CAAI;AAAA,WACZH,EAAE,QAAQI,CAAC;AAEpB,WAAAF,EAAM,QAAQD,GACdD,EAAE,QAAQI,GAAGF,CAAK,GACXE;AAAA,EACT;AAMA,WAASjB,EAASa,GAAG;AACnB,QAAIK,IAAa,IAAIrB,EAAK,EAAG,SAASgB,EAAE,OAAO;AAC/C,WAAAlB,EAAE,QAAQkB,EAAE,MAAK,GAAI,SAASI,GAAG;AAAE,MAAAC,EAAW,QAAQD,GAAGJ,EAAE,KAAKI,CAAC,CAAC;AAAA,IAAG,CAAC,GACtEtB,EAAE,QAAQkB,EAAE,MAAK,GAAI,SAAS,GAAG;AAC/B,UAAIM,IAAcD,EAAW,KAAK,EAAE,GAAG,EAAE,CAAC,KAAK,EAAE,QAAQ,GAAG,QAAQ,EAAC,GACjEE,IAAQP,EAAE,KAAK,CAAC;AACpB,MAAAK,EAAW,QAAQ,EAAE,GAAG,EAAE,GAAG;AAAA,QAC3B,QAAQC,EAAY,SAASC,EAAM;AAAA,QACnC,QAAQ,KAAK,IAAID,EAAY,QAAQC,EAAM,MAAM;AAAA,MACxD,CAAM;AAAA,IACH,CAAC,GACMF;AAAA,EACT;AAEA,WAASjB,EAAmBY,GAAG;AAC7B,QAAIK,IAAa,IAAIrB,EAAM,EAAE,YAAYgB,EAAE,aAAY,EAAE,CAAE,EAAE,SAASA,EAAE,MAAK,CAAE;AAC/E,WAAAlB,EAAE,QAAQkB,EAAE,MAAK,GAAI,SAASI,GAAG;AAC/B,MAAKJ,EAAE,SAASI,CAAC,EAAE,UACjBC,EAAW,QAAQD,GAAGJ,EAAE,KAAKI,CAAC,CAAC;AAAA,IAEnC,CAAC,GACDtB,EAAE,QAAQkB,EAAE,MAAK,GAAI,SAAS,GAAG;AAC/B,MAAAK,EAAW,QAAQ,GAAGL,EAAE,KAAK,CAAC,CAAC;AAAA,IACjC,CAAC,GACMK;AAAA,EACT;AAEA,WAAShB,EAAiBW,GAAG;AAC3B,QAAIQ,IAAY1B,EAAE,IAAIkB,EAAE,MAAK,GAAI,SAASI,GAAG;AAC3C,UAAIK,IAAO,CAAA;AACX,aAAA3B,EAAE,QAAQkB,EAAE,SAASI,CAAC,GAAG,SAASM,GAAG;AACnC,QAAAD,EAAKC,EAAE,CAAC,KAAKD,EAAKC,EAAE,CAAC,KAAK,KAAKV,EAAE,KAAKU,CAAC,EAAE;AAAA,MAC3C,CAAC,GACMD;AAAA,IACT,CAAC;AACD,WAAO3B,EAAE,UAAUkB,EAAE,MAAK,GAAIQ,CAAS;AAAA,EACzC;AAEA,WAASlB,EAAmBU,GAAG;AAC7B,QAAIQ,IAAY1B,EAAE,IAAIkB,EAAE,MAAK,GAAI,SAASI,GAAG;AAC3C,UAAIO,IAAQ,CAAA;AACZ,aAAA7B,EAAE,QAAQkB,EAAE,QAAQI,CAAC,GAAG,SAASM,GAAG;AAClC,QAAAC,EAAMD,EAAE,CAAC,KAAKC,EAAMD,EAAE,CAAC,KAAK,KAAKV,EAAE,KAAKU,CAAC,EAAE;AAAA,MAC7C,CAAC,GACMC;AAAA,IACT,CAAC;AACD,WAAO7B,EAAE,UAAUkB,EAAE,MAAK,GAAIQ,CAAS;AAAA,EACzC;AAMA,WAASjB,EAAcqB,GAAMC,GAAO;AAClC,QAAIC,IAAIF,EAAK,GACTG,IAAIH,EAAK,GAITI,IAAKH,EAAM,IAAIC,GACfG,IAAKJ,EAAM,IAAIE,GACfG,IAAIN,EAAK,QAAQ,GACjBO,IAAIP,EAAK,SAAS;AAEtB,QAAI,CAACI,KAAM,CAACC;AACV,YAAM,IAAI,MAAM,2DAA2D;AAG7E,QAAIG,GAAIC;AACR,WAAI,KAAK,IAAIJ,CAAE,IAAIC,IAAI,KAAK,IAAIF,CAAE,IAAIG,KAEhCF,IAAK,MACPE,IAAI,CAACA,IAEPC,IAAKD,IAAIH,IAAKC,GACdI,IAAKF,MAGDH,IAAK,MACPE,IAAI,CAACA,IAEPE,IAAKF,GACLG,IAAKH,IAAID,IAAKD,IAGT,EAAE,GAAGF,IAAIM,GAAI,GAAGL,IAAIM,EAAE;AAAA,EAC/B;AAMA,WAAS7B,EAAiBQ,GAAG;AAC3B,QAAIsB,IAAWxC,EAAE,IAAIA,EAAE,MAAMc,EAAQI,CAAC,IAAI,CAAC,GAAG,WAAW;AAAE,aAAO,CAAA;AAAA,IAAI,CAAC;AACvE,WAAAlB,EAAE,QAAQkB,EAAE,MAAK,GAAI,SAASI,GAAG;AAC/B,UAAImB,IAAOvB,EAAE,KAAKI,CAAC,GACfoB,IAAOD,EAAK;AAChB,MAAKzC,EAAE,YAAY0C,CAAI,MACrBF,EAASE,CAAI,EAAED,EAAK,KAAK,IAAInB;AAAA,IAEjC,CAAC,GACMkB;AAAA,EACT;AAMA,WAAS7B,EAAeO,GAAG;AACzB,QAAIyB,IAAM3C,EAAE,IAAIA,EAAE,IAAIkB,EAAE,MAAK,GAAI,SAASI,GAAG;AAAE,aAAOJ,EAAE,KAAKI,CAAC,EAAE;AAAA,IAAM,CAAC,CAAC;AACxE,IAAAtB,EAAE,QAAQkB,EAAE,MAAK,GAAI,SAASI,GAAG;AAC/B,UAAImB,IAAOvB,EAAE,KAAKI,CAAC;AACnB,MAAItB,EAAE,IAAIyC,GAAM,MAAM,MACpBA,EAAK,QAAQE;AAAA,IAEjB,CAAC;AAAA,EACH;AAEA,WAAS/B,EAAiBM,GAAG;AAE3B,QAAI0B,IAAS5C,EAAE,IAAIA,EAAE,IAAIkB,EAAE,MAAK,GAAI,SAASI,GAAG;AAAE,aAAOJ,EAAE,KAAKI,CAAC,EAAE;AAAA,IAAM,CAAC,CAAC,GAEvEuB,IAAS,CAAA;AACb,IAAA7C,EAAE,QAAQkB,EAAE,MAAK,GAAI,SAASI,GAAG;AAC/B,UAAIoB,IAAOxB,EAAE,KAAKI,CAAC,EAAE,OAAOsB;AAC5B,MAAKC,EAAOH,CAAI,MACdG,EAAOH,CAAI,IAAI,CAAA,IAEjBG,EAAOH,CAAI,EAAE,KAAKpB,CAAC;AAAA,IACrB,CAAC;AAED,QAAIwB,IAAQ,GACRC,IAAiB7B,EAAE,MAAK,EAAG;AAC/B,IAAAlB,EAAE,QAAQ6C,GAAQ,SAASG,GAAIC,GAAG;AAChC,MAAIjD,EAAE,YAAYgD,CAAE,KAAKC,IAAIF,MAAmB,IAC9C,EAAED,IACOA,KACT9C,EAAE,QAAQgD,GAAI,SAAS1B,GAAG;AAAE,QAAAJ,EAAE,KAAKI,CAAC,EAAE,QAAQwB;AAAA,MAAO,CAAC;AAAA,IAE1D,CAAC;AAAA,EACH;AAEA,WAASjC,EAAcK,GAAGgC,GAAQR,GAAMS,GAAO;AAC7C,QAAIV,IAAO;AAAA,MACT,OAAO;AAAA,MACP,QAAQ;AAAA,IACb;AACG,WAAI,UAAU,UAAU,MACtBA,EAAK,OAAOC,GACZD,EAAK,QAAQU,IAER/C,EAAac,GAAG,UAAUuB,GAAMS,CAAM;AAAA,EAC/C;AAEA,WAASpC,EAAQI,GAAG;AAClB,WAAOlB,EAAE,IAAIA,EAAE,IAAIkB,EAAE,MAAK,GAAI,SAASI,GAAG;AACxC,UAAIoB,IAAOxB,EAAE,KAAKI,CAAC,EAAE;AACrB,UAAI,CAACtB,EAAE,YAAY0C,CAAI;AACrB,eAAOA;AAAA,IAEX,CAAC,CAAC;AAAA,EACJ;AAOA,WAAS3B,EAAUqC,GAAYC,GAAI;AACjC,QAAIC,IAAS,EAAE,KAAK,CAAA,GAAI,KAAK,CAAA,EAAE;AAC/B,WAAAtD,EAAE,QAAQoD,GAAY,SAASG,GAAO;AACpC,MAAIF,EAAGE,CAAK,IACVD,EAAO,IAAI,KAAKC,CAAK,IAErBD,EAAO,IAAI,KAAKC,CAAK;AAAA,IAEzB,CAAC,GACMD;AAAA,EACT;AAMA,WAAStC,EAAKK,GAAMgC,GAAI;AACtB,QAAIG,IAAQxD,EAAE,IAAG;AACjB,QAAI;AACF,aAAOqD,EAAE;AAAA,IACX,UAAC;AACC,cAAQ,IAAIhC,IAAO,aAAarB,EAAE,IAAG,IAAKwD,KAAS,IAAI;AAAA,IACzD;AAAA,EACF;AAEA,WAASvC,EAAOI,GAAMgC,GAAI;AACxB,WAAOA,EAAE;AAAA,EACX;AACA,SAAOxD;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/dagre/lib/version.js

@@ -0,0 +1,8 @@
+var r, e;
+function i() {
+  return e || (e = 1, r = "0.8.5"), r;
+}
+export {
+  i as __require
+};
+//# sourceMappingURL=version.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"version.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/dagre/lib/version.js"],"sourcesContent":["var version;\nvar hasRequiredVersion;\n\nfunction requireVersion () {\n\tif (hasRequiredVersion) return version;\n\thasRequiredVersion = 1;\n\tversion = \"0.8.5\";\n\treturn version;\n}\n\nexport { requireVersion as __require };\n//# sourceMappingURL=version.js.map\n"],"names":["version","hasRequiredVersion","requireVersion"],"mappings":"AAAA,IAAIA,GACAC;AAEJ,SAASC,IAAkB;AAC1B,SAAID,MACJA,IAAqB,GACrBD,IAAU,UACHA;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/graphlib/index.js

@@ -0,0 +1,19 @@
+import { __require as a } from "./lib/index.js";
+import { __require as o } from "./lib/json.js";
+import { __require as u } from "./lib/alg/index.js";
+var r, i;
+function n() {
+  if (i) return r;
+  i = 1;
+  var e = a();
+  return r = {
+    Graph: e.Graph,
+    json: o(),
+    alg: u(),
+    version: e.version
+  }, r;
+}
+export {
+  n as __require
+};
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../node_modules/@antv/layout/lib/node_modules/graphlib/index.js"],"sourcesContent":["import { __require as requireLib } from './lib/index.js';\nimport { __require as requireJson } from './lib/json.js';\nimport { __require as requireAlg } from './lib/alg/index.js';\n\n/**\n * Copyright (c) 2014, Chris Pettitt\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and/or other materials provided with the distribution.\n *\n * 3. Neither the name of the copyright holder nor the names of its contributors\n * may be used to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\nvar graphlib;\nvar hasRequiredGraphlib$1;\n\nfunction requireGraphlib$1 () {\n\tif (hasRequiredGraphlib$1) return graphlib;\n\thasRequiredGraphlib$1 = 1;\n\tvar lib = requireLib();\n\n\tgraphlib = {\n\t  Graph: lib.Graph,\n\t  json: requireJson(),\n\t  alg: requireAlg(),\n\t  version: lib.version\n\t};\n\treturn graphlib;\n}\n\nexport { requireGraphlib$1 as __require };\n//# sourceMappingURL=index.js.map\n"],"names":["graphlib","hasRequiredGraphlib$1","requireGraphlib$1","lib","requireLib","requireJson","requireAlg"],"mappings":";;;AAkCA,IAAIA,GACAC;AAEJ,SAASC,IAAqB;AAC7B,MAAID,EAAuB,QAAOD;AAClC,EAAAC,IAAwB;AACxB,MAAIE,IAAMC,EAAU;AAEpB,SAAAJ,IAAW;AAAA,IACT,OAAOG,EAAI;AAAA,IACX,MAAME,EAAW;AAAA,IACjB,KAAKC,EAAU;AAAA,IACf,SAASH,EAAI;AAAA,EAChB,GACQH;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/components.js

@@ -0,0 +1,22 @@
+import { __require as p } from "../lodash.js";
+var t, a;
+function h() {
+  if (a) return t;
+  a = 1;
+  var r = p();
+  t = c;
+  function c(s) {
+    var u = {}, i = [], n;
+    function o(e) {
+      r.has(u, e) || (u[e] = !0, n.push(e), r.each(s.successors(e), o), r.each(s.predecessors(e), o));
+    }
+    return r.each(s.nodes(), function(e) {
+      n = [], o(e), n.length && i.push(n);
+    }), i;
+  }
+  return t;
+}
+export {
+  h as __require
+};
+//# sourceMappingURL=components.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/components.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"components.js","sources":["../../../../../../../../../node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/components.js"],"sourcesContent":["import { __require as requireLodash } from '../lodash.js';\n\nvar components_1;\nvar hasRequiredComponents;\n\nfunction requireComponents () {\n\tif (hasRequiredComponents) return components_1;\n\thasRequiredComponents = 1;\n\tvar _ = requireLodash();\n\n\tcomponents_1 = components;\n\n\tfunction components(g) {\n\t  var visited = {};\n\t  var cmpts = [];\n\t  var cmpt;\n\n\t  function dfs(v) {\n\t    if (_.has(visited, v)) return;\n\t    visited[v] = true;\n\t    cmpt.push(v);\n\t    _.each(g.successors(v), dfs);\n\t    _.each(g.predecessors(v), dfs);\n\t  }\n\n\t  _.each(g.nodes(), function(v) {\n\t    cmpt = [];\n\t    dfs(v);\n\t    if (cmpt.length) {\n\t      cmpts.push(cmpt);\n\t    }\n\t  });\n\n\t  return cmpts;\n\t}\n\treturn components_1;\n}\n\nexport { requireComponents as __require };\n//# sourceMappingURL=components.js.map\n"],"names":["components_1","hasRequiredComponents","requireComponents","_","requireLodash","components","g","visited","cmpts","cmpt","dfs","v"],"mappings":";AAEA,IAAIA,GACAC;AAEJ,SAASC,IAAqB;AAC7B,MAAID,EAAuB,QAAOD;AAClC,EAAAC,IAAwB;AACxB,MAAIE,IAAIC,EAAa;AAErB,EAAAJ,IAAeK;AAEf,WAASA,EAAWC,GAAG;AACrB,QAAIC,IAAU,CAAA,GACVC,IAAQ,CAAA,GACRC;AAEJ,aAASC,EAAIC,GAAG;AACd,MAAIR,EAAE,IAAII,GAASI,CAAC,MACpBJ,EAAQI,CAAC,IAAI,IACbF,EAAK,KAAKE,CAAC,GACXR,EAAE,KAAKG,EAAE,WAAWK,CAAC,GAAGD,CAAG,GAC3BP,EAAE,KAAKG,EAAE,aAAaK,CAAC,GAAGD,CAAG;AAAA,IAC/B;AAEA,WAAAP,EAAE,KAAKG,EAAE,MAAK,GAAI,SAASK,GAAG;AAC5B,MAAAF,IAAO,CAAA,GACPC,EAAIC,CAAC,GACDF,EAAK,UACPD,EAAM,KAAKC,CAAI;AAAA,IAEnB,CAAC,GAEMD;AAAA,EACT;AACA,SAAOR;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/dfs.js

@@ -0,0 +1,27 @@
+import { __require as d } from "../lodash.js";
+var o, t;
+function q() {
+  if (t) return o;
+  t = 1;
+  var s = d();
+  o = c;
+  function c(e, r, i) {
+    s.isArray(r) || (r = [r]);
+    var n = (e.isDirected() ? e.successors : e.neighbors).bind(e), f = [], u = {};
+    return s.each(r, function(a) {
+      if (!e.hasNode(a))
+        throw new Error("Graph does not have node: " + a);
+      h(e, a, i === "post", u, n, f);
+    }), f;
+  }
+  function h(e, r, i, n, f, u) {
+    s.has(n, r) || (n[r] = !0, i || u.push(r), s.each(f(r), function(a) {
+      h(e, a, i, n, f, u);
+    }), i && u.push(r));
+  }
+  return o;
+}
+export {
+  q as __require
+};
+//# sourceMappingURL=dfs.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/dfs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dfs.js","sources":["../../../../../../../../../node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/dfs.js"],"sourcesContent":["import { __require as requireLodash } from '../lodash.js';\n\nvar dfs_1;\nvar hasRequiredDfs;\n\nfunction requireDfs () {\n\tif (hasRequiredDfs) return dfs_1;\n\thasRequiredDfs = 1;\n\tvar _ = requireLodash();\n\n\tdfs_1 = dfs;\n\n\t/*\n\t * A helper that preforms a pre- or post-order traversal on the input graph\n\t * and returns the nodes in the order they were visited. If the graph is\n\t * undirected then this algorithm will navigate using neighbors. If the graph\n\t * is directed then this algorithm will navigate using successors.\n\t *\n\t * Order must be one of \"pre\" or \"post\".\n\t */\n\tfunction dfs(g, vs, order) {\n\t  if (!_.isArray(vs)) {\n\t    vs = [vs];\n\t  }\n\n\t  var navigation = (g.isDirected() ? g.successors : g.neighbors).bind(g);\n\n\t  var acc = [];\n\t  var visited = {};\n\t  _.each(vs, function(v) {\n\t    if (!g.hasNode(v)) {\n\t      throw new Error(\"Graph does not have node: \" + v);\n\t    }\n\n\t    doDfs(g, v, order === \"post\", visited, navigation, acc);\n\t  });\n\t  return acc;\n\t}\n\n\tfunction doDfs(g, v, postorder, visited, navigation, acc) {\n\t  if (!_.has(visited, v)) {\n\t    visited[v] = true;\n\n\t    if (!postorder) { acc.push(v); }\n\t    _.each(navigation(v), function(w) {\n\t      doDfs(g, w, postorder, visited, navigation, acc);\n\t    });\n\t    if (postorder) { acc.push(v); }\n\t  }\n\t}\n\treturn dfs_1;\n}\n\nexport { requireDfs as __require };\n//# sourceMappingURL=dfs.js.map\n"],"names":["dfs_1","hasRequiredDfs","requireDfs","_","requireLodash","dfs","g","vs","order","navigation","acc","visited","v","doDfs","postorder","w"],"mappings":";AAEA,IAAIA,GACAC;AAEJ,SAASC,IAAc;AACtB,MAAID,EAAgB,QAAOD;AAC3B,EAAAC,IAAiB;AACjB,MAAIE,IAAIC,EAAa;AAErB,EAAAJ,IAAQK;AAUR,WAASA,EAAIC,GAAGC,GAAIC,GAAO;AACzB,IAAKL,EAAE,QAAQI,CAAE,MACfA,IAAK,CAACA,CAAE;AAGV,QAAIE,KAAcH,EAAE,eAAeA,EAAE,aAAaA,EAAE,WAAW,KAAKA,CAAC,GAEjEI,IAAM,CAAA,GACNC,IAAU,CAAA;AACd,WAAAR,EAAE,KAAKI,GAAI,SAASK,GAAG;AACrB,UAAI,CAACN,EAAE,QAAQM,CAAC;AACd,cAAM,IAAI,MAAM,+BAA+BA,CAAC;AAGlD,MAAAC,EAAMP,GAAGM,GAAGJ,MAAU,QAAQG,GAASF,GAAYC,CAAG;AAAA,IACxD,CAAC,GACMA;AAAA,EACT;AAEA,WAASG,EAAMP,GAAGM,GAAGE,GAAWH,GAASF,GAAYC,GAAK;AACxD,IAAKP,EAAE,IAAIQ,GAASC,CAAC,MACnBD,EAAQC,CAAC,IAAI,IAERE,KAAaJ,EAAI,KAAKE,CAAC,GAC5BT,EAAE,KAAKM,EAAWG,CAAC,GAAG,SAASG,GAAG;AAChC,MAAAF,EAAMP,GAAGS,GAAGD,GAAWH,GAASF,GAAYC,CAAG;AAAA,IACjD,CAAC,GACGI,KAAaJ,EAAI,KAAKE,CAAC;AAAA,EAE/B;AACA,SAAOZ;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/dijkstra-all.js

@@ -0,0 +1,19 @@
+import { __require as _ } from "./dijkstra.js";
+import { __require as f } from "../lodash.js";
+var r, a;
+function j() {
+  if (a) return r;
+  a = 1;
+  var t = _(), s = f();
+  r = u;
+  function u(e, n, o) {
+    return s.transform(e.nodes(), function(l, i) {
+      l[i] = t(e, i, n, o);
+    }, {});
+  }
+  return r;
+}
+export {
+  j as __require
+};
+//# sourceMappingURL=dijkstra-all.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/dijkstra-all.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dijkstra-all.js","sources":["../../../../../../../../../node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/dijkstra-all.js"],"sourcesContent":["import { __require as requireDijkstra } from './dijkstra.js';\nimport { __require as requireLodash } from '../lodash.js';\n\nvar dijkstraAll_1;\nvar hasRequiredDijkstraAll;\n\nfunction requireDijkstraAll () {\n\tif (hasRequiredDijkstraAll) return dijkstraAll_1;\n\thasRequiredDijkstraAll = 1;\n\tvar dijkstra = requireDijkstra();\n\tvar _ = requireLodash();\n\n\tdijkstraAll_1 = dijkstraAll;\n\n\tfunction dijkstraAll(g, weightFunc, edgeFunc) {\n\t  return _.transform(g.nodes(), function(acc, v) {\n\t    acc[v] = dijkstra(g, v, weightFunc, edgeFunc);\n\t  }, {});\n\t}\n\treturn dijkstraAll_1;\n}\n\nexport { requireDijkstraAll as __require };\n//# sourceMappingURL=dijkstra-all.js.map\n"],"names":["dijkstraAll_1","hasRequiredDijkstraAll","requireDijkstraAll","dijkstra","requireDijkstra","_","requireLodash","dijkstraAll","g","weightFunc","edgeFunc","acc","v"],"mappings":";;AAGA,IAAIA,GACAC;AAEJ,SAASC,IAAsB;AAC9B,MAAID,EAAwB,QAAOD;AACnC,EAAAC,IAAyB;AACzB,MAAIE,IAAWC,EAAe,GAC1BC,IAAIC,EAAa;AAErB,EAAAN,IAAgBO;AAEhB,WAASA,EAAYC,GAAGC,GAAYC,GAAU;AAC5C,WAAOL,EAAE,UAAUG,EAAE,MAAK,GAAI,SAASG,GAAKC,GAAG;AAC7C,MAAAD,EAAIC,CAAC,IAAIT,EAASK,GAAGI,GAAGH,GAAYC,CAAQ;AAAA,IAC9C,GAAG,CAAA,CAAE;AAAA,EACP;AACA,SAAOV;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/dijkstra.js

@@ -0,0 +1,39 @@
+import { __require as m } from "../lodash.js";
+import { __require as j } from "../data/priority-queue.js";
+var _, I;
+function b() {
+  if (I) return _;
+  I = 1;
+  var h = m(), w = j();
+  _ = q;
+  var E = h.constant(1);
+  function q(a, s, u, o) {
+    return N(
+      a,
+      String(s),
+      u || E,
+      o || function(e) {
+        return a.outEdges(e);
+      }
+    );
+  }
+  function N(a, s, u, o) {
+    var e = {}, n = new w(), i, d, k = function(r) {
+      var t = r.v !== i ? r.v : r.w, c = e[t], v = u(r), f = d.distance + v;
+      if (v < 0)
+        throw new Error("dijkstra does not allow negative edge weights. Bad edge: " + r + " Weight: " + v);
+      f < c.distance && (c.distance = f, c.predecessor = i, n.decrease(t, f));
+    };
+    for (a.nodes().forEach(function(r) {
+      var t = r === s ? 0 : Number.POSITIVE_INFINITY;
+      e[r] = { distance: t }, n.add(r, t);
+    }); n.size() > 0 && (i = n.removeMin(), d = e[i], d.distance !== Number.POSITIVE_INFINITY); )
+      o(i).forEach(k);
+    return e;
+  }
+  return _;
+}
+export {
+  b as __require
+};
+//# sourceMappingURL=dijkstra.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/dijkstra.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dijkstra.js","sources":["../../../../../../../../../node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/dijkstra.js"],"sourcesContent":["import { __require as requireLodash } from '../lodash.js';\nimport { __require as requirePriorityQueue } from '../data/priority-queue.js';\n\nvar dijkstra_1;\nvar hasRequiredDijkstra;\n\nfunction requireDijkstra () {\n\tif (hasRequiredDijkstra) return dijkstra_1;\n\thasRequiredDijkstra = 1;\n\tvar _ = requireLodash();\n\tvar PriorityQueue = requirePriorityQueue();\n\n\tdijkstra_1 = dijkstra;\n\n\tvar DEFAULT_WEIGHT_FUNC = _.constant(1);\n\n\tfunction dijkstra(g, source, weightFn, edgeFn) {\n\t  return runDijkstra(g, String(source),\n\t    weightFn || DEFAULT_WEIGHT_FUNC,\n\t    edgeFn || function(v) { return g.outEdges(v); });\n\t}\n\n\tfunction runDijkstra(g, source, weightFn, edgeFn) {\n\t  var results = {};\n\t  var pq = new PriorityQueue();\n\t  var v, vEntry;\n\n\t  var updateNeighbors = function(edge) {\n\t    var w = edge.v !== v ? edge.v : edge.w;\n\t    var wEntry = results[w];\n\t    var weight = weightFn(edge);\n\t    var distance = vEntry.distance + weight;\n\n\t    if (weight < 0) {\n\t      throw new Error(\"dijkstra does not allow negative edge weights. \" +\n\t                      \"Bad edge: \" + edge + \" Weight: \" + weight);\n\t    }\n\n\t    if (distance < wEntry.distance) {\n\t      wEntry.distance = distance;\n\t      wEntry.predecessor = v;\n\t      pq.decrease(w, distance);\n\t    }\n\t  };\n\n\t  g.nodes().forEach(function(v) {\n\t    var distance = v === source ? 0 : Number.POSITIVE_INFINITY;\n\t    results[v] = { distance: distance };\n\t    pq.add(v, distance);\n\t  });\n\n\t  while (pq.size() > 0) {\n\t    v = pq.removeMin();\n\t    vEntry = results[v];\n\t    if (vEntry.distance === Number.POSITIVE_INFINITY) {\n\t      break;\n\t    }\n\n\t    edgeFn(v).forEach(updateNeighbors);\n\t  }\n\n\t  return results;\n\t}\n\treturn dijkstra_1;\n}\n\nexport { requireDijkstra as __require };\n//# sourceMappingURL=dijkstra.js.map\n"],"names":["dijkstra_1","hasRequiredDijkstra","requireDijkstra","_","requireLodash","PriorityQueue","requirePriorityQueue","dijkstra","DEFAULT_WEIGHT_FUNC","g","source","weightFn","edgeFn","runDijkstra","v","results","pq","vEntry","updateNeighbors","edge","w","wEntry","weight","distance"],"mappings":";;AAGA,IAAIA,GACAC;AAEJ,SAASC,IAAmB;AAC3B,MAAID,EAAqB,QAAOD;AAChC,EAAAC,IAAsB;AACtB,MAAIE,IAAIC,EAAa,GACjBC,IAAgBC,EAAoB;AAExC,EAAAN,IAAaO;AAEb,MAAIC,IAAsBL,EAAE,SAAS,CAAC;AAEtC,WAASI,EAASE,GAAGC,GAAQC,GAAUC,GAAQ;AAC7C,WAAOC;AAAA,MAAYJ;AAAA,MAAG,OAAOC,CAAM;AAAA,MACjCC,KAAYH;AAAA,MACZI,KAAU,SAASE,GAAG;AAAE,eAAOL,EAAE,SAASK,CAAC;AAAA,MAAG;AAAA,IAAC;AAAA,EACnD;AAEA,WAASD,EAAYJ,GAAGC,GAAQC,GAAUC,GAAQ;AAChD,QAAIG,IAAU,CAAA,GACVC,IAAK,IAAIX,EAAa,GACtBS,GAAGG,GAEHC,IAAkB,SAASC,GAAM;AACnC,UAAIC,IAAID,EAAK,MAAML,IAAIK,EAAK,IAAIA,EAAK,GACjCE,IAASN,EAAQK,CAAC,GAClBE,IAASX,EAASQ,CAAI,GACtBI,IAAWN,EAAO,WAAWK;AAEjC,UAAIA,IAAS;AACX,cAAM,IAAI,MAAM,8DACeH,IAAO,cAAcG,CAAM;AAG5D,MAAIC,IAAWF,EAAO,aACpBA,EAAO,WAAWE,GAClBF,EAAO,cAAcP,GACrBE,EAAG,SAASI,GAAGG,CAAQ;AAAA,IAE3B;AAQA,SANAd,EAAE,MAAK,EAAG,QAAQ,SAASK,GAAG;AAC5B,UAAIS,IAAWT,MAAMJ,IAAS,IAAI,OAAO;AACzC,MAAAK,EAAQD,CAAC,IAAI,EAAE,UAAUS,EAAQ,GACjCP,EAAG,IAAIF,GAAGS,CAAQ;AAAA,IACpB,CAAC,GAEMP,EAAG,KAAI,IAAK,MACjBF,IAAIE,EAAG,UAAS,GAChBC,IAASF,EAAQD,CAAC,GACdG,EAAO,aAAa,OAAO;AAI/B,MAAAL,EAAOE,CAAC,EAAE,QAAQI,CAAe;AAGnC,WAAOH;AAAA,EACT;AACA,SAAOf;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/find-cycles.js

@@ -0,0 +1,19 @@
+import { __require as s } from "../lodash.js";
+import { __require as f } from "./tarjan.js";
+var e, n;
+function d() {
+  if (n) return e;
+  n = 1;
+  var a = s(), u = f();
+  e = t;
+  function t(i) {
+    return a.filter(u(i), function(r) {
+      return r.length > 1 || r.length === 1 && i.hasEdge(r[0], r[0]);
+    });
+  }
+  return e;
+}
+export {
+  d as __require
+};
+//# sourceMappingURL=find-cycles.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/find-cycles.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"find-cycles.js","sources":["../../../../../../../../../node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/find-cycles.js"],"sourcesContent":["import { __require as requireLodash } from '../lodash.js';\nimport { __require as requireTarjan } from './tarjan.js';\n\nvar findCycles_1;\nvar hasRequiredFindCycles;\n\nfunction requireFindCycles () {\n\tif (hasRequiredFindCycles) return findCycles_1;\n\thasRequiredFindCycles = 1;\n\tvar _ = requireLodash();\n\tvar tarjan = requireTarjan();\n\n\tfindCycles_1 = findCycles;\n\n\tfunction findCycles(g) {\n\t  return _.filter(tarjan(g), function(cmpt) {\n\t    return cmpt.length > 1 || (cmpt.length === 1 && g.hasEdge(cmpt[0], cmpt[0]));\n\t  });\n\t}\n\treturn findCycles_1;\n}\n\nexport { requireFindCycles as __require };\n//# sourceMappingURL=find-cycles.js.map\n"],"names":["findCycles_1","hasRequiredFindCycles","requireFindCycles","_","requireLodash","tarjan","requireTarjan","findCycles","g","cmpt"],"mappings":";;AAGA,IAAIA,GACAC;AAEJ,SAASC,IAAqB;AAC7B,MAAID,EAAuB,QAAOD;AAClC,EAAAC,IAAwB;AACxB,MAAIE,IAAIC,EAAa,GACjBC,IAASC,EAAa;AAE1B,EAAAN,IAAeO;AAEf,WAASA,EAAWC,GAAG;AACrB,WAAOL,EAAE,OAAOE,EAAOG,CAAC,GAAG,SAASC,GAAM;AACxC,aAAOA,EAAK,SAAS,KAAMA,EAAK,WAAW,KAAKD,EAAE,QAAQC,EAAK,CAAC,GAAGA,EAAK,CAAC,CAAC;AAAA,IAC5E,CAAC;AAAA,EACH;AACA,SAAOT;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/graphlib/lib/alg/floyd-warshall.js

@@ -0,0 +1,43 @@
+import { __require as p } from "../lodash.js";
+var f, E;
+function y() {
+  if (E) return f;
+  E = 1;
+  var _ = p();
+  f = I;
+  var v = _.constant(1);
+  function I(e, i, s) {
+    return F(
+      e,
+      i || v,
+      s || function(a) {
+        return e.outEdges(a);
+      }
+    );
+  }
+  function F(e, i, s) {
+    var a = {}, o = e.nodes();
+    return o.forEach(function(r) {
+      a[r] = {}, a[r][r] = { distance: 0 }, o.forEach(function(n) {
+        r !== n && (a[r][n] = { distance: Number.POSITIVE_INFINITY });
+      }), s(r).forEach(function(n) {
+        var c = n.v === r ? n.w : n.v, t = i(n);
+        a[r][c] = { distance: t, predecessor: r };
+      });
+    }), o.forEach(function(r) {
+      var n = a[r];
+      o.forEach(function(c) {
+        var t = a[c];
+        o.forEach(function(d) {
+          var W = t[r], l = n[d], u = t[d], h = W.distance + l.distance;
+          h < u.distance && (u.distance = h, u.predecessor = l.predecessor);
+        });
+      });
+    }), a;
+  }
+  return f;
+}
+export {
+  y as __require
+};
+//# sourceMappingURL=floyd-warshall.js.map