@hkyhy/marsun-components-core 0.1.113 → 0.1.114

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

@@ -0,0 +1,22 @@
+import { __require as u } from "./lib/graphlib.js";
+import { __require as o } from "./lib/layout.js";
+import { __require as t } from "./lib/debug.js";
+import { __require as e } from "./lib/util.js";
+import { __require as a } from "./lib/version.js";
+var r, i;
+function p() {
+  return i || (i = 1, r = {
+    graphlib: u(),
+    layout: o(),
+    debug: t(),
+    util: {
+      time: e().time,
+      notime: e().notime
+    },
+    version: a()
+  }), r;
+}
+export {
+  p as __require
+};
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../node_modules/@antv/layout/lib/node_modules/dagre/index.js"],"sourcesContent":["import { __require as requireGraphlib } from './lib/graphlib.js';\nimport { __require as requireLayout } from './lib/layout.js';\nimport { __require as requireDebug } from './lib/debug.js';\nimport { __require as requireUtil } from './lib/util.js';\nimport { __require as requireVersion } from './lib/version.js';\n\n/*\nCopyright (c) 2012-2014 Chris Pettitt\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n*/\n\nvar dagre$1;\nvar hasRequiredDagre;\n\nfunction requireDagre () {\n\tif (hasRequiredDagre) return dagre$1;\n\thasRequiredDagre = 1;\n\tdagre$1 = {\n\t  graphlib: requireGraphlib(),\n\n\t  layout: requireLayout(),\n\t  debug: requireDebug(),\n\t  util: {\n\t    time: requireUtil().time,\n\t    notime: requireUtil().notime\n\t  },\n\t  version: requireVersion()\n\t};\n\treturn dagre$1;\n}\n\nexport { requireDagre as __require };\n//# sourceMappingURL=index.js.map\n"],"names":["dagre$1","hasRequiredDagre","requireDagre","requireGraphlib","requireLayout","requireDebug","requireUtil","requireVersion"],"mappings":";;;;;AA4BA,IAAIA,GACAC;AAEJ,SAASC,IAAgB;AACxB,SAAID,MACJA,IAAmB,GACnBD,IAAU;AAAA,IACR,UAAUG,EAAe;AAAA,IAEzB,QAAQC,EAAa;AAAA,IACrB,OAAOC,EAAY;AAAA,IACnB,MAAM;AAAA,MACJ,MAAMC,EAAW,EAAG;AAAA,MACpB,QAAQA,EAAW,EAAG;AAAA,IAC3B;AAAA,IACG,SAASC,EAAc;AAAA,EAC1B,IACQP;AACR;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,48 @@
+import { __require as l } from "./lodash.js";
+import { __require as m } from "./greedy-fas.js";
+var o, c;
+function q() {
+  if (c) return o;
+  c = 1;
+  var i = l(), f = m();
+  o = {
+    run: s,
+    undo: h
+  };
+  function s(e) {
+    var n = e.graph().acyclicer === "greedy" ? f(e, a(e)) : v(e);
+    i.forEach(n, function(r) {
+      var u = e.edge(r);
+      e.removeEdge(r), u.forwardName = r.name, u.reversed = !0, e.setEdge(r.w, r.v, u, i.uniqueId("rev"));
+    });
+    function a(r) {
+      return function(u) {
+        return r.edge(u).weight;
+      };
+    }
+  }
+  function v(e) {
+    var n = [], a = {}, r = {};
+    function u(t) {
+      i.has(r, t) || (r[t] = !0, a[t] = !0, i.forEach(e.outEdges(t), function(d) {
+        i.has(a, d.w) ? n.push(d) : u(d.w);
+      }), delete a[t]);
+    }
+    return i.forEach(e.nodes(), u), n;
+  }
+  function h(e) {
+    i.forEach(e.edges(), function(n) {
+      var a = e.edge(n);
+      if (a.reversed) {
+        e.removeEdge(n);
+        var r = a.forwardName;
+        delete a.reversed, delete a.forwardName, e.setEdge(n.w, n.v, a, r);
+      }
+    });
+  }
+  return o;
+}
+export {
+  q as __require
+};
+//# sourceMappingURL=acyclic.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"acyclic.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/dagre/lib/acyclic.js"],"sourcesContent":["import { __require as requireLodash } from './lodash.js';\nimport { __require as requireGreedyFas } from './greedy-fas.js';\n\nvar acyclic;\nvar hasRequiredAcyclic;\n\nfunction requireAcyclic () {\n\tif (hasRequiredAcyclic) return acyclic;\n\thasRequiredAcyclic = 1;\n\n\tvar _ = requireLodash();\n\tvar greedyFAS = requireGreedyFas();\n\n\tacyclic = {\n\t  run: run,\n\t  undo: undo\n\t};\n\n\tfunction run(g) {\n\t  var fas = (g.graph().acyclicer === \"greedy\"\n\t    ? greedyFAS(g, weightFn(g))\n\t    : dfsFAS(g));\n\t  _.forEach(fas, function(e) {\n\t    var label = g.edge(e);\n\t    g.removeEdge(e);\n\t    label.forwardName = e.name;\n\t    label.reversed = true;\n\t    g.setEdge(e.w, e.v, label, _.uniqueId(\"rev\"));\n\t  });\n\n\t  function weightFn(g) {\n\t    return function(e) {\n\t      return g.edge(e).weight;\n\t    };\n\t  }\n\t}\n\n\tfunction dfsFAS(g) {\n\t  var fas = [];\n\t  var stack = {};\n\t  var visited = {};\n\n\t  function dfs(v) {\n\t    if (_.has(visited, v)) {\n\t      return;\n\t    }\n\t    visited[v] = true;\n\t    stack[v] = true;\n\t    _.forEach(g.outEdges(v), function(e) {\n\t      if (_.has(stack, e.w)) {\n\t        fas.push(e);\n\t      } else {\n\t        dfs(e.w);\n\t      }\n\t    });\n\t    delete stack[v];\n\t  }\n\n\t  _.forEach(g.nodes(), dfs);\n\t  return fas;\n\t}\n\n\tfunction undo(g) {\n\t  _.forEach(g.edges(), function(e) {\n\t    var label = g.edge(e);\n\t    if (label.reversed) {\n\t      g.removeEdge(e);\n\n\t      var forwardName = label.forwardName;\n\t      delete label.reversed;\n\t      delete label.forwardName;\n\t      g.setEdge(e.w, e.v, label, forwardName);\n\t    }\n\t  });\n\t}\n\treturn acyclic;\n}\n\nexport { requireAcyclic as __require };\n//# sourceMappingURL=acyclic.js.map\n"],"names":["acyclic","hasRequiredAcyclic","requireAcyclic","_","requireLodash","greedyFAS","requireGreedyFas","run","undo","g","fas","weightFn","dfsFAS","e","label","stack","visited","dfs","v","forwardName"],"mappings":";;AAGA,IAAIA,GACAC;AAEJ,SAASC,IAAkB;AAC1B,MAAID,EAAoB,QAAOD;AAC/B,EAAAC,IAAqB;AAErB,MAAIE,IAAIC,EAAa,GACjBC,IAAYC,EAAgB;AAEhC,EAAAN,IAAU;AAAA,IACR,KAAKO;AAAA,IACL,MAAMC;AAAA,EACT;AAEC,WAASD,EAAIE,GAAG;AACd,QAAIC,IAAOD,EAAE,MAAK,EAAG,cAAc,WAC/BJ,EAAUI,GAAGE,EAASF,CAAC,CAAC,IACxBG,EAAOH,CAAC;AACZ,IAAAN,EAAE,QAAQO,GAAK,SAASG,GAAG;AACzB,UAAIC,IAAQL,EAAE,KAAKI,CAAC;AACpB,MAAAJ,EAAE,WAAWI,CAAC,GACdC,EAAM,cAAcD,EAAE,MACtBC,EAAM,WAAW,IACjBL,EAAE,QAAQI,EAAE,GAAGA,EAAE,GAAGC,GAAOX,EAAE,SAAS,KAAK,CAAC;AAAA,IAC9C,CAAC;AAED,aAASQ,EAASF,GAAG;AACnB,aAAO,SAASI,GAAG;AACjB,eAAOJ,EAAE,KAAKI,CAAC,EAAE;AAAA,MACnB;AAAA,IACF;AAAA,EACF;AAEA,WAASD,EAAOH,GAAG;AACjB,QAAIC,IAAM,CAAA,GACNK,IAAQ,CAAA,GACRC,IAAU,CAAA;AAEd,aAASC,EAAIC,GAAG;AACd,MAAIf,EAAE,IAAIa,GAASE,CAAC,MAGpBF,EAAQE,CAAC,IAAI,IACbH,EAAMG,CAAC,IAAI,IACXf,EAAE,QAAQM,EAAE,SAASS,CAAC,GAAG,SAASL,GAAG;AACnC,QAAIV,EAAE,IAAIY,GAAOF,EAAE,CAAC,IAClBH,EAAI,KAAKG,CAAC,IAEVI,EAAIJ,EAAE,CAAC;AAAA,MAEX,CAAC,GACD,OAAOE,EAAMG,CAAC;AAAA,IAChB;AAEA,WAAAf,EAAE,QAAQM,EAAE,MAAK,GAAIQ,CAAG,GACjBP;AAAA,EACT;AAEA,WAASF,EAAKC,GAAG;AACf,IAAAN,EAAE,QAAQM,EAAE,MAAK,GAAI,SAASI,GAAG;AAC/B,UAAIC,IAAQL,EAAE,KAAKI,CAAC;AACpB,UAAIC,EAAM,UAAU;AAClB,QAAAL,EAAE,WAAWI,CAAC;AAEd,YAAIM,IAAcL,EAAM;AACxB,eAAOA,EAAM,UACb,OAAOA,EAAM,aACbL,EAAE,QAAQI,EAAE,GAAGA,EAAE,GAAGC,GAAOK,CAAW;AAAA,MACxC;AAAA,IACF,CAAC;AAAA,EACH;AACA,SAAOnB;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/dagre/lib/add-border-segments.js

