@hkyhy/marsun-components-core 0.1.113 → 0.1.114

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

@@ -0,0 +1 @@
+{"version":3,"file":"layout.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/dagre/lib/layout.js"],"sourcesContent":["import { __require as requireLodash } from './lodash.js';\nimport { __require as requireAcyclic } from './acyclic.js';\nimport { __require as requireNormalize } from './normalize.js';\nimport { __require as requireRank } from './rank/index.js';\nimport { __require as requireUtil } from './util.js';\nimport { __require as requireParentDummyChains } from './parent-dummy-chains.js';\nimport { __require as requireNestingGraph } from './nesting-graph.js';\nimport { __require as requireAddBorderSegments } from './add-border-segments.js';\nimport { __require as requireCoordinateSystem } from './coordinate-system.js';\nimport { __require as requireOrder } from './order/index.js';\nimport { __require as requirePosition } from './position/index.js';\nimport { __require as requireGraphlib } from './graphlib.js';\n\nvar layout_1;\nvar hasRequiredLayout;\n\nfunction requireLayout () {\n\tif (hasRequiredLayout) return layout_1;\n\thasRequiredLayout = 1;\n\n\tvar _ = requireLodash();\n\tvar acyclic = requireAcyclic();\n\tvar normalize = requireNormalize();\n\tvar rank = requireRank();\n\tvar normalizeRanks = requireUtil().normalizeRanks;\n\tvar parentDummyChains = requireParentDummyChains();\n\tvar removeEmptyRanks = requireUtil().removeEmptyRanks;\n\tvar nestingGraph = requireNestingGraph();\n\tvar addBorderSegments = requireAddBorderSegments();\n\tvar coordinateSystem = requireCoordinateSystem();\n\tvar order = requireOrder();\n\tvar position = requirePosition();\n\tvar util = requireUtil();\n\tvar Graph = requireGraphlib().Graph;\n\n\tlayout_1 = layout;\n\n\tfunction layout(g, opts) {\n\t  var time = opts && opts.debugTiming ? util.time : util.notime;\n\t  time(\"layout\", function() {\n\t    var layoutGraph = \n\t      time(\"  buildLayoutGraph\", function() { return buildLayoutGraph(g); });\n\t    time(\"  runLayout\",        function() { runLayout(layoutGraph, time); });\n\t    time(\"  updateInputGraph\", function() { updateInputGraph(g, layoutGraph); });\n\t  });\n\t}\n\n\tfunction runLayout(g, time) {\n\t  time(\"    makeSpaceForEdgeLabels\", function() { makeSpaceForEdgeLabels(g); });\n\t  time(\"    removeSelfEdges\",        function() { removeSelfEdges(g); });\n\t  time(\"    acyclic\",                function() { acyclic.run(g); });\n\t  time(\"    nestingGraph.run\",       function() { nestingGraph.run(g); });\n\t  time(\"    rank\",                   function() { rank(util.asNonCompoundGraph(g)); });\n\t  time(\"    injectEdgeLabelProxies\", function() { injectEdgeLabelProxies(g); });\n\t  time(\"    removeEmptyRanks\",       function() { removeEmptyRanks(g); });\n\t  time(\"    nestingGraph.cleanup\",   function() { nestingGraph.cleanup(g); });\n\t  time(\"    normalizeRanks\",         function() { normalizeRanks(g); });\n\t  time(\"    assignRankMinMax\",       function() { assignRankMinMax(g); });\n\t  time(\"    removeEdgeLabelProxies\", function() { removeEdgeLabelProxies(g); });\n\t  time(\"    normalize.run\",          function() { normalize.run(g); });\n\t  time(\"    parentDummyChains\",      function() { parentDummyChains(g); });\n\t  time(\"    addBorderSegments\",      function() { addBorderSegments(g); });\n\t  time(\"    order\",                  function() { order(g); });\n\t  time(\"    insertSelfEdges\",        function() { insertSelfEdges(g); });\n\t  time(\"    adjustCoordinateSystem\", function() { coordinateSystem.adjust(g); });\n\t  time(\"    position\",               function() { position(g); });\n\t  time(\"    positionSelfEdges\",      function() { positionSelfEdges(g); });\n\t  time(\"    removeBorderNodes\",      function() { removeBorderNodes(g); });\n\t  time(\"    normalize.undo\",         function() { normalize.undo(g); });\n\t  time(\"    fixupEdgeLabelCoords\",   function() { fixupEdgeLabelCoords(g); });\n\t  time(\"    undoCoordinateSystem\",   function() { coordinateSystem.undo(g); });\n\t  time(\"    translateGraph\",         function() { translateGraph(g); });\n\t  time(\"    assignNodeIntersects\",   function() { assignNodeIntersects(g); });\n\t  time(\"    reversePoints\",          function() { reversePointsForReversedEdges(g); });\n\t  time(\"    acyclic.undo\",           function() { acyclic.undo(g); });\n\t}\n\n\t/*\n\t * Copies final layout information from the layout graph back to the input\n\t * graph. This process only copies whitelisted attributes from the layout graph\n\t * to the input graph, so it serves as a good place to determine what\n\t * attributes can influence layout.\n\t */\n\tfunction updateInputGraph(inputGraph, layoutGraph) {\n\t  _.forEach(inputGraph.nodes(), function(v) {\n\t    var inputLabel = inputGraph.node(v);\n\t    var layoutLabel = layoutGraph.node(v);\n\n\t    if (inputLabel) {\n\t      inputLabel.x = layoutLabel.x;\n\t      inputLabel.y = layoutLabel.y;\n\n\t      if (layoutGraph.children(v).length) {\n\t        inputLabel.width = layoutLabel.width;\n\t        inputLabel.height = layoutLabel.height;\n\t      }\n\t    }\n\t  });\n\n\t  _.forEach(inputGraph.edges(), function(e) {\n\t    var inputLabel = inputGraph.edge(e);\n\t    var layoutLabel = layoutGraph.edge(e);\n\n\t    inputLabel.points = layoutLabel.points;\n\t    if (_.has(layoutLabel, \"x\")) {\n\t      inputLabel.x = layoutLabel.x;\n\t      inputLabel.y = layoutLabel.y;\n\t    }\n\t  });\n\n\t  inputGraph.graph().width = layoutGraph.graph().width;\n\t  inputGraph.graph().height = layoutGraph.graph().height;\n\t}\n\n\tvar graphNumAttrs = [\"nodesep\", \"edgesep\", \"ranksep\", \"marginx\", \"marginy\"];\n\tvar graphDefaults = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: \"tb\" };\n\tvar graphAttrs = [\"acyclicer\", \"ranker\", \"rankdir\", \"align\"];\n\tvar nodeNumAttrs = [\"width\", \"height\"];\n\tvar nodeDefaults = { width: 0, height: 0 };\n\tvar edgeNumAttrs = [\"minlen\", \"weight\", \"width\", \"height\", \"labeloffset\"];\n\tvar edgeDefaults = {\n\t  minlen: 1, weight: 1, width: 0, height: 0,\n\t  labeloffset: 10, labelpos: \"r\"\n\t};\n\tvar edgeAttrs = [\"labelpos\"];\n\n\t/*\n\t * Constructs a new graph from the input graph, which can be used for layout.\n\t * This process copies only whitelisted attributes from the input graph to the\n\t * layout graph. Thus this function serves as a good place to determine what\n\t * attributes can influence layout.\n\t */\n\tfunction buildLayoutGraph(inputGraph) {\n\t  var g = new Graph({ multigraph: true, compound: true });\n\t  var graph = canonicalize(inputGraph.graph());\n\n\t  g.setGraph(_.merge({},\n\t    graphDefaults,\n\t    selectNumberAttrs(graph, graphNumAttrs),\n\t    _.pick(graph, graphAttrs)));\n\n\t  _.forEach(inputGraph.nodes(), function(v) {\n\t    var node = canonicalize(inputGraph.node(v));\n\t    g.setNode(v, _.defaults(selectNumberAttrs(node, nodeNumAttrs), nodeDefaults));\n\t    g.setParent(v, inputGraph.parent(v));\n\t  });\n\n\t  _.forEach(inputGraph.edges(), function(e) {\n\t    var edge = canonicalize(inputGraph.edge(e));\n\t    g.setEdge(e, _.merge({},\n\t      edgeDefaults,\n\t      selectNumberAttrs(edge, edgeNumAttrs),\n\t      _.pick(edge, edgeAttrs)));\n\t  });\n\n\t  return g;\n\t}\n\n\t/*\n\t * This idea comes from the Gansner paper: to account for edge labels in our\n\t * layout we split each rank in half by doubling minlen and halving ranksep.\n\t * Then we can place labels at these mid-points between nodes.\n\t *\n\t * We also add some minimal padding to the width to push the label for the edge\n\t * away from the edge itself a bit.\n\t */\n\tfunction makeSpaceForEdgeLabels(g) {\n\t  var graph = g.graph();\n\t  graph.ranksep /= 2;\n\t  _.forEach(g.edges(), function(e) {\n\t    var edge = g.edge(e);\n\t    edge.minlen *= 2;\n\t    if (edge.labelpos.toLowerCase() !== \"c\") {\n\t      if (graph.rankdir === \"TB\" || graph.rankdir === \"BT\") {\n\t        edge.width += edge.labeloffset;\n\t      } else {\n\t        edge.height += edge.labeloffset;\n\t      }\n\t    }\n\t  });\n\t}\n\n\t/*\n\t * Creates temporary dummy nodes that capture the rank in which each edge's\n\t * label is going to, if it has one of non-zero width and height. We do this\n\t * so that we can safely remove empty ranks while preserving balance for the\n\t * label's position.\n\t */\n\tfunction injectEdgeLabelProxies(g) {\n\t  _.forEach(g.edges(), function(e) {\n\t    var edge = g.edge(e);\n\t    if (edge.width && edge.height) {\n\t      var v = g.node(e.v);\n\t      var w = g.node(e.w);\n\t      var label = { rank: (w.rank - v.rank) / 2 + v.rank, e: e };\n\t      util.addDummyNode(g, \"edge-proxy\", label, \"_ep\");\n\t    }\n\t  });\n\t}\n\n\tfunction assignRankMinMax(g) {\n\t  var maxRank = 0;\n\t  _.forEach(g.nodes(), function(v) {\n\t    var node = g.node(v);\n\t    if (node.borderTop) {\n\t      node.minRank = g.node(node.borderTop).rank;\n\t      node.maxRank = g.node(node.borderBottom).rank;\n\t      maxRank = _.max(maxRank, node.maxRank);\n\t    }\n\t  });\n\t  g.graph().maxRank = maxRank;\n\t}\n\n\tfunction removeEdgeLabelProxies(g) {\n\t  _.forEach(g.nodes(), function(v) {\n\t    var node = g.node(v);\n\t    if (node.dummy === \"edge-proxy\") {\n\t      g.edge(node.e).labelRank = node.rank;\n\t      g.removeNode(v);\n\t    }\n\t  });\n\t}\n\n\tfunction translateGraph(g) {\n\t  var minX = Number.POSITIVE_INFINITY;\n\t  var maxX = 0;\n\t  var minY = Number.POSITIVE_INFINITY;\n\t  var maxY = 0;\n\t  var graphLabel = g.graph();\n\t  var marginX = graphLabel.marginx || 0;\n\t  var marginY = graphLabel.marginy || 0;\n\n\t  function getExtremes(attrs) {\n\t    var x = attrs.x;\n\t    var y = attrs.y;\n\t    var w = attrs.width;\n\t    var h = attrs.height;\n\t    minX = Math.min(minX, x - w / 2);\n\t    maxX = Math.max(maxX, x + w / 2);\n\t    minY = Math.min(minY, y - h / 2);\n\t    maxY = Math.max(maxY, y + h / 2);\n\t  }\n\n\t  _.forEach(g.nodes(), function(v) { getExtremes(g.node(v)); });\n\t  _.forEach(g.edges(), function(e) {\n\t    var edge = g.edge(e);\n\t    if (_.has(edge, \"x\")) {\n\t      getExtremes(edge);\n\t    }\n\t  });\n\n\t  minX -= marginX;\n\t  minY -= marginY;\n\n\t  _.forEach(g.nodes(), function(v) {\n\t    var node = g.node(v);\n\t    node.x -= minX;\n\t    node.y -= minY;\n\t  });\n\n\t  _.forEach(g.edges(), function(e) {\n\t    var edge = g.edge(e);\n\t    _.forEach(edge.points, function(p) {\n\t      p.x -= minX;\n\t      p.y -= minY;\n\t    });\n\t    if (_.has(edge, \"x\")) { edge.x -= minX; }\n\t    if (_.has(edge, \"y\")) { edge.y -= minY; }\n\t  });\n\n\t  graphLabel.width = maxX - minX + marginX;\n\t  graphLabel.height = maxY - minY + marginY;\n\t}\n\n\tfunction assignNodeIntersects(g) {\n\t  _.forEach(g.edges(), function(e) {\n\t    var edge = g.edge(e);\n\t    var nodeV = g.node(e.v);\n\t    var nodeW = g.node(e.w);\n\t    var p1, p2;\n\t    if (!edge.points) {\n\t      edge.points = [];\n\t      p1 = nodeW;\n\t      p2 = nodeV;\n\t    } else {\n\t      p1 = edge.points[0];\n\t      p2 = edge.points[edge.points.length - 1];\n\t    }\n\t    edge.points.unshift(util.intersectRect(nodeV, p1));\n\t    edge.points.push(util.intersectRect(nodeW, p2));\n\t  });\n\t}\n\n\tfunction fixupEdgeLabelCoords(g) {\n\t  _.forEach(g.edges(), function(e) {\n\t    var edge = g.edge(e);\n\t    if (_.has(edge, \"x\")) {\n\t      if (edge.labelpos === \"l\" || edge.labelpos === \"r\") {\n\t        edge.width -= edge.labeloffset;\n\t      }\n\t      switch (edge.labelpos) {\n\t      case \"l\": edge.x -= edge.width / 2 + edge.labeloffset; break;\n\t      case \"r\": edge.x += edge.width / 2 + edge.labeloffset; break;\n\t      }\n\t    }\n\t  });\n\t}\n\n\tfunction reversePointsForReversedEdges(g) {\n\t  _.forEach(g.edges(), function(e) {\n\t    var edge = g.edge(e);\n\t    if (edge.reversed) {\n\t      edge.points.reverse();\n\t    }\n\t  });\n\t}\n\n\tfunction removeBorderNodes(g) {\n\t  _.forEach(g.nodes(), function(v) {\n\t    if (g.children(v).length) {\n\t      var node = g.node(v);\n\t      var t = g.node(node.borderTop);\n\t      var b = g.node(node.borderBottom);\n\t      var l = g.node(_.last(node.borderLeft));\n\t      var r = g.node(_.last(node.borderRight));\n\n\t      node.width = Math.abs(r.x - l.x);\n\t      node.height = Math.abs(b.y - t.y);\n\t      node.x = l.x + node.width / 2;\n\t      node.y = t.y + node.height / 2;\n\t    }\n\t  });\n\n\t  _.forEach(g.nodes(), function(v) {\n\t    if (g.node(v).dummy === \"border\") {\n\t      g.removeNode(v);\n\t    }\n\t  });\n\t}\n\n\tfunction removeSelfEdges(g) {\n\t  _.forEach(g.edges(), function(e) {\n\t    if (e.v === e.w) {\n\t      var node = g.node(e.v);\n\t      if (!node.selfEdges) {\n\t        node.selfEdges = [];\n\t      }\n\t      node.selfEdges.push({ e: e, label: g.edge(e) });\n\t      g.removeEdge(e);\n\t    }\n\t  });\n\t}\n\n\tfunction insertSelfEdges(g) {\n\t  var layers = util.buildLayerMatrix(g);\n\t  _.forEach(layers, function(layer) {\n\t    var orderShift = 0;\n\t    _.forEach(layer, function(v, i) {\n\t      var node = g.node(v);\n\t      node.order = i + orderShift;\n\t      _.forEach(node.selfEdges, function(selfEdge) {\n\t        util.addDummyNode(g, \"selfedge\", {\n\t          width: selfEdge.label.width,\n\t          height: selfEdge.label.height,\n\t          rank: node.rank,\n\t          order: i + (++orderShift),\n\t          e: selfEdge.e,\n\t          label: selfEdge.label\n\t        }, \"_se\");\n\t      });\n\t      delete node.selfEdges;\n\t    });\n\t  });\n\t}\n\n\tfunction positionSelfEdges(g) {\n\t  _.forEach(g.nodes(), function(v) {\n\t    var node = g.node(v);\n\t    if (node.dummy === \"selfedge\") {\n\t      var selfNode = g.node(node.e.v);\n\t      var x = selfNode.x + selfNode.width / 2;\n\t      var y = selfNode.y;\n\t      var dx = node.x - x;\n\t      var dy = selfNode.height / 2;\n\t      g.setEdge(node.e, node.label);\n\t      g.removeNode(v);\n\t      node.label.points = [\n\t        { x: x + 2 * dx / 3, y: y - dy },\n\t        { x: x + 5 * dx / 6, y: y - dy },\n\t        { x: x +     dx    , y: y },\n\t        { x: x + 5 * dx / 6, y: y + dy },\n\t        { x: x + 2 * dx / 3, y: y + dy }\n\t      ];\n\t      node.label.x = node.x;\n\t      node.label.y = node.y;\n\t    }\n\t  });\n\t}\n\n\tfunction selectNumberAttrs(obj, attrs) {\n\t  return _.mapValues(_.pick(obj, attrs), Number);\n\t}\n\n\tfunction canonicalize(attrs) {\n\t  var newAttrs = {};\n\t  _.forEach(attrs, function(v, k) {\n\t    newAttrs[k.toLowerCase()] = v;\n\t  });\n\t  return newAttrs;\n\t}\n\treturn layout_1;\n}\n\nexport { requireLayout as __require };\n//# sourceMappingURL=layout.js.map\n"],"names":["layout_1","hasRequiredLayout","requireLayout","_","requireLodash","acyclic","requireAcyclic","normalize","requireNormalize","rank","requireRank","normalizeRanks","requireUtil","parentDummyChains","requireParentDummyChains","removeEmptyRanks","nestingGraph","requireNestingGraph","addBorderSegments","requireAddBorderSegments","coordinateSystem","requireCoordinateSystem","order","requireOrder","position","requirePosition","util","Graph","requireGraphlib","layout","g","opts","time","layoutGraph","buildLayoutGraph","runLayout","updateInputGraph","makeSpaceForEdgeLabels","removeSelfEdges","injectEdgeLabelProxies","assignRankMinMax","removeEdgeLabelProxies","insertSelfEdges","positionSelfEdges","removeBorderNodes","fixupEdgeLabelCoords","translateGraph","assignNodeIntersects","reversePointsForReversedEdges","inputGraph","v","inputLabel","layoutLabel","e","graphNumAttrs","graphDefaults","graphAttrs","nodeNumAttrs","nodeDefaults","edgeNumAttrs","edgeDefaults","edgeAttrs","graph","canonicalize","selectNumberAttrs","node","edge","w","label","maxRank","minX","maxX","minY","maxY","graphLabel","marginX","marginY","getExtremes","attrs","x","y","h","p","nodeV","nodeW","p1","p2","t","b","l","r","layers","layer","orderShift","i","selfEdge","selfNode","dx","dy","obj","newAttrs","k"],"mappings":";;;;;;;;;;;;AAaA,IAAIA,GACAC;AAEJ,SAASC,KAAiB;AACzB,MAAID,EAAmB,QAAOD;AAC9B,EAAAC,IAAoB;AAEpB,MAAIE,IAAIC,GAAa,GACjBC,IAAUC,GAAc,GACxBC,IAAYC,GAAgB,GAC5BC,IAAOC,GAAW,GAClBC,IAAiBC,EAAW,EAAG,gBAC/BC,IAAoBC,GAAwB,GAC5CC,IAAmBH,EAAW,EAAG,kBACjCI,IAAeC,GAAmB,GAClCC,IAAoBC,GAAwB,GAC5CC,IAAmBC,GAAuB,GAC1CC,IAAQC,GAAY,GACpBC,IAAWC,GAAe,GAC1BC,IAAOd,EAAW,GAClBe,IAAQC,GAAe,EAAG;AAE9B,EAAA5B,IAAW6B;AAEX,WAASA,EAAOC,GAAGC,GAAM;AACvB,QAAIC,IAAOD,KAAQA,EAAK,cAAcL,EAAK,OAAOA,EAAK;AACvD,IAAAM,EAAK,UAAU,WAAW;AACxB,UAAIC,IACFD,EAAK,sBAAsB,WAAW;AAAE,eAAOE,EAAiBJ,CAAC;AAAA,MAAG,CAAC;AACvE,MAAAE,EAAK,eAAsB,WAAW;AAAE,QAAAG,EAAUF,GAAaD,CAAI;AAAA,MAAG,CAAC,GACvEA,EAAK,sBAAsB,WAAW;AAAE,QAAAI,EAAiBN,GAAGG,CAAW;AAAA,MAAG,CAAC;AAAA,IAC7E,CAAC;AAAA,EACH;AAEA,WAASE,EAAUL,GAAGE,GAAM;AAC1B,IAAAA,EAAK,8BAA8B,WAAW;AAAE,MAAAK,EAAuBP,CAAC;AAAA,IAAG,CAAC,GAC5EE,EAAK,uBAA8B,WAAW;AAAE,MAAAM,GAAgBR,CAAC;AAAA,IAAG,CAAC,GACrEE,EAAK,eAA8B,WAAW;AAAE,MAAA3B,EAAQ,IAAIyB,CAAC;AAAA,IAAG,CAAC,GACjEE,EAAK,wBAA8B,WAAW;AAAE,MAAAhB,EAAa,IAAIc,CAAC;AAAA,IAAG,CAAC,GACtEE,EAAK,YAA8B,WAAW;AAAE,MAAAvB,EAAKiB,EAAK,mBAAmBI,CAAC,CAAC;AAAA,IAAG,CAAC,GACnFE,EAAK,8BAA8B,WAAW;AAAE,MAAAO,EAAuBT,CAAC;AAAA,IAAG,CAAC,GAC5EE,EAAK,wBAA8B,WAAW;AAAE,MAAAjB,EAAiBe,CAAC;AAAA,IAAG,CAAC,GACtEE,EAAK,4BAA8B,WAAW;AAAE,MAAAhB,EAAa,QAAQc,CAAC;AAAA,IAAG,CAAC,GAC1EE,EAAK,sBAA8B,WAAW;AAAE,MAAArB,EAAemB,CAAC;AAAA,IAAG,CAAC,GACpEE,EAAK,wBAA8B,WAAW;AAAE,MAAAQ,EAAiBV,CAAC;AAAA,IAAG,CAAC,GACtEE,EAAK,8BAA8B,WAAW;AAAE,MAAAS,EAAuBX,CAAC;AAAA,IAAG,CAAC,GAC5EE,EAAK,qBAA8B,WAAW;AAAE,MAAAzB,EAAU,IAAIuB,CAAC;AAAA,IAAG,CAAC,GACnEE,EAAK,yBAA8B,WAAW;AAAE,MAAAnB,EAAkBiB,CAAC;AAAA,IAAG,CAAC,GACvEE,EAAK,yBAA8B,WAAW;AAAE,MAAAd,EAAkBY,CAAC;AAAA,IAAG,CAAC,GACvEE,EAAK,aAA8B,WAAW;AAAE,MAAAV,EAAMQ,CAAC;AAAA,IAAG,CAAC,GAC3DE,EAAK,uBAA8B,WAAW;AAAE,MAAAU,GAAgBZ,CAAC;AAAA,IAAG,CAAC,GACrEE,EAAK,8BAA8B,WAAW;AAAE,MAAAZ,EAAiB,OAAOU,CAAC;AAAA,IAAG,CAAC,GAC7EE,EAAK,gBAA8B,WAAW;AAAE,MAAAR,EAASM,CAAC;AAAA,IAAG,CAAC,GAC9DE,EAAK,yBAA8B,WAAW;AAAE,MAAAW,GAAkBb,CAAC;AAAA,IAAG,CAAC,GACvEE,EAAK,yBAA8B,WAAW;AAAE,MAAAY,EAAkBd,CAAC;AAAA,IAAG,CAAC,GACvEE,EAAK,sBAA8B,WAAW;AAAE,MAAAzB,EAAU,KAAKuB,CAAC;AAAA,IAAG,CAAC,GACpEE,EAAK,4BAA8B,WAAW;AAAE,MAAAa,EAAqBf,CAAC;AAAA,IAAG,CAAC,GAC1EE,EAAK,4BAA8B,WAAW;AAAE,MAAAZ,EAAiB,KAAKU,CAAC;AAAA,IAAG,CAAC,GAC3EE,EAAK,sBAA8B,WAAW;AAAE,MAAAc,EAAehB,CAAC;AAAA,IAAG,CAAC,GACpEE,EAAK,4BAA8B,WAAW;AAAE,MAAAe,EAAqBjB,CAAC;AAAA,IAAG,CAAC,GAC1EE,EAAK,qBAA8B,WAAW;AAAE,MAAAgB,EAA8BlB,CAAC;AAAA,IAAG,CAAC,GACnFE,EAAK,oBAA8B,WAAW;AAAE,MAAA3B,EAAQ,KAAKyB,CAAC;AAAA,IAAG,CAAC;AAAA,EACpE;AAQA,WAASM,EAAiBa,GAAYhB,GAAa;AACjD,IAAA9B,EAAE,QAAQ8C,EAAW,MAAK,GAAI,SAASC,GAAG;AACxC,UAAIC,IAAaF,EAAW,KAAKC,CAAC,GAC9BE,IAAcnB,EAAY,KAAKiB,CAAC;AAEpC,MAAIC,MACFA,EAAW,IAAIC,EAAY,GAC3BD,EAAW,IAAIC,EAAY,GAEvBnB,EAAY,SAASiB,CAAC,EAAE,WAC1BC,EAAW,QAAQC,EAAY,OAC/BD,EAAW,SAASC,EAAY;AAAA,IAGtC,CAAC,GAEDjD,EAAE,QAAQ8C,EAAW,MAAK,GAAI,SAASI,GAAG;AACxC,UAAIF,IAAaF,EAAW,KAAKI,CAAC,GAC9BD,IAAcnB,EAAY,KAAKoB,CAAC;AAEpC,MAAAF,EAAW,SAASC,EAAY,QAC5BjD,EAAE,IAAIiD,GAAa,GAAG,MACxBD,EAAW,IAAIC,EAAY,GAC3BD,EAAW,IAAIC,EAAY;AAAA,IAE/B,CAAC,GAEDH,EAAW,MAAK,EAAG,QAAQhB,EAAY,MAAK,EAAG,OAC/CgB,EAAW,MAAK,EAAG,SAAShB,EAAY,MAAK,EAAG;AAAA,EAClD;AAEA,MAAIqB,IAAgB,CAAC,WAAW,WAAW,WAAW,WAAW,SAAS,GACtEC,IAAgB,EAAE,SAAS,IAAI,SAAS,IAAI,SAAS,IAAI,SAAS,KAAI,GACtEC,IAAa,CAAC,aAAa,UAAU,WAAW,OAAO,GACvDC,IAAe,CAAC,SAAS,QAAQ,GACjCC,IAAe,EAAE,OAAO,GAAG,QAAQ,EAAC,GACpCC,IAAe,CAAC,UAAU,UAAU,SAAS,UAAU,aAAa,GACpEC,IAAe;AAAA,IACjB,QAAQ;AAAA,IAAG,QAAQ;AAAA,IAAG,OAAO;AAAA,IAAG,QAAQ;AAAA,IACxC,aAAa;AAAA,IAAI,UAAU;AAAA,EAC9B,GACKC,IAAY,CAAC,UAAU;AAQ3B,WAAS3B,EAAiBe,GAAY;AACpC,QAAInB,IAAI,IAAIH,EAAM,EAAE,YAAY,IAAM,UAAU,IAAM,GAClDmC,IAAQC,EAAad,EAAW,MAAK,CAAE;AAE3C,WAAAnB,EAAE,SAAS3B,EAAE;AAAA,MAAM,CAAA;AAAA,MACjBoD;AAAA,MACAS,EAAkBF,GAAOR,CAAa;AAAA,MACtCnD,EAAE,KAAK2D,GAAON,CAAU;AAAA,IAAC,CAAC,GAE5BrD,EAAE,QAAQ8C,EAAW,MAAK,GAAI,SAASC,GAAG;AACxC,UAAIe,IAAOF,EAAad,EAAW,KAAKC,CAAC,CAAC;AAC1C,MAAApB,EAAE,QAAQoB,GAAG/C,EAAE,SAAS6D,EAAkBC,GAAMR,CAAY,GAAGC,CAAY,CAAC,GAC5E5B,EAAE,UAAUoB,GAAGD,EAAW,OAAOC,CAAC,CAAC;AAAA,IACrC,CAAC,GAED/C,EAAE,QAAQ8C,EAAW,MAAK,GAAI,SAASI,GAAG;AACxC,UAAIa,IAAOH,EAAad,EAAW,KAAKI,CAAC,CAAC;AAC1C,MAAAvB,EAAE,QAAQuB,GAAGlD,EAAE;AAAA,QAAM,CAAA;AAAA,QACnByD;AAAA,QACAI,EAAkBE,GAAMP,CAAY;AAAA,QACpCxD,EAAE,KAAK+D,GAAML,CAAS;AAAA,MAAC,CAAC;AAAA,IAC5B,CAAC,GAEM/B;AAAA,EACT;AAUA,WAASO,EAAuBP,GAAG;AACjC,QAAIgC,IAAQhC,EAAE,MAAK;AACnB,IAAAgC,EAAM,WAAW,GACjB3D,EAAE,QAAQ2B,EAAE,MAAK,GAAI,SAASuB,GAAG;AAC/B,UAAIa,IAAOpC,EAAE,KAAKuB,CAAC;AACnB,MAAAa,EAAK,UAAU,GACXA,EAAK,SAAS,YAAW,MAAO,QAC9BJ,EAAM,YAAY,QAAQA,EAAM,YAAY,OAC9CI,EAAK,SAASA,EAAK,cAEnBA,EAAK,UAAUA,EAAK;AAAA,IAG1B,CAAC;AAAA,EACH;AAQA,WAAS3B,EAAuBT,GAAG;AACjC,IAAA3B,EAAE,QAAQ2B,EAAE,MAAK,GAAI,SAASuB,GAAG;AAC/B,UAAIa,IAAOpC,EAAE,KAAKuB,CAAC;AACnB,UAAIa,EAAK,SAASA,EAAK,QAAQ;AAC7B,YAAIhB,IAAIpB,EAAE,KAAKuB,EAAE,CAAC,GACdc,IAAIrC,EAAE,KAAKuB,EAAE,CAAC,GACde,IAAQ,EAAE,OAAOD,EAAE,OAAOjB,EAAE,QAAQ,IAAIA,EAAE,MAAM,GAAGG,EAAC;AACxD,QAAA3B,EAAK,aAAaI,GAAG,cAAcsC,GAAO,KAAK;AAAA,MACjD;AAAA,IACF,CAAC;AAAA,EACH;AAEA,WAAS5B,EAAiBV,GAAG;AAC3B,QAAIuC,IAAU;AACd,IAAAlE,EAAE,QAAQ2B,EAAE,MAAK,GAAI,SAASoB,GAAG;AAC/B,UAAIe,IAAOnC,EAAE,KAAKoB,CAAC;AACnB,MAAIe,EAAK,cACPA,EAAK,UAAUnC,EAAE,KAAKmC,EAAK,SAAS,EAAE,MACtCA,EAAK,UAAUnC,EAAE,KAAKmC,EAAK,YAAY,EAAE,MACzCI,IAAUlE,EAAE,IAAIkE,GAASJ,EAAK,OAAO;AAAA,IAEzC,CAAC,GACDnC,EAAE,QAAQ,UAAUuC;AAAA,EACtB;AAEA,WAAS5B,EAAuBX,GAAG;AACjC,IAAA3B,EAAE,QAAQ2B,EAAE,MAAK,GAAI,SAASoB,GAAG;AAC/B,UAAIe,IAAOnC,EAAE,KAAKoB,CAAC;AACnB,MAAIe,EAAK,UAAU,iBACjBnC,EAAE,KAAKmC,EAAK,CAAC,EAAE,YAAYA,EAAK,MAChCnC,EAAE,WAAWoB,CAAC;AAAA,IAElB,CAAC;AAAA,EACH;AAEA,WAASJ,EAAehB,GAAG;AACzB,QAAIwC,IAAO,OAAO,mBACdC,IAAO,GACPC,IAAO,OAAO,mBACdC,IAAO,GACPC,IAAa5C,EAAE,MAAK,GACpB6C,IAAUD,EAAW,WAAW,GAChCE,IAAUF,EAAW,WAAW;AAEpC,aAASG,EAAYC,GAAO;AAC1B,UAAIC,IAAID,EAAM,GACVE,IAAIF,EAAM,GACVX,IAAIW,EAAM,OACVG,IAAIH,EAAM;AACd,MAAAR,IAAO,KAAK,IAAIA,GAAMS,IAAIZ,IAAI,CAAC,GAC/BI,IAAO,KAAK,IAAIA,GAAMQ,IAAIZ,IAAI,CAAC,GAC/BK,IAAO,KAAK,IAAIA,GAAMQ,IAAIC,IAAI,CAAC,GAC/BR,IAAO,KAAK,IAAIA,GAAMO,IAAIC,IAAI,CAAC;AAAA,IACjC;AAEA,IAAA9E,EAAE,QAAQ2B,EAAE,MAAK,GAAI,SAASoB,GAAG;AAAE,MAAA2B,EAAY/C,EAAE,KAAKoB,CAAC,CAAC;AAAA,IAAG,CAAC,GAC5D/C,EAAE,QAAQ2B,EAAE,MAAK,GAAI,SAASuB,GAAG;AAC/B,UAAIa,IAAOpC,EAAE,KAAKuB,CAAC;AACnB,MAAIlD,EAAE,IAAI+D,GAAM,GAAG,KACjBW,EAAYX,CAAI;AAAA,IAEpB,CAAC,GAEDI,KAAQK,GACRH,KAAQI,GAERzE,EAAE,QAAQ2B,EAAE,MAAK,GAAI,SAASoB,GAAG;AAC/B,UAAIe,IAAOnC,EAAE,KAAKoB,CAAC;AACnB,MAAAe,EAAK,KAAKK,GACVL,EAAK,KAAKO;AAAA,IACZ,CAAC,GAEDrE,EAAE,QAAQ2B,EAAE,MAAK,GAAI,SAASuB,GAAG;AAC/B,UAAIa,IAAOpC,EAAE,KAAKuB,CAAC;AACnB,MAAAlD,EAAE,QAAQ+D,EAAK,QAAQ,SAASgB,GAAG;AACjC,QAAAA,EAAE,KAAKZ,GACPY,EAAE,KAAKV;AAAA,MACT,CAAC,GACGrE,EAAE,IAAI+D,GAAM,GAAG,MAAKA,EAAK,KAAKI,IAC9BnE,EAAE,IAAI+D,GAAM,GAAG,MAAKA,EAAK,KAAKM;AAAA,IACpC,CAAC,GAEDE,EAAW,QAAQH,IAAOD,IAAOK,GACjCD,EAAW,SAASD,IAAOD,IAAOI;AAAA,EACpC;AAEA,WAAS7B,EAAqBjB,GAAG;AAC/B,IAAA3B,EAAE,QAAQ2B,EAAE,MAAK,GAAI,SAASuB,GAAG;AAC/B,UAAIa,IAAOpC,EAAE,KAAKuB,CAAC,GACf8B,IAAQrD,EAAE,KAAKuB,EAAE,CAAC,GAClB+B,IAAQtD,EAAE,KAAKuB,EAAE,CAAC,GAClBgC,GAAIC;AACR,MAAKpB,EAAK,UAKRmB,IAAKnB,EAAK,OAAO,CAAC,GAClBoB,IAAKpB,EAAK,OAAOA,EAAK,OAAO,SAAS,CAAC,MALvCA,EAAK,SAAS,CAAA,GACdmB,IAAKD,GACLE,IAAKH,IAKPjB,EAAK,OAAO,QAAQxC,EAAK,cAAcyD,GAAOE,CAAE,CAAC,GACjDnB,EAAK,OAAO,KAAKxC,EAAK,cAAc0D,GAAOE,CAAE,CAAC;AAAA,IAChD,CAAC;AAAA,EACH;AAEA,WAASzC,EAAqBf,GAAG;AAC/B,IAAA3B,EAAE,QAAQ2B,EAAE,MAAK,GAAI,SAASuB,GAAG;AAC/B,UAAIa,IAAOpC,EAAE,KAAKuB,CAAC;AACnB,UAAIlD,EAAE,IAAI+D,GAAM,GAAG;AAIjB,iBAHIA,EAAK,aAAa,OAAOA,EAAK,aAAa,SAC7CA,EAAK,SAASA,EAAK,cAEbA,EAAK,UAAQ;AAAA,UACrB,KAAK;AAAK,YAAAA,EAAK,KAAKA,EAAK,QAAQ,IAAIA,EAAK;AAAa;AAAA,UACvD,KAAK;AAAK,YAAAA,EAAK,KAAKA,EAAK,QAAQ,IAAIA,EAAK;AAAa;AAAA,QAC9D;AAAA,IAEG,CAAC;AAAA,EACH;AAEA,WAASlB,EAA8BlB,GAAG;AACxC,IAAA3B,EAAE,QAAQ2B,EAAE,MAAK,GAAI,SAASuB,GAAG;AAC/B,UAAIa,IAAOpC,EAAE,KAAKuB,CAAC;AACnB,MAAIa,EAAK,YACPA,EAAK,OAAO,QAAO;AAAA,IAEvB,CAAC;AAAA,EACH;AAEA,WAAStB,EAAkBd,GAAG;AAC5B,IAAA3B,EAAE,QAAQ2B,EAAE,MAAK,GAAI,SAASoB,GAAG;AAC/B,UAAIpB,EAAE,SAASoB,CAAC,EAAE,QAAQ;AACxB,YAAIe,IAAOnC,EAAE,KAAKoB,CAAC,GACfqC,IAAIzD,EAAE,KAAKmC,EAAK,SAAS,GACzBuB,IAAI1D,EAAE,KAAKmC,EAAK,YAAY,GAC5BwB,IAAI3D,EAAE,KAAK3B,EAAE,KAAK8D,EAAK,UAAU,CAAC,GAClCyB,IAAI5D,EAAE,KAAK3B,EAAE,KAAK8D,EAAK,WAAW,CAAC;AAEvC,QAAAA,EAAK,QAAQ,KAAK,IAAIyB,EAAE,IAAID,EAAE,CAAC,GAC/BxB,EAAK,SAAS,KAAK,IAAIuB,EAAE,IAAID,EAAE,CAAC,GAChCtB,EAAK,IAAIwB,EAAE,IAAIxB,EAAK,QAAQ,GAC5BA,EAAK,IAAIsB,EAAE,IAAItB,EAAK,SAAS;AAAA,MAC/B;AAAA,IACF,CAAC,GAED9D,EAAE,QAAQ2B,EAAE,MAAK,GAAI,SAASoB,GAAG;AAC/B,MAAIpB,EAAE,KAAKoB,CAAC,EAAE,UAAU,YACtBpB,EAAE,WAAWoB,CAAC;AAAA,IAElB,CAAC;AAAA,EACH;AAEA,WAASZ,GAAgBR,GAAG;AAC1B,IAAA3B,EAAE,QAAQ2B,EAAE,MAAK,GAAI,SAASuB,GAAG;AAC/B,UAAIA,EAAE,MAAMA,EAAE,GAAG;AACf,YAAIY,IAAOnC,EAAE,KAAKuB,EAAE,CAAC;AACrB,QAAKY,EAAK,cACRA,EAAK,YAAY,CAAA,IAEnBA,EAAK,UAAU,KAAK,EAAE,GAAGZ,GAAG,OAAOvB,EAAE,KAAKuB,CAAC,GAAG,GAC9CvB,EAAE,WAAWuB,CAAC;AAAA,MAChB;AAAA,IACF,CAAC;AAAA,EACH;AAEA,WAASX,GAAgBZ,GAAG;AAC1B,QAAI6D,IAASjE,EAAK,iBAAiBI,CAAC;AACpC,IAAA3B,EAAE,QAAQwF,GAAQ,SAASC,GAAO;AAChC,UAAIC,IAAa;AACjB,MAAA1F,EAAE,QAAQyF,GAAO,SAAS1C,GAAG4C,GAAG;AAC9B,YAAI7B,IAAOnC,EAAE,KAAKoB,CAAC;AACnB,QAAAe,EAAK,QAAQ6B,IAAID,GACjB1F,EAAE,QAAQ8D,EAAK,WAAW,SAAS8B,GAAU;AAC3C,UAAArE,EAAK,aAAaI,GAAG,YAAY;AAAA,YAC/B,OAAOiE,EAAS,MAAM;AAAA,YACtB,QAAQA,EAAS,MAAM;AAAA,YACvB,MAAM9B,EAAK;AAAA,YACX,OAAO6B,IAAK,EAAED;AAAA,YACd,GAAGE,EAAS;AAAA,YACZ,OAAOA,EAAS;AAAA,UAC3B,GAAY,KAAK;AAAA,QACV,CAAC,GACD,OAAO9B,EAAK;AAAA,MACd,CAAC;AAAA,IACH,CAAC;AAAA,EACH;AAEA,WAAStB,GAAkBb,GAAG;AAC5B,IAAA3B,EAAE,QAAQ2B,EAAE,MAAK,GAAI,SAASoB,GAAG;AAC/B,UAAIe,IAAOnC,EAAE,KAAKoB,CAAC;AACnB,UAAIe,EAAK,UAAU,YAAY;AAC7B,YAAI+B,IAAWlE,EAAE,KAAKmC,EAAK,EAAE,CAAC,GAC1Bc,IAAIiB,EAAS,IAAIA,EAAS,QAAQ,GAClChB,IAAIgB,EAAS,GACbC,IAAKhC,EAAK,IAAIc,GACdmB,IAAKF,EAAS,SAAS;AAC3B,QAAAlE,EAAE,QAAQmC,EAAK,GAAGA,EAAK,KAAK,GAC5BnC,EAAE,WAAWoB,CAAC,GACde,EAAK,MAAM,SAAS;AAAA,UAClB,EAAE,GAAGc,IAAI,IAAIkB,IAAK,GAAG,GAAGjB,IAAIkB,EAAE;AAAA,UAC9B,EAAE,GAAGnB,IAAI,IAAIkB,IAAK,GAAG,GAAGjB,IAAIkB,EAAE;AAAA,UAC9B,EAAE,GAAGnB,IAAQkB,GAAQ,GAAGjB,EAAC;AAAA,UACzB,EAAE,GAAGD,IAAI,IAAIkB,IAAK,GAAG,GAAGjB,IAAIkB,EAAE;AAAA,UAC9B,EAAE,GAAGnB,IAAI,IAAIkB,IAAK,GAAG,GAAGjB,IAAIkB,EAAE;AAAA,QACvC,GACOjC,EAAK,MAAM,IAAIA,EAAK,GACpBA,EAAK,MAAM,IAAIA,EAAK;AAAA,MACtB;AAAA,IACF,CAAC;AAAA,EACH;AAEA,WAASD,EAAkBmC,GAAKrB,GAAO;AACrC,WAAO3E,EAAE,UAAUA,EAAE,KAAKgG,GAAKrB,CAAK,GAAG,MAAM;AAAA,EAC/C;AAEA,WAASf,EAAae,GAAO;AAC3B,QAAIsB,IAAW,CAAA;AACf,WAAAjG,EAAE,QAAQ2E,GAAO,SAAS5B,GAAGmD,GAAG;AAC9B,MAAAD,EAASC,EAAE,YAAW,CAAE,IAAInD;AAAA,IAC9B,CAAC,GACMkD;AAAA,EACT;AACA,SAAOpG;AACR;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,70 @@
+import { commonjsRequire as o } from "../../../_virtual/_commonjs-dynamic-modules.js";
+import { __require as u } from "../../lodash/cloneDeep.js";
+import { __require as a } from "../../lodash/constant.js";
+import { __require as m } from "../../lodash/defaults.js";
+import { __require as q } from "../../lodash/each.js";
+import { __require as _ } from "../../lodash/filter.js";
+import { __require as t } from "../../lodash/find.js";
+import { __require as s } from "../../lodash/flatten.js";
+import { __require as f } from "../../lodash/forEach.js";
+import { __require as p } from "../../lodash/forIn.js";
+import { __require as n } from "../../lodash/has.js";
+import { __require as c } from "../../lodash/isUndefined.js";
+import { __require as d } from "../../lodash/last.js";
+import { __require as l } from "../../lodash/map.js";
+import { __require as h } from "../../lodash/mapValues.js";
+import { __require as y } from "../../lodash/max.js";
+import { __require as M } from "../../lodash/merge.js";
+import { __require as F } from "../../lodash/min.js";
+import { __require as I } from "../../lodash/minBy.js";
+import { __require as g } from "../../lodash/now.js";
+import { __require as v } from "../../lodash/pick.js";
+import { __require as w } from "../../lodash/range.js";
+import { __require as B } from "../../lodash/reduce.js";
+import { __require as R } from "../../lodash/sortBy.js";
+import { __require as j } from "../../lodash/uniqueId.js";
+import { __require as x } from "../../lodash/values.js";
+import { __require as D } from "../../lodash/zipObject.js";
+var e, i;
+function ur() {
+  if (i) return e;
+  i = 1;
+  var r;
+  if (typeof o == "function")
+    try {
+      r = {
+        cloneDeep: u(),
+        constant: a(),
+        defaults: m(),
+        each: q(),
+        filter: _(),
+        find: t(),
+        flatten: s(),
+        forEach: f(),
+        forIn: p(),
+        has: n(),
+        isUndefined: c(),
+        last: d(),
+        map: l(),
+        mapValues: h(),
+        max: y(),
+        merge: M(),
+        min: F(),
+        minBy: I(),
+        now: g(),
+        pick: v(),
+        range: w(),
+        reduce: B(),
+        sortBy: R(),
+        uniqueId: j(),
+        values: x(),
+        zipObject: D()
+      };
+    } catch {
+    }
+  return r || (r = window._), e = r, e;
+}
+export {
+  ur as __require
+};
+//# sourceMappingURL=lodash.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"lodash.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/dagre/lib/lodash.js"],"sourcesContent":["import { commonjsRequire } from '../../../_virtual/_commonjs-dynamic-modules.js';\nimport { __require as requireCloneDeep } from '../../lodash/cloneDeep.js';\nimport { __require as requireConstant } from '../../lodash/constant.js';\nimport { __require as requireDefaults } from '../../lodash/defaults.js';\nimport { __require as requireEach } from '../../lodash/each.js';\nimport { __require as requireFilter } from '../../lodash/filter.js';\nimport { __require as requireFind } from '../../lodash/find.js';\nimport { __require as requireFlatten } from '../../lodash/flatten.js';\nimport { __require as requireForEach } from '../../lodash/forEach.js';\nimport { __require as requireForIn } from '../../lodash/forIn.js';\nimport { __require as requireHas } from '../../lodash/has.js';\nimport { __require as requireIsUndefined } from '../../lodash/isUndefined.js';\nimport { __require as requireLast } from '../../lodash/last.js';\nimport { __require as requireMap } from '../../lodash/map.js';\nimport { __require as requireMapValues } from '../../lodash/mapValues.js';\nimport { __require as requireMax } from '../../lodash/max.js';\nimport { __require as requireMerge } from '../../lodash/merge.js';\nimport { __require as requireMin } from '../../lodash/min.js';\nimport { __require as requireMinBy } from '../../lodash/minBy.js';\nimport { __require as requireNow } from '../../lodash/now.js';\nimport { __require as requirePick } from '../../lodash/pick.js';\nimport { __require as requireRange } from '../../lodash/range.js';\nimport { __require as requireReduce } from '../../lodash/reduce.js';\nimport { __require as requireSortBy } from '../../lodash/sortBy.js';\nimport { __require as requireUniqueId } from '../../lodash/uniqueId.js';\nimport { __require as requireValues } from '../../lodash/values.js';\nimport { __require as requireZipObject } from '../../lodash/zipObject.js';\n\n/* global window */\n\nvar lodash_1;\nvar hasRequiredLodash;\n\nfunction requireLodash () {\n\tif (hasRequiredLodash) return lodash_1;\n\thasRequiredLodash = 1;\n\tvar lodash;\n\n\tif (typeof commonjsRequire === \"function\") {\n\t  try {\n\t    lodash = {\n\t      cloneDeep: requireCloneDeep(),\n\t      constant: requireConstant(),\n\t      defaults: requireDefaults(),\n\t      each: requireEach(),\n\t      filter: requireFilter(),\n\t      find: requireFind(),\n\t      flatten: requireFlatten(),\n\t      forEach: requireForEach(),\n\t      forIn: requireForIn(),\n\t      has:  requireHas(),\n\t      isUndefined: requireIsUndefined(),\n\t      last: requireLast(),\n\t      map: requireMap(),\n\t      mapValues: requireMapValues(),\n\t      max: requireMax(),\n\t      merge: requireMerge(),\n\t      min: requireMin(),\n\t      minBy: requireMinBy(),\n\t      now: requireNow(),\n\t      pick: requirePick(),\n\t      range: requireRange(),\n\t      reduce: requireReduce(),\n\t      sortBy: requireSortBy(),\n\t      uniqueId: requireUniqueId(),\n\t      values: requireValues(),\n\t      zipObject: requireZipObject(),\n\t    };\n\t  } catch (e) {\n\t    // continue regardless of error\n\t  }\n\t}\n\n\tif (!lodash) {\n\t  lodash = window._;\n\t}\n\n\tlodash_1 = lodash;\n\treturn lodash_1;\n}\n\nexport { requireLodash as __require };\n//# sourceMappingURL=lodash.js.map\n"],"names":["lodash_1","hasRequiredLodash","requireLodash","lodash","commonjsRequire","requireCloneDeep","requireConstant","requireDefaults","requireEach","requireFilter","requireFind","requireFlatten","requireForEach","requireForIn","requireHas","requireIsUndefined","requireLast","requireMap","requireMapValues","requireMax","requireMerge","requireMin","requireMinBy","requireNow","requirePick","requireRange","requireReduce","requireSortBy","requireUniqueId","requireValues","requireZipObject"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;AA8BA,IAAIA,GACAC;AAEJ,SAASC,KAAiB;AACzB,MAAID,EAAmB,QAAOD;AAC9B,EAAAC,IAAoB;AACpB,MAAIE;AAEJ,MAAI,OAAOC,KAAoB;AAC7B,QAAI;AACF,MAAAD,IAAS;AAAA,QACP,WAAWE,EAAgB;AAAA,QAC3B,UAAUC,EAAe;AAAA,QACzB,UAAUC,EAAe;AAAA,QACzB,MAAMC,EAAW;AAAA,QACjB,QAAQC,EAAa;AAAA,QACrB,MAAMC,EAAW;AAAA,QACjB,SAASC,EAAc;AAAA,QACvB,SAASC,EAAc;AAAA,QACvB,OAAOC,EAAY;AAAA,QACnB,KAAMC,EAAU;AAAA,QAChB,aAAaC,EAAkB;AAAA,QAC/B,MAAMC,EAAW;AAAA,QACjB,KAAKC,EAAU;AAAA,QACf,WAAWC,EAAgB;AAAA,QAC3B,KAAKC,EAAU;AAAA,QACf,OAAOC,EAAY;AAAA,QACnB,KAAKC,EAAU;AAAA,QACf,OAAOC,EAAY;AAAA,QACnB,KAAKC,EAAU;AAAA,QACf,MAAMC,EAAW;AAAA,QACjB,OAAOC,EAAY;AAAA,QACnB,QAAQC,EAAa;AAAA,QACrB,QAAQC,EAAa;AAAA,QACrB,UAAUC,EAAe;AAAA,QACzB,QAAQC,EAAa;AAAA,QACrB,WAAWC,EAAgB;AAAA,MAClC;AAAA,IACG,QAAY;AAAA,IAEZ;AAGF,SAAK3B,MACHA,IAAS,OAAO,IAGlBH,IAAWG,GACJH;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/dagre/lib/nesting-graph.js

