@seed-ship/mcp-ui-solid 5.7.0 → 6.0.0

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/layout.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"layout.cjs","sources":["../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/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":["requireLodash","acyclic","requireAcyclic","normalize","requireNormalize","requireRank","requireUtil","parentDummyChains","requireParentDummyChains","nestingGraph","requireNestingGraph","addBorderSegments","requireAddBorderSegments","coordinateSystem","requireCoordinateSystem","requireOrder","requirePosition","util","requireGraphlib"],"mappings":";;;;;;;;;;;;;;AAaA,IAAI;AACJ,IAAI;AAEJ,SAAS,gBAAiB;AACzB,MAAI,kBAAmB,QAAO;AAC9B,sBAAoB;AAEpB,MAAI,IAAIA,OAAAA,UAAa;AACrB,MAAIC,YAAUC,QAAAA,UAAc;AAC5B,MAAIC,cAAYC,UAAAA,UAAgB;AAChC,MAAI,OAAOC,MAAAA,UAAW;AACtB,MAAI,iBAAiBC,KAAAA,UAAW,EAAG;AACnC,MAAIC,sBAAoBC,kBAAAA,UAAwB;AAChD,MAAI,mBAAmBF,KAAAA,UAAW,EAAG;AACrC,MAAIG,iBAAeC,aAAAA,UAAmB;AACtC,MAAIC,sBAAoBC,kBAAAA,UAAwB;AAChD,MAAIC,qBAAmBC,iBAAAA,UAAuB;AAC9C,MAAI,QAAQC,QAAAA,UAAY;AACxB,MAAI,WAAWC,QAAAA,UAAe;AAC9B,MAAIC,SAAOX,KAAAA,UAAW;AACtB,MAAI,QAAQY,SAAAA,UAAe,EAAG;AAE9B,aAAW;AAEX,WAAS,OAAO,GAAG,MAAM;AACvB,QAAI,OAAO,QAAQ,KAAK,cAAcD,OAAK,OAAOA,OAAK;AACvD,SAAK,UAAU,WAAW;AACxB,UAAI,cACF,KAAK,sBAAsB,WAAW;AAAE,eAAO,iBAAiB,CAAC;AAAA,MAAG,CAAC;AACvE,WAAK,eAAsB,WAAW;AAAE,kBAAU,aAAa,IAAI;AAAA,MAAG,CAAC;AACvE,WAAK,sBAAsB,WAAW;AAAE,yBAAiB,GAAG,WAAW;AAAA,MAAG,CAAC;AAAA,IAC7E,CAAC;AAAA,EACH;AAEA,WAAS,UAAU,GAAG,MAAM;AAC1B,SAAK,8BAA8B,WAAW;AAAE,6BAAuB,CAAC;AAAA,IAAG,CAAC;AAC5E,SAAK,uBAA8B,WAAW;AAAE,sBAAgB,CAAC;AAAA,IAAG,CAAC;AACrE,SAAK,eAA8B,WAAW;AAAEhB,gBAAQ,IAAI,CAAC;AAAA,IAAG,CAAC;AACjE,SAAK,wBAA8B,WAAW;AAAEQ,qBAAa,IAAI,CAAC;AAAA,IAAG,CAAC;AACtE,SAAK,YAA8B,WAAW;AAAE,WAAKQ,OAAK,mBAAmB,CAAC,CAAC;AAAA,IAAG,CAAC;AACnF,SAAK,8BAA8B,WAAW;AAAE,6BAAuB,CAAC;AAAA,IAAG,CAAC;AAC5E,SAAK,wBAA8B,WAAW;AAAE,uBAAiB,CAAC;AAAA,IAAG,CAAC;AACtE,SAAK,4BAA8B,WAAW;AAAER,qBAAa,QAAQ,CAAC;AAAA,IAAG,CAAC;AAC1E,SAAK,sBAA8B,WAAW;AAAE,qBAAe,CAAC;AAAA,IAAG,CAAC;AACpE,SAAK,wBAA8B,WAAW;AAAE,uBAAiB,CAAC;AAAA,IAAG,CAAC;AACtE,SAAK,8BAA8B,WAAW;AAAE,6BAAuB,CAAC;AAAA,IAAG,CAAC;AAC5E,SAAK,qBAA8B,WAAW;AAAEN,kBAAU,IAAI,CAAC;AAAA,IAAG,CAAC;AACnE,SAAK,yBAA8B,WAAW;AAAEI,0BAAkB,CAAC;AAAA,IAAG,CAAC;AACvE,SAAK,yBAA8B,WAAW;AAAEI,0BAAkB,CAAC;AAAA,IAAG,CAAC;AACvE,SAAK,aAA8B,WAAW;AAAE,YAAM,CAAC;AAAA,IAAG,CAAC;AAC3D,SAAK,uBAA8B,WAAW;AAAE,sBAAgB,CAAC;AAAA,IAAG,CAAC;AACrE,SAAK,8BAA8B,WAAW;AAAEE,yBAAiB,OAAO,CAAC;AAAA,IAAG,CAAC;AAC7E,SAAK,gBAA8B,WAAW;AAAE,eAAS,CAAC;AAAA,IAAG,CAAC;AAC9D,SAAK,yBAA8B,WAAW;AAAE,wBAAkB,CAAC;AAAA,IAAG,CAAC;AACvE,SAAK,yBAA8B,WAAW;AAAE,wBAAkB,CAAC;AAAA,IAAG,CAAC;AACvE,SAAK,sBAA8B,WAAW;AAAEV,kBAAU,KAAK,CAAC;AAAA,IAAG,CAAC;AACpE,SAAK,4BAA8B,WAAW;AAAE,2BAAqB,CAAC;AAAA,IAAG,CAAC;AAC1E,SAAK,4BAA8B,WAAW;AAAEU,yBAAiB,KAAK,CAAC;AAAA,IAAG,CAAC;AAC3E,SAAK,sBAA8B,WAAW;AAAE,qBAAe,CAAC;AAAA,IAAG,CAAC;AACpE,SAAK,4BAA8B,WAAW;AAAE,2BAAqB,CAAC;AAAA,IAAG,CAAC;AAC1E,SAAK,qBAA8B,WAAW;AAAE,oCAA8B,CAAC;AAAA,IAAG,CAAC;AACnF,SAAK,oBAA8B,WAAW;AAAEZ,gBAAQ,KAAK,CAAC;AAAA,IAAG,CAAC;AAAA,EACpE;AAQA,WAAS,iBAAiB,YAAY,aAAa;AACjD,MAAE,QAAQ,WAAW,MAAK,GAAI,SAAS,GAAG;AACxC,UAAI,aAAa,WAAW,KAAK,CAAC;AAClC,UAAI,cAAc,YAAY,KAAK,CAAC;AAEpC,UAAI,YAAY;AACd,mBAAW,IAAI,YAAY;AAC3B,mBAAW,IAAI,YAAY;AAE3B,YAAI,YAAY,SAAS,CAAC,EAAE,QAAQ;AAClC,qBAAW,QAAQ,YAAY;AAC/B,qBAAW,SAAS,YAAY;AAAA,QAClC;AAAA,MACF;AAAA,IACF,CAAC;AAED,MAAE,QAAQ,WAAW,MAAK,GAAI,SAAS,GAAG;AACxC,UAAI,aAAa,WAAW,KAAK,CAAC;AAClC,UAAI,cAAc,YAAY,KAAK,CAAC;AAEpC,iBAAW,SAAS,YAAY;AAChC,UAAI,EAAE,IAAI,aAAa,GAAG,GAAG;AAC3B,mBAAW,IAAI,YAAY;AAC3B,mBAAW,IAAI,YAAY;AAAA,MAC7B;AAAA,IACF,CAAC;AAED,eAAW,MAAK,EAAG,QAAQ,YAAY,MAAK,EAAG;AAC/C,eAAW,MAAK,EAAG,SAAS,YAAY,MAAK,EAAG;AAAA,EAClD;AAEA,MAAI,gBAAgB,CAAC,WAAW,WAAW,WAAW,WAAW,SAAS;AAC1E,MAAI,gBAAgB,EAAE,SAAS,IAAI,SAAS,IAAI,SAAS,IAAI,SAAS,KAAI;AAC1E,MAAI,aAAa,CAAC,aAAa,UAAU,WAAW,OAAO;AAC3D,MAAI,eAAe,CAAC,SAAS,QAAQ;AACrC,MAAI,eAAe,EAAE,OAAO,GAAG,QAAQ,EAAC;AACxC,MAAI,eAAe,CAAC,UAAU,UAAU,SAAS,UAAU,aAAa;AACxE,MAAI,eAAe;AAAA,IACjB,QAAQ;AAAA,IAAG,QAAQ;AAAA,IAAG,OAAO;AAAA,IAAG,QAAQ;AAAA,IACxC,aAAa;AAAA,IAAI,UAAU;AAAA,EAC9B;AACC,MAAI,YAAY,CAAC,UAAU;AAQ3B,WAAS,iBAAiB,YAAY;AACpC,QAAI,IAAI,IAAI,MAAM,EAAE,YAAY,MAAM,UAAU,MAAM;AACtD,QAAI,QAAQ,aAAa,WAAW,MAAK,CAAE;AAE3C,MAAE,SAAS,EAAE;AAAA,MAAM,CAAA;AAAA,MACjB;AAAA,MACA,kBAAkB,OAAO,aAAa;AAAA,MACtC,EAAE,KAAK,OAAO,UAAU;AAAA,IAAC,CAAC;AAE5B,MAAE,QAAQ,WAAW,MAAK,GAAI,SAAS,GAAG;AACxC,UAAI,OAAO,aAAa,WAAW,KAAK,CAAC,CAAC;AAC1C,QAAE,QAAQ,GAAG,EAAE,SAAS,kBAAkB,MAAM,YAAY,GAAG,YAAY,CAAC;AAC5E,QAAE,UAAU,GAAG,WAAW,OAAO,CAAC,CAAC;AAAA,IACrC,CAAC;AAED,MAAE,QAAQ,WAAW,MAAK,GAAI,SAAS,GAAG;AACxC,UAAI,OAAO,aAAa,WAAW,KAAK,CAAC,CAAC;AAC1C,QAAE,QAAQ,GAAG,EAAE;AAAA,QAAM,CAAA;AAAA,QACnB;AAAA,QACA,kBAAkB,MAAM,YAAY;AAAA,QACpC,EAAE,KAAK,MAAM,SAAS;AAAA,MAAC,CAAC;AAAA,IAC5B,CAAC;AAED,WAAO;AAAA,EACT;AAUA,WAAS,uBAAuB,GAAG;AACjC,QAAI,QAAQ,EAAE,MAAK;AACnB,UAAM,WAAW;AACjB,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,GAAG;AAC/B,UAAI,OAAO,EAAE,KAAK,CAAC;AACnB,WAAK,UAAU;AACf,UAAI,KAAK,SAAS,YAAW,MAAO,KAAK;AACvC,YAAI,MAAM,YAAY,QAAQ,MAAM,YAAY,MAAM;AACpD,eAAK,SAAS,KAAK;AAAA,QACrB,OAAO;AACL,eAAK,UAAU,KAAK;AAAA,QACtB;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH;AAQA,WAAS,uBAAuB,GAAG;AACjC,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,GAAG;AAC/B,UAAI,OAAO,EAAE,KAAK,CAAC;AACnB,UAAI,KAAK,SAAS,KAAK,QAAQ;AAC7B,YAAI,IAAI,EAAE,KAAK,EAAE,CAAC;AAClB,YAAI,IAAI,EAAE,KAAK,EAAE,CAAC;AAClB,YAAI,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,IAAI,EAAE,MAAM,EAAI;AACxDgB,eAAK,aAAa,GAAG,cAAc,OAAO,KAAK;AAAA,MACjD;AAAA,IACF,CAAC;AAAA,EACH;AAEA,WAAS,iBAAiB,GAAG;AAC3B,QAAI,UAAU;AACd,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,GAAG;AAC/B,UAAI,OAAO,EAAE,KAAK,CAAC;AACnB,UAAI,KAAK,WAAW;AAClB,aAAK,UAAU,EAAE,KAAK,KAAK,SAAS,EAAE;AACtC,aAAK,UAAU,EAAE,KAAK,KAAK,YAAY,EAAE;AACzC,kBAAU,EAAE,IAAI,SAAS,KAAK,OAAO;AAAA,MACvC;AAAA,IACF,CAAC;AACD,MAAE,QAAQ,UAAU;AAAA,EACtB;AAEA,WAAS,uBAAuB,GAAG;AACjC,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,GAAG;AAC/B,UAAI,OAAO,EAAE,KAAK,CAAC;AACnB,UAAI,KAAK,UAAU,cAAc;AAC/B,UAAE,KAAK,KAAK,CAAC,EAAE,YAAY,KAAK;AAChC,UAAE,WAAW,CAAC;AAAA,MAChB;AAAA,IACF,CAAC;AAAA,EACH;AAEA,WAAS,eAAe,GAAG;AACzB,QAAI,OAAO,OAAO;AAClB,QAAI,OAAO;AACX,QAAI,OAAO,OAAO;AAClB,QAAI,OAAO;AACX,QAAI,aAAa,EAAE,MAAK;AACxB,QAAI,UAAU,WAAW,WAAW;AACpC,QAAI,UAAU,WAAW,WAAW;AAEpC,aAAS,YAAY,OAAO;AAC1B,UAAI,IAAI,MAAM;AACd,UAAI,IAAI,MAAM;AACd,UAAI,IAAI,MAAM;AACd,UAAI,IAAI,MAAM;AACd,aAAO,KAAK,IAAI,MAAM,IAAI,IAAI,CAAC;AAC/B,aAAO,KAAK,IAAI,MAAM,IAAI,IAAI,CAAC;AAC/B,aAAO,KAAK,IAAI,MAAM,IAAI,IAAI,CAAC;AAC/B,aAAO,KAAK,IAAI,MAAM,IAAI,IAAI,CAAC;AAAA,IACjC;AAEA,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,GAAG;AAAE,kBAAY,EAAE,KAAK,CAAC,CAAC;AAAA,IAAG,CAAC;AAC5D,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,GAAG;AAC/B,UAAI,OAAO,EAAE,KAAK,CAAC;AACnB,UAAI,EAAE,IAAI,MAAM,GAAG,GAAG;AACpB,oBAAY,IAAI;AAAA,MAClB;AAAA,IACF,CAAC;AAED,YAAQ;AACR,YAAQ;AAER,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,GAAG;AAC/B,UAAI,OAAO,EAAE,KAAK,CAAC;AACnB,WAAK,KAAK;AACV,WAAK,KAAK;AAAA,IACZ,CAAC;AAED,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,GAAG;AAC/B,UAAI,OAAO,EAAE,KAAK,CAAC;AACnB,QAAE,QAAQ,KAAK,QAAQ,SAAS,GAAG;AACjC,UAAE,KAAK;AACP,UAAE,KAAK;AAAA,MACT,CAAC;AACD,UAAI,EAAE,IAAI,MAAM,GAAG,GAAG;AAAE,aAAK,KAAK;AAAA,MAAM;AACxC,UAAI,EAAE,IAAI,MAAM,GAAG,GAAG;AAAE,aAAK,KAAK;AAAA,MAAM;AAAA,IAC1C,CAAC;AAED,eAAW,QAAQ,OAAO,OAAO;AACjC,eAAW,SAAS,OAAO,OAAO;AAAA,EACpC;AAEA,WAAS,qBAAqB,GAAG;AAC/B,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,GAAG;AAC/B,UAAI,OAAO,EAAE,KAAK,CAAC;AACnB,UAAI,QAAQ,EAAE,KAAK,EAAE,CAAC;AACtB,UAAI,QAAQ,EAAE,KAAK,EAAE,CAAC;AACtB,UAAI,IAAI;AACR,UAAI,CAAC,KAAK,QAAQ;AAChB,aAAK,SAAS,CAAA;AACd,aAAK;AACL,aAAK;AAAA,MACP,OAAO;AACL,aAAK,KAAK,OAAO,CAAC;AAClB,aAAK,KAAK,OAAO,KAAK,OAAO,SAAS,CAAC;AAAA,MACzC;AACA,WAAK,OAAO,QAAQA,OAAK,cAAc,OAAO,EAAE,CAAC;AACjD,WAAK,OAAO,KAAKA,OAAK,cAAc,OAAO,EAAE,CAAC;AAAA,IAChD,CAAC;AAAA,EACH;AAEA,WAAS,qBAAqB,GAAG;AAC/B,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,GAAG;AAC/B,UAAI,OAAO,EAAE,KAAK,CAAC;AACnB,UAAI,EAAE,IAAI,MAAM,GAAG,GAAG;AACpB,YAAI,KAAK,aAAa,OAAO,KAAK,aAAa,KAAK;AAClD,eAAK,SAAS,KAAK;AAAA,QACrB;AACA,gBAAQ,KAAK,UAAQ;AAAA,UACrB,KAAK;AAAK,iBAAK,KAAK,KAAK,QAAQ,IAAI,KAAK;AAAa;AAAA,UACvD,KAAK;AAAK,iBAAK,KAAK,KAAK,QAAQ,IAAI,KAAK;AAAa;AAAA,QAC9D;AAAA,MACK;AAAA,IACF,CAAC;AAAA,EACH;AAEA,WAAS,8BAA8B,GAAG;AACxC,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,GAAG;AAC/B,UAAI,OAAO,EAAE,KAAK,CAAC;AACnB,UAAI,KAAK,UAAU;AACjB,aAAK,OAAO,QAAO;AAAA,MACrB;AAAA,IACF,CAAC;AAAA,EACH;AAEA,WAAS,kBAAkB,GAAG;AAC5B,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,GAAG;AAC/B,UAAI,EAAE,SAAS,CAAC,EAAE,QAAQ;AACxB,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,YAAI,IAAI,EAAE,KAAK,KAAK,SAAS;AAC7B,YAAI,IAAI,EAAE,KAAK,KAAK,YAAY;AAChC,YAAI,IAAI,EAAE,KAAK,EAAE,KAAK,KAAK,UAAU,CAAC;AACtC,YAAI,IAAI,EAAE,KAAK,EAAE,KAAK,KAAK,WAAW,CAAC;AAEvC,aAAK,QAAQ,KAAK,IAAI,EAAE,IAAI,EAAE,CAAC;AAC/B,aAAK,SAAS,KAAK,IAAI,EAAE,IAAI,EAAE,CAAC;AAChC,aAAK,IAAI,EAAE,IAAI,KAAK,QAAQ;AAC5B,aAAK,IAAI,EAAE,IAAI,KAAK,SAAS;AAAA,MAC/B;AAAA,IACF,CAAC;AAED,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,GAAG;AAC/B,UAAI,EAAE,KAAK,CAAC,EAAE,UAAU,UAAU;AAChC,UAAE,WAAW,CAAC;AAAA,MAChB;AAAA,IACF,CAAC;AAAA,EACH;AAEA,WAAS,gBAAgB,GAAG;AAC1B,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,GAAG;AAC/B,UAAI,EAAE,MAAM,EAAE,GAAG;AACf,YAAI,OAAO,EAAE,KAAK,EAAE,CAAC;AACrB,YAAI,CAAC,KAAK,WAAW;AACnB,eAAK,YAAY,CAAA;AAAA,QACnB;AACA,aAAK,UAAU,KAAK,EAAE,GAAM,OAAO,EAAE,KAAK,CAAC,GAAG;AAC9C,UAAE,WAAW,CAAC;AAAA,MAChB;AAAA,IACF,CAAC;AAAA,EACH;AAEA,WAAS,gBAAgB,GAAG;AAC1B,QAAI,SAASA,OAAK,iBAAiB,CAAC;AACpC,MAAE,QAAQ,QAAQ,SAAS,OAAO;AAChC,UAAI,aAAa;AACjB,QAAE,QAAQ,OAAO,SAAS,GAAG,GAAG;AAC9B,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,aAAK,QAAQ,IAAI;AACjB,UAAE,QAAQ,KAAK,WAAW,SAAS,UAAU;AAC3CA,iBAAK,aAAa,GAAG,YAAY;AAAA,YAC/B,OAAO,SAAS,MAAM;AAAA,YACtB,QAAQ,SAAS,MAAM;AAAA,YACvB,MAAM,KAAK;AAAA,YACX,OAAO,IAAK,EAAE;AAAA,YACd,GAAG,SAAS;AAAA,YACZ,OAAO,SAAS;AAAA,UAC3B,GAAY,KAAK;AAAA,QACV,CAAC;AACD,eAAO,KAAK;AAAA,MACd,CAAC;AAAA,IACH,CAAC;AAAA,EACH;AAEA,WAAS,kBAAkB,GAAG;AAC5B,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,GAAG;AAC/B,UAAI,OAAO,EAAE,KAAK,CAAC;AACnB,UAAI,KAAK,UAAU,YAAY;AAC7B,YAAI,WAAW,EAAE,KAAK,KAAK,EAAE,CAAC;AAC9B,YAAI,IAAI,SAAS,IAAI,SAAS,QAAQ;AACtC,YAAI,IAAI,SAAS;AACjB,YAAI,KAAK,KAAK,IAAI;AAClB,YAAI,KAAK,SAAS,SAAS;AAC3B,UAAE,QAAQ,KAAK,GAAG,KAAK,KAAK;AAC5B,UAAE,WAAW,CAAC;AACd,aAAK,MAAM,SAAS;AAAA,UAClB,EAAE,GAAG,IAAI,IAAI,KAAK,GAAG,GAAG,IAAI,GAAE;AAAA,UAC9B,EAAE,GAAG,IAAI,IAAI,KAAK,GAAG,GAAG,IAAI,GAAE;AAAA,UAC9B,EAAE,GAAG,IAAQ,IAAQ,EAAI;AAAA,UACzB,EAAE,GAAG,IAAI,IAAI,KAAK,GAAG,GAAG,IAAI,GAAE;AAAA,UAC9B,EAAE,GAAG,IAAI,IAAI,KAAK,GAAG,GAAG,IAAI,GAAE;AAAA,QACvC;AACO,aAAK,MAAM,IAAI,KAAK;AACpB,aAAK,MAAM,IAAI,KAAK;AAAA,MACtB;AAAA,IACF,CAAC;AAAA,EACH;AAEA,WAAS,kBAAkB,KAAK,OAAO;AACrC,WAAO,EAAE,UAAU,EAAE,KAAK,KAAK,KAAK,GAAG,MAAM;AAAA,EAC/C;AAEA,WAAS,aAAa,OAAO;AAC3B,QAAI,WAAW,CAAA;AACf,MAAE,QAAQ,OAAO,SAAS,GAAG,GAAG;AAC9B,eAAS,EAAE,YAAW,CAAE,IAAI;AAAA,IAC9B,CAAC;AACD,WAAO;AAAA,EACT;AACA,SAAO;AACR;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/layout.js

@@ -0,0 +1,427 @@
+import { __require as requireLodash } from "./lodash.js";
+import { __require as requireAcyclic } from "./acyclic.js";
+import { __require as requireNormalize } from "./normalize.js";
+import { __require as requireRank } from "./rank/index.js";
+import { __require as requireUtil$1 } from "./util.js";
+import { __require as requireParentDummyChains } from "./parent-dummy-chains.js";
+import { __require as requireNestingGraph } from "./nesting-graph.js";
+import { __require as requireAddBorderSegments } from "./add-border-segments.js";
+import { __require as requireCoordinateSystem } from "./coordinate-system.js";
+import { __require as requireOrder } from "./order/index.js";
+import { __require as requirePosition } from "./position/index.js";
+import { __require as requireGraphlib } from "./graphlib.js";
+var layout_1;
+var hasRequiredLayout;
+function requireLayout() {
+  if (hasRequiredLayout) return layout_1;
+  hasRequiredLayout = 1;
+  var _ = requireLodash();
+  var acyclic = requireAcyclic();
+  var normalize = requireNormalize();
+  var rank = requireRank();
+  var normalizeRanks = requireUtil$1().normalizeRanks;
+  var parentDummyChains = requireParentDummyChains();
+  var removeEmptyRanks = requireUtil$1().removeEmptyRanks;
+  var nestingGraph = requireNestingGraph();
+  var addBorderSegments = requireAddBorderSegments();
+  var coordinateSystem = requireCoordinateSystem();
+  var order = requireOrder();
+  var position = requirePosition();
+  var util = requireUtil$1();
+  var Graph = requireGraphlib().Graph;
+  layout_1 = layout;
+  function layout(g, opts) {
+    var time = opts && opts.debugTiming ? util.time : util.notime;
+    time("layout", function() {
+      var layoutGraph = time("  buildLayoutGraph", function() {
+        return buildLayoutGraph(g);
+      });
+      time("  runLayout", function() {
+        runLayout(layoutGraph, time);
+      });
+      time("  updateInputGraph", function() {
+        updateInputGraph(g, layoutGraph);
+      });
+    });
+  }
+  function runLayout(g, time) {
+    time("    makeSpaceForEdgeLabels", function() {
+      makeSpaceForEdgeLabels(g);
+    });
+    time("    removeSelfEdges", function() {
+      removeSelfEdges(g);
+    });
+    time("    acyclic", function() {
+      acyclic.run(g);
+    });
+    time("    nestingGraph.run", function() {
+      nestingGraph.run(g);
+    });
+    time("    rank", function() {
+      rank(util.asNonCompoundGraph(g));
+    });
+    time("    injectEdgeLabelProxies", function() {
+      injectEdgeLabelProxies(g);
+    });
+    time("    removeEmptyRanks", function() {
+      removeEmptyRanks(g);
+    });
+    time("    nestingGraph.cleanup", function() {
+      nestingGraph.cleanup(g);
+    });
+    time("    normalizeRanks", function() {
+      normalizeRanks(g);
+    });
+    time("    assignRankMinMax", function() {
+      assignRankMinMax(g);
+    });
+    time("    removeEdgeLabelProxies", function() {
+      removeEdgeLabelProxies(g);
+    });
+    time("    normalize.run", function() {
+      normalize.run(g);
+    });
+    time("    parentDummyChains", function() {
+      parentDummyChains(g);
+    });
+    time("    addBorderSegments", function() {
+      addBorderSegments(g);
+    });
+    time("    order", function() {
+      order(g);
+    });
+    time("    insertSelfEdges", function() {
+      insertSelfEdges(g);
+    });
+    time("    adjustCoordinateSystem", function() {
+      coordinateSystem.adjust(g);
+    });
+    time("    position", function() {
+      position(g);
+    });
+    time("    positionSelfEdges", function() {
+      positionSelfEdges(g);
+    });
+    time("    removeBorderNodes", function() {
+      removeBorderNodes(g);
+    });
+    time("    normalize.undo", function() {
+      normalize.undo(g);
+    });
+    time("    fixupEdgeLabelCoords", function() {
+      fixupEdgeLabelCoords(g);
+    });
+    time("    undoCoordinateSystem", function() {
+      coordinateSystem.undo(g);
+    });
+    time("    translateGraph", function() {
+      translateGraph(g);
+    });
+    time("    assignNodeIntersects", function() {
+      assignNodeIntersects(g);
+    });
+    time("    reversePoints", function() {
+      reversePointsForReversedEdges(g);
+    });
+    time("    acyclic.undo", function() {
+      acyclic.undo(g);
+    });
+  }
+  function updateInputGraph(inputGraph, layoutGraph) {
+    _.forEach(inputGraph.nodes(), function(v) {
+      var inputLabel = inputGraph.node(v);
+      var layoutLabel = layoutGraph.node(v);
+      if (inputLabel) {
+        inputLabel.x = layoutLabel.x;
+        inputLabel.y = layoutLabel.y;
+        if (layoutGraph.children(v).length) {
+          inputLabel.width = layoutLabel.width;
+          inputLabel.height = layoutLabel.height;
+        }
+      }
+    });
+    _.forEach(inputGraph.edges(), function(e) {
+      var inputLabel = inputGraph.edge(e);
+      var layoutLabel = layoutGraph.edge(e);
+      inputLabel.points = layoutLabel.points;
+      if (_.has(layoutLabel, "x")) {
+        inputLabel.x = layoutLabel.x;
+        inputLabel.y = layoutLabel.y;
+      }
+    });
+    inputGraph.graph().width = layoutGraph.graph().width;
+    inputGraph.graph().height = layoutGraph.graph().height;
+  }
+  var graphNumAttrs = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"];
+  var graphDefaults = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" };
+  var graphAttrs = ["acyclicer", "ranker", "rankdir", "align"];
+  var nodeNumAttrs = ["width", "height"];
+  var nodeDefaults = { width: 0, height: 0 };
+  var edgeNumAttrs = ["minlen", "weight", "width", "height", "labeloffset"];
+  var edgeDefaults = {
+    minlen: 1,
+    weight: 1,
+    width: 0,
+    height: 0,
+    labeloffset: 10,
+    labelpos: "r"
+  };
+  var edgeAttrs = ["labelpos"];
+  function buildLayoutGraph(inputGraph) {
+    var g = new Graph({ multigraph: true, compound: true });
+    var graph = canonicalize(inputGraph.graph());
+    g.setGraph(_.merge(
+      {},
+      graphDefaults,
+      selectNumberAttrs(graph, graphNumAttrs),
+      _.pick(graph, graphAttrs)
+    ));
+    _.forEach(inputGraph.nodes(), function(v) {
+      var node = canonicalize(inputGraph.node(v));
+      g.setNode(v, _.defaults(selectNumberAttrs(node, nodeNumAttrs), nodeDefaults));
+      g.setParent(v, inputGraph.parent(v));
+    });
+    _.forEach(inputGraph.edges(), function(e) {
+      var edge = canonicalize(inputGraph.edge(e));
+      g.setEdge(e, _.merge(
+        {},
+        edgeDefaults,
+        selectNumberAttrs(edge, edgeNumAttrs),
+        _.pick(edge, edgeAttrs)
+      ));
+    });
+    return g;
+  }
+  function makeSpaceForEdgeLabels(g) {
+    var graph = g.graph();
+    graph.ranksep /= 2;
+    _.forEach(g.edges(), function(e) {
+      var edge = g.edge(e);
+      edge.minlen *= 2;
+      if (edge.labelpos.toLowerCase() !== "c") {
+        if (graph.rankdir === "TB" || graph.rankdir === "BT") {
+          edge.width += edge.labeloffset;
+        } else {
+          edge.height += edge.labeloffset;
+        }
+      }
+    });
+  }
+  function injectEdgeLabelProxies(g) {
+    _.forEach(g.edges(), function(e) {
+      var edge = g.edge(e);
+      if (edge.width && edge.height) {
+        var v = g.node(e.v);
+        var w = g.node(e.w);
+        var label = { rank: (w.rank - v.rank) / 2 + v.rank, e };
+        util.addDummyNode(g, "edge-proxy", label, "_ep");
+      }
+    });
+  }
+  function assignRankMinMax(g) {
+    var maxRank = 0;
+    _.forEach(g.nodes(), function(v) {
+      var node = g.node(v);
+      if (node.borderTop) {
+        node.minRank = g.node(node.borderTop).rank;
+        node.maxRank = g.node(node.borderBottom).rank;
+        maxRank = _.max(maxRank, node.maxRank);
+      }
+    });
+    g.graph().maxRank = maxRank;
+  }
+  function removeEdgeLabelProxies(g) {
+    _.forEach(g.nodes(), function(v) {
+      var node = g.node(v);
+      if (node.dummy === "edge-proxy") {
+        g.edge(node.e).labelRank = node.rank;
+        g.removeNode(v);
+      }
+    });
+  }
+  function translateGraph(g) {
+    var minX = Number.POSITIVE_INFINITY;
+    var maxX = 0;
+    var minY = Number.POSITIVE_INFINITY;
+    var maxY = 0;
+    var graphLabel = g.graph();
+    var marginX = graphLabel.marginx || 0;
+    var marginY = graphLabel.marginy || 0;
+    function getExtremes(attrs) {
+      var x = attrs.x;
+      var y = attrs.y;
+      var w = attrs.width;
+      var h = attrs.height;
+      minX = Math.min(minX, x - w / 2);
+      maxX = Math.max(maxX, x + w / 2);
+      minY = Math.min(minY, y - h / 2);
+      maxY = Math.max(maxY, y + h / 2);
+    }
+    _.forEach(g.nodes(), function(v) {
+      getExtremes(g.node(v));
+    });
+    _.forEach(g.edges(), function(e) {
+      var edge = g.edge(e);
+      if (_.has(edge, "x")) {
+        getExtremes(edge);
+      }
+    });
+    minX -= marginX;
+    minY -= marginY;
+    _.forEach(g.nodes(), function(v) {
+      var node = g.node(v);
+      node.x -= minX;
+      node.y -= minY;
+    });
+    _.forEach(g.edges(), function(e) {
+      var edge = g.edge(e);
+      _.forEach(edge.points, function(p) {
+        p.x -= minX;
+        p.y -= minY;
+      });
+      if (_.has(edge, "x")) {
+        edge.x -= minX;
+      }
+      if (_.has(edge, "y")) {
+        edge.y -= minY;
+      }
+    });
+    graphLabel.width = maxX - minX + marginX;
+    graphLabel.height = maxY - minY + marginY;
+  }
+  function assignNodeIntersects(g) {
+    _.forEach(g.edges(), function(e) {
+      var edge = g.edge(e);
+      var nodeV = g.node(e.v);
+      var nodeW = g.node(e.w);
+      var p1, p2;
+      if (!edge.points) {
+        edge.points = [];
+        p1 = nodeW;
+        p2 = nodeV;
+      } else {
+        p1 = edge.points[0];
+        p2 = edge.points[edge.points.length - 1];
+      }
+      edge.points.unshift(util.intersectRect(nodeV, p1));
+      edge.points.push(util.intersectRect(nodeW, p2));
+    });
+  }
+  function fixupEdgeLabelCoords(g) {
+    _.forEach(g.edges(), function(e) {
+      var edge = g.edge(e);
+      if (_.has(edge, "x")) {
+        if (edge.labelpos === "l" || edge.labelpos === "r") {
+          edge.width -= edge.labeloffset;
+        }
+        switch (edge.labelpos) {
+          case "l":
+            edge.x -= edge.width / 2 + edge.labeloffset;
+            break;
+          case "r":
+            edge.x += edge.width / 2 + edge.labeloffset;
+            break;
+        }
+      }
+    });
+  }
+  function reversePointsForReversedEdges(g) {
+    _.forEach(g.edges(), function(e) {
+      var edge = g.edge(e);
+      if (edge.reversed) {
+        edge.points.reverse();
+      }
+    });
+  }
+  function removeBorderNodes(g) {
+    _.forEach(g.nodes(), function(v) {
+      if (g.children(v).length) {
+        var node = g.node(v);
+        var t = g.node(node.borderTop);
+        var b = g.node(node.borderBottom);
+        var l = g.node(_.last(node.borderLeft));
+        var r = g.node(_.last(node.borderRight));
+        node.width = Math.abs(r.x - l.x);
+        node.height = Math.abs(b.y - t.y);
+        node.x = l.x + node.width / 2;
+        node.y = t.y + node.height / 2;
+      }
+    });
+    _.forEach(g.nodes(), function(v) {
+      if (g.node(v).dummy === "border") {
+        g.removeNode(v);
+      }
+    });
+  }
+  function removeSelfEdges(g) {
+    _.forEach(g.edges(), function(e) {
+      if (e.v === e.w) {
+        var node = g.node(e.v);
+        if (!node.selfEdges) {
+          node.selfEdges = [];
+        }
+        node.selfEdges.push({ e, label: g.edge(e) });
+        g.removeEdge(e);
+      }
+    });
+  }
+  function insertSelfEdges(g) {
+    var layers = util.buildLayerMatrix(g);
+    _.forEach(layers, function(layer) {
+      var orderShift = 0;
+      _.forEach(layer, function(v, i) {
+        var node = g.node(v);
+        node.order = i + orderShift;
+        _.forEach(node.selfEdges, function(selfEdge) {
+          util.addDummyNode(g, "selfedge", {
+            width: selfEdge.label.width,
+            height: selfEdge.label.height,
+            rank: node.rank,
+            order: i + ++orderShift,
+            e: selfEdge.e,
+            label: selfEdge.label
+          }, "_se");
+        });
+        delete node.selfEdges;
+      });
+    });
+  }
+  function positionSelfEdges(g) {
+    _.forEach(g.nodes(), function(v) {
+      var node = g.node(v);
+      if (node.dummy === "selfedge") {
+        var selfNode = g.node(node.e.v);
+        var x = selfNode.x + selfNode.width / 2;
+        var y = selfNode.y;
+        var dx = node.x - x;
+        var dy = selfNode.height / 2;
+        g.setEdge(node.e, node.label);
+        g.removeNode(v);
+        node.label.points = [
+          { x: x + 2 * dx / 3, y: y - dy },
+          { x: x + 5 * dx / 6, y: y - dy },
+          { x: x + dx, y },
+          { x: x + 5 * dx / 6, y: y + dy },
+          { x: x + 2 * dx / 3, y: y + dy }
+        ];
+        node.label.x = node.x;
+        node.label.y = node.y;
+      }
+    });
+  }
+  function selectNumberAttrs(obj, attrs) {
+    return _.mapValues(_.pick(obj, attrs), Number);
+  }
+  function canonicalize(attrs) {
+    var newAttrs = {};
+    _.forEach(attrs, function(v, k) {
+      newAttrs[k.toLowerCase()] = v;
+    });
+    return newAttrs;
+  }
+  return layout_1;
+}
+export {
+  requireLayout as __require
+};
+//# sourceMappingURL=layout.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"layout.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/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":["requireUtil"],"mappings":";;;;;;;;;;;;AAaA,IAAI;AACJ,IAAI;AAEJ,SAAS,gBAAiB;AACzB,MAAI,kBAAmB,QAAO;AAC9B,sBAAoB;AAEpB,MAAI,IAAI,cAAa;AACrB,MAAI,UAAU,eAAc;AAC5B,MAAI,YAAY,iBAAgB;AAChC,MAAI,OAAO,YAAW;AACtB,MAAI,iBAAiBA,cAAW,EAAG;AACnC,MAAI,oBAAoB,yBAAwB;AAChD,MAAI,mBAAmBA,cAAW,EAAG;AACrC,MAAI,eAAe,oBAAmB;AACtC,MAAI,oBAAoB,yBAAwB;AAChD,MAAI,mBAAmB,wBAAuB;AAC9C,MAAI,QAAQ,aAAY;AACxB,MAAI,WAAW,gBAAe;AAC9B,MAAI,OAAOA,cAAW;AACtB,MAAI,QAAQ,gBAAe,EAAG;AAE9B,aAAW;AAEX,WAAS,OAAO,GAAG,MAAM;AACvB,QAAI,OAAO,QAAQ,KAAK,cAAc,KAAK,OAAO,KAAK;AACvD,SAAK,UAAU,WAAW;AACxB,UAAI,cACF,KAAK,sBAAsB,WAAW;AAAE,eAAO,iBAAiB,CAAC;AAAA,MAAG,CAAC;AACvE,WAAK,eAAsB,WAAW;AAAE,kBAAU,aAAa,IAAI;AAAA,MAAG,CAAC;AACvE,WAAK,sBAAsB,WAAW;AAAE,yBAAiB,GAAG,WAAW;AAAA,MAAG,CAAC;AAAA,IAC7E,CAAC;AAAA,EACH;AAEA,WAAS,UAAU,GAAG,MAAM;AAC1B,SAAK,8BAA8B,WAAW;AAAE,6BAAuB,CAAC;AAAA,IAAG,CAAC;AAC5E,SAAK,uBAA8B,WAAW;AAAE,sBAAgB,CAAC;AAAA,IAAG,CAAC;AACrE,SAAK,eAA8B,WAAW;AAAE,cAAQ,IAAI,CAAC;AAAA,IAAG,CAAC;AACjE,SAAK,wBAA8B,WAAW;AAAE,mBAAa,IAAI,CAAC;AAAA,IAAG,CAAC;AACtE,SAAK,YAA8B,WAAW;AAAE,WAAK,KAAK,mBAAmB,CAAC,CAAC;AAAA,IAAG,CAAC;AACnF,SAAK,8BAA8B,WAAW;AAAE,6BAAuB,CAAC;AAAA,IAAG,CAAC;AAC5E,SAAK,wBAA8B,WAAW;AAAE,uBAAiB,CAAC;AAAA,IAAG,CAAC;AACtE,SAAK,4BAA8B,WAAW;AAAE,mBAAa,QAAQ,CAAC;AAAA,IAAG,CAAC;AAC1E,SAAK,sBAA8B,WAAW;AAAE,qBAAe,CAAC;AAAA,IAAG,CAAC;AACpE,SAAK,wBAA8B,WAAW;AAAE,uBAAiB,CAAC;AAAA,IAAG,CAAC;AACtE,SAAK,8BAA8B,WAAW;AAAE,6BAAuB,CAAC;AAAA,IAAG,CAAC;AAC5E,SAAK,qBAA8B,WAAW;AAAE,gBAAU,IAAI,CAAC;AAAA,IAAG,CAAC;AACnE,SAAK,yBAA8B,WAAW;AAAE,wBAAkB,CAAC;AAAA,IAAG,CAAC;AACvE,SAAK,yBAA8B,WAAW;AAAE,wBAAkB,CAAC;AAAA,IAAG,CAAC;AACvE,SAAK,aAA8B,WAAW;AAAE,YAAM,CAAC;AAAA,IAAG,CAAC;AAC3D,SAAK,uBAA8B,WAAW;AAAE,sBAAgB,CAAC;AAAA,IAAG,CAAC;AACrE,SAAK,8BAA8B,WAAW;AAAE,uBAAiB,OAAO,CAAC;AAAA,IAAG,CAAC;AAC7E,SAAK,gBAA8B,WAAW;AAAE,eAAS,CAAC;AAAA,IAAG,CAAC;AAC9D,SAAK,yBAA8B,WAAW;AAAE,wBAAkB,CAAC;AAAA,IAAG,CAAC;AACvE,SAAK,yBAA8B,WAAW;AAAE,wBAAkB,CAAC;AAAA,IAAG,CAAC;AACvE,SAAK,sBAA8B,WAAW;AAAE,gBAAU,KAAK,CAAC;AAAA,IAAG,CAAC;AACpE,SAAK,4BAA8B,WAAW;AAAE,2BAAqB,CAAC;AAAA,IAAG,CAAC;AAC1E,SAAK,4BAA8B,WAAW;AAAE,uBAAiB,KAAK,CAAC;AAAA,IAAG,CAAC;AAC3E,SAAK,sBAA8B,WAAW;AAAE,qBAAe,CAAC;AAAA,IAAG,CAAC;AACpE,SAAK,4BAA8B,WAAW;AAAE,2BAAqB,CAAC;AAAA,IAAG,CAAC;AAC1E,SAAK,qBAA8B,WAAW;AAAE,oCAA8B,CAAC;AAAA,IAAG,CAAC;AACnF,SAAK,oBAA8B,WAAW;AAAE,cAAQ,KAAK,CAAC;AAAA,IAAG,CAAC;AAAA,EACpE;AAQA,WAAS,iBAAiB,YAAY,aAAa;AACjD,MAAE,QAAQ,WAAW,MAAK,GAAI,SAAS,GAAG;AACxC,UAAI,aAAa,WAAW,KAAK,CAAC;AAClC,UAAI,cAAc,YAAY,KAAK,CAAC;AAEpC,UAAI,YAAY;AACd,mBAAW,IAAI,YAAY;AAC3B,mBAAW,IAAI,YAAY;AAE3B,YAAI,YAAY,SAAS,CAAC,EAAE,QAAQ;AAClC,qBAAW,QAAQ,YAAY;AAC/B,qBAAW,SAAS,YAAY;AAAA,QAClC;AAAA,MACF;AAAA,IACF,CAAC;AAED,MAAE,QAAQ,WAAW,MAAK,GAAI,SAAS,GAAG;AACxC,UAAI,aAAa,WAAW,KAAK,CAAC;AAClC,UAAI,cAAc,YAAY,KAAK,CAAC;AAEpC,iBAAW,SAAS,YAAY;AAChC,UAAI,EAAE,IAAI,aAAa,GAAG,GAAG;AAC3B,mBAAW,IAAI,YAAY;AAC3B,mBAAW,IAAI,YAAY;AAAA,MAC7B;AAAA,IACF,CAAC;AAED,eAAW,MAAK,EAAG,QAAQ,YAAY,MAAK,EAAG;AAC/C,eAAW,MAAK,EAAG,SAAS,YAAY,MAAK,EAAG;AAAA,EAClD;AAEA,MAAI,gBAAgB,CAAC,WAAW,WAAW,WAAW,WAAW,SAAS;AAC1E,MAAI,gBAAgB,EAAE,SAAS,IAAI,SAAS,IAAI,SAAS,IAAI,SAAS,KAAI;AAC1E,MAAI,aAAa,CAAC,aAAa,UAAU,WAAW,OAAO;AAC3D,MAAI,eAAe,CAAC,SAAS,QAAQ;AACrC,MAAI,eAAe,EAAE,OAAO,GAAG,QAAQ,EAAC;AACxC,MAAI,eAAe,CAAC,UAAU,UAAU,SAAS,UAAU,aAAa;AACxE,MAAI,eAAe;AAAA,IACjB,QAAQ;AAAA,IAAG,QAAQ;AAAA,IAAG,OAAO;AAAA,IAAG,QAAQ;AAAA,IACxC,aAAa;AAAA,IAAI,UAAU;AAAA,EAC9B;AACC,MAAI,YAAY,CAAC,UAAU;AAQ3B,WAAS,iBAAiB,YAAY;AACpC,QAAI,IAAI,IAAI,MAAM,EAAE,YAAY,MAAM,UAAU,MAAM;AACtD,QAAI,QAAQ,aAAa,WAAW,MAAK,CAAE;AAE3C,MAAE,SAAS,EAAE;AAAA,MAAM,CAAA;AAAA,MACjB;AAAA,MACA,kBAAkB,OAAO,aAAa;AAAA,MACtC,EAAE,KAAK,OAAO,UAAU;AAAA,IAAC,CAAC;AAE5B,MAAE,QAAQ,WAAW,MAAK,GAAI,SAAS,GAAG;AACxC,UAAI,OAAO,aAAa,WAAW,KAAK,CAAC,CAAC;AAC1C,QAAE,QAAQ,GAAG,EAAE,SAAS,kBAAkB,MAAM,YAAY,GAAG,YAAY,CAAC;AAC5E,QAAE,UAAU,GAAG,WAAW,OAAO,CAAC,CAAC;AAAA,IACrC,CAAC;AAED,MAAE,QAAQ,WAAW,MAAK,GAAI,SAAS,GAAG;AACxC,UAAI,OAAO,aAAa,WAAW,KAAK,CAAC,CAAC;AAC1C,QAAE,QAAQ,GAAG,EAAE;AAAA,QAAM,CAAA;AAAA,QACnB;AAAA,QACA,kBAAkB,MAAM,YAAY;AAAA,QACpC,EAAE,KAAK,MAAM,SAAS;AAAA,MAAC,CAAC;AAAA,IAC5B,CAAC;AAED,WAAO;AAAA,EACT;AAUA,WAAS,uBAAuB,GAAG;AACjC,QAAI,QAAQ,EAAE,MAAK;AACnB,UAAM,WAAW;AACjB,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,GAAG;AAC/B,UAAI,OAAO,EAAE,KAAK,CAAC;AACnB,WAAK,UAAU;AACf,UAAI,KAAK,SAAS,YAAW,MAAO,KAAK;AACvC,YAAI,MAAM,YAAY,QAAQ,MAAM,YAAY,MAAM;AACpD,eAAK,SAAS,KAAK;AAAA,QACrB,OAAO;AACL,eAAK,UAAU,KAAK;AAAA,QACtB;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH;AAQA,WAAS,uBAAuB,GAAG;AACjC,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,GAAG;AAC/B,UAAI,OAAO,EAAE,KAAK,CAAC;AACnB,UAAI,KAAK,SAAS,KAAK,QAAQ;AAC7B,YAAI,IAAI,EAAE,KAAK,EAAE,CAAC;AAClB,YAAI,IAAI,EAAE,KAAK,EAAE,CAAC;AAClB,YAAI,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,IAAI,EAAE,MAAM,EAAI;AACxD,aAAK,aAAa,GAAG,cAAc,OAAO,KAAK;AAAA,MACjD;AAAA,IACF,CAAC;AAAA,EACH;AAEA,WAAS,iBAAiB,GAAG;AAC3B,QAAI,UAAU;AACd,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,GAAG;AAC/B,UAAI,OAAO,EAAE,KAAK,CAAC;AACnB,UAAI,KAAK,WAAW;AAClB,aAAK,UAAU,EAAE,KAAK,KAAK,SAAS,EAAE;AACtC,aAAK,UAAU,EAAE,KAAK,KAAK,YAAY,EAAE;AACzC,kBAAU,EAAE,IAAI,SAAS,KAAK,OAAO;AAAA,MACvC;AAAA,IACF,CAAC;AACD,MAAE,QAAQ,UAAU;AAAA,EACtB;AAEA,WAAS,uBAAuB,GAAG;AACjC,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,GAAG;AAC/B,UAAI,OAAO,EAAE,KAAK,CAAC;AACnB,UAAI,KAAK,UAAU,cAAc;AAC/B,UAAE,KAAK,KAAK,CAAC,EAAE,YAAY,KAAK;AAChC,UAAE,WAAW,CAAC;AAAA,MAChB;AAAA,IACF,CAAC;AAAA,EACH;AAEA,WAAS,eAAe,GAAG;AACzB,QAAI,OAAO,OAAO;AAClB,QAAI,OAAO;AACX,QAAI,OAAO,OAAO;AAClB,QAAI,OAAO;AACX,QAAI,aAAa,EAAE,MAAK;AACxB,QAAI,UAAU,WAAW,WAAW;AACpC,QAAI,UAAU,WAAW,WAAW;AAEpC,aAAS,YAAY,OAAO;AAC1B,UAAI,IAAI,MAAM;AACd,UAAI,IAAI,MAAM;AACd,UAAI,IAAI,MAAM;AACd,UAAI,IAAI,MAAM;AACd,aAAO,KAAK,IAAI,MAAM,IAAI,IAAI,CAAC;AAC/B,aAAO,KAAK,IAAI,MAAM,IAAI,IAAI,CAAC;AAC/B,aAAO,KAAK,IAAI,MAAM,IAAI,IAAI,CAAC;AAC/B,aAAO,KAAK,IAAI,MAAM,IAAI,IAAI,CAAC;AAAA,IACjC;AAEA,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,GAAG;AAAE,kBAAY,EAAE,KAAK,CAAC,CAAC;AAAA,IAAG,CAAC;AAC5D,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,GAAG;AAC/B,UAAI,OAAO,EAAE,KAAK,CAAC;AACnB,UAAI,EAAE,IAAI,MAAM,GAAG,GAAG;AACpB,oBAAY,IAAI;AAAA,MAClB;AAAA,IACF,CAAC;AAED,YAAQ;AACR,YAAQ;AAER,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,GAAG;AAC/B,UAAI,OAAO,EAAE,KAAK,CAAC;AACnB,WAAK,KAAK;AACV,WAAK,KAAK;AAAA,IACZ,CAAC;AAED,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,GAAG;AAC/B,UAAI,OAAO,EAAE,KAAK,CAAC;AACnB,QAAE,QAAQ,KAAK,QAAQ,SAAS,GAAG;AACjC,UAAE,KAAK;AACP,UAAE,KAAK;AAAA,MACT,CAAC;AACD,UAAI,EAAE,IAAI,MAAM,GAAG,GAAG;AAAE,aAAK,KAAK;AAAA,MAAM;AACxC,UAAI,EAAE,IAAI,MAAM,GAAG,GAAG;AAAE,aAAK,KAAK;AAAA,MAAM;AAAA,IAC1C,CAAC;AAED,eAAW,QAAQ,OAAO,OAAO;AACjC,eAAW,SAAS,OAAO,OAAO;AAAA,EACpC;AAEA,WAAS,qBAAqB,GAAG;AAC/B,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,GAAG;AAC/B,UAAI,OAAO,EAAE,KAAK,CAAC;AACnB,UAAI,QAAQ,EAAE,KAAK,EAAE,CAAC;AACtB,UAAI,QAAQ,EAAE,KAAK,EAAE,CAAC;AACtB,UAAI,IAAI;AACR,UAAI,CAAC,KAAK,QAAQ;AAChB,aAAK,SAAS,CAAA;AACd,aAAK;AACL,aAAK;AAAA,MACP,OAAO;AACL,aAAK,KAAK,OAAO,CAAC;AAClB,aAAK,KAAK,OAAO,KAAK,OAAO,SAAS,CAAC;AAAA,MACzC;AACA,WAAK,OAAO,QAAQ,KAAK,cAAc,OAAO,EAAE,CAAC;AACjD,WAAK,OAAO,KAAK,KAAK,cAAc,OAAO,EAAE,CAAC;AAAA,IAChD,CAAC;AAAA,EACH;AAEA,WAAS,qBAAqB,GAAG;AAC/B,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,GAAG;AAC/B,UAAI,OAAO,EAAE,KAAK,CAAC;AACnB,UAAI,EAAE,IAAI,MAAM,GAAG,GAAG;AACpB,YAAI,KAAK,aAAa,OAAO,KAAK,aAAa,KAAK;AAClD,eAAK,SAAS,KAAK;AAAA,QACrB;AACA,gBAAQ,KAAK,UAAQ;AAAA,UACrB,KAAK;AAAK,iBAAK,KAAK,KAAK,QAAQ,IAAI,KAAK;AAAa;AAAA,UACvD,KAAK;AAAK,iBAAK,KAAK,KAAK,QAAQ,IAAI,KAAK;AAAa;AAAA,QAC9D;AAAA,MACK;AAAA,IACF,CAAC;AAAA,EACH;AAEA,WAAS,8BAA8B,GAAG;AACxC,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,GAAG;AAC/B,UAAI,OAAO,EAAE,KAAK,CAAC;AACnB,UAAI,KAAK,UAAU;AACjB,aAAK,OAAO,QAAO;AAAA,MACrB;AAAA,IACF,CAAC;AAAA,EACH;AAEA,WAAS,kBAAkB,GAAG;AAC5B,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,GAAG;AAC/B,UAAI,EAAE,SAAS,CAAC,EAAE,QAAQ;AACxB,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,YAAI,IAAI,EAAE,KAAK,KAAK,SAAS;AAC7B,YAAI,IAAI,EAAE,KAAK,KAAK,YAAY;AAChC,YAAI,IAAI,EAAE,KAAK,EAAE,KAAK,KAAK,UAAU,CAAC;AACtC,YAAI,IAAI,EAAE,KAAK,EAAE,KAAK,KAAK,WAAW,CAAC;AAEvC,aAAK,QAAQ,KAAK,IAAI,EAAE,IAAI,EAAE,CAAC;AAC/B,aAAK,SAAS,KAAK,IAAI,EAAE,IAAI,EAAE,CAAC;AAChC,aAAK,IAAI,EAAE,IAAI,KAAK,QAAQ;AAC5B,aAAK,IAAI,EAAE,IAAI,KAAK,SAAS;AAAA,MAC/B;AAAA,IACF,CAAC;AAED,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,GAAG;AAC/B,UAAI,EAAE,KAAK,CAAC,EAAE,UAAU,UAAU;AAChC,UAAE,WAAW,CAAC;AAAA,MAChB;AAAA,IACF,CAAC;AAAA,EACH;AAEA,WAAS,gBAAgB,GAAG;AAC1B,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,GAAG;AAC/B,UAAI,EAAE,MAAM,EAAE,GAAG;AACf,YAAI,OAAO,EAAE,KAAK,EAAE,CAAC;AACrB,YAAI,CAAC,KAAK,WAAW;AACnB,eAAK,YAAY,CAAA;AAAA,QACnB;AACA,aAAK,UAAU,KAAK,EAAE,GAAM,OAAO,EAAE,KAAK,CAAC,GAAG;AAC9C,UAAE,WAAW,CAAC;AAAA,MAChB;AAAA,IACF,CAAC;AAAA,EACH;AAEA,WAAS,gBAAgB,GAAG;AAC1B,QAAI,SAAS,KAAK,iBAAiB,CAAC;AACpC,MAAE,QAAQ,QAAQ,SAAS,OAAO;AAChC,UAAI,aAAa;AACjB,QAAE,QAAQ,OAAO,SAAS,GAAG,GAAG;AAC9B,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,aAAK,QAAQ,IAAI;AACjB,UAAE,QAAQ,KAAK,WAAW,SAAS,UAAU;AAC3C,eAAK,aAAa,GAAG,YAAY;AAAA,YAC/B,OAAO,SAAS,MAAM;AAAA,YACtB,QAAQ,SAAS,MAAM;AAAA,YACvB,MAAM,KAAK;AAAA,YACX,OAAO,IAAK,EAAE;AAAA,YACd,GAAG,SAAS;AAAA,YACZ,OAAO,SAAS;AAAA,UAC3B,GAAY,KAAK;AAAA,QACV,CAAC;AACD,eAAO,KAAK;AAAA,MACd,CAAC;AAAA,IACH,CAAC;AAAA,EACH;AAEA,WAAS,kBAAkB,GAAG;AAC5B,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,GAAG;AAC/B,UAAI,OAAO,EAAE,KAAK,CAAC;AACnB,UAAI,KAAK,UAAU,YAAY;AAC7B,YAAI,WAAW,EAAE,KAAK,KAAK,EAAE,CAAC;AAC9B,YAAI,IAAI,SAAS,IAAI,SAAS,QAAQ;AACtC,YAAI,IAAI,SAAS;AACjB,YAAI,KAAK,KAAK,IAAI;AAClB,YAAI,KAAK,SAAS,SAAS;AAC3B,UAAE,QAAQ,KAAK,GAAG,KAAK,KAAK;AAC5B,UAAE,WAAW,CAAC;AACd,aAAK,MAAM,SAAS;AAAA,UAClB,EAAE,GAAG,IAAI,IAAI,KAAK,GAAG,GAAG,IAAI,GAAE;AAAA,UAC9B,EAAE,GAAG,IAAI,IAAI,KAAK,GAAG,GAAG,IAAI,GAAE;AAAA,UAC9B,EAAE,GAAG,IAAQ,IAAQ,EAAI;AAAA,UACzB,EAAE,GAAG,IAAI,IAAI,KAAK,GAAG,GAAG,IAAI,GAAE;AAAA,UAC9B,EAAE,GAAG,IAAI,IAAI,KAAK,GAAG,GAAG,IAAI,GAAE;AAAA,QACvC;AACO,aAAK,MAAM,IAAI,KAAK;AACpB,aAAK,MAAM,IAAI,KAAK;AAAA,MACtB;AAAA,IACF,CAAC;AAAA,EACH;AAEA,WAAS,kBAAkB,KAAK,OAAO;AACrC,WAAO,EAAE,UAAU,EAAE,KAAK,KAAK,KAAK,GAAG,MAAM;AAAA,EAC/C;AAEA,WAAS,aAAa,OAAO;AAC3B,QAAI,WAAW,CAAA;AACf,MAAE,QAAQ,OAAO,SAAS,GAAG,GAAG;AAC9B,eAAS,EAAE,YAAW,CAAE,IAAI;AAAA,IAC9B,CAAC;AACD,WAAO;AAAA,EACT;AACA,SAAO;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/lodash.cjs

@@ -0,0 +1,76 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const _commonjsDynamicModules = require("../../../_virtual/_commonjs-dynamic-modules.cjs");
+const cloneDeep = require("../../lodash/cloneDeep.cjs");
+const constant = require("../../lodash/constant.cjs");
+const defaults = require("../../lodash/defaults.cjs");
+const each = require("../../lodash/each.cjs");
+const filter = require("../../lodash/filter.cjs");
+const find = require("../../lodash/find.cjs");
+const flatten = require("../../lodash/flatten.cjs");
+const forEach = require("../../lodash/forEach.cjs");
+const forIn = require("../../lodash/forIn.cjs");
+const has = require("../../lodash/has.cjs");
+const isUndefined = require("../../lodash/isUndefined.cjs");
+const last = require("../../lodash/last.cjs");
+const map = require("../../lodash/map.cjs");
+const mapValues = require("../../lodash/mapValues.cjs");
+const max = require("../../lodash/max.cjs");
+const merge = require("../../lodash/merge.cjs");
+const min = require("../../lodash/min.cjs");
+const minBy = require("../../lodash/minBy.cjs");
+const now = require("../../lodash/now.cjs");
+const pick = require("../../lodash/pick.cjs");
+const range = require("../../lodash/range.cjs");
+const reduce = require("../../lodash/reduce.cjs");
+const sortBy = require("../../lodash/sortBy.cjs");
+const uniqueId = require("../../lodash/uniqueId.cjs");
+const values = require("../../lodash/values.cjs");
+const zipObject = require("../../lodash/zipObject.cjs");
+var lodash_1;
+var hasRequiredLodash;
+function requireLodash() {
+  if (hasRequiredLodash) return lodash_1;
+  hasRequiredLodash = 1;
+  var lodash;
+  if (typeof _commonjsDynamicModules.commonjsRequire === "function") {
+    try {
+      lodash = {
+        cloneDeep: cloneDeep.__require(),
+        constant: constant.__require(),
+        defaults: defaults.__require(),
+        each: each.__require(),
+        filter: filter.__require(),
+        find: find.__require(),
+        flatten: flatten.__require(),
+        forEach: forEach.__require(),
+        forIn: forIn.__require(),
+        has: has.__require(),
+        isUndefined: isUndefined.__require(),
+        last: last.__require(),
+        map: map.__require(),
+        mapValues: mapValues.__require(),
+        max: max.__require(),
+        merge: merge.__require(),
+        min: min.__require(),
+        minBy: minBy.__require(),
+        now: now.__require(),
+        pick: pick.__require(),
+        range: range.__require(),
+        reduce: reduce.__require(),
+        sortBy: sortBy.__require(),
+        uniqueId: uniqueId.__require(),
+        values: values.__require(),
+        zipObject: zipObject.__require()
+      };
+    } catch (e) {
+    }
+  }
+  if (!lodash) {
+    lodash = window._;
+  }
+  lodash_1 = lodash;
+  return lodash_1;
+}
+exports.__require = requireLodash;
+//# sourceMappingURL=lodash.cjs.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/lodash.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"lodash.cjs","sources":["../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/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":["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,IAAI;AACJ,IAAI;AAEJ,SAAS,gBAAiB;AACzB,MAAI,kBAAmB,QAAO;AAC9B,sBAAoB;AACpB,MAAI;AAEJ,MAAI,OAAOA,wBAAAA,oBAAoB,YAAY;AACzC,QAAI;AACF,eAAS;AAAA,QACP,WAAWC,UAAAA,UAAgB;AAAA,QAC3B,UAAUC,SAAAA,UAAe;AAAA,QACzB,UAAUC,SAAAA,UAAe;AAAA,QACzB,MAAMC,KAAAA,UAAW;AAAA,QACjB,QAAQC,OAAAA,UAAa;AAAA,QACrB,MAAMC,KAAAA,UAAW;AAAA,QACjB,SAASC,QAAAA,UAAc;AAAA,QACvB,SAASC,QAAAA,UAAc;AAAA,QACvB,OAAOC,MAAAA,UAAY;AAAA,QACnB,KAAMC,IAAAA,UAAU;AAAA,QAChB,aAAaC,YAAAA,UAAkB;AAAA,QAC/B,MAAMC,KAAAA,UAAW;AAAA,QACjB,KAAKC,IAAAA,UAAU;AAAA,QACf,WAAWC,UAAAA,UAAgB;AAAA,QAC3B,KAAKC,IAAAA,UAAU;AAAA,QACf,OAAOC,MAAAA,UAAY;AAAA,QACnB,KAAKC,IAAAA,UAAU;AAAA,QACf,OAAOC,MAAAA,UAAY;AAAA,QACnB,KAAKC,IAAAA,UAAU;AAAA,QACf,MAAMC,KAAAA,UAAW;AAAA,QACjB,OAAOC,MAAAA,UAAY;AAAA,QACnB,QAAQC,OAAAA,UAAa;AAAA,QACrB,QAAQC,OAAAA,UAAa;AAAA,QACrB,UAAUC,SAAAA,UAAe;AAAA,QACzB,QAAQC,OAAAA,UAAa;AAAA,QACrB,WAAWC,UAAAA,UAAgB;AAAA,MAClC;AAAA,IACG,SAAS,GAAG;AAAA,IAEZ;AAAA,EACF;AAEA,MAAI,CAAC,QAAQ;AACX,aAAS,OAAO;AAAA,EAClB;AAEA,aAAW;AACX,SAAO;AACR;;","x_google_ignoreList":[0]}