@@ -0,0 +1,29 @@
+import { __require as b } from "./lodash.js";
+import { __require as l } from "./util.js";
+var u, s;
+function R() {
+  if (s) return u;
+  s = 1;
+  var a = b(), c = l();
+  u = _;
+  function _(e) {
+    function i(t) {
+      var o = e.children(t), r = e.node(t);
+      if (o.length && a.forEach(o, i), a.has(r, "minRank")) {
+        r.borderLeft = [], r.borderRight = [];
+        for (var d = r.minRank, n = r.maxRank + 1; d < n; ++d)
+          h(e, "borderLeft", "_bl", t, r, d), h(e, "borderRight", "_br", t, r, d);
+      }
+    }
+    a.forEach(e.children(), i);
+  }
+  function h(e, i, t, o, r, d) {
+    var n = { width: 0, height: 0, rank: d, borderType: i }, m = r[i][d - 1], f = c.addDummyNode(e, "border", n, t);
+    r[i][d] = f, e.setParent(f, o), m && e.setEdge(m, f, { weight: 1 });
+  }
+  return u;
+}
+export {
+  R as __require
+};
+//# sourceMappingURL=add-border-segments.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/dagre/lib/add-border-segments.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"add-border-segments.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/dagre/lib/add-border-segments.js"],"sourcesContent":["import { __require as requireLodash } from './lodash.js';\nimport { __require as requireUtil } from './util.js';\n\nvar addBorderSegments_1;\nvar hasRequiredAddBorderSegments;\n\nfunction requireAddBorderSegments () {\n\tif (hasRequiredAddBorderSegments) return addBorderSegments_1;\n\thasRequiredAddBorderSegments = 1;\n\tvar _ = requireLodash();\n\tvar util = requireUtil();\n\n\taddBorderSegments_1 = addBorderSegments;\n\n\tfunction addBorderSegments(g) {\n\t  function dfs(v) {\n\t    var children = g.children(v);\n\t    var node = g.node(v);\n\t    if (children.length) {\n\t      _.forEach(children, dfs);\n\t    }\n\n\t    if (_.has(node, \"minRank\")) {\n\t      node.borderLeft = [];\n\t      node.borderRight = [];\n\t      for (var rank = node.minRank, maxRank = node.maxRank + 1;\n\t        rank < maxRank;\n\t        ++rank) {\n\t        addBorderNode(g, \"borderLeft\", \"_bl\", v, node, rank);\n\t        addBorderNode(g, \"borderRight\", \"_br\", v, node, rank);\n\t      }\n\t    }\n\t  }\n\n\t  _.forEach(g.children(), dfs);\n\t}\n\n\tfunction addBorderNode(g, prop, prefix, sg, sgNode, rank) {\n\t  var label = { width: 0, height: 0, rank: rank, borderType: prop };\n\t  var prev = sgNode[prop][rank - 1];\n\t  var curr = util.addDummyNode(g, \"border\", label, prefix);\n\t  sgNode[prop][rank] = curr;\n\t  g.setParent(curr, sg);\n\t  if (prev) {\n\t    g.setEdge(prev, curr, { weight: 1 });\n\t  }\n\t}\n\treturn addBorderSegments_1;\n}\n\nexport { requireAddBorderSegments as __require };\n//# sourceMappingURL=add-border-segments.js.map\n"],"names":["addBorderSegments_1","hasRequiredAddBorderSegments","requireAddBorderSegments","_","requireLodash","util","requireUtil","addBorderSegments","g","dfs","v","children","node","rank","maxRank","addBorderNode","prop","prefix","sg","sgNode","label","prev","curr"],"mappings":";;AAGA,IAAIA,GACAC;AAEJ,SAASC,IAA4B;AACpC,MAAID,EAA8B,QAAOD;AACzC,EAAAC,IAA+B;AAC/B,MAAIE,IAAIC,EAAa,GACjBC,IAAOC,EAAW;AAEtB,EAAAN,IAAsBO;AAEtB,WAASA,EAAkBC,GAAG;AAC5B,aAASC,EAAIC,GAAG;AACd,UAAIC,IAAWH,EAAE,SAASE,CAAC,GACvBE,IAAOJ,EAAE,KAAKE,CAAC;AAKnB,UAJIC,EAAS,UACXR,EAAE,QAAQQ,GAAUF,CAAG,GAGrBN,EAAE,IAAIS,GAAM,SAAS,GAAG;AAC1B,QAAAA,EAAK,aAAa,CAAA,GAClBA,EAAK,cAAc,CAAA;AACnB,iBAASC,IAAOD,EAAK,SAASE,IAAUF,EAAK,UAAU,GACrDC,IAAOC,GACP,EAAED;AACF,UAAAE,EAAcP,GAAG,cAAc,OAAOE,GAAGE,GAAMC,CAAI,GACnDE,EAAcP,GAAG,eAAe,OAAOE,GAAGE,GAAMC,CAAI;AAAA,MAExD;AAAA,IACF;AAEA,IAAAV,EAAE,QAAQK,EAAE,SAAQ,GAAIC,CAAG;AAAA,EAC7B;AAEA,WAASM,EAAcP,GAAGQ,GAAMC,GAAQC,GAAIC,GAAQN,GAAM;AACxD,QAAIO,IAAQ,EAAE,OAAO,GAAG,QAAQ,GAAG,MAAMP,GAAM,YAAYG,EAAI,GAC3DK,IAAOF,EAAOH,CAAI,EAAEH,IAAO,CAAC,GAC5BS,IAAOjB,EAAK,aAAaG,GAAG,UAAUY,GAAOH,CAAM;AACvD,IAAAE,EAAOH,CAAI,EAAEH,CAAI,IAAIS,GACrBd,EAAE,UAAUc,GAAMJ,CAAE,GAChBG,KACFb,EAAE,QAAQa,GAAMC,GAAM,EAAE,QAAQ,GAAG;AAAA,EAEvC;AACA,SAAOtB;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/dagre/lib/coordinate-system.js