@@ -0,0 +1,72 @@
+import { __require as w } from "./lodash.js";
+import { __require as G } from "./util.js";
+var l, q;
+function L() {
+  if (q) return l;
+  q = 1;
+  var a = w(), s = G();
+  l = {
+    run: N,
+    cleanup: T
+  };
+  function N(e) {
+    var r = s.addDummyNode(e, "root", {}, "_root"), t = B(e), o = a.max(a.values(t)) - 1, i = 2 * o + 1;
+    e.graph().nestingRoot = r, a.forEach(e.edges(), function(n) {
+      e.edge(n).minlen *= i;
+    });
+    var d = R(e) + 1;
+    a.forEach(e.children(), function(n) {
+      m(e, r, i, d, o, t, n);
+    }), e.graph().nodeRankFactor = i;
+  }
+  function m(e, r, t, o, i, d, n) {
+    var p = e.children(n);
+    if (!p.length) {
+      n !== r && e.setEdge(r, n, { weight: 0, minlen: t });
+      return;
+    }
+    var c = s.addBorderNode(e, "_bt"), h = s.addBorderNode(e, "_bb"), v = e.node(n);
+    e.setParent(c, n), v.borderTop = c, e.setParent(h, n), v.borderBottom = h, a.forEach(p, function(f) {
+      m(e, r, t, o, i, d, f);
+      var u = e.node(f), E = u.borderTop ? u.borderTop : f, b = u.borderBottom ? u.borderBottom : f, _ = u.borderTop ? o : 2 * o, g = E !== b ? 1 : i - d[n] + 1;
+      e.setEdge(c, E, {
+        weight: _,
+        minlen: g,
+        nestingEdge: !0
+      }), e.setEdge(b, h, {
+        weight: _,
+        minlen: g,
+        nestingEdge: !0
+      });
+    }), e.parent(n) || e.setEdge(r, c, { weight: 0, minlen: i + d[n] });
+  }
+  function B(e) {
+    var r = {};
+    function t(o, i) {
+      var d = e.children(o);
+      d && d.length && a.forEach(d, function(n) {
+        t(n, i + 1);
+      }), r[o] = i;
+    }
+    return a.forEach(e.children(), function(o) {
+      t(o, 1);
+    }), r;
+  }
+  function R(e) {
+    return a.reduce(e.edges(), function(r, t) {
+      return r + e.edge(t).weight;
+    }, 0);
+  }
+  function T(e) {
+    var r = e.graph();
+    e.removeNode(r.nestingRoot), delete r.nestingRoot, a.forEach(e.edges(), function(t) {
+      var o = e.edge(t);
+      o.nestingEdge && e.removeEdge(t);
+    });
+  }
+  return l;
+}
+export {
+  L as __require
+};
+//# sourceMappingURL=nesting-graph.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/dagre/lib/nesting-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"nesting-graph.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/dagre/lib/nesting-graph.js"],"sourcesContent":["import { __require as requireLodash } from './lodash.js';\nimport { __require as requireUtil } from './util.js';\n\nvar nestingGraph;\nvar hasRequiredNestingGraph;\n\nfunction requireNestingGraph () {\n\tif (hasRequiredNestingGraph) return nestingGraph;\n\thasRequiredNestingGraph = 1;\n\tvar _ = requireLodash();\n\tvar util = requireUtil();\n\n\tnestingGraph = {\n\t  run: run,\n\t  cleanup: cleanup\n\t};\n\n\t/*\n\t * A nesting graph creates dummy nodes for the tops and bottoms of subgraphs,\n\t * adds appropriate edges to ensure that all cluster nodes are placed between\n\t * these boundries, and ensures that the graph is connected.\n\t *\n\t * In addition we ensure, through the use of the minlen property, that nodes\n\t * and subgraph border nodes to not end up on the same rank.\n\t *\n\t * Preconditions:\n\t *\n\t *    1. Input graph is a DAG\n\t *    2. Nodes in the input graph has a minlen attribute\n\t *\n\t * Postconditions:\n\t *\n\t *    1. Input graph is connected.\n\t *    2. Dummy nodes are added for the tops and bottoms of subgraphs.\n\t *    3. The minlen attribute for nodes is adjusted to ensure nodes do not\n\t *       get placed on the same rank as subgraph border nodes.\n\t *\n\t * The nesting graph idea comes from Sander, \"Layout of Compound Directed\n\t * Graphs.\"\n\t */\n\tfunction run(g) {\n\t  var root = util.addDummyNode(g, \"root\", {}, \"_root\");\n\t  var depths = treeDepths(g);\n\t  var height = _.max(_.values(depths)) - 1; // Note: depths is an Object not an array\n\t  var nodeSep = 2 * height + 1;\n\n\t  g.graph().nestingRoot = root;\n\n\t  // Multiply minlen by nodeSep to align nodes on non-border ranks.\n\t  _.forEach(g.edges(), function(e) { g.edge(e).minlen *= nodeSep; });\n\n\t  // Calculate a weight that is sufficient to keep subgraphs vertically compact\n\t  var weight = sumWeights(g) + 1;\n\n\t  // Create border nodes and link them up\n\t  _.forEach(g.children(), function(child) {\n\t    dfs(g, root, nodeSep, weight, height, depths, child);\n\t  });\n\n\t  // Save the multiplier for node layers for later removal of empty border\n\t  // layers.\n\t  g.graph().nodeRankFactor = nodeSep;\n\t}\n\n\tfunction dfs(g, root, nodeSep, weight, height, depths, v) {\n\t  var children = g.children(v);\n\t  if (!children.length) {\n\t    if (v !== root) {\n\t      g.setEdge(root, v, { weight: 0, minlen: nodeSep });\n\t    }\n\t    return;\n\t  }\n\n\t  var top = util.addBorderNode(g, \"_bt\");\n\t  var bottom = util.addBorderNode(g, \"_bb\");\n\t  var label = g.node(v);\n\n\t  g.setParent(top, v);\n\t  label.borderTop = top;\n\t  g.setParent(bottom, v);\n\t  label.borderBottom = bottom;\n\n\t  _.forEach(children, function(child) {\n\t    dfs(g, root, nodeSep, weight, height, depths, child);\n\n\t    var childNode = g.node(child);\n\t    var childTop = childNode.borderTop ? childNode.borderTop : child;\n\t    var childBottom = childNode.borderBottom ? childNode.borderBottom : child;\n\t    var thisWeight = childNode.borderTop ? weight : 2 * weight;\n\t    var minlen = childTop !== childBottom ? 1 : height - depths[v] + 1;\n\n\t    g.setEdge(top, childTop, {\n\t      weight: thisWeight,\n\t      minlen: minlen,\n\t      nestingEdge: true\n\t    });\n\n\t    g.setEdge(childBottom, bottom, {\n\t      weight: thisWeight,\n\t      minlen: minlen,\n\t      nestingEdge: true\n\t    });\n\t  });\n\n\t  if (!g.parent(v)) {\n\t    g.setEdge(root, top, { weight: 0, minlen: height + depths[v] });\n\t  }\n\t}\n\n\tfunction treeDepths(g) {\n\t  var depths = {};\n\t  function dfs(v, depth) {\n\t    var children = g.children(v);\n\t    if (children && children.length) {\n\t      _.forEach(children, function(child) {\n\t        dfs(child, depth + 1);\n\t      });\n\t    }\n\t    depths[v] = depth;\n\t  }\n\t  _.forEach(g.children(), function(v) { dfs(v, 1); });\n\t  return depths;\n\t}\n\n\tfunction sumWeights(g) {\n\t  return _.reduce(g.edges(), function(acc, e) {\n\t    return acc + g.edge(e).weight;\n\t  }, 0);\n\t}\n\n\tfunction cleanup(g) {\n\t  var graphLabel = g.graph();\n\t  g.removeNode(graphLabel.nestingRoot);\n\t  delete graphLabel.nestingRoot;\n\t  _.forEach(g.edges(), function(e) {\n\t    var edge = g.edge(e);\n\t    if (edge.nestingEdge) {\n\t      g.removeEdge(e);\n\t    }\n\t  });\n\t}\n\treturn nestingGraph;\n}\n\nexport { requireNestingGraph as __require };\n//# sourceMappingURL=nesting-graph.js.map\n"],"names":["nestingGraph","hasRequiredNestingGraph","requireNestingGraph","_","requireLodash","util","requireUtil","run","cleanup","g","root","depths","treeDepths","height","nodeSep","e","weight","sumWeights","child","dfs","v","children","top","bottom","label","childNode","childTop","childBottom","thisWeight","minlen","depth","acc","graphLabel","edge"],"mappings":";;AAGA,IAAIA,GACAC;AAEJ,SAASC,IAAuB;AAC/B,MAAID,EAAyB,QAAOD;AACpC,EAAAC,IAA0B;AAC1B,MAAIE,IAAIC,EAAa,GACjBC,IAAOC,EAAW;AAEtB,EAAAN,IAAe;AAAA,IACb,KAAKO;AAAA,IACL,SAASC;AAAA,EACZ;AAyBC,WAASD,EAAIE,GAAG;AACd,QAAIC,IAAOL,EAAK,aAAaI,GAAG,QAAQ,CAAA,GAAI,OAAO,GAC/CE,IAASC,EAAWH,CAAC,GACrBI,IAASV,EAAE,IAAIA,EAAE,OAAOQ,CAAM,CAAC,IAAI,GACnCG,IAAU,IAAID,IAAS;AAE3B,IAAAJ,EAAE,QAAQ,cAAcC,GAGxBP,EAAE,QAAQM,EAAE,MAAK,GAAI,SAASM,GAAG;AAAE,MAAAN,EAAE,KAAKM,CAAC,EAAE,UAAUD;AAAA,IAAS,CAAC;AAGjE,QAAIE,IAASC,EAAWR,CAAC,IAAI;AAG7B,IAAAN,EAAE,QAAQM,EAAE,SAAQ,GAAI,SAASS,GAAO;AACtC,MAAAC,EAAIV,GAAGC,GAAMI,GAASE,GAAQH,GAAQF,GAAQO,CAAK;AAAA,IACrD,CAAC,GAIDT,EAAE,QAAQ,iBAAiBK;AAAA,EAC7B;AAEA,WAASK,EAAIV,GAAGC,GAAMI,GAASE,GAAQH,GAAQF,GAAQS,GAAG;AACxD,QAAIC,IAAWZ,EAAE,SAASW,CAAC;AAC3B,QAAI,CAACC,EAAS,QAAQ;AACpB,MAAID,MAAMV,KACRD,EAAE,QAAQC,GAAMU,GAAG,EAAE,QAAQ,GAAG,QAAQN,GAAS;AAEnD;AAAA,IACF;AAEA,QAAIQ,IAAMjB,EAAK,cAAcI,GAAG,KAAK,GACjCc,IAASlB,EAAK,cAAcI,GAAG,KAAK,GACpCe,IAAQf,EAAE,KAAKW,CAAC;AAEpB,IAAAX,EAAE,UAAUa,GAAKF,CAAC,GAClBI,EAAM,YAAYF,GAClBb,EAAE,UAAUc,GAAQH,CAAC,GACrBI,EAAM,eAAeD,GAErBpB,EAAE,QAAQkB,GAAU,SAASH,GAAO;AAClC,MAAAC,EAAIV,GAAGC,GAAMI,GAASE,GAAQH,GAAQF,GAAQO,CAAK;AAEnD,UAAIO,IAAYhB,EAAE,KAAKS,CAAK,GACxBQ,IAAWD,EAAU,YAAYA,EAAU,YAAYP,GACvDS,IAAcF,EAAU,eAAeA,EAAU,eAAeP,GAChEU,IAAaH,EAAU,YAAYT,IAAS,IAAIA,GAChDa,IAASH,MAAaC,IAAc,IAAId,IAASF,EAAOS,CAAC,IAAI;AAEjE,MAAAX,EAAE,QAAQa,GAAKI,GAAU;AAAA,QACvB,QAAQE;AAAA,QACR,QAAQC;AAAA,QACR,aAAa;AAAA,MACpB,CAAM,GAEDpB,EAAE,QAAQkB,GAAaJ,GAAQ;AAAA,QAC7B,QAAQK;AAAA,QACR,QAAQC;AAAA,QACR,aAAa;AAAA,MACpB,CAAM;AAAA,IACH,CAAC,GAEIpB,EAAE,OAAOW,CAAC,KACbX,EAAE,QAAQC,GAAMY,GAAK,EAAE,QAAQ,GAAG,QAAQT,IAASF,EAAOS,CAAC,EAAC,CAAE;AAAA,EAElE;AAEA,WAASR,EAAWH,GAAG;AACrB,QAAIE,IAAS,CAAA;AACb,aAASQ,EAAIC,GAAGU,GAAO;AACrB,UAAIT,IAAWZ,EAAE,SAASW,CAAC;AAC3B,MAAIC,KAAYA,EAAS,UACvBlB,EAAE,QAAQkB,GAAU,SAASH,GAAO;AAClC,QAAAC,EAAID,GAAOY,IAAQ,CAAC;AAAA,MACtB,CAAC,GAEHnB,EAAOS,CAAC,IAAIU;AAAA,IACd;AACA,WAAA3B,EAAE,QAAQM,EAAE,SAAQ,GAAI,SAASW,GAAG;AAAE,MAAAD,EAAIC,GAAG,CAAC;AAAA,IAAG,CAAC,GAC3CT;AAAA,EACT;AAEA,WAASM,EAAWR,GAAG;AACrB,WAAON,EAAE,OAAOM,EAAE,MAAK,GAAI,SAASsB,GAAKhB,GAAG;AAC1C,aAAOgB,IAAMtB,EAAE,KAAKM,CAAC,EAAE;AAAA,IACzB,GAAG,CAAC;AAAA,EACN;AAEA,WAASP,EAAQC,GAAG;AAClB,QAAIuB,IAAavB,EAAE,MAAK;AACxB,IAAAA,EAAE,WAAWuB,EAAW,WAAW,GACnC,OAAOA,EAAW,aAClB7B,EAAE,QAAQM,EAAE,MAAK,GAAI,SAASM,GAAG;AAC/B,UAAIkB,IAAOxB,EAAE,KAAKM,CAAC;AACnB,MAAIkB,EAAK,eACPxB,EAAE,WAAWM,CAAC;AAAA,IAElB,CAAC;AAAA,EACH;AACA,SAAOf;AACR;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,45 @@
+import { __require as y } from "./lodash.js";
+import { __require as c } from "./util.js";
+var u, f;
+function q() {
+  if (f) return u;
+  f = 1;
+  var m = y(), v = c();
+  u = {
+    run: g,
+    undo: b
+  };
+  function g(e) {
+    e.graph().dummyChains = [], m.forEach(e.edges(), function(a) {
+      w(e, a);
+    });
+  }
+  function w(e, a) {
+    var r = a.v, i = e.node(r).rank, o = a.w, l = e.node(o).rank, s = a.name, d = e.edge(a), p = d.labelRank;
+    if (l !== i + 1) {
+      e.removeEdge(a);
+      var t, n, h;
+      for (h = 0, ++i; i < l; ++h, ++i)
+        d.points = [], n = {
+          width: 0,
+          height: 0,
+          edgeLabel: d,
+          edgeObj: a,
+          rank: i
+        }, t = v.addDummyNode(e, "edge", n, "_d"), i === p && (n.width = d.width, n.height = d.height, n.dummy = "edge-label", n.labelpos = d.labelpos), e.setEdge(r, t, { weight: d.weight }, s), h === 0 && e.graph().dummyChains.push(t), r = t;
+      e.setEdge(r, o, { weight: d.weight }, s);
+    }
+  }
+  function b(e) {
+    m.forEach(e.graph().dummyChains, function(a) {
+      var r = e.node(a), i = r.edgeLabel, o;
+      for (e.setEdge(r.edgeObj, i); r.dummy; )
+        o = e.successors(a)[0], e.removeNode(a), i.points.push({ x: r.x, y: r.y }), r.dummy === "edge-label" && (i.x = r.x, i.y = r.y, i.width = r.width, i.height = r.height), a = o, r = e.node(a);
+    });
+  }
+  return u;
+}
+export {
+  q as __require
+};
+//# sourceMappingURL=normalize.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"normalize.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/dagre/lib/normalize.js"],"sourcesContent":["import { __require as requireLodash } from './lodash.js';\nimport { __require as requireUtil } from './util.js';\n\nvar normalize;\nvar hasRequiredNormalize;\n\nfunction requireNormalize () {\n\tif (hasRequiredNormalize) return normalize;\n\thasRequiredNormalize = 1;\n\n\tvar _ = requireLodash();\n\tvar util = requireUtil();\n\n\tnormalize = {\n\t  run: run,\n\t  undo: undo\n\t};\n\n\t/*\n\t * Breaks any long edges in the graph into short segments that span 1 layer\n\t * each. This operation is undoable with the denormalize function.\n\t *\n\t * Pre-conditions:\n\t *\n\t *    1. The input graph is a DAG.\n\t *    2. Each node in the graph has a \"rank\" property.\n\t *\n\t * Post-condition:\n\t *\n\t *    1. All edges in the graph have a length of 1.\n\t *    2. Dummy nodes are added where edges have been split into segments.\n\t *    3. The graph is augmented with a \"dummyChains\" attribute which contains\n\t *       the first dummy in each chain of dummy nodes produced.\n\t */\n\tfunction run(g) {\n\t  g.graph().dummyChains = [];\n\t  _.forEach(g.edges(), function(edge) { normalizeEdge(g, edge); });\n\t}\n\n\tfunction normalizeEdge(g, e) {\n\t  var v = e.v;\n\t  var vRank = g.node(v).rank;\n\t  var w = e.w;\n\t  var wRank = g.node(w).rank;\n\t  var name = e.name;\n\t  var edgeLabel = g.edge(e);\n\t  var labelRank = edgeLabel.labelRank;\n\n\t  if (wRank === vRank + 1) return;\n\n\t  g.removeEdge(e);\n\n\t  var dummy, attrs, i;\n\t  for (i = 0, ++vRank; vRank < wRank; ++i, ++vRank) {\n\t    edgeLabel.points = [];\n\t    attrs = {\n\t      width: 0, height: 0,\n\t      edgeLabel: edgeLabel, edgeObj: e,\n\t      rank: vRank\n\t    };\n\t    dummy = util.addDummyNode(g, \"edge\", attrs, \"_d\");\n\t    if (vRank === labelRank) {\n\t      attrs.width = edgeLabel.width;\n\t      attrs.height = edgeLabel.height;\n\t      attrs.dummy = \"edge-label\";\n\t      attrs.labelpos = edgeLabel.labelpos;\n\t    }\n\t    g.setEdge(v, dummy, { weight: edgeLabel.weight }, name);\n\t    if (i === 0) {\n\t      g.graph().dummyChains.push(dummy);\n\t    }\n\t    v = dummy;\n\t  }\n\n\t  g.setEdge(v, w, { weight: edgeLabel.weight }, name);\n\t}\n\n\tfunction undo(g) {\n\t  _.forEach(g.graph().dummyChains, function(v) {\n\t    var node = g.node(v);\n\t    var origLabel = node.edgeLabel;\n\t    var w;\n\t    g.setEdge(node.edgeObj, origLabel);\n\t    while (node.dummy) {\n\t      w = g.successors(v)[0];\n\t      g.removeNode(v);\n\t      origLabel.points.push({ x: node.x, y: node.y });\n\t      if (node.dummy === \"edge-label\") {\n\t        origLabel.x = node.x;\n\t        origLabel.y = node.y;\n\t        origLabel.width = node.width;\n\t        origLabel.height = node.height;\n\t      }\n\t      v = w;\n\t      node = g.node(v);\n\t    }\n\t  });\n\t}\n\treturn normalize;\n}\n\nexport { requireNormalize as __require };\n//# sourceMappingURL=normalize.js.map\n"],"names":["normalize","hasRequiredNormalize","requireNormalize","_","requireLodash","util","requireUtil","run","undo","g","edge","normalizeEdge","e","v","vRank","w","wRank","name","edgeLabel","labelRank","dummy","attrs","i","node","origLabel"],"mappings":";;AAGA,IAAIA,GACAC;AAEJ,SAASC,IAAoB;AAC5B,MAAID,EAAsB,QAAOD;AACjC,EAAAC,IAAuB;AAEvB,MAAIE,IAAIC,EAAa,GACjBC,IAAOC,EAAW;AAEtB,EAAAN,IAAY;AAAA,IACV,KAAKO;AAAA,IACL,MAAMC;AAAA,EACT;AAkBC,WAASD,EAAIE,GAAG;AACd,IAAAA,EAAE,QAAQ,cAAc,CAAA,GACxBN,EAAE,QAAQM,EAAE,MAAK,GAAI,SAASC,GAAM;AAAE,MAAAC,EAAcF,GAAGC,CAAI;AAAA,IAAG,CAAC;AAAA,EACjE;AAEA,WAASC,EAAcF,GAAGG,GAAG;AAC3B,QAAIC,IAAID,EAAE,GACNE,IAAQL,EAAE,KAAKI,CAAC,EAAE,MAClBE,IAAIH,EAAE,GACNI,IAAQP,EAAE,KAAKM,CAAC,EAAE,MAClBE,IAAOL,EAAE,MACTM,IAAYT,EAAE,KAAKG,CAAC,GACpBO,IAAYD,EAAU;AAE1B,QAAIF,MAAUF,IAAQ,GAEtB;AAAA,MAAAL,EAAE,WAAWG,CAAC;AAEd,UAAIQ,GAAOC,GAAOC;AAClB,WAAKA,IAAI,GAAG,EAAER,GAAOA,IAAQE,GAAO,EAAEM,GAAG,EAAER;AACzC,QAAAI,EAAU,SAAS,CAAA,GACnBG,IAAQ;AAAA,UACN,OAAO;AAAA,UAAG,QAAQ;AAAA,UAClB,WAAWH;AAAA,UAAW,SAASN;AAAA,UAC/B,MAAME;AAAA,QACb,GACKM,IAAQf,EAAK,aAAaI,GAAG,QAAQY,GAAO,IAAI,GAC5CP,MAAUK,MACZE,EAAM,QAAQH,EAAU,OACxBG,EAAM,SAASH,EAAU,QACzBG,EAAM,QAAQ,cACdA,EAAM,WAAWH,EAAU,WAE7BT,EAAE,QAAQI,GAAGO,GAAO,EAAE,QAAQF,EAAU,OAAM,GAAID,CAAI,GAClDK,MAAM,KACRb,EAAE,MAAK,EAAG,YAAY,KAAKW,CAAK,GAElCP,IAAIO;AAGN,MAAAX,EAAE,QAAQI,GAAGE,GAAG,EAAE,QAAQG,EAAU,OAAM,GAAID,CAAI;AAAA;AAAA,EACpD;AAEA,WAAST,EAAKC,GAAG;AACf,IAAAN,EAAE,QAAQM,EAAE,MAAK,EAAG,aAAa,SAASI,GAAG;AAC3C,UAAIU,IAAOd,EAAE,KAAKI,CAAC,GACfW,IAAYD,EAAK,WACjBR;AAEJ,WADAN,EAAE,QAAQc,EAAK,SAASC,CAAS,GAC1BD,EAAK;AACV,QAAAR,IAAIN,EAAE,WAAWI,CAAC,EAAE,CAAC,GACrBJ,EAAE,WAAWI,CAAC,GACdW,EAAU,OAAO,KAAK,EAAE,GAAGD,EAAK,GAAG,GAAGA,EAAK,GAAG,GAC1CA,EAAK,UAAU,iBACjBC,EAAU,IAAID,EAAK,GACnBC,EAAU,IAAID,EAAK,GACnBC,EAAU,QAAQD,EAAK,OACvBC,EAAU,SAASD,EAAK,SAE1BV,IAAIE,GACJQ,IAAOd,EAAE,KAAKI,CAAC;AAAA,IAEnB,CAAC;AAAA,EACH;AACA,SAAOb;AACR;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,25 @@
+import { __require as v } from "../lodash.js";
+var t, o;
+function c() {
+  if (o) return t;
+  o = 1;
+  var s = v();
+  t = d;
+  function d(n, p, h) {
+    var i = {}, u;
+    s.forEach(h, function(f) {
+      for (var r = n.parent(f), e, a; r; ) {
+        if (e = n.parent(r), e ? (a = i[e], i[e] = r) : (a = u, u = r), a && a !== r) {
+          p.setEdge(a, r);
+          return;
+        }
+        r = e;
+      }
+    });
+  }
+  return t;
+}
+export {
+  c as __require
+};
+//# sourceMappingURL=add-subgraph-constraints.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"add-subgraph-constraints.js","sources":["../../../../../../../../../node_modules/@antv/layout/lib/node_modules/dagre/lib/order/add-subgraph-constraints.js"],"sourcesContent":["import { __require as requireLodash } from '../lodash.js';\n\nvar addSubgraphConstraints_1;\nvar hasRequiredAddSubgraphConstraints;\n\nfunction requireAddSubgraphConstraints () {\n\tif (hasRequiredAddSubgraphConstraints) return addSubgraphConstraints_1;\n\thasRequiredAddSubgraphConstraints = 1;\n\tvar _ = requireLodash();\n\n\taddSubgraphConstraints_1 = addSubgraphConstraints;\n\n\tfunction addSubgraphConstraints(g, cg, vs) {\n\t  var prev = {},\n\t    rootPrev;\n\n\t  _.forEach(vs, function(v) {\n\t    var child = g.parent(v),\n\t      parent,\n\t      prevChild;\n\t    while (child) {\n\t      parent = g.parent(child);\n\t      if (parent) {\n\t        prevChild = prev[parent];\n\t        prev[parent] = child;\n\t      } else {\n\t        prevChild = rootPrev;\n\t        rootPrev = child;\n\t      }\n\t      if (prevChild && prevChild !== child) {\n\t        cg.setEdge(prevChild, child);\n\t        return;\n\t      }\n\t      child = parent;\n\t    }\n\t  });\n\n\t  /*\n\t  function dfs(v) {\n\t    var children = v ? g.children(v) : g.children();\n\t    if (children.length) {\n\t      var min = Number.POSITIVE_INFINITY,\n\t          subgraphs = [];\n\t      _.each(children, function(child) {\n\t        var childMin = dfs(child);\n\t        if (g.children(child).length) {\n\t          subgraphs.push({ v: child, order: childMin });\n\t        }\n\t        min = Math.min(min, childMin);\n\t      });\n\t      _.reduce(_.sortBy(subgraphs, \"order\"), function(prev, curr) {\n\t        cg.setEdge(prev.v, curr.v);\n\t        return curr;\n\t      });\n\t      return min;\n\t    }\n\t    return g.node(v).order;\n\t  }\n\t  dfs(undefined);\n\t  */\n\t}\n\treturn addSubgraphConstraints_1;\n}\n\nexport { requireAddSubgraphConstraints as __require };\n//# sourceMappingURL=add-subgraph-constraints.js.map\n"],"names":["addSubgraphConstraints_1","hasRequiredAddSubgraphConstraints","requireAddSubgraphConstraints","_","requireLodash","addSubgraphConstraints","g","cg","vs","prev","rootPrev","v","child","parent","prevChild"],"mappings":";AAEA,IAAIA,GACAC;AAEJ,SAASC,IAAiC;AACzC,MAAID,EAAmC,QAAOD;AAC9C,EAAAC,IAAoC;AACpC,MAAIE,IAAIC,EAAa;AAErB,EAAAJ,IAA2BK;AAE3B,WAASA,EAAuBC,GAAGC,GAAIC,GAAI;AACzC,QAAIC,IAAO,CAAA,GACTC;AAEF,IAAAP,EAAE,QAAQK,GAAI,SAASG,GAAG;AAIxB,eAHIC,IAAQN,EAAE,OAAOK,CAAC,GACpBE,GACAC,GACKF,KAAO;AASZ,YARAC,IAASP,EAAE,OAAOM,CAAK,GACnBC,KACFC,IAAYL,EAAKI,CAAM,GACvBJ,EAAKI,CAAM,IAAID,MAEfE,IAAYJ,GACZA,IAAWE,IAETE,KAAaA,MAAcF,GAAO;AACpC,UAAAL,EAAG,QAAQO,GAAWF,CAAK;AAC3B;AAAA,QACF;AACA,QAAAA,IAAQC;AAAA,MACV;AAAA,IACF,CAAC;AAAA,EAyBH;AACA,SAAOb;AACR;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,33 @@
+import { __require as w } from "../lodash.js";
+var t, g;
+function m() {
+  if (g) return t;
+  g = 1;
+  var i = w();
+  t = d;
+  function d(e, c) {
+    return i.map(c, function(r) {
+      var u = e.inEdges(r);
+      if (u.length) {
+        var n = i.reduce(u, function(a, h) {
+          var o = e.edge(h), s = e.node(h.v);
+          return {
+            sum: a.sum + o.weight * s.order,
+            weight: a.weight + o.weight
+          };
+        }, { sum: 0, weight: 0 });
+        return {
+          v: r,
+          barycenter: n.sum / n.weight,
+          weight: n.weight
+        };
+      } else
+        return { v: r };
+    });
+  }
+  return t;
+}
+export {
+  m as __require
+};
+//# sourceMappingURL=barycenter.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"barycenter.js","sources":["../../../../../../../../../node_modules/@antv/layout/lib/node_modules/dagre/lib/order/barycenter.js"],"sourcesContent":["import { __require as requireLodash } from '../lodash.js';\n\nvar barycenter_1;\nvar hasRequiredBarycenter;\n\nfunction requireBarycenter () {\n\tif (hasRequiredBarycenter) return barycenter_1;\n\thasRequiredBarycenter = 1;\n\tvar _ = requireLodash();\n\n\tbarycenter_1 = barycenter;\n\n\tfunction barycenter(g, movable) {\n\t  return _.map(movable, function(v) {\n\t    var inV = g.inEdges(v);\n\t    if (!inV.length) {\n\t      return { v: v };\n\t    } else {\n\t      var result = _.reduce(inV, function(acc, e) {\n\t        var edge = g.edge(e),\n\t          nodeU = g.node(e.v);\n\t        return {\n\t          sum: acc.sum + (edge.weight * nodeU.order),\n\t          weight: acc.weight + edge.weight\n\t        };\n\t      }, { sum: 0, weight: 0 });\n\n\t      return {\n\t        v: v,\n\t        barycenter: result.sum / result.weight,\n\t        weight: result.weight\n\t      };\n\t    }\n\t  });\n\t}\n\treturn barycenter_1;\n}\n\nexport { requireBarycenter as __require };\n//# sourceMappingURL=barycenter.js.map\n"],"names":["barycenter_1","hasRequiredBarycenter","requireBarycenter","_","requireLodash","barycenter","g","movable","v","inV","result","acc","e","edge","nodeU"],"mappings":";AAEA,IAAIA,GACAC;AAEJ,SAASC,IAAqB;AAC7B,MAAID,EAAuB,QAAOD;AAClC,EAAAC,IAAwB;AACxB,MAAIE,IAAIC,EAAa;AAErB,EAAAJ,IAAeK;AAEf,WAASA,EAAWC,GAAGC,GAAS;AAC9B,WAAOJ,EAAE,IAAII,GAAS,SAASC,GAAG;AAChC,UAAIC,IAAMH,EAAE,QAAQE,CAAC;AACrB,UAAKC,EAAI,QAEF;AACL,YAAIC,IAASP,EAAE,OAAOM,GAAK,SAASE,GAAKC,GAAG;AAC1C,cAAIC,IAAOP,EAAE,KAAKM,CAAC,GACjBE,IAAQR,EAAE,KAAKM,EAAE,CAAC;AACpB,iBAAO;AAAA,YACL,KAAKD,EAAI,MAAOE,EAAK,SAASC,EAAM;AAAA,YACpC,QAAQH,EAAI,SAASE,EAAK;AAAA,UACrC;AAAA,QACO,GAAG,EAAE,KAAK,GAAG,QAAQ,EAAC,CAAE;AAExB,eAAO;AAAA,UACL,GAAGL;AAAA,UACH,YAAYE,EAAO,MAAMA,EAAO;AAAA,UAChC,QAAQA,EAAO;AAAA,QACxB;AAAA,MACK;AAhBE,eAAO,EAAE,GAAGF,EAAC;AAAA,IAiBjB,CAAC;AAAA,EACH;AACA,SAAOR;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/dagre/lib/order/build-layer-graph.js