@@ -0,0 +1,58 @@
+import { __require as p } from "./lodash.js";
+var f, u;
+function y() {
+  if (u) return f;
+  u = 1;
+  var r = p();
+  f = {
+    adjust: c,
+    undo: h
+  };
+  function c(e) {
+    var n = e.graph().rankdir.toLowerCase();
+    (n === "lr" || n === "rl") && d(e);
+  }
+  function h(e) {
+    var n = e.graph().rankdir.toLowerCase();
+    (n === "bt" || n === "rl") && s(e), (n === "lr" || n === "rl") && (v(e), d(e));
+  }
+  function d(e) {
+    r.forEach(e.nodes(), function(n) {
+      t(e.node(n));
+    }), r.forEach(e.edges(), function(n) {
+      t(e.edge(n));
+    });
+  }
+  function t(e) {
+    var n = e.width;
+    e.width = e.height, e.height = n;
+  }
+  function s(e) {
+    r.forEach(e.nodes(), function(n) {
+      i(e.node(n));
+    }), r.forEach(e.edges(), function(n) {
+      var o = e.edge(n);
+      r.forEach(o.points, i), r.has(o, "y") && i(o);
+    });
+  }
+  function i(e) {
+    e.y = -e.y;
+  }
+  function v(e) {
+    r.forEach(e.nodes(), function(n) {
+      a(e.node(n));
+    }), r.forEach(e.edges(), function(n) {
+      var o = e.edge(n);
+      r.forEach(o.points, a), r.has(o, "x") && a(o);
+    });
+  }
+  function a(e) {
+    var n = e.x;
+    e.x = e.y, e.y = n;
+  }
+  return f;
+}
+export {
+  y as __require
+};
+//# sourceMappingURL=coordinate-system.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/dagre/lib/coordinate-system.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"coordinate-system.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/dagre/lib/coordinate-system.js"],"sourcesContent":["import { __require as requireLodash } from './lodash.js';\n\nvar coordinateSystem;\nvar hasRequiredCoordinateSystem;\n\nfunction requireCoordinateSystem () {\n\tif (hasRequiredCoordinateSystem) return coordinateSystem;\n\thasRequiredCoordinateSystem = 1;\n\n\tvar _ = requireLodash();\n\n\tcoordinateSystem = {\n\t  adjust: adjust,\n\t  undo: undo\n\t};\n\n\tfunction adjust(g) {\n\t  var rankDir = g.graph().rankdir.toLowerCase();\n\t  if (rankDir === \"lr\" || rankDir === \"rl\") {\n\t    swapWidthHeight(g);\n\t  }\n\t}\n\n\tfunction undo(g) {\n\t  var rankDir = g.graph().rankdir.toLowerCase();\n\t  if (rankDir === \"bt\" || rankDir === \"rl\") {\n\t    reverseY(g);\n\t  }\n\n\t  if (rankDir === \"lr\" || rankDir === \"rl\") {\n\t    swapXY(g);\n\t    swapWidthHeight(g);\n\t  }\n\t}\n\n\tfunction swapWidthHeight(g) {\n\t  _.forEach(g.nodes(), function(v) { swapWidthHeightOne(g.node(v)); });\n\t  _.forEach(g.edges(), function(e) { swapWidthHeightOne(g.edge(e)); });\n\t}\n\n\tfunction swapWidthHeightOne(attrs) {\n\t  var w = attrs.width;\n\t  attrs.width = attrs.height;\n\t  attrs.height = w;\n\t}\n\n\tfunction reverseY(g) {\n\t  _.forEach(g.nodes(), function(v) { reverseYOne(g.node(v)); });\n\n\t  _.forEach(g.edges(), function(e) {\n\t    var edge = g.edge(e);\n\t    _.forEach(edge.points, reverseYOne);\n\t    if (_.has(edge, \"y\")) {\n\t      reverseYOne(edge);\n\t    }\n\t  });\n\t}\n\n\tfunction reverseYOne(attrs) {\n\t  attrs.y = -attrs.y;\n\t}\n\n\tfunction swapXY(g) {\n\t  _.forEach(g.nodes(), function(v) { swapXYOne(g.node(v)); });\n\n\t  _.forEach(g.edges(), function(e) {\n\t    var edge = g.edge(e);\n\t    _.forEach(edge.points, swapXYOne);\n\t    if (_.has(edge, \"x\")) {\n\t      swapXYOne(edge);\n\t    }\n\t  });\n\t}\n\n\tfunction swapXYOne(attrs) {\n\t  var x = attrs.x;\n\t  attrs.x = attrs.y;\n\t  attrs.y = x;\n\t}\n\treturn coordinateSystem;\n}\n\nexport { requireCoordinateSystem as __require };\n//# sourceMappingURL=coordinate-system.js.map\n"],"names":["coordinateSystem","hasRequiredCoordinateSystem","requireCoordinateSystem","_","requireLodash","adjust","undo","g","rankDir","swapWidthHeight","reverseY","swapXY","v","swapWidthHeightOne","e","attrs","w","reverseYOne","edge","swapXYOne","x"],"mappings":";AAEA,IAAIA,GACAC;AAEJ,SAASC,IAA2B;AACnC,MAAID,EAA6B,QAAOD;AACxC,EAAAC,IAA8B;AAE9B,MAAIE,IAAIC,EAAa;AAErB,EAAAJ,IAAmB;AAAA,IACjB,QAAQK;AAAA,IACR,MAAMC;AAAA,EACT;AAEC,WAASD,EAAOE,GAAG;AACjB,QAAIC,IAAUD,EAAE,MAAK,EAAG,QAAQ,YAAW;AAC3C,KAAIC,MAAY,QAAQA,MAAY,SAClCC,EAAgBF,CAAC;AAAA,EAErB;AAEA,WAASD,EAAKC,GAAG;AACf,QAAIC,IAAUD,EAAE,MAAK,EAAG,QAAQ,YAAW;AAC3C,KAAIC,MAAY,QAAQA,MAAY,SAClCE,EAASH,CAAC,IAGRC,MAAY,QAAQA,MAAY,UAClCG,EAAOJ,CAAC,GACRE,EAAgBF,CAAC;AAAA,EAErB;AAEA,WAASE,EAAgBF,GAAG;AAC1B,IAAAJ,EAAE,QAAQI,EAAE,MAAK,GAAI,SAASK,GAAG;AAAE,MAAAC,EAAmBN,EAAE,KAAKK,CAAC,CAAC;AAAA,IAAG,CAAC,GACnET,EAAE,QAAQI,EAAE,MAAK,GAAI,SAASO,GAAG;AAAE,MAAAD,EAAmBN,EAAE,KAAKO,CAAC,CAAC;AAAA,IAAG,CAAC;AAAA,EACrE;AAEA,WAASD,EAAmBE,GAAO;AACjC,QAAIC,IAAID,EAAM;AACd,IAAAA,EAAM,QAAQA,EAAM,QACpBA,EAAM,SAASC;AAAA,EACjB;AAEA,WAASN,EAASH,GAAG;AACnB,IAAAJ,EAAE,QAAQI,EAAE,MAAK,GAAI,SAASK,GAAG;AAAE,MAAAK,EAAYV,EAAE,KAAKK,CAAC,CAAC;AAAA,IAAG,CAAC,GAE5DT,EAAE,QAAQI,EAAE,MAAK,GAAI,SAASO,GAAG;AAC/B,UAAII,IAAOX,EAAE,KAAKO,CAAC;AACnB,MAAAX,EAAE,QAAQe,EAAK,QAAQD,CAAW,GAC9Bd,EAAE,IAAIe,GAAM,GAAG,KACjBD,EAAYC,CAAI;AAAA,IAEpB,CAAC;AAAA,EACH;AAEA,WAASD,EAAYF,GAAO;AAC1B,IAAAA,EAAM,IAAI,CAACA,EAAM;AAAA,EACnB;AAEA,WAASJ,EAAOJ,GAAG;AACjB,IAAAJ,EAAE,QAAQI,EAAE,MAAK,GAAI,SAASK,GAAG;AAAE,MAAAO,EAAUZ,EAAE,KAAKK,CAAC,CAAC;AAAA,IAAG,CAAC,GAE1DT,EAAE,QAAQI,EAAE,MAAK,GAAI,SAASO,GAAG;AAC/B,UAAII,IAAOX,EAAE,KAAKO,CAAC;AACnB,MAAAX,EAAE,QAAQe,EAAK,QAAQC,CAAS,GAC5BhB,EAAE,IAAIe,GAAM,GAAG,KACjBC,EAAUD,CAAI;AAAA,IAElB,CAAC;AAAA,EACH;AAEA,WAASC,EAAUJ,GAAO;AACxB,QAAIK,IAAIL,EAAM;AACd,IAAAA,EAAM,IAAIA,EAAM,GAChBA,EAAM,IAAIK;AAAA,EACZ;AACA,SAAOpB;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/dagre/lib/data/list.js