@@ -0,0 +1,33 @@
+import { __require as q } from "../lodash.js";
+import { __require as G } from "../graphlib.js";
+var u, s;
+function R() {
+  if (s) return u;
+  s = 1;
+  var i = q(), p = G().Graph;
+  u = c;
+  function c(r, t, _) {
+    var d = l(r), o = new p({ compound: !0 }).setGraph({ root: d }).setDefaultNodeLabel(function(e) {
+      return r.node(e);
+    });
+    return i.forEach(r.nodes(), function(e) {
+      var a = r.node(e), b = r.parent(e);
+      (a.rank === t || a.minRank <= t && t <= a.maxRank) && (o.setNode(e), o.setParent(e, b || d), i.forEach(r[_](e), function(n) {
+        var h = n.v === e ? n.w : n.v, f = o.edge(h, e), m = i.isUndefined(f) ? 0 : f.weight;
+        o.setEdge(h, e, { weight: r.edge(n).weight + m });
+      }), i.has(a, "minRank") && o.setNode(e, {
+        borderLeft: a.borderLeft[t],
+        borderRight: a.borderRight[t]
+      }));
+    }), o;
+  }
+  function l(r) {
+    for (var t; r.hasNode(t = i.uniqueId("_root")); ) ;
+    return t;
+  }
+  return u;
+}
+export {
+  R as __require
+};
+//# sourceMappingURL=build-layer-graph.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/dagre/lib/order/build-layer-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"build-layer-graph.js","sources":["../../../../../../../../../node_modules/@antv/layout/lib/node_modules/dagre/lib/order/build-layer-graph.js"],"sourcesContent":["import { __require as requireLodash } from '../lodash.js';\nimport { __require as requireGraphlib } from '../graphlib.js';\n\nvar buildLayerGraph_1;\nvar hasRequiredBuildLayerGraph;\n\nfunction requireBuildLayerGraph () {\n\tif (hasRequiredBuildLayerGraph) return buildLayerGraph_1;\n\thasRequiredBuildLayerGraph = 1;\n\tvar _ = requireLodash();\n\tvar Graph = requireGraphlib().Graph;\n\n\tbuildLayerGraph_1 = buildLayerGraph;\n\n\t/*\n\t * Constructs a graph that can be used to sort a layer of nodes. The graph will\n\t * contain all base and subgraph nodes from the request layer in their original\n\t * hierarchy and any edges that are incident on these nodes and are of the type\n\t * requested by the \"relationship\" parameter.\n\t *\n\t * Nodes from the requested rank that do not have parents are assigned a root\n\t * node in the output graph, which is set in the root graph attribute. This\n\t * makes it easy to walk the hierarchy of movable nodes during ordering.\n\t *\n\t * Pre-conditions:\n\t *\n\t *    1. Input graph is a DAG\n\t *    2. Base nodes in the input graph have a rank attribute\n\t *    3. Subgraph nodes in the input graph has minRank and maxRank attributes\n\t *    4. Edges have an assigned weight\n\t *\n\t * Post-conditions:\n\t *\n\t *    1. Output graph has all nodes in the movable rank with preserved\n\t *       hierarchy.\n\t *    2. Root nodes in the movable layer are made children of the node\n\t *       indicated by the root attribute of the graph.\n\t *    3. Non-movable nodes incident on movable nodes, selected by the\n\t *       relationship parameter, are included in the graph (without hierarchy).\n\t *    4. Edges incident on movable nodes, selected by the relationship\n\t *       parameter, are added to the output graph.\n\t *    5. The weights for copied edges are aggregated as need, since the output\n\t *       graph is not a multi-graph.\n\t */\n\tfunction buildLayerGraph(g, rank, relationship) {\n\t  var root = createRootNode(g),\n\t    result = new Graph({ compound: true }).setGraph({ root: root })\n\t      .setDefaultNodeLabel(function(v) { return g.node(v); });\n\n\t  _.forEach(g.nodes(), function(v) {\n\t    var node = g.node(v),\n\t      parent = g.parent(v);\n\n\t    if (node.rank === rank || node.minRank <= rank && rank <= node.maxRank) {\n\t      result.setNode(v);\n\t      result.setParent(v, parent || root);\n\n\t      // This assumes we have only short edges!\n\t      _.forEach(g[relationship](v), function(e) {\n\t        var u = e.v === v ? e.w : e.v,\n\t          edge = result.edge(u, v),\n\t          weight = !_.isUndefined(edge) ? edge.weight : 0;\n\t        result.setEdge(u, v, { weight: g.edge(e).weight + weight });\n\t      });\n\n\t      if (_.has(node, \"minRank\")) {\n\t        result.setNode(v, {\n\t          borderLeft: node.borderLeft[rank],\n\t          borderRight: node.borderRight[rank]\n\t        });\n\t      }\n\t    }\n\t  });\n\n\t  return result;\n\t}\n\n\tfunction createRootNode(g) {\n\t  var v;\n\t  while (g.hasNode((v = _.uniqueId(\"_root\"))));\n\t  return v;\n\t}\n\treturn buildLayerGraph_1;\n}\n\nexport { requireBuildLayerGraph as __require };\n//# sourceMappingURL=build-layer-graph.js.map\n"],"names":["buildLayerGraph_1","hasRequiredBuildLayerGraph","requireBuildLayerGraph","_","requireLodash","Graph","requireGraphlib","buildLayerGraph","g","rank","relationship","root","createRootNode","result","v","node","parent","e","u","edge","weight"],"mappings":";;AAGA,IAAIA,GACAC;AAEJ,SAASC,IAA0B;AAClC,MAAID,EAA4B,QAAOD;AACvC,EAAAC,IAA6B;AAC7B,MAAIE,IAAIC,EAAa,GACjBC,IAAQC,EAAe,EAAG;AAE9B,EAAAN,IAAoBO;AAgCpB,WAASA,EAAgBC,GAAGC,GAAMC,GAAc;AAC9C,QAAIC,IAAOC,EAAeJ,CAAC,GACzBK,IAAS,IAAIR,EAAM,EAAE,UAAU,GAAI,CAAE,EAAE,SAAS,EAAE,MAAMM,EAAI,CAAE,EAC3D,oBAAoB,SAASG,GAAG;AAAE,aAAON,EAAE,KAAKM,CAAC;AAAA,IAAG,CAAC;AAE1D,WAAAX,EAAE,QAAQK,EAAE,MAAK,GAAI,SAASM,GAAG;AAC/B,UAAIC,IAAOP,EAAE,KAAKM,CAAC,GACjBE,IAASR,EAAE,OAAOM,CAAC;AAErB,OAAIC,EAAK,SAASN,KAAQM,EAAK,WAAWN,KAAQA,KAAQM,EAAK,aAC7DF,EAAO,QAAQC,CAAC,GAChBD,EAAO,UAAUC,GAAGE,KAAUL,CAAI,GAGlCR,EAAE,QAAQK,EAAEE,CAAY,EAAEI,CAAC,GAAG,SAASG,GAAG;AACxC,YAAIC,IAAID,EAAE,MAAMH,IAAIG,EAAE,IAAIA,EAAE,GAC1BE,IAAON,EAAO,KAAKK,GAAGJ,CAAC,GACvBM,IAAUjB,EAAE,YAAYgB,CAAI,IAAkB,IAAdA,EAAK;AACvC,QAAAN,EAAO,QAAQK,GAAGJ,GAAG,EAAE,QAAQN,EAAE,KAAKS,CAAC,EAAE,SAASG,EAAM,CAAE;AAAA,MAC5D,CAAC,GAEGjB,EAAE,IAAIY,GAAM,SAAS,KACvBF,EAAO,QAAQC,GAAG;AAAA,QAChB,YAAYC,EAAK,WAAWN,CAAI;AAAA,QAChC,aAAaM,EAAK,YAAYN,CAAI;AAAA,MAC7C,CAAU;AAAA,IAGP,CAAC,GAEMI;AAAA,EACT;AAEA,WAASD,EAAeJ,GAAG;AAEzB,aADIM,GACGN,EAAE,QAASM,IAAIX,EAAE,SAAS,OAAO,KAAI;AAC5C,WAAOW;AAAA,EACT;AACA,SAAOd;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/dagre/lib/order/cross-count.js