@@ -0,0 +1,33 @@
+var r, s;
+function v() {
+  if (s) return r;
+  s = 1, r = n;
+  function n() {
+    var e = {};
+    e._next = e._prev = e, this._sentinel = e;
+  }
+  n.prototype.dequeue = function() {
+    var e = this._sentinel, t = e._prev;
+    if (t !== e)
+      return _(t), t;
+  }, n.prototype.enqueue = function(e) {
+    var t = this._sentinel;
+    e._prev && e._next && _(e), e._next = t._next, t._next._prev = e, t._next = e, e._prev = t;
+  }, n.prototype.toString = function() {
+    for (var e = [], t = this._sentinel, i = t._prev; i !== t; )
+      e.push(JSON.stringify(i, u)), i = i._prev;
+    return "[" + e.join(", ") + "]";
+  };
+  function _(e) {
+    e._prev._next = e._next, e._next._prev = e._prev, delete e._next, delete e._prev;
+  }
+  function u(e, t) {
+    if (e !== "_next" && e !== "_prev")
+      return t;
+  }
+  return r;
+}
+export {
+  v as __require
+};
+//# sourceMappingURL=list.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"list.js","sources":["../../../../../../../../../node_modules/@antv/layout/lib/node_modules/dagre/lib/data/list.js"],"sourcesContent":["/*\n * Simple doubly linked list implementation derived from Cormen, et al.,\n * \"Introduction to Algorithms\".\n */\n\nvar list;\nvar hasRequiredList;\n\nfunction requireList () {\n\tif (hasRequiredList) return list;\n\thasRequiredList = 1;\n\tlist = List;\n\n\tfunction List() {\n\t  var sentinel = {};\n\t  sentinel._next = sentinel._prev = sentinel;\n\t  this._sentinel = sentinel;\n\t}\n\n\tList.prototype.dequeue = function() {\n\t  var sentinel = this._sentinel;\n\t  var entry = sentinel._prev;\n\t  if (entry !== sentinel) {\n\t    unlink(entry);\n\t    return entry;\n\t  }\n\t};\n\n\tList.prototype.enqueue = function(entry) {\n\t  var sentinel = this._sentinel;\n\t  if (entry._prev && entry._next) {\n\t    unlink(entry);\n\t  }\n\t  entry._next = sentinel._next;\n\t  sentinel._next._prev = entry;\n\t  sentinel._next = entry;\n\t  entry._prev = sentinel;\n\t};\n\n\tList.prototype.toString = function() {\n\t  var strs = [];\n\t  var sentinel = this._sentinel;\n\t  var curr = sentinel._prev;\n\t  while (curr !== sentinel) {\n\t    strs.push(JSON.stringify(curr, filterOutLinks));\n\t    curr = curr._prev;\n\t  }\n\t  return \"[\" + strs.join(\", \") + \"]\";\n\t};\n\n\tfunction unlink(entry) {\n\t  entry._prev._next = entry._next;\n\t  entry._next._prev = entry._prev;\n\t  delete entry._next;\n\t  delete entry._prev;\n\t}\n\n\tfunction filterOutLinks(k, v) {\n\t  if (k !== \"_next\" && k !== \"_prev\") {\n\t    return v;\n\t  }\n\t}\n\treturn list;\n}\n\nexport { requireList as __require };\n//# sourceMappingURL=list.js.map\n"],"names":["list","hasRequiredList","requireList","List","sentinel","entry","unlink","strs","curr","filterOutLinks","k","v"],"mappings":"AAKA,IAAIA,GACAC;AAEJ,SAASC,IAAe;AACvB,MAAID,EAAiB,QAAOD;AAC5B,EAAAC,IAAkB,GAClBD,IAAOG;AAEP,WAASA,IAAO;AACd,QAAIC,IAAW,CAAA;AACf,IAAAA,EAAS,QAAQA,EAAS,QAAQA,GAClC,KAAK,YAAYA;AAAA,EACnB;AAEA,EAAAD,EAAK,UAAU,UAAU,WAAW;AAClC,QAAIC,IAAW,KAAK,WAChBC,IAAQD,EAAS;AACrB,QAAIC,MAAUD;AACZ,aAAAE,EAAOD,CAAK,GACLA;AAAA,EAEX,GAEAF,EAAK,UAAU,UAAU,SAASE,GAAO;AACvC,QAAID,IAAW,KAAK;AACpB,IAAIC,EAAM,SAASA,EAAM,SACvBC,EAAOD,CAAK,GAEdA,EAAM,QAAQD,EAAS,OACvBA,EAAS,MAAM,QAAQC,GACvBD,EAAS,QAAQC,GACjBA,EAAM,QAAQD;AAAA,EAChB,GAEAD,EAAK,UAAU,WAAW,WAAW;AAInC,aAHII,IAAO,CAAA,GACPH,IAAW,KAAK,WAChBI,IAAOJ,EAAS,OACbI,MAASJ;AACd,MAAAG,EAAK,KAAK,KAAK,UAAUC,GAAMC,CAAc,CAAC,GAC9CD,IAAOA,EAAK;AAEd,WAAO,MAAMD,EAAK,KAAK,IAAI,IAAI;AAAA,EACjC;AAEA,WAASD,EAAOD,GAAO;AACrB,IAAAA,EAAM,MAAM,QAAQA,EAAM,OAC1BA,EAAM,MAAM,QAAQA,EAAM,OAC1B,OAAOA,EAAM,OACb,OAAOA,EAAM;AAAA,EACf;AAEA,WAASI,EAAeC,GAAGC,GAAG;AAC5B,QAAID,MAAM,WAAWA,MAAM;AACzB,aAAOC;AAAA,EAEX;AACA,SAAOX;AACR;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,30 @@
+import { __require as m } from "./lodash.js";
+import { __require as p } from "./util.js";
+import { __require as q } from "./graphlib.js";
+var i, n;
+function v() {
+  if (n) return i;
+  n = 1;
+  var a = m(), o = p(), d = q().Graph;
+  i = {
+    debugOrdering: s
+  };
+  function s(u) {
+    var f = o.buildLayerMatrix(u), e = new d({ compound: !0, multigraph: !0 }).setGraph({});
+    return a.forEach(u.nodes(), function(r) {
+      e.setNode(r, { label: r }), e.setParent(r, "layer" + u.node(r).rank);
+    }), a.forEach(u.edges(), function(r) {
+      e.setEdge(r.v, r.w, {}, r.name);
+    }), a.forEach(f, function(r, l) {
+      var c = "layer" + l;
+      e.setNode(c, { rank: "same" }), a.reduce(r, function(h, t) {
+        return e.setEdge(h, t, { style: "invis" }), t;
+      });
+    }), e;
+  }
+  return i;
+}
+export {
+  v as __require
+};
+//# sourceMappingURL=debug.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"debug.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/dagre/lib/debug.js"],"sourcesContent":["import { __require as requireLodash } from './lodash.js';\nimport { __require as requireUtil } from './util.js';\nimport { __require as requireGraphlib } from './graphlib.js';\n\nvar debug;\nvar hasRequiredDebug;\n\nfunction requireDebug () {\n\tif (hasRequiredDebug) return debug;\n\thasRequiredDebug = 1;\n\tvar _ = requireLodash();\n\tvar util = requireUtil();\n\tvar Graph = requireGraphlib().Graph;\n\n\tdebug = {\n\t  debugOrdering: debugOrdering\n\t};\n\n\t/* istanbul ignore next */\n\tfunction debugOrdering(g) {\n\t  var layerMatrix = util.buildLayerMatrix(g);\n\n\t  var h = new Graph({ compound: true, multigraph: true }).setGraph({});\n\n\t  _.forEach(g.nodes(), function(v) {\n\t    h.setNode(v, { label: v });\n\t    h.setParent(v, \"layer\" + g.node(v).rank);\n\t  });\n\n\t  _.forEach(g.edges(), function(e) {\n\t    h.setEdge(e.v, e.w, {}, e.name);\n\t  });\n\n\t  _.forEach(layerMatrix, function(layer, i) {\n\t    var layerV = \"layer\" + i;\n\t    h.setNode(layerV, { rank: \"same\" });\n\t    _.reduce(layer, function(u, v) {\n\t      h.setEdge(u, v, { style: \"invis\" });\n\t      return v;\n\t    });\n\t  });\n\n\t  return h;\n\t}\n\treturn debug;\n}\n\nexport { requireDebug as __require };\n//# sourceMappingURL=debug.js.map\n"],"names":["debug","hasRequiredDebug","requireDebug","_","requireLodash","util","requireUtil","Graph","requireGraphlib","debugOrdering","g","layerMatrix","h","v","e","layer","i","layerV","u"],"mappings":";;;AAIA,IAAIA,GACAC;AAEJ,SAASC,IAAgB;AACxB,MAAID,EAAkB,QAAOD;AAC7B,EAAAC,IAAmB;AACnB,MAAIE,IAAIC,EAAa,GACjBC,IAAOC,EAAW,GAClBC,IAAQC,EAAe,EAAG;AAE9B,EAAAR,IAAQ;AAAA,IACN,eAAeS;AAAA,EAClB;AAGC,WAASA,EAAcC,GAAG;AACxB,QAAIC,IAAcN,EAAK,iBAAiBK,CAAC,GAErCE,IAAI,IAAIL,EAAM,EAAE,UAAU,IAAM,YAAY,GAAI,CAAE,EAAE,SAAS,EAAE;AAEnE,WAAAJ,EAAE,QAAQO,EAAE,MAAK,GAAI,SAASG,GAAG;AAC/B,MAAAD,EAAE,QAAQC,GAAG,EAAE,OAAOA,EAAC,CAAE,GACzBD,EAAE,UAAUC,GAAG,UAAUH,EAAE,KAAKG,CAAC,EAAE,IAAI;AAAA,IACzC,CAAC,GAEDV,EAAE,QAAQO,EAAE,MAAK,GAAI,SAASI,GAAG;AAC/B,MAAAF,EAAE,QAAQE,EAAE,GAAGA,EAAE,GAAG,CAAA,GAAIA,EAAE,IAAI;AAAA,IAChC,CAAC,GAEDX,EAAE,QAAQQ,GAAa,SAASI,GAAOC,GAAG;AACxC,UAAIC,IAAS,UAAUD;AACvB,MAAAJ,EAAE,QAAQK,GAAQ,EAAE,MAAM,OAAM,CAAE,GAClCd,EAAE,OAAOY,GAAO,SAASG,GAAGL,GAAG;AAC7B,eAAAD,EAAE,QAAQM,GAAGL,GAAG,EAAE,OAAO,SAAS,GAC3BA;AAAA,MACT,CAAC;AAAA,IACH,CAAC,GAEMD;AAAA,EACT;AACA,SAAOZ;AACR;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,18 @@
+import { commonjsRequire as a } from "../../../_virtual/_commonjs-dynamic-modules.js";
+import { __require as o } from "../../graphlib/index.js";
+var i, e;
+function f() {
+  if (e) return i;
+  e = 1;
+  var r;
+  if (typeof a == "function")
+    try {
+      r = o();
+    } catch {
+    }
+  return r || (r = window.graphlib), i = r, i;
+}
+export {
+  f as __require
+};
+//# sourceMappingURL=graphlib.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"graphlib.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/dagre/lib/graphlib.js"],"sourcesContent":["import { commonjsRequire } from '../../../_virtual/_commonjs-dynamic-modules.js';\nimport { __require as requireGraphlib$1 } from '../../graphlib/index.js';\n\n/* global window */\n\nvar graphlib_1;\nvar hasRequiredGraphlib;\n\nfunction requireGraphlib () {\n\tif (hasRequiredGraphlib) return graphlib_1;\n\thasRequiredGraphlib = 1;\n\tvar graphlib;\n\n\tif (typeof commonjsRequire === \"function\") {\n\t  try {\n\t    graphlib = requireGraphlib$1();\n\t  } catch (e) {\n\t    // continue regardless of error\n\t  }\n\t}\n\n\tif (!graphlib) {\n\t  graphlib = window.graphlib;\n\t}\n\n\tgraphlib_1 = graphlib;\n\treturn graphlib_1;\n}\n\nexport { requireGraphlib as __require };\n//# sourceMappingURL=graphlib.js.map\n"],"names":["graphlib_1","hasRequiredGraphlib","requireGraphlib","graphlib","commonjsRequire","requireGraphlib$1"],"mappings":";;AAKA,IAAIA,GACAC;AAEJ,SAASC,IAAmB;AAC3B,MAAID,EAAqB,QAAOD;AAChC,EAAAC,IAAsB;AACtB,MAAIE;AAEJ,MAAI,OAAOC,KAAoB;AAC7B,QAAI;AACF,MAAAD,IAAWE,EAAiB;AAAA,IAC9B,QAAY;AAAA,IAEZ;AAGF,SAAKF,MACHA,IAAW,OAAO,WAGpBH,IAAaG,GACNH;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/dagre/lib/greedy-fas.js

@@ -0,0 +1,68 @@
+import { __require as F } from "./lodash.js";
+import { __require as g } from "./graphlib.js";
+import { __require as x } from "./data/list.js";
+var w, q;
+function C() {
+  if (q) return w;
+  q = 1;
+  var i = F(), m = g().Graph, p = x();
+  w = c;
+  var E = i.constant(1);
+  function c(e, u) {
+    if (e.nodeCount() <= 1)
+      return [];
+    var r = _(e, u || E), o = l(r.graph, r.buckets, r.zeroIdx);
+    return i.flatten(i.map(o, function(t) {
+      return e.outEdges(t.v, t.w);
+    }), !0);
+  }
+  function l(e, u, r) {
+    for (var o = [], t = u[u.length - 1], v = u[0], a; e.nodeCount(); ) {
+      for (; a = v.dequeue(); )
+        h(e, u, r, a);
+      for (; a = t.dequeue(); )
+        h(e, u, r, a);
+      if (e.nodeCount()) {
+        for (var n = u.length - 2; n > 0; --n)
+          if (a = u[n].dequeue(), a) {
+            o = o.concat(h(e, u, r, a, !0));
+            break;
+          }
+      }
+    }
+    return o;
+  }
+  function h(e, u, r, o, t) {
+    var v = t ? [] : void 0;
+    return i.forEach(e.inEdges(o.v), function(a) {
+      var n = e.edge(a), f = e.node(a.v);
+      t && v.push({ v: a.v, w: a.w }), f.out -= n, s(u, r, f);
+    }), i.forEach(e.outEdges(o.v), function(a) {
+      var n = e.edge(a), f = a.w, d = e.node(f);
+      d.in -= n, s(u, r, d);
+    }), e.removeNode(o.v), v;
+  }
+  function _(e, u) {
+    var r = new m(), o = 0, t = 0;
+    i.forEach(e.nodes(), function(n) {
+      r.setNode(n, { v: n, in: 0, out: 0 });
+    }), i.forEach(e.edges(), function(n) {
+      var f = r.edge(n.v, n.w) || 0, d = u(n), G = f + d;
+      r.setEdge(n.v, n.w, G), t = Math.max(t, r.node(n.v).out += d), o = Math.max(o, r.node(n.w).in += d);
+    });
+    var v = i.range(t + o + 3).map(function() {
+      return new p();
+    }), a = o + 1;
+    return i.forEach(r.nodes(), function(n) {
+      s(v, a, r.node(n));
+    }), { graph: r, buckets: v, zeroIdx: a };
+  }
+  function s(e, u, r) {
+    r.out ? r.in ? e[r.out - r.in + u].enqueue(r) : e[e.length - 1].enqueue(r) : e[0].enqueue(r);
+  }
+  return w;
+}
+export {
+  C as __require
+};
+//# sourceMappingURL=greedy-fas.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/dagre/lib/greedy-fas.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"greedy-fas.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/dagre/lib/greedy-fas.js"],"sourcesContent":["import { __require as requireLodash } from './lodash.js';\nimport { __require as requireGraphlib } from './graphlib.js';\nimport { __require as requireList } from './data/list.js';\n\nvar greedyFas;\nvar hasRequiredGreedyFas;\n\nfunction requireGreedyFas () {\n\tif (hasRequiredGreedyFas) return greedyFas;\n\thasRequiredGreedyFas = 1;\n\tvar _ = requireLodash();\n\tvar Graph = requireGraphlib().Graph;\n\tvar List = requireList();\n\n\t/*\n\t * A greedy heuristic for finding a feedback arc set for a graph. A feedback\n\t * arc set is a set of edges that can be removed to make a graph acyclic.\n\t * The algorithm comes from: P. Eades, X. Lin, and W. F. Smyth, \"A fast and\n\t * effective heuristic for the feedback arc set problem.\" This implementation\n\t * adjusts that from the paper to allow for weighted edges.\n\t */\n\tgreedyFas = greedyFAS;\n\n\tvar DEFAULT_WEIGHT_FN = _.constant(1);\n\n\tfunction greedyFAS(g, weightFn) {\n\t  if (g.nodeCount() <= 1) {\n\t    return [];\n\t  }\n\t  var state = buildState(g, weightFn || DEFAULT_WEIGHT_FN);\n\t  var results = doGreedyFAS(state.graph, state.buckets, state.zeroIdx);\n\n\t  // Expand multi-edges\n\t  return _.flatten(_.map(results, function(e) {\n\t    return g.outEdges(e.v, e.w);\n\t  }), true);\n\t}\n\n\tfunction doGreedyFAS(g, buckets, zeroIdx) {\n\t  var results = [];\n\t  var sources = buckets[buckets.length - 1];\n\t  var sinks = buckets[0];\n\n\t  var entry;\n\t  while (g.nodeCount()) {\n\t    while ((entry = sinks.dequeue()))   { removeNode(g, buckets, zeroIdx, entry); }\n\t    while ((entry = sources.dequeue())) { removeNode(g, buckets, zeroIdx, entry); }\n\t    if (g.nodeCount()) {\n\t      for (var i = buckets.length - 2; i > 0; --i) {\n\t        entry = buckets[i].dequeue();\n\t        if (entry) {\n\t          results = results.concat(removeNode(g, buckets, zeroIdx, entry, true));\n\t          break;\n\t        }\n\t      }\n\t    }\n\t  }\n\n\t  return results;\n\t}\n\n\tfunction removeNode(g, buckets, zeroIdx, entry, collectPredecessors) {\n\t  var results = collectPredecessors ? [] : undefined;\n\n\t  _.forEach(g.inEdges(entry.v), function(edge) {\n\t    var weight = g.edge(edge);\n\t    var uEntry = g.node(edge.v);\n\n\t    if (collectPredecessors) {\n\t      results.push({ v: edge.v, w: edge.w });\n\t    }\n\n\t    uEntry.out -= weight;\n\t    assignBucket(buckets, zeroIdx, uEntry);\n\t  });\n\n\t  _.forEach(g.outEdges(entry.v), function(edge) {\n\t    var weight = g.edge(edge);\n\t    var w = edge.w;\n\t    var wEntry = g.node(w);\n\t    wEntry[\"in\"] -= weight;\n\t    assignBucket(buckets, zeroIdx, wEntry);\n\t  });\n\n\t  g.removeNode(entry.v);\n\n\t  return results;\n\t}\n\n\tfunction buildState(g, weightFn) {\n\t  var fasGraph = new Graph();\n\t  var maxIn = 0;\n\t  var maxOut = 0;\n\n\t  _.forEach(g.nodes(), function(v) {\n\t    fasGraph.setNode(v, { v: v, \"in\": 0, out: 0 });\n\t  });\n\n\t  // Aggregate weights on nodes, but also sum the weights across multi-edges\n\t  // into a single edge for the fasGraph.\n\t  _.forEach(g.edges(), function(e) {\n\t    var prevWeight = fasGraph.edge(e.v, e.w) || 0;\n\t    var weight = weightFn(e);\n\t    var edgeWeight = prevWeight + weight;\n\t    fasGraph.setEdge(e.v, e.w, edgeWeight);\n\t    maxOut = Math.max(maxOut, fasGraph.node(e.v).out += weight);\n\t    maxIn  = Math.max(maxIn,  fasGraph.node(e.w)[\"in\"]  += weight);\n\t  });\n\n\t  var buckets = _.range(maxOut + maxIn + 3).map(function() { return new List(); });\n\t  var zeroIdx = maxIn + 1;\n\n\t  _.forEach(fasGraph.nodes(), function(v) {\n\t    assignBucket(buckets, zeroIdx, fasGraph.node(v));\n\t  });\n\n\t  return { graph: fasGraph, buckets: buckets, zeroIdx: zeroIdx };\n\t}\n\n\tfunction assignBucket(buckets, zeroIdx, entry) {\n\t  if (!entry.out) {\n\t    buckets[0].enqueue(entry);\n\t  } else if (!entry[\"in\"]) {\n\t    buckets[buckets.length - 1].enqueue(entry);\n\t  } else {\n\t    buckets[entry.out - entry[\"in\"] + zeroIdx].enqueue(entry);\n\t  }\n\t}\n\treturn greedyFas;\n}\n\nexport { requireGreedyFas as __require };\n//# sourceMappingURL=greedy-fas.js.map\n"],"names":["greedyFas","hasRequiredGreedyFas","requireGreedyFas","_","requireLodash","Graph","requireGraphlib","List","requireList","greedyFAS","DEFAULT_WEIGHT_FN","g","weightFn","state","buildState","results","doGreedyFAS","e","buckets","zeroIdx","sources","sinks","entry","removeNode","i","collectPredecessors","edge","weight","uEntry","assignBucket","w","wEntry","fasGraph","maxIn","maxOut","v","prevWeight","edgeWeight"],"mappings":";;;AAIA,IAAIA,GACAC;AAEJ,SAASC,IAAoB;AAC5B,MAAID,EAAsB,QAAOD;AACjC,EAAAC,IAAuB;AACvB,MAAIE,IAAIC,EAAa,GACjBC,IAAQC,EAAe,EAAG,OAC1BC,IAAOC,EAAW;AAStB,EAAAR,IAAYS;AAEZ,MAAIC,IAAoBP,EAAE,SAAS,CAAC;AAEpC,WAASM,EAAUE,GAAGC,GAAU;AAC9B,QAAID,EAAE,UAAS,KAAM;AACnB,aAAO,CAAA;AAET,QAAIE,IAAQC,EAAWH,GAAGC,KAAYF,CAAiB,GACnDK,IAAUC,EAAYH,EAAM,OAAOA,EAAM,SAASA,EAAM,OAAO;AAGnE,WAAOV,EAAE,QAAQA,EAAE,IAAIY,GAAS,SAASE,GAAG;AAC1C,aAAON,EAAE,SAASM,EAAE,GAAGA,EAAE,CAAC;AAAA,IAC5B,CAAC,GAAG,EAAI;AAAA,EACV;AAEA,WAASD,EAAYL,GAAGO,GAASC,GAAS;AAMxC,aALIJ,IAAU,CAAA,GACVK,IAAUF,EAAQA,EAAQ,SAAS,CAAC,GACpCG,IAAQH,EAAQ,CAAC,GAEjBI,GACGX,EAAE,eAAa;AACpB,aAAQW,IAAQD,EAAM,QAAO;AAAS,QAAAE,EAAWZ,GAAGO,GAASC,GAASG,CAAK;AAC3E,aAAQA,IAAQF,EAAQ,QAAO;AAAO,QAAAG,EAAWZ,GAAGO,GAASC,GAASG,CAAK;AAC3E,UAAIX,EAAE;AACJ,iBAASa,IAAIN,EAAQ,SAAS,GAAGM,IAAI,GAAG,EAAEA;AAExC,cADAF,IAAQJ,EAAQM,CAAC,EAAE,QAAO,GACtBF,GAAO;AACT,YAAAP,IAAUA,EAAQ,OAAOQ,EAAWZ,GAAGO,GAASC,GAASG,GAAO,EAAI,CAAC;AACrE;AAAA,UACF;AAAA;AAAA,IAGN;AAEA,WAAOP;AAAA,EACT;AAEA,WAASQ,EAAWZ,GAAGO,GAASC,GAASG,GAAOG,GAAqB;AACnE,QAAIV,IAAUU,IAAsB,CAAA,IAAK;AAEzC,WAAAtB,EAAE,QAAQQ,EAAE,QAAQW,EAAM,CAAC,GAAG,SAASI,GAAM;AAC3C,UAAIC,IAAShB,EAAE,KAAKe,CAAI,GACpBE,IAASjB,EAAE,KAAKe,EAAK,CAAC;AAE1B,MAAID,KACFV,EAAQ,KAAK,EAAE,GAAGW,EAAK,GAAG,GAAGA,EAAK,GAAG,GAGvCE,EAAO,OAAOD,GACdE,EAAaX,GAASC,GAASS,CAAM;AAAA,IACvC,CAAC,GAEDzB,EAAE,QAAQQ,EAAE,SAASW,EAAM,CAAC,GAAG,SAASI,GAAM;AAC5C,UAAIC,IAAShB,EAAE,KAAKe,CAAI,GACpBI,IAAIJ,EAAK,GACTK,IAASpB,EAAE,KAAKmB,CAAC;AACrB,MAAAC,EAAO,MAASJ,GAChBE,EAAaX,GAASC,GAASY,CAAM;AAAA,IACvC,CAAC,GAEDpB,EAAE,WAAWW,EAAM,CAAC,GAEbP;AAAA,EACT;AAEA,WAASD,EAAWH,GAAGC,GAAU;AAC/B,QAAIoB,IAAW,IAAI3B,EAAK,GACpB4B,IAAQ,GACRC,IAAS;AAEb,IAAA/B,EAAE,QAAQQ,EAAE,MAAK,GAAI,SAASwB,GAAG;AAC/B,MAAAH,EAAS,QAAQG,GAAG,EAAE,GAAGA,GAAG,IAAM,GAAG,KAAK,GAAG;AAAA,IAC/C,CAAC,GAIDhC,EAAE,QAAQQ,EAAE,MAAK,GAAI,SAASM,GAAG;AAC/B,UAAImB,IAAaJ,EAAS,KAAKf,EAAE,GAAGA,EAAE,CAAC,KAAK,GACxCU,IAASf,EAASK,CAAC,GACnBoB,IAAaD,IAAaT;AAC9B,MAAAK,EAAS,QAAQf,EAAE,GAAGA,EAAE,GAAGoB,CAAU,GACrCH,IAAS,KAAK,IAAIA,GAAQF,EAAS,KAAKf,EAAE,CAAC,EAAE,OAAOU,CAAM,GAC1DM,IAAS,KAAK,IAAIA,GAAQD,EAAS,KAAKf,EAAE,CAAC,EAAE,MAAUU,CAAM;AAAA,IAC/D,CAAC;AAED,QAAIT,IAAUf,EAAE,MAAM+B,IAASD,IAAQ,CAAC,EAAE,IAAI,WAAW;AAAE,aAAO,IAAI1B,EAAI;AAAA,IAAI,CAAC,GAC3EY,IAAUc,IAAQ;AAEtB,WAAA9B,EAAE,QAAQ6B,EAAS,MAAK,GAAI,SAASG,GAAG;AACtC,MAAAN,EAAaX,GAASC,GAASa,EAAS,KAAKG,CAAC,CAAC;AAAA,IACjD,CAAC,GAEM,EAAE,OAAOH,GAAU,SAASd,GAAS,SAASC,EAAO;AAAA,EAC9D;AAEA,WAASU,EAAaX,GAASC,GAASG,GAAO;AAC7C,IAAKA,EAAM,MAECA,EAAM,KAGhBJ,EAAQI,EAAM,MAAMA,EAAM,KAAQH,CAAO,EAAE,QAAQG,CAAK,IAFxDJ,EAAQA,EAAQ,SAAS,CAAC,EAAE,QAAQI,CAAK,IAFzCJ,EAAQ,CAAC,EAAE,QAAQI,CAAK;AAAA,EAM5B;AACA,SAAOtB;AACR;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,268 @@
+import { __require as ae } from "./lodash.js";
+import { __require as oe } from "./acyclic.js";
+import { __require as ie } from "./normalize.js";
+import { __require as te } from "./rank/index.js";
+import { __require as m } from "./util.js";
+import { __require as de } from "./parent-dummy-chains.js";
+import { __require as se } from "./nesting-graph.js";
+import { __require as ue } from "./add-border-segments.js";
+import { __require as fe } from "./coordinate-system.js";
+import { __require as ce } from "./order/index.js";
+import { __require as he } from "./position/index.js";
+import { __require as le } from "./graphlib.js";
+var p, w;
+function Le() {
+  if (w) return p;
+  w = 1;
+  var o = ae(), b = oe(), g = ie(), q = te(), L = m().normalizeRanks, N = de(), R = m().removeEmptyRanks, E = se(), S = ue(), y = fe(), I = ce(), C = he(), c = m(), M = le().Graph;
+  p = P;
+  function P(e, r) {
+    var n = r && r.debugTiming ? c.time : c.notime;
+    n("layout", function() {
+      var a = n("  buildLayoutGraph", function() {
+        return X(e);
+      });
+      n("  runLayout", function() {
+        T(a, n);
+      }), n("  updateInputGraph", function() {
+        A(e, a);
+      });
+    });
+  }
+  function T(e, r) {
+    r("    makeSpaceForEdgeLabels", function() {
+      G(e);
+    }), r("    removeSelfEdges", function() {
+      ee(e);
+    }), r("    acyclic", function() {
+      b.run(e);
+    }), r("    nestingGraph.run", function() {
+      E.run(e);
+    }), r("    rank", function() {
+      q(c.asNonCompoundGraph(e));
+    }), r("    injectEdgeLabelProxies", function() {
+      U(e);
+    }), r("    removeEmptyRanks", function() {
+      R(e);
+    }), r("    nestingGraph.cleanup", function() {
+      E.cleanup(e);
+    }), r("    normalizeRanks", function() {
+      L(e);
+    }), r("    assignRankMinMax", function() {
+      W(e);
+    }), r("    removeEdgeLabelProxies", function() {
+      $(e);
+    }), r("    normalize.run", function() {
+      g.run(e);
+    }), r("    parentDummyChains", function() {
+      N(e);
+    }), r("    addBorderSegments", function() {
+      S(e);
+    }), r("    order", function() {
+      I(e);
+    }), r("    insertSelfEdges", function() {
+      re(e);
+    }), r("    adjustCoordinateSystem", function() {
+      y.adjust(e);
+    }), r("    position", function() {
+      C(e);
+    }), r("    positionSelfEdges", function() {
+      ne(e);
+    }), r("    removeBorderNodes", function() {
+      Z(e);
+    }), r("    normalize.undo", function() {
+      g.undo(e);
+    }), r("    fixupEdgeLabelCoords", function() {
+      K(e);
+    }), r("    undoCoordinateSystem", function() {
+      y.undo(e);
+    }), r("    translateGraph", function() {
+      H(e);
+    }), r("    assignNodeIntersects", function() {
+      J(e);
+    }), r("    reversePoints", function() {
+      Q(e);
+    }), r("    acyclic.undo", function() {
+      b.undo(e);
+    });
+  }
+  function A(e, r) {
+    o.forEach(e.nodes(), function(n) {
+      var a = e.node(n), i = r.node(n);
+      a && (a.x = i.x, a.y = i.y, r.children(n).length && (a.width = i.width, a.height = i.height));
+    }), o.forEach(e.edges(), function(n) {
+      var a = e.edge(n), i = r.edge(n);
+      a.points = i.points, o.has(i, "x") && (a.x = i.x, a.y = i.y);
+    }), e.graph().width = r.graph().width, e.graph().height = r.graph().height;
+  }
+  var B = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], z = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" }, D = ["acyclicer", "ranker", "rankdir", "align"], F = ["width", "height"], Y = { width: 0, height: 0 }, j = ["minlen", "weight", "width", "height", "labeloffset"], V = {
+    minlen: 1,
+    weight: 1,
+    width: 0,
+    height: 0,
+    labeloffset: 10,
+    labelpos: "r"
+  }, O = ["labelpos"];
+  function X(e) {
+    var r = new M({ multigraph: !0, compound: !0 }), n = v(e.graph());
+    return r.setGraph(o.merge(
+      {},
+      z,
+      l(n, B),
+      o.pick(n, D)
+    )), o.forEach(e.nodes(), function(a) {
+      var i = v(e.node(a));
+      r.setNode(a, o.defaults(l(i, F), Y)), r.setParent(a, e.parent(a));
+    }), o.forEach(e.edges(), function(a) {
+      var i = v(e.edge(a));
+      r.setEdge(a, o.merge(
+        {},
+        V,
+        l(i, j),
+        o.pick(i, O)
+      ));
+    }), r;
+  }
+  function G(e) {
+    var r = e.graph();
+    r.ranksep /= 2, o.forEach(e.edges(), function(n) {
+      var a = e.edge(n);
+      a.minlen *= 2, a.labelpos.toLowerCase() !== "c" && (r.rankdir === "TB" || r.rankdir === "BT" ? a.width += a.labeloffset : a.height += a.labeloffset);
+    });
+  }
+  function U(e) {
+    o.forEach(e.edges(), function(r) {
+      var n = e.edge(r);
+      if (n.width && n.height) {
+        var a = e.node(r.v), i = e.node(r.w), t = { rank: (i.rank - a.rank) / 2 + a.rank, e: r };
+        c.addDummyNode(e, "edge-proxy", t, "_ep");
+      }
+    });
+  }
+  function W(e) {
+    var r = 0;
+    o.forEach(e.nodes(), function(n) {
+      var a = e.node(n);
+      a.borderTop && (a.minRank = e.node(a.borderTop).rank, a.maxRank = e.node(a.borderBottom).rank, r = o.max(r, a.maxRank));
+    }), e.graph().maxRank = r;
+  }
+  function $(e) {
+    o.forEach(e.nodes(), function(r) {
+      var n = e.node(r);
+      n.dummy === "edge-proxy" && (e.edge(n.e).labelRank = n.rank, e.removeNode(r));
+    });
+  }
+  function H(e) {
+    var r = Number.POSITIVE_INFINITY, n = 0, a = Number.POSITIVE_INFINITY, i = 0, t = e.graph(), d = t.marginx || 0, u = t.marginy || 0;
+    function x(f) {
+      var s = f.x, h = f.y, k = f.width, _ = f.height;
+      r = Math.min(r, s - k / 2), n = Math.max(n, s + k / 2), a = Math.min(a, h - _ / 2), i = Math.max(i, h + _ / 2);
+    }
+    o.forEach(e.nodes(), function(f) {
+      x(e.node(f));
+    }), o.forEach(e.edges(), function(f) {
+      var s = e.edge(f);
+      o.has(s, "x") && x(s);
+    }), r -= d, a -= u, o.forEach(e.nodes(), function(f) {
+      var s = e.node(f);
+      s.x -= r, s.y -= a;
+    }), o.forEach(e.edges(), function(f) {
+      var s = e.edge(f);
+      o.forEach(s.points, function(h) {
+        h.x -= r, h.y -= a;
+      }), o.has(s, "x") && (s.x -= r), o.has(s, "y") && (s.y -= a);
+    }), t.width = n - r + d, t.height = i - a + u;
+  }
+  function J(e) {
+    o.forEach(e.edges(), function(r) {
+      var n = e.edge(r), a = e.node(r.v), i = e.node(r.w), t, d;
+      n.points ? (t = n.points[0], d = n.points[n.points.length - 1]) : (n.points = [], t = i, d = a), n.points.unshift(c.intersectRect(a, t)), n.points.push(c.intersectRect(i, d));
+    });
+  }
+  function K(e) {
+    o.forEach(e.edges(), function(r) {
+      var n = e.edge(r);
+      if (o.has(n, "x"))
+        switch ((n.labelpos === "l" || n.labelpos === "r") && (n.width -= n.labeloffset), n.labelpos) {
+          case "l":
+            n.x -= n.width / 2 + n.labeloffset;
+            break;
+          case "r":
+            n.x += n.width / 2 + n.labeloffset;
+            break;
+        }
+    });
+  }
+  function Q(e) {
+    o.forEach(e.edges(), function(r) {
+      var n = e.edge(r);
+      n.reversed && n.points.reverse();
+    });
+  }
+  function Z(e) {
+    o.forEach(e.nodes(), function(r) {
+      if (e.children(r).length) {
+        var n = e.node(r), a = e.node(n.borderTop), i = e.node(n.borderBottom), t = e.node(o.last(n.borderLeft)), d = e.node(o.last(n.borderRight));
+        n.width = Math.abs(d.x - t.x), n.height = Math.abs(i.y - a.y), n.x = t.x + n.width / 2, n.y = a.y + n.height / 2;
+      }
+    }), o.forEach(e.nodes(), function(r) {
+      e.node(r).dummy === "border" && e.removeNode(r);
+    });
+  }
+  function ee(e) {
+    o.forEach(e.edges(), function(r) {
+      if (r.v === r.w) {
+        var n = e.node(r.v);
+        n.selfEdges || (n.selfEdges = []), n.selfEdges.push({ e: r, label: e.edge(r) }), e.removeEdge(r);
+      }
+    });
+  }
+  function re(e) {
+    var r = c.buildLayerMatrix(e);
+    o.forEach(r, function(n) {
+      var a = 0;
+      o.forEach(n, function(i, t) {
+        var d = e.node(i);
+        d.order = t + a, o.forEach(d.selfEdges, function(u) {
+          c.addDummyNode(e, "selfedge", {
+            width: u.label.width,
+            height: u.label.height,
+            rank: d.rank,
+            order: t + ++a,
+            e: u.e,
+            label: u.label
+          }, "_se");
+        }), delete d.selfEdges;
+      });
+    });
+  }
+  function ne(e) {
+    o.forEach(e.nodes(), function(r) {
+      var n = e.node(r);
+      if (n.dummy === "selfedge") {
+        var a = e.node(n.e.v), i = a.x + a.width / 2, t = a.y, d = n.x - i, u = a.height / 2;
+        e.setEdge(n.e, n.label), e.removeNode(r), n.label.points = [
+          { x: i + 2 * d / 3, y: t - u },
+          { x: i + 5 * d / 6, y: t - u },
+          { x: i + d, y: t },
+          { x: i + 5 * d / 6, y: t + u },
+          { x: i + 2 * d / 3, y: t + u }
+        ], n.label.x = n.x, n.label.y = n.y;
+      }
+    });
+  }
+  function l(e, r) {
+    return o.mapValues(o.pick(e, r), Number);
+  }
+  function v(e) {
+    var r = {};
+    return o.forEach(e, function(n, a) {
+      r[a.toLowerCase()] = n;
+    }), r;
+  }
+  return p;
+}
+export {
+  Le as __require
+};
+//# sourceMappingURL=layout.js.map