@@ -0,0 +1,42 @@
+import { __require as m } from "../lodash.js";
+var c, v;
+function _() {
+  if (v) return c;
+  v = 1;
+  var t = m();
+  c = w;
+  function w(a, u) {
+    for (var o = 0, n = 1; n < u.length; ++n)
+      o += p(a, u[n - 1], u[n]);
+    return o;
+  }
+  function p(a, u, o) {
+    for (var n = t.zipObject(
+      o,
+      t.map(o, function(e, r) {
+        return r;
+      })
+    ), C = t.flatten(t.map(u, function(e) {
+      return t.sortBy(t.map(a.outEdges(e), function(r) {
+        return { pos: n[r.w], weight: a.edge(r).weight };
+      }), "pos");
+    }), !0), i = 1; i < o.length; ) i <<= 1;
+    var g = 2 * i - 1;
+    i -= 1;
+    var s = t.map(new Array(g), function() {
+      return 0;
+    }), f = 0;
+    return t.forEach(C.forEach(function(e) {
+      var r = e.pos + i;
+      s[r] += e.weight;
+      for (var h = 0; r > 0; )
+        r % 2 && (h += s[r + 1]), r = r - 1 >> 1, s[r] += e.weight;
+      f += e.weight * h;
+    })), f;
+  }
+  return c;
+}
+export {
+  _ as __require
+};
+//# sourceMappingURL=cross-count.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/dagre/lib/order/cross-count.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cross-count.js","sources":["../../../../../../../../../node_modules/@antv/layout/lib/node_modules/dagre/lib/order/cross-count.js"],"sourcesContent":["import { __require as requireLodash } from '../lodash.js';\n\nvar crossCount_1;\nvar hasRequiredCrossCount;\n\nfunction requireCrossCount () {\n\tif (hasRequiredCrossCount) return crossCount_1;\n\thasRequiredCrossCount = 1;\n\n\tvar _ = requireLodash();\n\n\tcrossCount_1 = crossCount;\n\n\t/*\n\t * A function that takes a layering (an array of layers, each with an array of\n\t * ordererd nodes) and a graph and returns a weighted crossing count.\n\t *\n\t * Pre-conditions:\n\t *\n\t *    1. Input graph must be simple (not a multigraph), directed, and include\n\t *       only simple edges.\n\t *    2. Edges in the input graph must have assigned weights.\n\t *\n\t * Post-conditions:\n\t *\n\t *    1. The graph and layering matrix are left unchanged.\n\t *\n\t * This algorithm is derived from Barth, et al., \"Bilayer Cross Counting.\"\n\t */\n\tfunction crossCount(g, layering) {\n\t  var cc = 0;\n\t  for (var i = 1; i < layering.length; ++i) {\n\t    cc += twoLayerCrossCount(g, layering[i-1], layering[i]);\n\t  }\n\t  return cc;\n\t}\n\n\tfunction twoLayerCrossCount(g, northLayer, southLayer) {\n\t  // Sort all of the edges between the north and south layers by their position\n\t  // in the north layer and then the south. Map these edges to the position of\n\t  // their head in the south layer.\n\t  var southPos = _.zipObject(southLayer,\n\t    _.map(southLayer, function (v, i) { return i; }));\n\t  var southEntries = _.flatten(_.map(northLayer, function(v) {\n\t    return _.sortBy(_.map(g.outEdges(v), function(e) {\n\t      return { pos: southPos[e.w], weight: g.edge(e).weight };\n\t    }), \"pos\");\n\t  }), true);\n\n\t  // Build the accumulator tree\n\t  var firstIndex = 1;\n\t  while (firstIndex < southLayer.length) firstIndex <<= 1;\n\t  var treeSize = 2 * firstIndex - 1;\n\t  firstIndex -= 1;\n\t  var tree = _.map(new Array(treeSize), function() { return 0; });\n\n\t  // Calculate the weighted crossings\n\t  var cc = 0;\n\t  _.forEach(southEntries.forEach(function(entry) {\n\t    var index = entry.pos + firstIndex;\n\t    tree[index] += entry.weight;\n\t    var weightSum = 0;\n\t    while (index > 0) {\n\t      if (index % 2) {\n\t        weightSum += tree[index + 1];\n\t      }\n\t      index = (index - 1) >> 1;\n\t      tree[index] += entry.weight;\n\t    }\n\t    cc += entry.weight * weightSum;\n\t  }));\n\n\t  return cc;\n\t}\n\treturn crossCount_1;\n}\n\nexport { requireCrossCount as __require };\n//# sourceMappingURL=cross-count.js.map\n"],"names":["crossCount_1","hasRequiredCrossCount","requireCrossCount","_","requireLodash","crossCount","g","layering","cc","i","twoLayerCrossCount","northLayer","southLayer","southPos","v","southEntries","e","firstIndex","treeSize","tree","entry","index","weightSum"],"mappings":";AAEA,IAAIA,GACAC;AAEJ,SAASC,IAAqB;AAC7B,MAAID,EAAuB,QAAOD;AAClC,EAAAC,IAAwB;AAExB,MAAIE,IAAIC,EAAa;AAErB,EAAAJ,IAAeK;AAkBf,WAASA,EAAWC,GAAGC,GAAU;AAE/B,aADIC,IAAK,GACAC,IAAI,GAAGA,IAAIF,EAAS,QAAQ,EAAEE;AACrC,MAAAD,KAAME,EAAmBJ,GAAGC,EAASE,IAAE,CAAC,GAAGF,EAASE,CAAC,CAAC;AAExD,WAAOD;AAAA,EACT;AAEA,WAASE,EAAmBJ,GAAGK,GAAYC,GAAY;AAcrD,aAVIC,IAAWV,EAAE;AAAA,MAAUS;AAAA,MACzBT,EAAE,IAAIS,GAAY,SAAUE,GAAGL,GAAG;AAAE,eAAOA;AAAA,MAAG,CAAC;AAAA,IAAC,GAC9CM,IAAeZ,EAAE,QAAQA,EAAE,IAAIQ,GAAY,SAASG,GAAG;AACzD,aAAOX,EAAE,OAAOA,EAAE,IAAIG,EAAE,SAASQ,CAAC,GAAG,SAASE,GAAG;AAC/C,eAAO,EAAE,KAAKH,EAASG,EAAE,CAAC,GAAG,QAAQV,EAAE,KAAKU,CAAC,EAAE,OAAM;AAAA,MACvD,CAAC,GAAG,KAAK;AAAA,IACX,CAAC,GAAG,EAAI,GAGJC,IAAa,GACVA,IAAaL,EAAW,SAAQ,CAAAK,MAAe;AACtD,QAAIC,IAAW,IAAID,IAAa;AAChC,IAAAA,KAAc;AACd,QAAIE,IAAOhB,EAAE,IAAI,IAAI,MAAMe,CAAQ,GAAG,WAAW;AAAE,aAAO;AAAA,IAAG,CAAC,GAG1DV,IAAK;AACT,WAAAL,EAAE,QAAQY,EAAa,QAAQ,SAASK,GAAO;AAC7C,UAAIC,IAAQD,EAAM,MAAMH;AACxB,MAAAE,EAAKE,CAAK,KAAKD,EAAM;AAErB,eADIE,IAAY,GACTD,IAAQ;AACb,QAAIA,IAAQ,MACVC,KAAaH,EAAKE,IAAQ,CAAC,IAE7BA,IAASA,IAAQ,KAAM,GACvBF,EAAKE,CAAK,KAAKD,EAAM;AAEvB,MAAAZ,KAAMY,EAAM,SAASE;AAAA,IACvB,CAAC,CAAC,GAEKd;AAAA,EACT;AACA,SAAOR;AACR;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,51 @@
+import { __require as I } from "../lodash.js";
+import { __require as O } from "./init-order.js";
+import { __require as S } from "./cross-count.js";
+import { __require as l } from "./sort-subgraph.js";
+import { __require as x } from "./build-layer-graph.js";
+import { __require as w } from "./add-subgraph-constraints.js";
+import { __require as N } from "../graphlib.js";
+import { __require as R } from "../util.js";
+var d, v;
+function U() {
+  if (v) return d;
+  v = 1;
+  var a = I(), q = O(), c = S(), b = l(), G = x(), y = w(), L = N().Graph, f = R();
+  d = C;
+  function C(r) {
+    var o = f.maxRank(r), i = _(r, a.range(1, o + 1), "inEdges"), e = _(r, a.range(o - 1, -1, -1), "outEdges"), u = q(r);
+    h(r, u);
+    for (var n = Number.POSITIVE_INFINITY, s, t = 0, p = 0; p < 4; ++t, ++p) {
+      E(t % 2 ? i : e, t % 4 >= 2), u = f.buildLayerMatrix(r);
+      var m = c(r, u);
+      m < n && (p = 0, s = a.cloneDeep(u), n = m);
+    }
+    h(r, s);
+  }
+  function _(r, o, i) {
+    return a.map(o, function(e) {
+      return G(r, e, i);
+    });
+  }
+  function E(r, o) {
+    var i = new L();
+    a.forEach(r, function(e) {
+      var u = e.graph().root, n = b(e, u, i, o);
+      a.forEach(n.vs, function(s, t) {
+        e.node(s).order = t;
+      }), y(e, i, n.vs);
+    });
+  }
+  function h(r, o) {
+    a.forEach(o, function(i) {
+      a.forEach(i, function(e, u) {
+        r.node(e).order = u;
+      });
+    });
+  }
+  return d;
+}
+export {
+  U as __require
+};
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../../../node_modules/@antv/layout/lib/node_modules/dagre/lib/order/index.js"],"sourcesContent":["import { __require as requireLodash } from '../lodash.js';\nimport { __require as requireInitOrder } from './init-order.js';\nimport { __require as requireCrossCount } from './cross-count.js';\nimport { __require as requireSortSubgraph } from './sort-subgraph.js';\nimport { __require as requireBuildLayerGraph } from './build-layer-graph.js';\nimport { __require as requireAddSubgraphConstraints } from './add-subgraph-constraints.js';\nimport { __require as requireGraphlib } from '../graphlib.js';\nimport { __require as requireUtil } from '../util.js';\n\nvar order_1;\nvar hasRequiredOrder;\n\nfunction requireOrder () {\n\tif (hasRequiredOrder) return order_1;\n\thasRequiredOrder = 1;\n\n\tvar _ = requireLodash();\n\tvar initOrder = requireInitOrder();\n\tvar crossCount = requireCrossCount();\n\tvar sortSubgraph = requireSortSubgraph();\n\tvar buildLayerGraph = requireBuildLayerGraph();\n\tvar addSubgraphConstraints = requireAddSubgraphConstraints();\n\tvar Graph = requireGraphlib().Graph;\n\tvar util = requireUtil();\n\n\torder_1 = order;\n\n\t/*\n\t * Applies heuristics to minimize edge crossings in the graph and sets the best\n\t * order solution as an order attribute on each node.\n\t *\n\t * Pre-conditions:\n\t *\n\t *    1. Graph must be DAG\n\t *    2. Graph nodes must be objects with a \"rank\" attribute\n\t *    3. Graph edges must have the \"weight\" attribute\n\t *\n\t * Post-conditions:\n\t *\n\t *    1. Graph nodes will have an \"order\" attribute based on the results of the\n\t *       algorithm.\n\t */\n\tfunction order(g) {\n\t  var maxRank = util.maxRank(g),\n\t    downLayerGraphs = buildLayerGraphs(g, _.range(1, maxRank + 1), \"inEdges\"),\n\t    upLayerGraphs = buildLayerGraphs(g, _.range(maxRank - 1, -1, -1), \"outEdges\");\n\n\t  var layering = initOrder(g);\n\t  assignOrder(g, layering);\n\n\t  var bestCC = Number.POSITIVE_INFINITY,\n\t    best;\n\n\t  for (var i = 0, lastBest = 0; lastBest < 4; ++i, ++lastBest) {\n\t    sweepLayerGraphs(i % 2 ? downLayerGraphs : upLayerGraphs, i % 4 >= 2);\n\n\t    layering = util.buildLayerMatrix(g);\n\t    var cc = crossCount(g, layering);\n\t    if (cc < bestCC) {\n\t      lastBest = 0;\n\t      best = _.cloneDeep(layering);\n\t      bestCC = cc;\n\t    }\n\t  }\n\n\t  assignOrder(g, best);\n\t}\n\n\tfunction buildLayerGraphs(g, ranks, relationship) {\n\t  return _.map(ranks, function(rank) {\n\t    return buildLayerGraph(g, rank, relationship);\n\t  });\n\t}\n\n\tfunction sweepLayerGraphs(layerGraphs, biasRight) {\n\t  var cg = new Graph();\n\t  _.forEach(layerGraphs, function(lg) {\n\t    var root = lg.graph().root;\n\t    var sorted = sortSubgraph(lg, root, cg, biasRight);\n\t    _.forEach(sorted.vs, function(v, i) {\n\t      lg.node(v).order = i;\n\t    });\n\t    addSubgraphConstraints(lg, cg, sorted.vs);\n\t  });\n\t}\n\n\tfunction assignOrder(g, layering) {\n\t  _.forEach(layering, function(layer) {\n\t    _.forEach(layer, function(v, i) {\n\t      g.node(v).order = i;\n\t    });\n\t  });\n\t}\n\treturn order_1;\n}\n\nexport { requireOrder as __require };\n//# sourceMappingURL=index.js.map\n"],"names":["order_1","hasRequiredOrder","requireOrder","_","requireLodash","initOrder","requireInitOrder","crossCount","requireCrossCount","sortSubgraph","requireSortSubgraph","buildLayerGraph","requireBuildLayerGraph","addSubgraphConstraints","requireAddSubgraphConstraints","Graph","requireGraphlib","util","requireUtil","order","g","maxRank","downLayerGraphs","buildLayerGraphs","upLayerGraphs","layering","assignOrder","bestCC","best","i","lastBest","sweepLayerGraphs","cc","ranks","relationship","rank","layerGraphs","biasRight","cg","lg","root","sorted","v","layer"],"mappings":";;;;;;;;AASA,IAAIA,GACAC;AAEJ,SAASC,IAAgB;AACxB,MAAID,EAAkB,QAAOD;AAC7B,EAAAC,IAAmB;AAEnB,MAAIE,IAAIC,EAAa,GACjBC,IAAYC,EAAgB,GAC5BC,IAAaC,EAAiB,GAC9BC,IAAeC,EAAmB,GAClCC,IAAkBC,EAAsB,GACxCC,IAAyBC,EAA6B,GACtDC,IAAQC,EAAe,EAAG,OAC1BC,IAAOC,EAAW;AAEtB,EAAAlB,IAAUmB;AAiBV,WAASA,EAAMC,GAAG;AAChB,QAAIC,IAAUJ,EAAK,QAAQG,CAAC,GAC1BE,IAAkBC,EAAiBH,GAAGjB,EAAE,MAAM,GAAGkB,IAAU,CAAC,GAAG,SAAS,GACxEG,IAAgBD,EAAiBH,GAAGjB,EAAE,MAAMkB,IAAU,GAAG,IAAI,EAAE,GAAG,UAAU,GAE1EI,IAAWpB,EAAUe,CAAC;AAC1B,IAAAM,EAAYN,GAAGK,CAAQ;AAKvB,aAHIE,IAAS,OAAO,mBAClBC,GAEOC,IAAI,GAAGC,IAAW,GAAGA,IAAW,GAAG,EAAED,GAAG,EAAEC,GAAU;AAC3D,MAAAC,EAAiBF,IAAI,IAAIP,IAAkBE,GAAeK,IAAI,KAAK,CAAC,GAEpEJ,IAAWR,EAAK,iBAAiBG,CAAC;AAClC,UAAIY,IAAKzB,EAAWa,GAAGK,CAAQ;AAC/B,MAAIO,IAAKL,MACPG,IAAW,GACXF,IAAOzB,EAAE,UAAUsB,CAAQ,GAC3BE,IAASK;AAAA,IAEb;AAEA,IAAAN,EAAYN,GAAGQ,CAAI;AAAA,EACrB;AAEA,WAASL,EAAiBH,GAAGa,GAAOC,GAAc;AAChD,WAAO/B,EAAE,IAAI8B,GAAO,SAASE,GAAM;AACjC,aAAOxB,EAAgBS,GAAGe,GAAMD,CAAY;AAAA,IAC9C,CAAC;AAAA,EACH;AAEA,WAASH,EAAiBK,GAAaC,GAAW;AAChD,QAAIC,IAAK,IAAIvB,EAAK;AAClB,IAAAZ,EAAE,QAAQiC,GAAa,SAASG,GAAI;AAClC,UAAIC,IAAOD,EAAG,MAAK,EAAG,MAClBE,IAAShC,EAAa8B,GAAIC,GAAMF,GAAID,CAAS;AACjD,MAAAlC,EAAE,QAAQsC,EAAO,IAAI,SAASC,GAAGb,GAAG;AAClC,QAAAU,EAAG,KAAKG,CAAC,EAAE,QAAQb;AAAA,MACrB,CAAC,GACDhB,EAAuB0B,GAAID,GAAIG,EAAO,EAAE;AAAA,IAC1C,CAAC;AAAA,EACH;AAEA,WAASf,EAAYN,GAAGK,GAAU;AAChC,IAAAtB,EAAE,QAAQsB,GAAU,SAASkB,GAAO;AAClC,MAAAxC,EAAE,QAAQwC,GAAO,SAASD,GAAGb,GAAG;AAC9B,QAAAT,EAAE,KAAKsB,CAAC,EAAE,QAAQb;AAAA,MACpB,CAAC;AAAA,IACH,CAAC;AAAA,EACH;AACA,SAAO7B;AACR;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,33 @@
+import { __require as m } from "../lodash.js";
+var a, s;
+function v() {
+  if (s) return a;
+  s = 1;
+  var e = m();
+  a = d;
+  function d(n) {
+    var i = {}, t = e.filter(n.nodes(), function(r) {
+      return !n.children(r).length;
+    }), f = e.max(e.map(t, function(r) {
+      return n.node(r).rank;
+    })), u = e.map(e.range(f + 1), function() {
+      return [];
+    });
+    function o(r) {
+      if (!e.has(i, r)) {
+        i[r] = !0;
+        var h = n.node(r);
+        u[h.rank].push(r), e.forEach(n.successors(r), o);
+      }
+    }
+    var c = e.sortBy(t, function(r) {
+      return n.node(r).rank;
+    });
+    return e.forEach(c, o), u;
+  }
+  return a;
+}
+export {
+  v as __require
+};
+//# sourceMappingURL=init-order.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"init-order.js","sources":["../../../../../../../../../node_modules/@antv/layout/lib/node_modules/dagre/lib/order/init-order.js"],"sourcesContent":["import { __require as requireLodash } from '../lodash.js';\n\nvar initOrder_1;\nvar hasRequiredInitOrder;\n\nfunction requireInitOrder () {\n\tif (hasRequiredInitOrder) return initOrder_1;\n\thasRequiredInitOrder = 1;\n\n\tvar _ = requireLodash();\n\n\tinitOrder_1 = initOrder;\n\n\t/*\n\t * Assigns an initial order value for each node by performing a DFS search\n\t * starting from nodes in the first rank. Nodes are assigned an order in their\n\t * rank as they are first visited.\n\t *\n\t * This approach comes from Gansner, et al., \"A Technique for Drawing Directed\n\t * Graphs.\"\n\t *\n\t * Returns a layering matrix with an array per layer and each layer sorted by\n\t * the order of its nodes.\n\t */\n\tfunction initOrder(g) {\n\t  var visited = {};\n\t  var simpleNodes = _.filter(g.nodes(), function(v) {\n\t    return !g.children(v).length;\n\t  });\n\t  var maxRank = _.max(_.map(simpleNodes, function(v) { return g.node(v).rank; }));\n\t  var layers = _.map(_.range(maxRank + 1), function() { return []; });\n\n\t  function dfs(v) {\n\t    if (_.has(visited, v)) return;\n\t    visited[v] = true;\n\t    var node = g.node(v);\n\t    layers[node.rank].push(v);\n\t    _.forEach(g.successors(v), dfs);\n\t  }\n\n\t  var orderedVs = _.sortBy(simpleNodes, function(v) { return g.node(v).rank; });\n\t  _.forEach(orderedVs, dfs);\n\n\t  return layers;\n\t}\n\treturn initOrder_1;\n}\n\nexport { requireInitOrder as __require };\n//# sourceMappingURL=init-order.js.map\n"],"names":["initOrder_1","hasRequiredInitOrder","requireInitOrder","_","requireLodash","initOrder","g","visited","simpleNodes","v","maxRank","layers","dfs","node","orderedVs"],"mappings":";AAEA,IAAIA,GACAC;AAEJ,SAASC,IAAoB;AAC5B,MAAID,EAAsB,QAAOD;AACjC,EAAAC,IAAuB;AAEvB,MAAIE,IAAIC,EAAa;AAErB,EAAAJ,IAAcK;AAad,WAASA,EAAUC,GAAG;AACpB,QAAIC,IAAU,CAAA,GACVC,IAAcL,EAAE,OAAOG,EAAE,MAAK,GAAI,SAASG,GAAG;AAChD,aAAO,CAACH,EAAE,SAASG,CAAC,EAAE;AAAA,IACxB,CAAC,GACGC,IAAUP,EAAE,IAAIA,EAAE,IAAIK,GAAa,SAASC,GAAG;AAAE,aAAOH,EAAE,KAAKG,CAAC,EAAE;AAAA,IAAM,CAAC,CAAC,GAC1EE,IAASR,EAAE,IAAIA,EAAE,MAAMO,IAAU,CAAC,GAAG,WAAW;AAAE,aAAO,CAAA;AAAA,IAAI,CAAC;AAElE,aAASE,EAAIH,GAAG;AACd,UAAI,CAAAN,EAAE,IAAII,GAASE,CAAC,GACpB;AAAA,QAAAF,EAAQE,CAAC,IAAI;AACb,YAAII,IAAOP,EAAE,KAAKG,CAAC;AACnB,QAAAE,EAAOE,EAAK,IAAI,EAAE,KAAKJ,CAAC,GACxBN,EAAE,QAAQG,EAAE,WAAWG,CAAC,GAAGG,CAAG;AAAA;AAAA,IAChC;AAEA,QAAIE,IAAYX,EAAE,OAAOK,GAAa,SAASC,GAAG;AAAE,aAAOH,EAAE,KAAKG,CAAC,EAAE;AAAA,IAAM,CAAC;AAC5E,WAAAN,EAAE,QAAQW,GAAWF,CAAG,GAEjBD;AAAA,EACT;AACA,SAAOX;AACR;","x_google_ignoreList":[0]}