@antv/layout 2.0.0-alpha.1 → 2.0.0-alpha.2

package/lib/node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/add-subgraph-constraints.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"add-subgraph-constraints.js","sources":["../../../../../../../../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/add-subgraph-constraints.js"],"sourcesContent":["var _ = require(\"../lodash\");\n\nmodule.exports = addSubgraphConstraints;\n\nfunction addSubgraphConstraints(g, cg, vs) {\n  var prev = {},\n    rootPrev;\n\n  _.forEach(vs, function(v) {\n    var child = g.parent(v),\n      parent,\n      prevChild;\n    while (child) {\n      parent = g.parent(child);\n      if (parent) {\n        prevChild = prev[parent];\n        prev[parent] = child;\n      } else {\n        prevChild = rootPrev;\n        rootPrev = child;\n      }\n      if (prevChild && prevChild !== child) {\n        cg.setEdge(prevChild, child);\n        return;\n      }\n      child = parent;\n    }\n  });\n\n  /*\n  function dfs(v) {\n    var children = v ? g.children(v) : g.children();\n    if (children.length) {\n      var min = Number.POSITIVE_INFINITY,\n          subgraphs = [];\n      _.each(children, function(child) {\n        var childMin = dfs(child);\n        if (g.children(child).length) {\n          subgraphs.push({ v: child, order: childMin });\n        }\n        min = Math.min(min, childMin);\n      });\n      _.reduce(_.sortBy(subgraphs, \"order\"), function(prev, curr) {\n        cg.setEdge(prev.v, curr.v);\n        return curr;\n      });\n      return min;\n    }\n    return g.node(v).order;\n  }\n  dfs(undefined);\n  */\n}\n"],"names":["require$$0"],"mappings":";;;;;;;;CAAA,IAAI,CAAC,GAAGA,aAAA,EAAoB;;AAE5B,CAAA,wBAAc,GAAG,sBAAsB;;AAEvC,CAAA,SAAS,sBAAsB,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE;GACzC,IAAI,IAAI,GAAG,EAAE;AACf,KAAI,QAAQ;;GAEV,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,SAAS,CAAC,EAAE;KACxB,IAAI,KAAK,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;AAC3B,OAAM,MAAM;AACZ,OAAM,SAAS;KACX,OAAO,KAAK,EAAE;AAClB,OAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC;OACxB,IAAI,MAAM,EAAE;AAClB,SAAQ,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC;AAChC,SAAQ,IAAI,CAAC,MAAM,CAAC,GAAG,KAAK;AAC5B,OAAA,CAAO,MAAM;SACL,SAAS,GAAG,QAAQ;SACpB,QAAQ,GAAG,KAAK;AACxB,OAAA;AACA,OAAM,IAAI,SAAS,IAAI,SAAS,KAAK,KAAK,EAAE;AAC5C,SAAQ,EAAE,CAAC,OAAO,CAAC,SAAS,EAAE,KAAK,CAAC;SAC5B;AACR,OAAA;OACM,KAAK,GAAG,MAAM;AACpB,KAAA;AACA,GAAA,CAAG,CAAC;;AAEJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/barycenter.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"barycenter.js","sources":["../../../../../../../../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/barycenter.js"],"sourcesContent":["var _ = require(\"../lodash\");\n\nmodule.exports = barycenter;\n\nfunction barycenter(g, movable) {\n  return _.map(movable, function(v) {\n    var inV = g.inEdges(v);\n    if (!inV.length) {\n      return { v: v };\n    } else {\n      var result = _.reduce(inV, function(acc, e) {\n        var edge = g.edge(e),\n          nodeU = g.node(e.v);\n        return {\n          sum: acc.sum + (edge.weight * nodeU.order),\n          weight: acc.weight + edge.weight\n        };\n      }, { sum: 0, weight: 0 });\n\n      return {\n        v: v,\n        barycenter: result.sum / result.weight,\n        weight: result.weight\n      };\n    }\n  });\n}\n\n"],"names":["require$$0"],"mappings":";;;;;;;;CAAA,IAAI,CAAC,GAAGA,aAAA,EAAoB;;AAE5B,CAAA,YAAc,GAAG,UAAU;;AAE3B,CAAA,SAAS,UAAU,CAAC,CAAC,EAAE,OAAO,EAAE;GAC9B,OAAO,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,SAAS,CAAC,EAAE;KAChC,IAAI,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;AAC1B,KAAI,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE;AACrB,OAAM,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE;AACrB,KAAA,CAAK,MAAM;AACX,OAAM,IAAI,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,SAAS,GAAG,EAAE,CAAC,EAAE;SAC1C,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;WAClB,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AAC7B,SAAQ,OAAO;AACf,WAAU,GAAG,EAAE,GAAG,CAAC,GAAG,IAAI,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC;AACpD,WAAU,MAAM,EAAE,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC;UAC3B;OACT,CAAO,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;;AAE/B,OAAM,OAAO;SACL,CAAC,EAAE,CAAC;SACJ,UAAU,EAAE,MAAM,CAAC,GAAG,GAAG,MAAM,CAAC,MAAM;SACtC,MAAM,EAAE,MAAM,CAAC;QAChB;AACP,KAAA;AACA,GAAA,CAAG,CAAC;AACJ,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/build-layer-graph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"build-layer-graph.js","sources":["../../../../../../../../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/build-layer-graph.js"],"sourcesContent":["var _ = require(\"../lodash\");\nvar Graph = require(\"../graphlib\").Graph;\n\nmodule.exports = buildLayerGraph;\n\n/*\n * Constructs a graph that can be used to sort a layer of nodes. The graph will\n * contain all base and subgraph nodes from the request layer in their original\n * hierarchy and any edges that are incident on these nodes and are of the type\n * requested by the \"relationship\" parameter.\n *\n * Nodes from the requested rank that do not have parents are assigned a root\n * node in the output graph, which is set in the root graph attribute. This\n * makes it easy to walk the hierarchy of movable nodes during ordering.\n *\n * Pre-conditions:\n *\n *    1. Input graph is a DAG\n *    2. Base nodes in the input graph have a rank attribute\n *    3. Subgraph nodes in the input graph has minRank and maxRank attributes\n *    4. Edges have an assigned weight\n *\n * Post-conditions:\n *\n *    1. Output graph has all nodes in the movable rank with preserved\n *       hierarchy.\n *    2. Root nodes in the movable layer are made children of the node\n *       indicated by the root attribute of the graph.\n *    3. Non-movable nodes incident on movable nodes, selected by the\n *       relationship parameter, are included in the graph (without hierarchy).\n *    4. Edges incident on movable nodes, selected by the relationship\n *       parameter, are added to the output graph.\n *    5. The weights for copied edges are aggregated as need, since the output\n *       graph is not a multi-graph.\n */\nfunction buildLayerGraph(g, rank, relationship) {\n  var root = createRootNode(g),\n    result = new Graph({ compound: true }).setGraph({ root: root })\n      .setDefaultNodeLabel(function(v) { return g.node(v); });\n\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v),\n      parent = g.parent(v);\n\n    if (node.rank === rank || node.minRank <= rank && rank <= node.maxRank) {\n      result.setNode(v);\n      result.setParent(v, parent || root);\n\n      // This assumes we have only short edges!\n      _.forEach(g[relationship](v), function(e) {\n        var u = e.v === v ? e.w : e.v,\n          edge = result.edge(u, v),\n          weight = !_.isUndefined(edge) ? edge.weight : 0;\n        result.setEdge(u, v, { weight: g.edge(e).weight + weight });\n      });\n\n      if (_.has(node, \"minRank\")) {\n        result.setNode(v, {\n          borderLeft: node.borderLeft[rank],\n          borderRight: node.borderRight[rank]\n        });\n      }\n    }\n  });\n\n  return result;\n}\n\nfunction createRootNode(g) {\n  var v;\n  while (g.hasNode((v = _.uniqueId(\"_root\"))));\n  return v;\n}\n"],"names":["require$$0","require$$1"],"mappings":";;;;;;;;;CAAA,IAAI,CAAC,GAAGA,aAAA,EAAoB;AAC5B,CAAA,IAAI,KAAK,GAAGC,eAAA,EAAsB,CAAC,KAAK;;AAExC,CAAA,iBAAc,GAAG,eAAe;;AAEhC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAS,eAAe,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE;AAChD,GAAE,IAAI,IAAI,GAAG,cAAc,CAAC,CAAC,CAAC;AAC9B,KAAI,MAAM,GAAG,IAAI,KAAK,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE;AAClE,QAAO,mBAAmB,CAAC,SAAS,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;;GAE3D,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KAC/B,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AACxB,OAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;;AAE1B,KAAI,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC,OAAO,EAAE;AAC5E,OAAM,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;OACjB,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,IAAI,IAAI,CAAC;;AAEzC;AACA,OAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE;AAChD,SAAQ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;WAC3B,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;AAClC,WAAU,MAAM,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC;SACjD,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,CAAC;AACnE,OAAA,CAAO,CAAC;;OAEF,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,EAAE;AAClC,SAAQ,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE;AAC1B,WAAU,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;AAC3C,WAAU,WAAW,EAAE,IAAI,CAAC,WAAW,CAAC,IAAI;AAC5C,UAAS,CAAC;AACV,OAAA;AACA,KAAA;AACA,GAAA,CAAG,CAAC;;AAEJ,GAAE,OAAO,MAAM;AACf,CAAA;;CAEA,SAAS,cAAc,CAAC,CAAC,EAAE;AAC3B,GAAE,IAAI,CAAC;AACP,GAAE,OAAO,CAAC,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;AAC9C,GAAE,OAAO,CAAC;AACV,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/cross-count.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"cross-count.js","sources":["../../../../../../../../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/cross-count.js"],"sourcesContent":["\"use strict\";\n\nvar _ = require(\"../lodash\");\n\nmodule.exports = crossCount;\n\n/*\n * A function that takes a layering (an array of layers, each with an array of\n * ordererd nodes) and a graph and returns a weighted crossing count.\n *\n * Pre-conditions:\n *\n *    1. Input graph must be simple (not a multigraph), directed, and include\n *       only simple edges.\n *    2. Edges in the input graph must have assigned weights.\n *\n * Post-conditions:\n *\n *    1. The graph and layering matrix are left unchanged.\n *\n * This algorithm is derived from Barth, et al., \"Bilayer Cross Counting.\"\n */\nfunction crossCount(g, layering) {\n  var cc = 0;\n  for (var i = 1; i < layering.length; ++i) {\n    cc += twoLayerCrossCount(g, layering[i-1], layering[i]);\n  }\n  return cc;\n}\n\nfunction twoLayerCrossCount(g, northLayer, southLayer) {\n  // Sort all of the edges between the north and south layers by their position\n  // in the north layer and then the south. Map these edges to the position of\n  // their head in the south layer.\n  var southPos = _.zipObject(southLayer,\n    _.map(southLayer, function (v, i) { return i; }));\n  var southEntries = _.flatten(_.map(northLayer, function(v) {\n    return _.sortBy(_.map(g.outEdges(v), function(e) {\n      return { pos: southPos[e.w], weight: g.edge(e).weight };\n    }), \"pos\");\n  }), true);\n\n  // Build the accumulator tree\n  var firstIndex = 1;\n  while (firstIndex < southLayer.length) firstIndex <<= 1;\n  var treeSize = 2 * firstIndex - 1;\n  firstIndex -= 1;\n  var tree = _.map(new Array(treeSize), function() { return 0; });\n\n  // Calculate the weighted crossings\n  var cc = 0;\n  _.forEach(southEntries.forEach(function(entry) {\n    var index = entry.pos + firstIndex;\n    tree[index] += entry.weight;\n    var weightSum = 0;\n    while (index > 0) {\n      if (index % 2) {\n        weightSum += tree[index + 1];\n      }\n      index = (index - 1) >> 1;\n      tree[index] += entry.weight;\n    }\n    cc += entry.weight * weightSum;\n  }));\n\n  return cc;\n}\n"],"names":["require$$0"],"mappings":";;;;;;;;;CAEA,IAAI,CAAC,GAAGA,aAAA,EAAoB;;AAE5B,CAAA,YAAc,GAAG,UAAU;;AAE3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAS,UAAU,CAAC,CAAC,EAAE,QAAQ,EAAE;GAC/B,IAAI,EAAE,GAAG,CAAC;AACZ,GAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;AAC5C,KAAI,EAAE,IAAI,kBAAkB,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;AAC3D,GAAA;AACA,GAAE,OAAO,EAAE;AACX,CAAA;;AAEA,CAAA,SAAS,kBAAkB,CAAC,CAAC,EAAE,UAAU,EAAE,UAAU,EAAE;AACvD;AACA;AACA;AACA,GAAE,IAAI,QAAQ,GAAG,CAAC,CAAC,SAAS,CAAC,UAAU;AACvC,KAAI,CAAC,CAAC,GAAG,CAAC,UAAU,EAAE,UAAU,CAAC,EAAE,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,CAAA,CAAE,CAAC,CAAC;AACrD,GAAE,IAAI,YAAY,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,UAAU,EAAE,SAAS,CAAC,EAAE;AAC7D,KAAI,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE;OAC/C,OAAO,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE;KAC7D,CAAK,CAAC,EAAE,KAAK,CAAC;GACd,CAAG,CAAC,EAAE,IAAI,CAAC;;AAEX;GACE,IAAI,UAAU,GAAG,CAAC;GAClB,OAAO,UAAU,GAAG,UAAU,CAAC,MAAM,EAAE,UAAU,KAAK,CAAC;AACzD,GAAE,IAAI,QAAQ,GAAG,CAAC,GAAG,UAAU,GAAG,CAAC;GACjC,UAAU,IAAI,CAAC;AACjB,GAAE,IAAI,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC;;AAEjE;GACE,IAAI,EAAE,GAAG,CAAC;GACV,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC,OAAO,CAAC,SAAS,KAAK,EAAE;AACjD,KAAI,IAAI,KAAK,GAAG,KAAK,CAAC,GAAG,GAAG,UAAU;AACtC,KAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM;KAC3B,IAAI,SAAS,GAAG,CAAC;AACrB,KAAI,OAAO,KAAK,GAAG,CAAC,EAAE;AACtB,OAAM,IAAI,KAAK,GAAG,CAAC,EAAE;AACrB,SAAQ,SAAS,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;AACpC,OAAA;AACA,OAAM,KAAK,GAAG,CAAC,KAAK,GAAG,CAAC,KAAK,CAAC;AAC9B,OAAM,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM;AACjC,KAAA;AACA,KAAI,EAAE,IAAI,KAAK,CAAC,MAAM,GAAG,SAAS;AAClC,GAAA,CAAG,CAAC,CAAC;;AAEL,GAAE,OAAO,EAAE;AACX,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../../../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/index.js"],"sourcesContent":["\"use strict\";\n\nvar _ = require(\"../lodash\");\nvar initOrder = require(\"./init-order\");\nvar crossCount = require(\"./cross-count\");\nvar sortSubgraph = require(\"./sort-subgraph\");\nvar buildLayerGraph = require(\"./build-layer-graph\");\nvar addSubgraphConstraints = require(\"./add-subgraph-constraints\");\nvar Graph = require(\"../graphlib\").Graph;\nvar util = require(\"../util\");\n\nmodule.exports = order;\n\n/*\n * Applies heuristics to minimize edge crossings in the graph and sets the best\n * order solution as an order attribute on each node.\n *\n * Pre-conditions:\n *\n *    1. Graph must be DAG\n *    2. Graph nodes must be objects with a \"rank\" attribute\n *    3. Graph edges must have the \"weight\" attribute\n *\n * Post-conditions:\n *\n *    1. Graph nodes will have an \"order\" attribute based on the results of the\n *       algorithm.\n */\nfunction order(g) {\n  var maxRank = util.maxRank(g),\n    downLayerGraphs = buildLayerGraphs(g, _.range(1, maxRank + 1), \"inEdges\"),\n    upLayerGraphs = buildLayerGraphs(g, _.range(maxRank - 1, -1, -1), \"outEdges\");\n\n  var layering = initOrder(g);\n  assignOrder(g, layering);\n\n  var bestCC = Number.POSITIVE_INFINITY,\n    best;\n\n  for (var i = 0, lastBest = 0; lastBest < 4; ++i, ++lastBest) {\n    sweepLayerGraphs(i % 2 ? downLayerGraphs : upLayerGraphs, i % 4 >= 2);\n\n    layering = util.buildLayerMatrix(g);\n    var cc = crossCount(g, layering);\n    if (cc < bestCC) {\n      lastBest = 0;\n      best = _.cloneDeep(layering);\n      bestCC = cc;\n    }\n  }\n\n  assignOrder(g, best);\n}\n\nfunction buildLayerGraphs(g, ranks, relationship) {\n  return _.map(ranks, function(rank) {\n    return buildLayerGraph(g, rank, relationship);\n  });\n}\n\nfunction sweepLayerGraphs(layerGraphs, biasRight) {\n  var cg = new Graph();\n  _.forEach(layerGraphs, function(lg) {\n    var root = lg.graph().root;\n    var sorted = sortSubgraph(lg, root, cg, biasRight);\n    _.forEach(sorted.vs, function(v, i) {\n      lg.node(v).order = i;\n    });\n    addSubgraphConstraints(lg, cg, sorted.vs);\n  });\n}\n\nfunction assignOrder(g, layering) {\n  _.forEach(layering, function(layer) {\n    _.forEach(layer, function(v, i) {\n      g.node(v).order = i;\n    });\n  });\n}\n"],"names":["require$$0","require$$1","require$$2","require$$3","require$$4","require$$5","require$$6","require$$7"],"mappings":";;;;;;;;;;;;;;;;CAEA,IAAI,CAAC,GAAGA,aAAA,EAAoB;CAC5B,IAAI,SAAS,GAAGC,gBAAA,EAAuB;CACvC,IAAI,UAAU,GAAGC,iBAAA,EAAwB;CACzC,IAAI,YAAY,GAAGC,mBAAA,EAA0B;CAC7C,IAAI,eAAe,GAAGC,sBAAA,EAA8B;CACpD,IAAI,sBAAsB,GAAGC,6BAAA,EAAqC;AAClE,CAAA,IAAI,KAAK,GAAGC,eAAA,EAAsB,CAAC,KAAK;CACxC,IAAI,IAAI,GAAGC,WAAA,EAAkB;;AAE7B,CAAA,OAAc,GAAG,KAAK;;AAEtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,KAAK,CAAC,CAAC,EAAE;GAChB,IAAI,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;AAC/B,KAAI,eAAe,GAAG,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC;KACzE,aAAa,GAAG,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,UAAU,CAAC;;AAEjF,GAAE,IAAI,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAC;AAC7B,GAAE,WAAW,CAAC,CAAC,EAAE,QAAQ,CAAC;;AAE1B,GAAE,IAAI,MAAM,GAAG,MAAM,CAAC,iBAAiB;AACvC,KAAI,IAAI;;AAER,GAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,QAAQ,EAAE;AAC/D,KAAI,gBAAgB,CAAC,CAAC,GAAG,CAAC,GAAG,eAAe,GAAG,aAAa,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;;AAEzE,KAAI,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;KACnC,IAAI,EAAE,GAAG,UAAU,CAAC,CAAC,EAAE,QAAQ,CAAC;AACpC,KAAI,IAAI,EAAE,GAAG,MAAM,EAAE;OACf,QAAQ,GAAG,CAAC;AAClB,OAAM,IAAI,GAAG,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC;OAC5B,MAAM,GAAG,EAAE;AACjB,KAAA;AACA,GAAA;;AAEA,GAAE,WAAW,CAAC,CAAC,EAAE,IAAI,CAAC;AACtB,CAAA;;AAEA,CAAA,SAAS,gBAAgB,CAAC,CAAC,EAAE,KAAK,EAAE,YAAY,EAAE;GAChD,OAAO,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,SAAS,IAAI,EAAE;KACjC,OAAO,eAAe,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC;AACjD,GAAA,CAAG,CAAC;AACJ,CAAA;;AAEA,CAAA,SAAS,gBAAgB,CAAC,WAAW,EAAE,SAAS,EAAE;AAClD,GAAE,IAAI,EAAE,GAAG,IAAI,KAAK,EAAE;GACpB,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,SAAS,EAAE,EAAE;KAClC,IAAI,IAAI,GAAG,EAAE,CAAC,KAAK,EAAE,CAAC,IAAI;AAC9B,KAAI,IAAI,MAAM,GAAG,YAAY,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,SAAS,CAAC;AACtD,KAAI,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,EAAE,SAAS,CAAC,EAAE,CAAC,EAAE;OAClC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC;AAC1B,KAAA,CAAK,CAAC;KACF,sBAAsB,CAAC,EAAE,EAAE,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC;AAC7C,GAAA,CAAG,CAAC;AACJ,CAAA;;AAEA,CAAA,SAAS,WAAW,CAAC,CAAC,EAAE,QAAQ,EAAE;GAChC,CAAC,CAAC,OAAO,CAAC,QAAQ,EAAE,SAAS,KAAK,EAAE;KAClC,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,CAAC,EAAE;OAC9B,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC;AACzB,KAAA,CAAK,CAAC;AACN,GAAA,CAAG,CAAC;AACJ,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/init-order.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"init-order.js","sources":["../../../../../../../../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/init-order.js"],"sourcesContent":["\"use strict\";\n\nvar _ = require(\"../lodash\");\n\nmodule.exports = initOrder;\n\n/*\n * Assigns an initial order value for each node by performing a DFS search\n * starting from nodes in the first rank. Nodes are assigned an order in their\n * rank as they are first visited.\n *\n * This approach comes from Gansner, et al., \"A Technique for Drawing Directed\n * Graphs.\"\n *\n * Returns a layering matrix with an array per layer and each layer sorted by\n * the order of its nodes.\n */\nfunction initOrder(g) {\n  var visited = {};\n  var simpleNodes = _.filter(g.nodes(), function(v) {\n    return !g.children(v).length;\n  });\n  var maxRank = _.max(_.map(simpleNodes, function(v) { return g.node(v).rank; }));\n  var layers = _.map(_.range(maxRank + 1), function() { return []; });\n\n  function dfs(v) {\n    if (_.has(visited, v)) return;\n    visited[v] = true;\n    var node = g.node(v);\n    layers[node.rank].push(v);\n    _.forEach(g.successors(v), dfs);\n  }\n\n  var orderedVs = _.sortBy(simpleNodes, function(v) { return g.node(v).rank; });\n  _.forEach(orderedVs, dfs);\n\n  return layers;\n}\n"],"names":["require$$0"],"mappings":";;;;;;;;;CAEA,IAAI,CAAC,GAAGA,aAAA,EAAoB;;AAE5B,CAAA,WAAc,GAAG,SAAS;;AAE1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,SAAS,CAAC,CAAC,EAAE;GACpB,IAAI,OAAO,GAAG,EAAE;AAClB,GAAE,IAAI,WAAW,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KAChD,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM;AAChC,GAAA,CAAG,CAAC;AACJ,GAAE,IAAI,OAAO,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,WAAW,EAAE,SAAS,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA,CAAE,CAAC,CAAC;GAC/E,IAAI,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,EAAE,WAAW,EAAE,OAAO,EAAE,CAAC,CAAA,CAAE,CAAC;;AAErE,GAAE,SAAS,GAAG,CAAC,CAAC,EAAE;KACd,IAAI,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE;AAC3B,KAAI,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI;KACjB,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;KACpB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AAC7B,KAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC;AACnC,GAAA;;GAEE,IAAI,SAAS,GAAG,CAAC,CAAC,MAAM,CAAC,WAAW,EAAE,SAAS,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA,CAAE,CAAC;AAC/E,GAAE,CAAC,CAAC,OAAO,CAAC,SAAS,EAAE,GAAG,CAAC;;AAE3B,GAAE,OAAO,MAAM;AACf,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/resolve-conflicts.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"resolve-conflicts.js","sources":["../../../../../../../../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/resolve-conflicts.js"],"sourcesContent":["\"use strict\";\n\nvar _ = require(\"../lodash\");\n\nmodule.exports = resolveConflicts;\n\n/*\n * Given a list of entries of the form {v, barycenter, weight} and a\n * constraint graph this function will resolve any conflicts between the\n * constraint graph and the barycenters for the entries. If the barycenters for\n * an entry would violate a constraint in the constraint graph then we coalesce\n * the nodes in the conflict into a new node that respects the contraint and\n * aggregates barycenter and weight information.\n *\n * This implementation is based on the description in Forster, \"A Fast and\n * Simple Hueristic for Constrained Two-Level Crossing Reduction,\" thought it\n * differs in some specific details.\n *\n * Pre-conditions:\n *\n *    1. Each entry has the form {v, barycenter, weight}, or if the node has\n *       no barycenter, then {v}.\n *\n * Returns:\n *\n *    A new list of entries of the form {vs, i, barycenter, weight}. The list\n *    `vs` may either be a singleton or it may be an aggregation of nodes\n *    ordered such that they do not violate constraints from the constraint\n *    graph. The property `i` is the lowest original index of any of the\n *    elements in `vs`.\n */\nfunction resolveConflicts(entries, cg) {\n  var mappedEntries = {};\n  _.forEach(entries, function(entry, i) {\n    var tmp = mappedEntries[entry.v] = {\n      indegree: 0,\n      \"in\": [],\n      out: [],\n      vs: [entry.v],\n      i: i\n    };\n    if (!_.isUndefined(entry.barycenter)) {\n      tmp.barycenter = entry.barycenter;\n      tmp.weight = entry.weight;\n    }\n  });\n\n  _.forEach(cg.edges(), function(e) {\n    var entryV = mappedEntries[e.v];\n    var entryW = mappedEntries[e.w];\n    if (!_.isUndefined(entryV) && !_.isUndefined(entryW)) {\n      entryW.indegree++;\n      entryV.out.push(mappedEntries[e.w]);\n    }\n  });\n\n  var sourceSet = _.filter(mappedEntries, function(entry) {\n    return !entry.indegree;\n  });\n\n  return doResolveConflicts(sourceSet);\n}\n\nfunction doResolveConflicts(sourceSet) {\n  var entries = [];\n\n  function handleIn(vEntry) {\n    return function(uEntry) {\n      if (uEntry.merged) {\n        return;\n      }\n      if (_.isUndefined(uEntry.barycenter) ||\n          _.isUndefined(vEntry.barycenter) ||\n          uEntry.barycenter >= vEntry.barycenter) {\n        mergeEntries(vEntry, uEntry);\n      }\n    };\n  }\n\n  function handleOut(vEntry) {\n    return function(wEntry) {\n      wEntry[\"in\"].push(vEntry);\n      if (--wEntry.indegree === 0) {\n        sourceSet.push(wEntry);\n      }\n    };\n  }\n\n  while (sourceSet.length) {\n    var entry = sourceSet.pop();\n    entries.push(entry);\n    _.forEach(entry[\"in\"].reverse(), handleIn(entry));\n    _.forEach(entry.out, handleOut(entry));\n  }\n\n  return _.map(_.filter(entries, function(entry) { return !entry.merged; }),\n    function(entry) {\n      return _.pick(entry, [\"vs\", \"i\", \"barycenter\", \"weight\"]);\n    });\n\n}\n\nfunction mergeEntries(target, source) {\n  var sum = 0;\n  var weight = 0;\n\n  if (target.weight) {\n    sum += target.barycenter * target.weight;\n    weight += target.weight;\n  }\n\n  if (source.weight) {\n    sum += source.barycenter * source.weight;\n    weight += source.weight;\n  }\n\n  target.vs = source.vs.concat(target.vs);\n  target.barycenter = sum / weight;\n  target.weight = weight;\n  target.i = Math.min(source.i, target.i);\n  source.merged = true;\n}\n"],"names":["require$$0"],"mappings":";;;;;;;;;CAEA,IAAI,CAAC,GAAGA,aAAA,EAAoB;;AAE5B,CAAA,kBAAc,GAAG,gBAAgB;;AAEjC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAS,gBAAgB,CAAC,OAAO,EAAE,EAAE,EAAE;GACrC,IAAI,aAAa,GAAG,EAAE;GACtB,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,SAAS,KAAK,EAAE,CAAC,EAAE;KACpC,IAAI,GAAG,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG;OACjC,QAAQ,EAAE,CAAC;OACX,IAAI,EAAE,EAAE;OACR,GAAG,EAAE,EAAE;AACb,OAAM,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;AACnB,OAAM,CAAC,EAAE;MACJ;KACD,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE;AAC1C,OAAM,GAAG,CAAC,UAAU,GAAG,KAAK,CAAC,UAAU;AACvC,OAAM,GAAG,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM;AAC/B,KAAA;AACA,GAAA,CAAG,CAAC;;GAEF,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KAChC,IAAI,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;KAC/B,IAAI,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;AACnC,KAAI,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE;OACpD,MAAM,CAAC,QAAQ,EAAE;AACvB,OAAM,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACzC,KAAA;AACA,GAAA,CAAG,CAAC;;GAEF,IAAI,SAAS,GAAG,CAAC,CAAC,MAAM,CAAC,aAAa,EAAE,SAAS,KAAK,EAAE;AAC1D,KAAI,OAAO,CAAC,KAAK,CAAC,QAAQ;AAC1B,GAAA,CAAG,CAAC;;AAEJ,GAAE,OAAO,kBAAkB,CAAC,SAAS,CAAC;AACtC,CAAA;;CAEA,SAAS,kBAAkB,CAAC,SAAS,EAAE;GACrC,IAAI,OAAO,GAAG,EAAE;;AAElB,GAAE,SAAS,QAAQ,CAAC,MAAM,EAAE;KACxB,OAAO,SAAS,MAAM,EAAE;AAC5B,OAAM,IAAI,MAAM,CAAC,MAAM,EAAE;SACjB;AACR,OAAA;OACM,IAAI,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,UAAU,CAAC;AAC1C,WAAU,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,UAAU,CAAC;AAC1C,WAAU,MAAM,CAAC,UAAU,IAAI,MAAM,CAAC,UAAU,EAAE;AAClD,SAAQ,YAAY,CAAC,MAAM,EAAE,MAAM,CAAC;AACpC,OAAA;KACA,CAAK;AACL,GAAA;;AAEA,GAAE,SAAS,SAAS,CAAC,MAAM,EAAE;KACzB,OAAO,SAAS,MAAM,EAAE;OACtB,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;AAC/B,OAAM,IAAI,EAAE,MAAM,CAAC,QAAQ,KAAK,CAAC,EAAE;AACnC,SAAQ,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC;AAC9B,OAAA;KACA,CAAK;AACL,GAAA;;AAEA,GAAE,OAAO,SAAS,CAAC,MAAM,EAAE;AAC3B,KAAI,IAAI,KAAK,GAAG,SAAS,CAAC,GAAG,EAAE;AAC/B,KAAI,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC;AACvB,KAAI,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC;AACrD,KAAI,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC;AAC1C,GAAA;;GAEE,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,EAAE,SAAS,KAAK,EAAE,EAAE,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAA,CAAE,CAAC;KACvE,SAAS,KAAK,EAAE;AACpB,OAAM,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAC;AAC/D,KAAA,CAAK,CAAC;;AAEN,CAAA;;AAEA,CAAA,SAAS,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE;GACpC,IAAI,GAAG,GAAG,CAAC;GACX,IAAI,MAAM,GAAG,CAAC;;AAEhB,GAAE,IAAI,MAAM,CAAC,MAAM,EAAE;KACjB,GAAG,IAAI,MAAM,CAAC,UAAU,GAAG,MAAM,CAAC,MAAM;AAC5C,KAAI,MAAM,IAAI,MAAM,CAAC,MAAM;AAC3B,GAAA;;AAEA,GAAE,IAAI,MAAM,CAAC,MAAM,EAAE;KACjB,GAAG,IAAI,MAAM,CAAC,UAAU,GAAG,MAAM,CAAC,MAAM;AAC5C,KAAI,MAAM,IAAI,MAAM,CAAC,MAAM;AAC3B,GAAA;;AAEA,GAAE,MAAM,CAAC,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;AACzC,GAAE,MAAM,CAAC,UAAU,GAAG,GAAG,GAAG,MAAM;AAClC,GAAE,MAAM,CAAC,MAAM,GAAG,MAAM;AACxB,GAAE,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;AACzC,GAAE,MAAM,CAAC,MAAM,GAAG,IAAI;AACtB,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/sort-subgraph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sort-subgraph.js","sources":["../../../../../../../../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/sort-subgraph.js"],"sourcesContent":["var _ = require(\"../lodash\");\nvar barycenter = require(\"./barycenter\");\nvar resolveConflicts = require(\"./resolve-conflicts\");\nvar sort = require(\"./sort\");\n\nmodule.exports = sortSubgraph;\n\nfunction sortSubgraph(g, v, cg, biasRight) {\n  var movable = g.children(v);\n  var node = g.node(v);\n  var bl = node ? node.borderLeft : undefined;\n  var br = node ? node.borderRight: undefined;\n  var subgraphs = {};\n\n  if (bl) {\n    movable = _.filter(movable, function(w) {\n      return w !== bl && w !== br;\n    });\n  }\n\n  var barycenters = barycenter(g, movable);\n  _.forEach(barycenters, function(entry) {\n    if (g.children(entry.v).length) {\n      var subgraphResult = sortSubgraph(g, entry.v, cg, biasRight);\n      subgraphs[entry.v] = subgraphResult;\n      if (_.has(subgraphResult, \"barycenter\")) {\n        mergeBarycenters(entry, subgraphResult);\n      }\n    }\n  });\n\n  var entries = resolveConflicts(barycenters, cg);\n  expandSubgraphs(entries, subgraphs);\n\n  var result = sort(entries, biasRight);\n\n  if (bl) {\n    result.vs = _.flatten([bl, result.vs, br], true);\n    if (g.predecessors(bl).length) {\n      var blPred = g.node(g.predecessors(bl)[0]),\n        brPred = g.node(g.predecessors(br)[0]);\n      if (!_.has(result, \"barycenter\")) {\n        result.barycenter = 0;\n        result.weight = 0;\n      }\n      result.barycenter = (result.barycenter * result.weight +\n                           blPred.order + brPred.order) / (result.weight + 2);\n      result.weight += 2;\n    }\n  }\n\n  return result;\n}\n\nfunction expandSubgraphs(entries, subgraphs) {\n  _.forEach(entries, function(entry) {\n    entry.vs = _.flatten(entry.vs.map(function(v) {\n      if (subgraphs[v]) {\n        return subgraphs[v].vs;\n      }\n      return v;\n    }), true);\n  });\n}\n\nfunction mergeBarycenters(target, other) {\n  if (!_.isUndefined(target.barycenter)) {\n    target.barycenter = (target.barycenter * target.weight +\n                         other.barycenter * other.weight) /\n                        (target.weight + other.weight);\n    target.weight += other.weight;\n  } else {\n    target.barycenter = other.barycenter;\n    target.weight = other.weight;\n  }\n}\n"],"names":["require$$0","require$$1","require$$2","require$$3"],"mappings":";;;;;;;;;;;CAAA,IAAI,CAAC,GAAGA,aAAA,EAAoB;CAC5B,IAAI,UAAU,GAAGC,iBAAA,EAAuB;CACxC,IAAI,gBAAgB,GAAGC,uBAAA,EAA8B;CACrD,IAAI,IAAI,GAAGC,WAAA,EAAiB;;AAE5B,CAAA,cAAc,GAAG,YAAY;;CAE7B,SAAS,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE;GACzC,IAAI,OAAO,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;GAC3B,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;GACpB,IAAI,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC,UAAU,GAAG,SAAS;GAC3C,IAAI,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC,WAAW,EAAE,SAAS;GAC3C,IAAI,SAAS,GAAG,EAAE;;GAElB,IAAI,EAAE,EAAE;KACN,OAAO,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,EAAE,SAAS,CAAC,EAAE;AAC5C,OAAM,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE;AACjC,KAAA,CAAK,CAAC;AACN,GAAA;;GAEE,IAAI,WAAW,GAAG,UAAU,CAAC,CAAC,EAAE,OAAO,CAAC;GACxC,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,SAAS,KAAK,EAAE;KACrC,IAAI,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE;AACpC,OAAM,IAAI,cAAc,GAAG,YAAY,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,EAAE,EAAE,SAAS,CAAC;AAClE,OAAM,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,cAAc;OACnC,IAAI,CAAC,CAAC,GAAG,CAAC,cAAc,EAAE,YAAY,CAAC,EAAE;AAC/C,SAAQ,gBAAgB,CAAC,KAAK,EAAE,cAAc,CAAC;AAC/C,OAAA;AACA,KAAA;AACA,GAAA,CAAG,CAAC;;GAEF,IAAI,OAAO,GAAG,gBAAgB,CAAC,WAAW,EAAE,EAAE,CAAC;AACjD,GAAE,eAAe,CAAC,OAAO,EAAE,SAAS,CAAC;;GAEnC,IAAI,MAAM,GAAG,IAAI,CAAC,OAAO,EAAE,SAAS,CAAC;;GAErC,IAAI,EAAE,EAAE;AACV,KAAI,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC;KAChD,IAAI,CAAC,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC,MAAM,EAAE;AACnC,OAAM,IAAI,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;AAChD,SAAQ,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;OACxC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,EAAE;AACxC,SAAQ,MAAM,CAAC,UAAU,GAAG,CAAC;AAC7B,SAAQ,MAAM,CAAC,MAAM,GAAG,CAAC;AACzB,OAAA;OACM,MAAM,CAAC,UAAU,GAAG,CAAC,MAAM,CAAC,UAAU,GAAG,MAAM,CAAC,MAAM;AAC5D,4BAA2B,MAAM,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,KAAK,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;AAC7E,OAAM,MAAM,CAAC,MAAM,IAAI,CAAC;AACxB,KAAA;AACA,GAAA;;AAEA,GAAE,OAAO,MAAM;AACf,CAAA;;AAEA,CAAA,SAAS,eAAe,CAAC,OAAO,EAAE,SAAS,EAAE;GAC3C,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,SAAS,KAAK,EAAE;AACrC,KAAI,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE;AAClD,OAAM,IAAI,SAAS,CAAC,CAAC,CAAC,EAAE;AACxB,SAAQ,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE;AAC9B,OAAA;AACA,OAAM,OAAO,CAAC;KACd,CAAK,CAAC,EAAE,IAAI,CAAC;AACb,GAAA,CAAG,CAAC;AACJ,CAAA;;AAEA,CAAA,SAAS,gBAAgB,CAAC,MAAM,EAAE,KAAK,EAAE;GACvC,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE;KACrC,MAAM,CAAC,UAAU,GAAG,CAAC,MAAM,CAAC,UAAU,GAAG,MAAM,CAAC,MAAM;AAC1D,0BAAyB,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,MAAM;AACxD,0BAAyB,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;AACtD,KAAI,MAAM,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM;AACjC,GAAA,CAAG,MAAM;AACT,KAAI,MAAM,CAAC,UAAU,GAAG,KAAK,CAAC,UAAU;AACxC,KAAI,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM;AAChC,GAAA;AACA,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/sort.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sort.js","sources":["../../../../../../../../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/sort.js"],"sourcesContent":["var _ = require(\"../lodash\");\nvar util = require(\"../util\");\n\nmodule.exports = sort;\n\nfunction sort(entries, biasRight) {\n  var parts = util.partition(entries, function(entry) {\n    return _.has(entry, \"barycenter\");\n  });\n  var sortable = parts.lhs,\n    unsortable = _.sortBy(parts.rhs, function(entry) { return -entry.i; }),\n    vs = [],\n    sum = 0,\n    weight = 0,\n    vsIndex = 0;\n\n  sortable.sort(compareWithBias(!!biasRight));\n\n  vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n\n  _.forEach(sortable, function (entry) {\n    vsIndex += entry.vs.length;\n    vs.push(entry.vs);\n    sum += entry.barycenter * entry.weight;\n    weight += entry.weight;\n    vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n  });\n\n  var result = { vs: _.flatten(vs, true) };\n  if (weight) {\n    result.barycenter = sum / weight;\n    result.weight = weight;\n  }\n  return result;\n}\n\nfunction consumeUnsortable(vs, unsortable, index) {\n  var last;\n  while (unsortable.length && (last = _.last(unsortable)).i <= index) {\n    unsortable.pop();\n    vs.push(last.vs);\n    index++;\n  }\n  return index;\n}\n\nfunction compareWithBias(bias) {\n  return function(entryV, entryW) {\n    if (entryV.barycenter < entryW.barycenter) {\n      return -1;\n    } else if (entryV.barycenter > entryW.barycenter) {\n      return 1;\n    }\n\n    return !bias ? entryV.i - entryW.i : entryW.i - entryV.i;\n  };\n}\n"],"names":["require$$0","require$$1"],"mappings":";;;;;;;;;CAAA,IAAI,CAAC,GAAGA,aAAA,EAAoB;CAC5B,IAAI,IAAI,GAAGC,WAAA,EAAkB;;AAE7B,CAAA,MAAc,GAAG,IAAI;;AAErB,CAAA,SAAS,IAAI,CAAC,OAAO,EAAE,SAAS,EAAE;GAChC,IAAI,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,SAAS,KAAK,EAAE;KAClD,OAAO,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,YAAY,CAAC;AACrC,GAAA,CAAG,CAAC;AACJ,GAAE,IAAI,QAAQ,GAAG,KAAK,CAAC,GAAG;KACtB,UAAU,GAAG,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,SAAS,KAAK,EAAE,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA,CAAE,CAAC;KACtE,EAAE,GAAG,EAAE;KACP,GAAG,GAAG,CAAC;KACP,MAAM,GAAG,CAAC;KACV,OAAO,GAAG,CAAC;;GAEb,QAAQ,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;;GAE3C,OAAO,GAAG,iBAAiB,CAAC,EAAE,EAAE,UAAU,EAAE,OAAO,CAAC;;GAEpD,CAAC,CAAC,OAAO,CAAC,QAAQ,EAAE,UAAU,KAAK,EAAE;AACvC,KAAI,OAAO,IAAI,KAAK,CAAC,EAAE,CAAC,MAAM;AAC9B,KAAI,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;KACjB,GAAG,IAAI,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,MAAM;AAC1C,KAAI,MAAM,IAAI,KAAK,CAAC,MAAM;KACtB,OAAO,GAAG,iBAAiB,CAAC,EAAE,EAAE,UAAU,EAAE,OAAO,CAAC;AACxD,GAAA,CAAG,CAAC;;AAEJ,GAAE,IAAI,MAAM,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE;GACxC,IAAI,MAAM,EAAE;AACd,KAAI,MAAM,CAAC,UAAU,GAAG,GAAG,GAAG,MAAM;AACpC,KAAI,MAAM,CAAC,MAAM,GAAG,MAAM;AAC1B,GAAA;AACA,GAAE,OAAO,MAAM;AACf,CAAA;;AAEA,CAAA,SAAS,iBAAiB,CAAC,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE;AAClD,GAAE,IAAI,IAAI;AACV,GAAE,OAAO,UAAU,CAAC,MAAM,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,IAAI,KAAK,EAAE;KAClE,UAAU,CAAC,GAAG,EAAE;AACpB,KAAI,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;AACpB,KAAI,KAAK,EAAE;AACX,GAAA;AACA,GAAE,OAAO,KAAK;AACd,CAAA;;CAEA,SAAS,eAAe,CAAC,IAAI,EAAE;AAC/B,GAAE,OAAO,SAAS,MAAM,EAAE,MAAM,EAAE;KAC9B,IAAI,MAAM,CAAC,UAAU,GAAG,MAAM,CAAC,UAAU,EAAE;OACzC,OAAO,EAAE;KACf,CAAK,MAAM,IAAI,MAAM,CAAC,UAAU,GAAG,MAAM,CAAC,UAAU,EAAE;AACtD,OAAM,OAAO,CAAC;AACd,KAAA;;AAEA,KAAI,OAAO,CAAC,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;GAC5D,CAAG;AACH,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/parent-dummy-chains.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"parent-dummy-chains.js","sources":["../../../../../../../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/parent-dummy-chains.js"],"sourcesContent":["var _ = require(\"./lodash\");\n\nmodule.exports = parentDummyChains;\n\nfunction parentDummyChains(g) {\n  var postorderNums = postorder(g);\n\n  _.forEach(g.graph().dummyChains, function(v) {\n    var node = g.node(v);\n    var edgeObj = node.edgeObj;\n    var pathData = findPath(g, postorderNums, edgeObj.v, edgeObj.w);\n    var path = pathData.path;\n    var lca = pathData.lca;\n    var pathIdx = 0;\n    var pathV = path[pathIdx];\n    var ascending = true;\n\n    while (v !== edgeObj.w) {\n      node = g.node(v);\n\n      if (ascending) {\n        while ((pathV = path[pathIdx]) !== lca &&\n               g.node(pathV).maxRank < node.rank) {\n          pathIdx++;\n        }\n\n        if (pathV === lca) {\n          ascending = false;\n        }\n      }\n\n      if (!ascending) {\n        while (pathIdx < path.length - 1 &&\n               g.node(pathV = path[pathIdx + 1]).minRank <= node.rank) {\n          pathIdx++;\n        }\n        pathV = path[pathIdx];\n      }\n\n      g.setParent(v, pathV);\n      v = g.successors(v)[0];\n    }\n  });\n}\n\n// Find a path from v to w through the lowest common ancestor (LCA). Return the\n// full path and the LCA.\nfunction findPath(g, postorderNums, v, w) {\n  var vPath = [];\n  var wPath = [];\n  var low = Math.min(postorderNums[v].low, postorderNums[w].low);\n  var lim = Math.max(postorderNums[v].lim, postorderNums[w].lim);\n  var parent;\n  var lca;\n\n  // Traverse up from v to find the LCA\n  parent = v;\n  do {\n    parent = g.parent(parent);\n    vPath.push(parent);\n  } while (parent &&\n           (postorderNums[parent].low > low || lim > postorderNums[parent].lim));\n  lca = parent;\n\n  // Traverse from w to LCA\n  parent = w;\n  while ((parent = g.parent(parent)) !== lca) {\n    wPath.push(parent);\n  }\n\n  return { path: vPath.concat(wPath.reverse()), lca: lca };\n}\n\nfunction postorder(g) {\n  var result = {};\n  var lim = 0;\n\n  function dfs(v) {\n    var low = lim;\n    _.forEach(g.children(v), dfs);\n    result[v] = { low: low, lim: lim++ };\n  }\n  _.forEach(g.children(), dfs);\n\n  return result;\n}\n"],"names":["require$$0"],"mappings":";;;;;;;;CAAA,IAAI,CAAC,GAAGA,aAAA,EAAmB;;AAE3B,CAAA,mBAAc,GAAG,iBAAiB;;CAElC,SAAS,iBAAiB,CAAC,CAAC,EAAE;AAC9B,GAAE,IAAI,aAAa,GAAG,SAAS,CAAC,CAAC,CAAC;;AAElC,GAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,WAAW,EAAE,SAAS,CAAC,EAAE;KAC3C,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AACxB,KAAI,IAAI,OAAO,GAAG,IAAI,CAAC,OAAO;AAC9B,KAAI,IAAI,QAAQ,GAAG,QAAQ,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;AACnE,KAAI,IAAI,IAAI,GAAG,QAAQ,CAAC,IAAI;AAC5B,KAAI,IAAI,GAAG,GAAG,QAAQ,CAAC,GAAG;KACtB,IAAI,OAAO,GAAG,CAAC;AACnB,KAAI,IAAI,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC;KACzB,IAAI,SAAS,GAAG,IAAI;;AAExB,KAAI,OAAO,CAAC,KAAK,OAAO,CAAC,CAAC,EAAE;AAC5B,OAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;;OAEhB,IAAI,SAAS,EAAE;SACb,OAAO,CAAC,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG;AAC9C,gBAAe,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE;AAClD,WAAU,OAAO,EAAE;AACnB,SAAA;;AAEA,SAAQ,IAAI,KAAK,KAAK,GAAG,EAAE;WACjB,SAAS,GAAG,KAAK;AAC3B,SAAA;AACA,OAAA;;OAEM,IAAI,CAAC,SAAS,EAAE;AACtB,SAAQ,OAAO,OAAO,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC;AACxC,gBAAe,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,IAAI,IAAI,CAAC,IAAI,EAAE;AACvE,WAAU,OAAO,EAAE;AACnB,SAAA;AACA,SAAQ,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC;AAC7B,OAAA;;AAEA,OAAM,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC;OACrB,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC5B,KAAA;AACA,GAAA,CAAG,CAAC;AACJ,CAAA;;AAEA;AACA;CACA,SAAS,QAAQ,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,CAAC,EAAE;GACxC,IAAI,KAAK,GAAG,EAAE;GACd,IAAI,KAAK,GAAG,EAAE;GACd,IAAI,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;GAC9D,IAAI,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;AAChE,GAAE,IAAI,MAAM;AACZ,GAAE,IAAI,GAAG;;AAET;GACE,MAAM,GAAG,CAAC;AACZ,GAAE,GAAG;AACL,KAAI,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;AAC7B,KAAI,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC;AACtB,GAAA,CAAG,QAAQ,MAAM;AACjB,aAAY,aAAa,CAAC,MAAM,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC;GAC7E,GAAG,GAAG,MAAM;;AAEd;GACE,MAAM,GAAG,CAAC;AACZ,GAAE,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,EAAE;AAC9C,KAAI,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC;AACtB,GAAA;;AAEA,GAAE,OAAO,EAAE,IAAI,EAAE,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE;AAC1D,CAAA;;CAEA,SAAS,SAAS,CAAC,CAAC,EAAE;GACpB,IAAI,MAAM,GAAG,EAAE;GACf,IAAI,GAAG,GAAG,CAAC;;AAEb,GAAE,SAAS,GAAG,CAAC,CAAC,EAAE;KACd,IAAI,GAAG,GAAG,GAAG;AACjB,KAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC;AACjC,KAAI,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE;AACxC,GAAA;GACE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,EAAE,EAAE,GAAG,CAAC;;AAE9B,GAAE,OAAO,MAAM;AACf,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/position/bk.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"bk.js","sources":["../../../../../../../../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/position/bk.js"],"sourcesContent":["\"use strict\";\n\nvar _ = require(\"../lodash\");\nvar Graph = require(\"../graphlib\").Graph;\nvar util = require(\"../util\");\n\n/*\n * This module provides coordinate assignment based on Brandes and Köpf, \"Fast\n * and Simple Horizontal Coordinate Assignment.\"\n */\n\nmodule.exports = {\n  positionX: positionX,\n  findType1Conflicts: findType1Conflicts,\n  findType2Conflicts: findType2Conflicts,\n  addConflict: addConflict,\n  hasConflict: hasConflict,\n  verticalAlignment: verticalAlignment,\n  horizontalCompaction: horizontalCompaction,\n  alignCoordinates: alignCoordinates,\n  findSmallestWidthAlignment: findSmallestWidthAlignment,\n  balance: balance\n};\n\n/*\n * Marks all edges in the graph with a type-1 conflict with the \"type1Conflict\"\n * property. A type-1 conflict is one where a non-inner segment crosses an\n * inner segment. An inner segment is an edge with both incident nodes marked\n * with the \"dummy\" property.\n *\n * This algorithm scans layer by layer, starting with the second, for type-1\n * conflicts between the current layer and the previous layer. For each layer\n * it scans the nodes from left to right until it reaches one that is incident\n * on an inner segment. It then scans predecessors to determine if they have\n * edges that cross that inner segment. At the end a final scan is done for all\n * nodes on the current rank to see if they cross the last visited inner\n * segment.\n *\n * This algorithm (safely) assumes that a dummy node will only be incident on a\n * single node in the layers being scanned.\n */\nfunction findType1Conflicts(g, layering) {\n  var conflicts = {};\n\n  function visitLayer(prevLayer, layer) {\n    var\n      // last visited node in the previous layer that is incident on an inner\n      // segment.\n      k0 = 0,\n      // Tracks the last node in this layer scanned for crossings with a type-1\n      // segment.\n      scanPos = 0,\n      prevLayerLength = prevLayer.length,\n      lastNode = _.last(layer);\n\n    _.forEach(layer, function(v, i) {\n      var w = findOtherInnerSegmentNode(g, v),\n        k1 = w ? g.node(w).order : prevLayerLength;\n\n      if (w || v === lastNode) {\n        _.forEach(layer.slice(scanPos, i +1), function(scanNode) {\n          _.forEach(g.predecessors(scanNode), function(u) {\n            var uLabel = g.node(u),\n              uPos = uLabel.order;\n            if ((uPos < k0 || k1 < uPos) &&\n                !(uLabel.dummy && g.node(scanNode).dummy)) {\n              addConflict(conflicts, u, scanNode);\n            }\n          });\n        });\n        scanPos = i + 1;\n        k0 = k1;\n      }\n    });\n\n    return layer;\n  }\n\n  _.reduce(layering, visitLayer);\n  return conflicts;\n}\n\nfunction findType2Conflicts(g, layering) {\n  var conflicts = {};\n\n  function scan(south, southPos, southEnd, prevNorthBorder, nextNorthBorder) {\n    var v;\n    _.forEach(_.range(southPos, southEnd), function(i) {\n      v = south[i];\n      if (g.node(v).dummy) {\n        _.forEach(g.predecessors(v), function(u) {\n          var uNode = g.node(u);\n          if (uNode.dummy &&\n              (uNode.order < prevNorthBorder || uNode.order > nextNorthBorder)) {\n            addConflict(conflicts, u, v);\n          }\n        });\n      }\n    });\n  }\n\n\n  function visitLayer(north, south) {\n    var prevNorthPos = -1,\n      nextNorthPos,\n      southPos = 0;\n\n    _.forEach(south, function(v, southLookahead) {\n      if (g.node(v).dummy === \"border\") {\n        var predecessors = g.predecessors(v);\n        if (predecessors.length) {\n          nextNorthPos = g.node(predecessors[0]).order;\n          scan(south, southPos, southLookahead, prevNorthPos, nextNorthPos);\n          southPos = southLookahead;\n          prevNorthPos = nextNorthPos;\n        }\n      }\n      scan(south, southPos, south.length, nextNorthPos, north.length);\n    });\n\n    return south;\n  }\n\n  _.reduce(layering, visitLayer);\n  return conflicts;\n}\n\nfunction findOtherInnerSegmentNode(g, v) {\n  if (g.node(v).dummy) {\n    return _.find(g.predecessors(v), function(u) {\n      return g.node(u).dummy;\n    });\n  }\n}\n\nfunction addConflict(conflicts, v, w) {\n  if (v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n\n  var conflictsV = conflicts[v];\n  if (!conflictsV) {\n    conflicts[v] = conflictsV = {};\n  }\n  conflictsV[w] = true;\n}\n\nfunction hasConflict(conflicts, v, w) {\n  if (v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n  return _.has(conflicts[v], w);\n}\n\n/*\n * Try to align nodes into vertical \"blocks\" where possible. This algorithm\n * attempts to align a node with one of its median neighbors. If the edge\n * connecting a neighbor is a type-1 conflict then we ignore that possibility.\n * If a previous node has already formed a block with a node after the node\n * we're trying to form a block with, we also ignore that possibility - our\n * blocks would be split in that scenario.\n */\nfunction verticalAlignment(g, layering, conflicts, neighborFn) {\n  var root = {},\n    align = {},\n    pos = {};\n\n  // We cache the position here based on the layering because the graph and\n  // layering may be out of sync. The layering matrix is manipulated to\n  // generate different extreme alignments.\n  _.forEach(layering, function(layer) {\n    _.forEach(layer, function(v, order) {\n      root[v] = v;\n      align[v] = v;\n      pos[v] = order;\n    });\n  });\n\n  _.forEach(layering, function(layer) {\n    var prevIdx = -1;\n    _.forEach(layer, function(v) {\n      var ws = neighborFn(v);\n      if (ws.length) {\n        ws = _.sortBy(ws, function(w) { return pos[w]; });\n        var mp = (ws.length - 1) / 2;\n        for (var i = Math.floor(mp), il = Math.ceil(mp); i <= il; ++i) {\n          var w = ws[i];\n          if (align[v] === v &&\n              prevIdx < pos[w] &&\n              !hasConflict(conflicts, v, w)) {\n            align[w] = v;\n            align[v] = root[v] = root[w];\n            prevIdx = pos[w];\n          }\n        }\n      }\n    });\n  });\n\n  return { root: root, align: align };\n}\n\nfunction horizontalCompaction(g, layering, root, align, reverseSep) {\n  // This portion of the algorithm differs from BK due to a number of problems.\n  // Instead of their algorithm we construct a new block graph and do two\n  // sweeps. The first sweep places blocks with the smallest possible\n  // coordinates. The second sweep removes unused space by moving blocks to the\n  // greatest coordinates without violating separation.\n  var xs = {},\n    blockG = buildBlockGraph(g, layering, root, reverseSep),\n    borderType = reverseSep ? \"borderLeft\" : \"borderRight\";\n\n  function iterate(setXsFunc, nextNodesFunc) {\n    var stack = blockG.nodes();\n    var elem = stack.pop();\n    var visited = {};\n    while (elem) {\n      if (visited[elem]) {\n        setXsFunc(elem);\n      } else {\n        visited[elem] = true;\n        stack.push(elem);\n        stack = stack.concat(nextNodesFunc(elem));\n      }\n\n      elem = stack.pop();\n    }\n  }\n\n  // First pass, assign smallest coordinates\n  function pass1(elem) {\n    xs[elem] = blockG.inEdges(elem).reduce(function(acc, e) {\n      return Math.max(acc, xs[e.v] + blockG.edge(e));\n    }, 0);\n  }\n\n  // Second pass, assign greatest coordinates\n  function pass2(elem) {\n    var min = blockG.outEdges(elem).reduce(function(acc, e) {\n      return Math.min(acc, xs[e.w] - blockG.edge(e));\n    }, Number.POSITIVE_INFINITY);\n\n    var node = g.node(elem);\n    if (min !== Number.POSITIVE_INFINITY && node.borderType !== borderType) {\n      xs[elem] = Math.max(xs[elem], min);\n    }\n  }\n\n  iterate(pass1, blockG.predecessors.bind(blockG));\n  iterate(pass2, blockG.successors.bind(blockG));\n\n  // Assign x coordinates to all nodes\n  _.forEach(align, function(v) {\n    xs[v] = xs[root[v]];\n  });\n\n  return xs;\n}\n\n\nfunction buildBlockGraph(g, layering, root, reverseSep) {\n  var blockGraph = new Graph(),\n    graphLabel = g.graph(),\n    sepFn = sep(graphLabel.nodesep, graphLabel.edgesep, reverseSep);\n\n  _.forEach(layering, function(layer) {\n    var u;\n    _.forEach(layer, function(v) {\n      var vRoot = root[v];\n      blockGraph.setNode(vRoot);\n      if (u) {\n        var uRoot = root[u],\n          prevMax = blockGraph.edge(uRoot, vRoot);\n        blockGraph.setEdge(uRoot, vRoot, Math.max(sepFn(g, v, u), prevMax || 0));\n      }\n      u = v;\n    });\n  });\n\n  return blockGraph;\n}\n\n/*\n * Returns the alignment that has the smallest width of the given alignments.\n */\nfunction findSmallestWidthAlignment(g, xss) {\n  return _.minBy(_.values(xss), function (xs) {\n    var max = Number.NEGATIVE_INFINITY;\n    var min = Number.POSITIVE_INFINITY;\n\n    _.forIn(xs, function (x, v) {\n      var halfWidth = width(g, v) / 2;\n\n      max = Math.max(x + halfWidth, max);\n      min = Math.min(x - halfWidth, min);\n    });\n\n    return max - min;\n  });\n}\n\n/*\n * Align the coordinates of each of the layout alignments such that\n * left-biased alignments have their minimum coordinate at the same point as\n * the minimum coordinate of the smallest width alignment and right-biased\n * alignments have their maximum coordinate at the same point as the maximum\n * coordinate of the smallest width alignment.\n */\nfunction alignCoordinates(xss, alignTo) {\n  var alignToVals = _.values(alignTo),\n    alignToMin = _.min(alignToVals),\n    alignToMax = _.max(alignToVals);\n\n  _.forEach([\"u\", \"d\"], function(vert) {\n    _.forEach([\"l\", \"r\"], function(horiz) {\n      var alignment = vert + horiz,\n        xs = xss[alignment],\n        delta;\n      if (xs === alignTo) return;\n\n      var xsVals = _.values(xs);\n      delta = horiz === \"l\" ? alignToMin - _.min(xsVals) : alignToMax - _.max(xsVals);\n\n      if (delta) {\n        xss[alignment] = _.mapValues(xs, function(x) { return x + delta; });\n      }\n    });\n  });\n}\n\nfunction balance(xss, align) {\n  return _.mapValues(xss.ul, function(ignore, v) {\n    if (align) {\n      return xss[align.toLowerCase()][v];\n    } else {\n      var xs = _.sortBy(_.map(xss, v));\n      return (xs[1] + xs[2]) / 2;\n    }\n  });\n}\n\nfunction positionX(g) {\n  var layering = util.buildLayerMatrix(g);\n  var conflicts = _.merge(\n    findType1Conflicts(g, layering),\n    findType2Conflicts(g, layering));\n\n  var xss = {};\n  var adjustedLayering;\n  _.forEach([\"u\", \"d\"], function(vert) {\n    adjustedLayering = vert === \"u\" ? layering : _.values(layering).reverse();\n    _.forEach([\"l\", \"r\"], function(horiz) {\n      if (horiz === \"r\") {\n        adjustedLayering = _.map(adjustedLayering, function(inner) {\n          return _.values(inner).reverse();\n        });\n      }\n\n      var neighborFn = (vert === \"u\" ? g.predecessors : g.successors).bind(g);\n      var align = verticalAlignment(g, adjustedLayering, conflicts, neighborFn);\n      var xs = horizontalCompaction(g, adjustedLayering,\n        align.root, align.align, horiz === \"r\");\n      if (horiz === \"r\") {\n        xs = _.mapValues(xs, function(x) { return -x; });\n      }\n      xss[vert + horiz] = xs;\n    });\n  });\n\n  var smallestWidth = findSmallestWidthAlignment(g, xss);\n  alignCoordinates(xss, smallestWidth);\n  return balance(xss, g.graph().align);\n}\n\nfunction sep(nodeSep, edgeSep, reverseSep) {\n  return function(g, v, w) {\n    var vLabel = g.node(v);\n    var wLabel = g.node(w);\n    var sum = 0;\n    var delta;\n\n    sum += vLabel.width / 2;\n    if (_.has(vLabel, \"labelpos\")) {\n      switch (vLabel.labelpos.toLowerCase()) {\n      case \"l\": delta = -vLabel.width / 2; break;\n      case \"r\": delta = vLabel.width / 2; break;\n      }\n    }\n    if (delta) {\n      sum += reverseSep ? delta : -delta;\n    }\n    delta = 0;\n\n    sum += (vLabel.dummy ? edgeSep : nodeSep) / 2;\n    sum += (wLabel.dummy ? edgeSep : nodeSep) / 2;\n\n    sum += wLabel.width / 2;\n    if (_.has(wLabel, \"labelpos\")) {\n      switch (wLabel.labelpos.toLowerCase()) {\n      case \"l\": delta = wLabel.width / 2; break;\n      case \"r\": delta = -wLabel.width / 2; break;\n      }\n    }\n    if (delta) {\n      sum += reverseSep ? delta : -delta;\n    }\n    delta = 0;\n\n    return sum;\n  };\n}\n\nfunction width(g, v) {\n  return g.node(v).width;\n}\n"],"names":["require$$0","require$$1","require$$2"],"mappings":";;;;;;;;;;;CAEA,IAAI,CAAC,GAAGA,aAAA,EAAoB;AAC5B,CAAA,IAAI,KAAK,GAAGC,eAAA,EAAsB,CAAC,KAAK;CACxC,IAAI,IAAI,GAAGC,WAAA,EAAkB;;AAE7B;AACA;AACA;AACA;;AAEA,CAAA,EAAc,GAAG;GACf,SAAS,EAAE,SAAS;GACpB,kBAAkB,EAAE,kBAAkB;GACtC,kBAAkB,EAAE,kBAAkB;GACtC,WAAW,EAAE,WAAW;GACxB,WAAW,EAAE,WAAW;GACxB,iBAAiB,EAAE,iBAAiB;GACpC,oBAAoB,EAAE,oBAAoB;GAC1C,gBAAgB,EAAE,gBAAgB;GAClC,0BAA0B,EAAE,0BAA0B;AACxD,GAAE,OAAO,EAAE;EACV;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAS,kBAAkB,CAAC,CAAC,EAAE,QAAQ,EAAE;GACvC,IAAI,SAAS,GAAG,EAAE;;AAEpB,GAAE,SAAS,UAAU,CAAC,SAAS,EAAE,KAAK,EAAE;KACpC;AACJ;AACA;OACM,EAAE,GAAG,CAAC;AACZ;AACA;OACM,OAAO,GAAG,CAAC;AACjB,OAAM,eAAe,GAAG,SAAS,CAAC,MAAM;AACxC,OAAM,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;;KAE1B,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,CAAC,EAAE;OAC9B,IAAI,CAAC,GAAG,yBAAyB,CAAC,CAAC,EAAE,CAAC,CAAC;AAC7C,SAAQ,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,eAAe;;AAElD,OAAM,IAAI,CAAC,IAAI,CAAC,KAAK,QAAQ,EAAE;AAC/B,SAAQ,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,QAAQ,EAAE;AACjE,WAAU,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,EAAE,SAAS,CAAC,EAAE;aAC9C,IAAI,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AAClC,eAAc,IAAI,GAAG,MAAM,CAAC,KAAK;aACrB,IAAI,CAAC,IAAI,GAAG,EAAE,IAAI,EAAE,GAAG,IAAI;AACvC,iBAAgB,EAAE,MAAM,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,KAAK,CAAC,EAAE;AAC3D,eAAc,WAAW,CAAC,SAAS,EAAE,CAAC,EAAE,QAAQ,CAAC;AACjD,aAAA;AACA,WAAA,CAAW,CAAC;AACZ,SAAA,CAAS,CAAC;AACV,SAAQ,OAAO,GAAG,CAAC,GAAG,CAAC;SACf,EAAE,GAAG,EAAE;AACf,OAAA;AACA,KAAA,CAAK,CAAC;;AAEN,KAAI,OAAO,KAAK;AAChB,GAAA;;AAEA,GAAE,CAAC,CAAC,MAAM,CAAC,QAAQ,EAAE,UAAU,CAAC;AAChC,GAAE,OAAO,SAAS;AAClB,CAAA;;AAEA,CAAA,SAAS,kBAAkB,CAAC,CAAC,EAAE,QAAQ,EAAE;GACvC,IAAI,SAAS,GAAG,EAAE;;AAEpB,GAAE,SAAS,IAAI,CAAC,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,eAAe,EAAE,eAAe,EAAE;AAC7E,KAAI,IAAI,CAAC;AACT,KAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,SAAS,CAAC,EAAE;AACvD,OAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;OACZ,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE;AAC3B,SAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE;WACvC,IAAI,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;WACrB,IAAI,KAAK,CAAC,KAAK;AACzB,gBAAe,KAAK,CAAC,KAAK,GAAG,eAAe,IAAI,KAAK,CAAC,KAAK,GAAG,eAAe,CAAC,EAAE;AAChF,aAAY,WAAW,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC;AACxC,WAAA;AACA,SAAA,CAAS,CAAC;AACV,OAAA;AACA,KAAA,CAAK,CAAC;AACN,GAAA;;;AAGA,GAAE,SAAS,UAAU,CAAC,KAAK,EAAE,KAAK,EAAE;AACpC,KAAI,IAAI,YAAY,GAAG,EAAE;AACzB,OAAM,YAAY;OACZ,QAAQ,GAAG,CAAC;;KAEd,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,cAAc,EAAE;OAC3C,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,KAAK,QAAQ,EAAE;SAChC,IAAI,YAAY,GAAG,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC;AAC5C,SAAQ,IAAI,YAAY,CAAC,MAAM,EAAE;AACjC,WAAU,YAAY,GAAG,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK;WAC5C,IAAI,CAAC,KAAK,EAAE,QAAQ,EAAE,cAAc,EAAE,YAAY,EAAE,YAAY,CAAC;WACjE,QAAQ,GAAG,cAAc;WACzB,YAAY,GAAG,YAAY;AACrC,SAAA;AACA,OAAA;AACA,OAAM,IAAI,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,CAAC,MAAM,EAAE,YAAY,EAAE,KAAK,CAAC,MAAM,CAAC;AACrE,KAAA,CAAK,CAAC;;AAEN,KAAI,OAAO,KAAK;AAChB,GAAA;;AAEA,GAAE,CAAC,CAAC,MAAM,CAAC,QAAQ,EAAE,UAAU,CAAC;AAChC,GAAE,OAAO,SAAS;AAClB,CAAA;;AAEA,CAAA,SAAS,yBAAyB,CAAC,CAAC,EAAE,CAAC,EAAE;GACvC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE;AACvB,KAAI,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE;OAC3C,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK;AAC5B,KAAA,CAAK,CAAC;AACN,GAAA;AACA,CAAA;;AAEA,CAAA,SAAS,WAAW,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,EAAE;AACtC,GAAE,IAAI,CAAC,GAAG,CAAC,EAAE;KACT,IAAI,GAAG,GAAG,CAAC;KACX,CAAC,GAAG,CAAC;KACL,CAAC,GAAG,GAAG;AACX,GAAA;;AAEA,GAAE,IAAI,UAAU,GAAG,SAAS,CAAC,CAAC,CAAC;GAC7B,IAAI,CAAC,UAAU,EAAE;AACnB,KAAI,SAAS,CAAC,CAAC,CAAC,GAAG,UAAU,GAAG,EAAE;AAClC,GAAA;AACA,GAAE,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI;AACtB,CAAA;;AAEA,CAAA,SAAS,WAAW,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,EAAE;AACtC,GAAE,IAAI,CAAC,GAAG,CAAC,EAAE;KACT,IAAI,GAAG,GAAG,CAAC;KACX,CAAC,GAAG,CAAC;KACL,CAAC,GAAG,GAAG;AACX,GAAA;GACE,OAAO,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AAC/B,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,iBAAiB,CAAC,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,UAAU,EAAE;GAC7D,IAAI,IAAI,GAAG,EAAE;KACX,KAAK,GAAG,EAAE;KACV,GAAG,GAAG,EAAE;;AAEZ;AACA;AACA;GACE,CAAC,CAAC,OAAO,CAAC,QAAQ,EAAE,SAAS,KAAK,EAAE;KAClC,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,KAAK,EAAE;AACxC,OAAM,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC;AACjB,OAAM,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC;AAClB,OAAM,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK;AACpB,KAAA,CAAK,CAAC;AACN,GAAA,CAAG,CAAC;;GAEF,CAAC,CAAC,OAAO,CAAC,QAAQ,EAAE,SAAS,KAAK,EAAE;AACtC,KAAI,IAAI,OAAO,GAAG,EAAE;KAChB,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE;AACjC,OAAM,IAAI,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC;AAC5B,OAAM,IAAI,EAAE,CAAC,MAAM,EAAE;AACrB,SAAQ,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;SACjD,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC;SAC5B,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,EAAE;AACvE,WAAU,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;AACvB,WAAU,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;AAC5B,eAAc,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC;eAChB,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE;AAC7C,aAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC;AACxB,aAAY,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;AACxC,aAAY,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC;AAC5B,WAAA;AACA,SAAA;AACA,OAAA;AACA,KAAA,CAAK,CAAC;AACN,GAAA,CAAG,CAAC;;GAEF,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE;AACrC,CAAA;;CAEA,SAAS,oBAAoB,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE;AACpE;AACA;AACA;AACA;AACA;GACE,IAAI,EAAE,GAAG,EAAE;KACT,MAAM,GAAG,eAAe,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,UAAU,CAAC;AAC3D,KAAI,UAAU,GAAG,UAAU,GAAG,YAAY,GAAG,aAAa;;AAE1D,GAAE,SAAS,OAAO,CAAC,SAAS,EAAE,aAAa,EAAE;AAC7C,KAAI,IAAI,KAAK,GAAG,MAAM,CAAC,KAAK,EAAE;AAC9B,KAAI,IAAI,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE;KACtB,IAAI,OAAO,GAAG,EAAE;KAChB,OAAO,IAAI,EAAE;AACjB,OAAM,IAAI,OAAO,CAAC,IAAI,CAAC,EAAE;SACjB,SAAS,CAAC,IAAI,CAAC;AACvB,OAAA,CAAO,MAAM;AACb,SAAQ,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI;AAC5B,SAAQ,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;SAChB,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;AACjD,OAAA;;AAEA,OAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE;AACxB,KAAA;AACA,GAAA;;AAEA;AACA,GAAE,SAAS,KAAK,CAAC,IAAI,EAAE;AACvB,KAAI,EAAE,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,SAAS,GAAG,EAAE,CAAC,EAAE;OACtD,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;KACpD,CAAK,EAAE,CAAC,CAAC;AACT,GAAA;;AAEA;AACA,GAAE,SAAS,KAAK,CAAC,IAAI,EAAE;AACvB,KAAI,IAAI,GAAG,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,SAAS,GAAG,EAAE,CAAC,EAAE;OACtD,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACpD,KAAA,CAAK,EAAE,MAAM,CAAC,iBAAiB,CAAC;;KAE5B,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;AAC3B,KAAI,IAAI,GAAG,KAAK,MAAM,CAAC,iBAAiB,IAAI,IAAI,CAAC,UAAU,KAAK,UAAU,EAAE;AAC5E,OAAM,EAAE,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC;AACxC,KAAA;AACA,GAAA;;AAEA,GAAE,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AAClD,GAAE,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;;AAEhD;GACE,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE;KAC3B,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACvB,GAAA,CAAG,CAAC;;AAEJ,GAAE,OAAO,EAAE;AACX,CAAA;;;CAGA,SAAS,eAAe,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,UAAU,EAAE;AACxD,GAAE,IAAI,UAAU,GAAG,IAAI,KAAK,EAAE;AAC9B,KAAI,UAAU,GAAG,CAAC,CAAC,KAAK,EAAE;AAC1B,KAAI,KAAK,GAAG,GAAG,CAAC,UAAU,CAAC,OAAO,EAAE,UAAU,CAAC,OAAO,EAAE,UAAU,CAAC;;GAEjE,CAAC,CAAC,OAAO,CAAC,QAAQ,EAAE,SAAS,KAAK,EAAE;AACtC,KAAI,IAAI,CAAC;KACL,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE;AACjC,OAAM,IAAI,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC;AACzB,OAAM,UAAU,CAAC,OAAO,CAAC,KAAK,CAAC;OACzB,IAAI,CAAC,EAAE;AACb,SAAQ,IAAI,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC;WACjB,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC;SACzC,UAAU,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,OAAO,IAAI,CAAC,CAAC,CAAC;AAChF,OAAA;OACM,CAAC,GAAG,CAAC;AACX,KAAA,CAAK,CAAC;AACN,GAAA,CAAG,CAAC;;AAEJ,GAAE,OAAO,UAAU;AACnB,CAAA;;AAEA;AACA;AACA;AACA,CAAA,SAAS,0BAA0B,CAAC,CAAC,EAAE,GAAG,EAAE;AAC5C,GAAE,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,UAAU,EAAE,EAAE;AAC9C,KAAI,IAAI,GAAG,GAAG,MAAM,CAAC,iBAAiB;AACtC,KAAI,IAAI,GAAG,GAAG,MAAM,CAAC,iBAAiB;;KAElC,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,UAAU,CAAC,EAAE,CAAC,EAAE;OAC1B,IAAI,SAAS,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC;;OAE/B,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,EAAE,GAAG,CAAC;OAClC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,EAAE,GAAG,CAAC;AACxC,KAAA,CAAK,CAAC;;KAEF,OAAO,GAAG,GAAG,GAAG;AACpB,GAAA,CAAG,CAAC;AACJ,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAS,gBAAgB,CAAC,GAAG,EAAE,OAAO,EAAE;GACtC,IAAI,WAAW,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC;AACrC,KAAI,UAAU,GAAG,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC;AACnC,KAAI,UAAU,GAAG,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC;;AAEnC,GAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,SAAS,IAAI,EAAE;AACvC,KAAI,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,SAAS,KAAK,EAAE;AAC1C,OAAM,IAAI,SAAS,GAAG,IAAI,GAAG,KAAK;AAClC,SAAQ,EAAE,GAAG,GAAG,CAAC,SAAS,CAAC;AAC3B,SAAQ,KAAK;AACb,OAAM,IAAI,EAAE,KAAK,OAAO,EAAE;;OAEpB,IAAI,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;OACzB,KAAK,GAAG,KAAK,KAAK,GAAG,GAAG,UAAU,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,UAAU,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC;;OAE/E,IAAI,KAAK,EAAE;SACT,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,OAAO,CAAC,GAAG,KAAK,CAAC,CAAA,CAAE,CAAC;AAC3E,OAAA;AACA,KAAA,CAAK,CAAC;AACN,GAAA,CAAG,CAAC;AACJ,CAAA;;AAEA,CAAA,SAAS,OAAO,CAAC,GAAG,EAAE,KAAK,EAAE;AAC7B,GAAE,OAAO,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,SAAS,MAAM,EAAE,CAAC,EAAE;KAC7C,IAAI,KAAK,EAAE;OACT,OAAO,GAAG,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC;AACxC,KAAA,CAAK,MAAM;AACX,OAAM,IAAI,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;AACtC,OAAM,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;AAChC,KAAA;AACA,GAAA,CAAG,CAAC;AACJ,CAAA;;CAEA,SAAS,SAAS,CAAC,CAAC,EAAE;GACpB,IAAI,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;AACzC,GAAE,IAAI,SAAS,GAAG,CAAC,CAAC,KAAK;AACzB,KAAI,kBAAkB,CAAC,CAAC,EAAE,QAAQ,CAAC;AACnC,KAAI,kBAAkB,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;;GAElC,IAAI,GAAG,GAAG,EAAE;AACd,GAAE,IAAI,gBAAgB;AACtB,GAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,SAAS,IAAI,EAAE;AACvC,KAAI,gBAAgB,GAAG,IAAI,KAAK,GAAG,GAAG,QAAQ,GAAG,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,OAAO,EAAE;AAC7E,KAAI,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,SAAS,KAAK,EAAE;AAC1C,OAAM,IAAI,KAAK,KAAK,GAAG,EAAE;SACjB,gBAAgB,GAAG,CAAC,CAAC,GAAG,CAAC,gBAAgB,EAAE,SAAS,KAAK,EAAE;WACzD,OAAO,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE;AAC1C,SAAA,CAAS,CAAC;AACV,OAAA;;AAEA,OAAM,IAAI,UAAU,GAAG,CAAC,IAAI,KAAK,GAAG,GAAG,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC,CAAC;AAC7E,OAAM,IAAI,KAAK,GAAG,iBAAiB,CAAC,CAAC,EAAE,gBAAgB,EAAE,SAAS,EAAE,UAAU,CAAC;AAC/E,OAAM,IAAI,EAAE,GAAG,oBAAoB,CAAC,CAAC,EAAE,gBAAgB;SAC/C,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,KAAK,GAAG,CAAC;AAC/C,OAAM,IAAI,KAAK,KAAK,GAAG,EAAE;AACzB,SAAQ,EAAE,GAAG,CAAC,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;AACxD,OAAA;AACA,OAAM,GAAG,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE;AAC5B,KAAA,CAAK,CAAC;AACN,GAAA,CAAG,CAAC;;GAEF,IAAI,aAAa,GAAG,0BAA0B,CAAC,CAAC,EAAE,GAAG,CAAC;AACxD,GAAE,gBAAgB,CAAC,GAAG,EAAE,aAAa,CAAC;GACpC,OAAO,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC;AACtC,CAAA;;AAEA,CAAA,SAAS,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE;AAC3C,GAAE,OAAO,SAAS,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;KACvB,IAAI,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;KACtB,IAAI,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;KACtB,IAAI,GAAG,GAAG,CAAC;AACf,KAAI,IAAI,KAAK;;AAEb,KAAI,GAAG,IAAI,MAAM,CAAC,KAAK,GAAG,CAAC;KACvB,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,EAAE;AACnC,OAAM,QAAQ,MAAM,CAAC,QAAQ,CAAC,WAAW,EAAE;AAC3C,OAAM,KAAK,GAAG,EAAE,KAAK,GAAG,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;OACrC,KAAK,GAAG,EAAE,KAAK,GAAG,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;AAC1C;AACA,KAAA;KACI,IAAI,KAAK,EAAE;AACf,OAAM,GAAG,IAAI,UAAU,GAAG,KAAK,GAAG,CAAC,KAAK;AACxC,KAAA;KACI,KAAK,GAAG,CAAC;;KAET,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,OAAO,GAAG,OAAO,IAAI,CAAC;KAC7C,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,OAAO,GAAG,OAAO,IAAI,CAAC;;AAEjD,KAAI,GAAG,IAAI,MAAM,CAAC,KAAK,GAAG,CAAC;KACvB,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,EAAE;AACnC,OAAM,QAAQ,MAAM,CAAC,QAAQ,CAAC,WAAW,EAAE;OACrC,KAAK,GAAG,EAAE,KAAK,GAAG,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;AAC1C,OAAM,KAAK,GAAG,EAAE,KAAK,GAAG,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;AAC3C;AACA,KAAA;KACI,IAAI,KAAK,EAAE;AACf,OAAM,GAAG,IAAI,UAAU,GAAG,KAAK,GAAG,CAAC,KAAK;AACxC,KAAA;KACI,KAAK,GAAG,CAAC;;AAEb,KAAI,OAAO,GAAG;GACd,CAAG;AACH,CAAA;;AAEA,CAAA,SAAS,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE;GACnB,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK;AACxB,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/position/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../../../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/position/index.js"],"sourcesContent":["\"use strict\";\n\nvar _ = require(\"../lodash\");\nvar util = require(\"../util\");\nvar positionX = require(\"./bk\").positionX;\n\nmodule.exports = position;\n\nfunction position(g) {\n  g = util.asNonCompoundGraph(g);\n\n  positionY(g);\n  _.forEach(positionX(g), function(x, v) {\n    g.node(v).x = x;\n  });\n}\n\nfunction positionY(g) {\n  var layering = util.buildLayerMatrix(g);\n  var rankSep = g.graph().ranksep;\n  var prevY = 0;\n  _.forEach(layering, function(layer) {\n    var maxHeight = _.max(_.map(layer, function(v) { return g.node(v).height; }));\n    _.forEach(layer, function(v) {\n      g.node(v).y = prevY + maxHeight / 2;\n    });\n    prevY += maxHeight + rankSep;\n  });\n}\n\n"],"names":["require$$0","require$$1","require$$2"],"mappings":";;;;;;;;;;;CAEA,IAAI,CAAC,GAAGA,aAAA,EAAoB;CAC5B,IAAI,IAAI,GAAGC,WAAA,EAAkB;AAC7B,CAAA,IAAI,SAAS,GAAGC,SAAA,EAAe,CAAC,SAAS;;AAEzC,CAAA,UAAc,GAAG,QAAQ;;CAEzB,SAAS,QAAQ,CAAC,CAAC,EAAE;AACrB,GAAE,CAAC,GAAG,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC;;GAE9B,SAAS,CAAC,CAAC,CAAC;AACd,GAAE,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE,CAAC,EAAE;KACrC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;AACnB,GAAA,CAAG,CAAC;AACJ,CAAA;;CAEA,SAAS,SAAS,CAAC,CAAC,EAAE;GACpB,IAAI,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;GACvC,IAAI,OAAO,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO;GAC/B,IAAI,KAAK,GAAG,CAAC;GACb,CAAC,CAAC,OAAO,CAAC,QAAQ,EAAE,SAAS,KAAK,EAAE;AACtC,KAAI,IAAI,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA,CAAE,CAAC,CAAC;KAC7E,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE;AACjC,OAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,SAAS,GAAG,CAAC;AACzC,KAAA,CAAK,CAAC;AACN,KAAI,KAAK,IAAI,SAAS,GAAG,OAAO;AAChC,GAAA,CAAG,CAAC;AACJ,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/rank/feasible-tree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"feasible-tree.js","sources":["../../../../../../../../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/rank/feasible-tree.js"],"sourcesContent":["\"use strict\";\n\nvar _ = require(\"../lodash\");\nvar Graph = require(\"../graphlib\").Graph;\nvar slack = require(\"./util\").slack;\n\nmodule.exports = feasibleTree;\n\n/*\n * Constructs a spanning tree with tight edges and adjusted the input node's\n * ranks to achieve this. A tight edge is one that is has a length that matches\n * its \"minlen\" attribute.\n *\n * The basic structure for this function is derived from Gansner, et al., \"A\n * Technique for Drawing Directed Graphs.\"\n *\n * Pre-conditions:\n *\n *    1. Graph must be a DAG.\n *    2. Graph must be connected.\n *    3. Graph must have at least one node.\n *    5. Graph nodes must have been previously assigned a \"rank\" property that\n *       respects the \"minlen\" property of incident edges.\n *    6. Graph edges must have a \"minlen\" property.\n *\n * Post-conditions:\n *\n *    - Graph nodes will have their rank adjusted to ensure that all edges are\n *      tight.\n *\n * Returns a tree (undirected graph) that is constructed using only \"tight\"\n * edges.\n */\nfunction feasibleTree(g) {\n  var t = new Graph({ directed: false });\n\n  // Choose arbitrary node from which to start our tree\n  var start = g.nodes()[0];\n  var size = g.nodeCount();\n  t.setNode(start, {});\n\n  var edge, delta;\n  while (tightTree(t, g) < size) {\n    edge = findMinSlackEdge(t, g);\n    delta = t.hasNode(edge.v) ? slack(g, edge) : -slack(g, edge);\n    shiftRanks(t, g, delta);\n  }\n\n  return t;\n}\n\n/*\n * Finds a maximal tree of tight edges and returns the number of nodes in the\n * tree.\n */\nfunction tightTree(t, g) {\n  function dfs(v) {\n    _.forEach(g.nodeEdges(v), function(e) {\n      var edgeV = e.v,\n        w = (v === edgeV) ? e.w : edgeV;\n      if (!t.hasNode(w) && !slack(g, e)) {\n        t.setNode(w, {});\n        t.setEdge(v, w, {});\n        dfs(w);\n      }\n    });\n  }\n\n  _.forEach(t.nodes(), dfs);\n  return t.nodeCount();\n}\n\n/*\n * Finds the edge with the smallest slack that is incident on tree and returns\n * it.\n */\nfunction findMinSlackEdge(t, g) {\n  return _.minBy(g.edges(), function(e) {\n    if (t.hasNode(e.v) !== t.hasNode(e.w)) {\n      return slack(g, e);\n    }\n  });\n}\n\nfunction shiftRanks(t, g, delta) {\n  _.forEach(t.nodes(), function(v) {\n    g.node(v).rank += delta;\n  });\n}\n"],"names":["require$$0","require$$1","require$$2"],"mappings":";;;;;;;;;;;CAEA,IAAI,CAAC,GAAGA,aAAA,EAAoB;AAC5B,CAAA,IAAI,KAAK,GAAGC,eAAA,EAAsB,CAAC,KAAK;AACxC,CAAA,IAAI,KAAK,GAAGC,WAAA,EAAiB,CAAC,KAAK;;AAEnC,CAAA,cAAc,GAAG,YAAY;;AAE7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,YAAY,CAAC,CAAC,EAAE;GACvB,IAAI,CAAC,GAAG,IAAI,KAAK,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;;AAExC;GACE,IAAI,KAAK,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;AAC1B,GAAE,IAAI,IAAI,GAAG,CAAC,CAAC,SAAS,EAAE;AAC1B,GAAE,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC;;GAEpB,IAAI,IAAI,EAAE,KAAK;GACf,OAAO,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,EAAE;AACjC,KAAI,IAAI,GAAG,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC;KAC7B,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC;AAChE,KAAI,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC;AAC3B,GAAA;;AAEA,GAAE,OAAO,CAAC;AACV,CAAA;;AAEA;AACA;AACA;AACA;AACA,CAAA,SAAS,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE;AACzB,GAAE,SAAS,GAAG,CAAC,CAAC,EAAE;AAClB,KAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE;AAC1C,OAAM,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;SACb,CAAC,GAAG,CAAC,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK;AACvC,OAAM,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;AACzC,SAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC;SAChB,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;SACnB,GAAG,CAAC,CAAC,CAAC;AACd,OAAA;AACA,KAAA,CAAK,CAAC;AACN,GAAA;;GAEE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,GAAG,CAAC;AAC3B,GAAE,OAAO,CAAC,CAAC,SAAS,EAAE;AACtB,CAAA;;AAEA;AACA;AACA;AACA;AACA,CAAA,SAAS,gBAAgB,CAAC,CAAC,EAAE,CAAC,EAAE;AAChC,GAAE,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;AACxC,KAAI,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;AAC3C,OAAM,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;AACxB,KAAA;AACA,GAAA,CAAG,CAAC;AACJ,CAAA;;AAEA,CAAA,SAAS,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE;GAC/B,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KAC/B,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,KAAK;AAC3B,GAAA,CAAG,CAAC;AACJ,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/rank/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../../../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/rank/index.js"],"sourcesContent":["\"use strict\";\n\nvar rankUtil = require(\"./util\");\nvar longestPath = rankUtil.longestPath;\nvar feasibleTree = require(\"./feasible-tree\");\nvar networkSimplex = require(\"./network-simplex\");\n\nmodule.exports = rank;\n\n/*\n * Assigns a rank to each node in the input graph that respects the \"minlen\"\n * constraint specified on edges between nodes.\n *\n * This basic structure is derived from Gansner, et al., \"A Technique for\n * Drawing Directed Graphs.\"\n *\n * Pre-conditions:\n *\n *    1. Graph must be a connected DAG\n *    2. Graph nodes must be objects\n *    3. Graph edges must have \"weight\" and \"minlen\" attributes\n *\n * Post-conditions:\n *\n *    1. Graph nodes will have a \"rank\" attribute based on the results of the\n *       algorithm. Ranks can start at any index (including negative), we'll\n *       fix them up later.\n */\nfunction rank(g) {\n  switch(g.graph().ranker) {\n  case \"network-simplex\": networkSimplexRanker(g); break;\n  case \"tight-tree\": tightTreeRanker(g); break;\n  case \"longest-path\": longestPathRanker(g); break;\n  default: networkSimplexRanker(g);\n  }\n}\n\n// A fast and simple ranker, but results are far from optimal.\nvar longestPathRanker = longestPath;\n\nfunction tightTreeRanker(g) {\n  longestPath(g);\n  feasibleTree(g);\n}\n\nfunction networkSimplexRanker(g) {\n  networkSimplex(g);\n}\n"],"names":["require$$0","require$$1","require$$2"],"mappings":";;;;;;;;;;;CAEA,IAAI,QAAQ,GAAGA,WAAA,EAAiB;AAChC,CAAA,IAAI,WAAW,GAAG,QAAQ,CAAC,WAAW;CACtC,IAAI,YAAY,GAAGC,mBAAA,EAA0B;CAC7C,IAAI,cAAc,GAAGC,qBAAA,EAA4B;;AAEjD,CAAA,MAAc,GAAG,IAAI;;AAErB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,IAAI,CAAC,CAAC,EAAE;AACjB,GAAE,OAAO,CAAC,CAAC,KAAK,EAAE,CAAC,MAAM;GACvB,KAAK,iBAAiB,EAAE,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC;GACjD,KAAK,YAAY,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;GACvC,KAAK,cAAc,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;AAC7C,GAAE,SAAS,oBAAoB,CAAC,CAAC,CAAC;AAClC;AACA,CAAA;;AAEA;CACA,IAAI,iBAAiB,GAAG,WAAW;;CAEnC,SAAS,eAAe,CAAC,CAAC,EAAE;GAC1B,WAAW,CAAC,CAAC,CAAC;GACd,YAAY,CAAC,CAAC,CAAC;AACjB,CAAA;;CAEA,SAAS,oBAAoB,CAAC,CAAC,EAAE;GAC/B,cAAc,CAAC,CAAC,CAAC;AACnB,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/rank/network-simplex.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"network-simplex.js","sources":["../../../../../../../../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/rank/network-simplex.js"],"sourcesContent":["\"use strict\";\n\nvar _ = require(\"../lodash\");\nvar feasibleTree = require(\"./feasible-tree\");\nvar slack = require(\"./util\").slack;\nvar initRank = require(\"./util\").longestPath;\nvar preorder = require(\"../graphlib\").alg.preorder;\nvar postorder = require(\"../graphlib\").alg.postorder;\nvar simplify = require(\"../util\").simplify;\n\nmodule.exports = networkSimplex;\n\n// Expose some internals for testing purposes\nnetworkSimplex.initLowLimValues = initLowLimValues;\nnetworkSimplex.initCutValues = initCutValues;\nnetworkSimplex.calcCutValue = calcCutValue;\nnetworkSimplex.leaveEdge = leaveEdge;\nnetworkSimplex.enterEdge = enterEdge;\nnetworkSimplex.exchangeEdges = exchangeEdges;\n\n/*\n * The network simplex algorithm assigns ranks to each node in the input graph\n * and iteratively improves the ranking to reduce the length of edges.\n *\n * Preconditions:\n *\n *    1. The input graph must be a DAG.\n *    2. All nodes in the graph must have an object value.\n *    3. All edges in the graph must have \"minlen\" and \"weight\" attributes.\n *\n * Postconditions:\n *\n *    1. All nodes in the graph will have an assigned \"rank\" attribute that has\n *       been optimized by the network simplex algorithm. Ranks start at 0.\n *\n *\n * A rough sketch of the algorithm is as follows:\n *\n *    1. Assign initial ranks to each node. We use the longest path algorithm,\n *       which assigns ranks to the lowest position possible. In general this\n *       leads to very wide bottom ranks and unnecessarily long edges.\n *    2. Construct a feasible tight tree. A tight tree is one such that all\n *       edges in the tree have no slack (difference between length of edge\n *       and minlen for the edge). This by itself greatly improves the assigned\n *       rankings by shorting edges.\n *    3. Iteratively find edges that have negative cut values. Generally a\n *       negative cut value indicates that the edge could be removed and a new\n *       tree edge could be added to produce a more compact graph.\n *\n * Much of the algorithms here are derived from Gansner, et al., \"A Technique\n * for Drawing Directed Graphs.\" The structure of the file roughly follows the\n * structure of the overall algorithm.\n */\nfunction networkSimplex(g) {\n  g = simplify(g);\n  initRank(g);\n  var t = feasibleTree(g);\n  initLowLimValues(t);\n  initCutValues(t, g);\n\n  var e, f;\n  while ((e = leaveEdge(t))) {\n    f = enterEdge(t, g, e);\n    exchangeEdges(t, g, e, f);\n  }\n}\n\n/*\n * Initializes cut values for all edges in the tree.\n */\nfunction initCutValues(t, g) {\n  var vs = postorder(t, t.nodes());\n  vs = vs.slice(0, vs.length - 1);\n  _.forEach(vs, function(v) {\n    assignCutValue(t, g, v);\n  });\n}\n\nfunction assignCutValue(t, g, child) {\n  var childLab = t.node(child);\n  var parent = childLab.parent;\n  t.edge(child, parent).cutvalue = calcCutValue(t, g, child);\n}\n\n/*\n * Given the tight tree, its graph, and a child in the graph calculate and\n * return the cut value for the edge between the child and its parent.\n */\nfunction calcCutValue(t, g, child) {\n  var childLab = t.node(child);\n  var parent = childLab.parent;\n  // True if the child is on the tail end of the edge in the directed graph\n  var childIsTail = true;\n  // The graph's view of the tree edge we're inspecting\n  var graphEdge = g.edge(child, parent);\n  // The accumulated cut value for the edge between this node and its parent\n  var cutValue = 0;\n\n  if (!graphEdge) {\n    childIsTail = false;\n    graphEdge = g.edge(parent, child);\n  }\n\n  cutValue = graphEdge.weight;\n\n  _.forEach(g.nodeEdges(child), function(e) {\n    var isOutEdge = e.v === child,\n      other = isOutEdge ? e.w : e.v;\n\n    if (other !== parent) {\n      var pointsToHead = isOutEdge === childIsTail,\n        otherWeight = g.edge(e).weight;\n\n      cutValue += pointsToHead ? otherWeight : -otherWeight;\n      if (isTreeEdge(t, child, other)) {\n        var otherCutValue = t.edge(child, other).cutvalue;\n        cutValue += pointsToHead ? -otherCutValue : otherCutValue;\n      }\n    }\n  });\n\n  return cutValue;\n}\n\nfunction initLowLimValues(tree, root) {\n  if (arguments.length < 2) {\n    root = tree.nodes()[0];\n  }\n  dfsAssignLowLim(tree, {}, 1, root);\n}\n\nfunction dfsAssignLowLim(tree, visited, nextLim, v, parent) {\n  var low = nextLim;\n  var label = tree.node(v);\n\n  visited[v] = true;\n  _.forEach(tree.neighbors(v), function(w) {\n    if (!_.has(visited, w)) {\n      nextLim = dfsAssignLowLim(tree, visited, nextLim, w, v);\n    }\n  });\n\n  label.low = low;\n  label.lim = nextLim++;\n  if (parent) {\n    label.parent = parent;\n  } else {\n    // TODO should be able to remove this when we incrementally update low lim\n    delete label.parent;\n  }\n\n  return nextLim;\n}\n\nfunction leaveEdge(tree) {\n  return _.find(tree.edges(), function(e) {\n    return tree.edge(e).cutvalue < 0;\n  });\n}\n\nfunction enterEdge(t, g, edge) {\n  var v = edge.v;\n  var w = edge.w;\n\n  // For the rest of this function we assume that v is the tail and w is the\n  // head, so if we don't have this edge in the graph we should flip it to\n  // match the correct orientation.\n  if (!g.hasEdge(v, w)) {\n    v = edge.w;\n    w = edge.v;\n  }\n\n  var vLabel = t.node(v);\n  var wLabel = t.node(w);\n  var tailLabel = vLabel;\n  var flip = false;\n\n  // If the root is in the tail of the edge then we need to flip the logic that\n  // checks for the head and tail nodes in the candidates function below.\n  if (vLabel.lim > wLabel.lim) {\n    tailLabel = wLabel;\n    flip = true;\n  }\n\n  var candidates = _.filter(g.edges(), function(edge) {\n    return flip === isDescendant(t, t.node(edge.v), tailLabel) &&\n           flip !== isDescendant(t, t.node(edge.w), tailLabel);\n  });\n\n  return _.minBy(candidates, function(edge) { return slack(g, edge); });\n}\n\nfunction exchangeEdges(t, g, e, f) {\n  var v = e.v;\n  var w = e.w;\n  t.removeEdge(v, w);\n  t.setEdge(f.v, f.w, {});\n  initLowLimValues(t);\n  initCutValues(t, g);\n  updateRanks(t, g);\n}\n\nfunction updateRanks(t, g) {\n  var root = _.find(t.nodes(), function(v) { return !g.node(v).parent; });\n  var vs = preorder(t, root);\n  vs = vs.slice(1);\n  _.forEach(vs, function(v) {\n    var parent = t.node(v).parent,\n      edge = g.edge(v, parent),\n      flipped = false;\n\n    if (!edge) {\n      edge = g.edge(parent, v);\n      flipped = true;\n    }\n\n    g.node(v).rank = g.node(parent).rank + (flipped ? edge.minlen : -edge.minlen);\n  });\n}\n\n/*\n * Returns true if the edge is in the tree.\n */\nfunction isTreeEdge(tree, u, v) {\n  return tree.hasEdge(u, v);\n}\n\n/*\n * Returns true if the specified node is descendant of the root node per the\n * assigned low and lim attributes in the tree.\n */\nfunction isDescendant(tree, vLabel, rootLabel) {\n  return rootLabel.low <= vLabel.lim && vLabel.lim <= rootLabel.lim;\n}\n"],"names":["require$$0","require$$1","require$$2","require$$3","require$$4"],"mappings":";;;;;;;;;;;;;CAEA,IAAI,CAAC,GAAGA,aAAA,EAAoB;CAC5B,IAAI,YAAY,GAAGC,mBAAA,EAA0B;AAC7C,CAAA,IAAI,KAAK,GAAGC,WAAA,EAAiB,CAAC,KAAK;AACnC,CAAA,IAAI,QAAQ,GAAGA,WAAA,EAAiB,CAAC,WAAW;AAC5C,CAAA,IAAI,QAAQ,GAAGC,eAAA,EAAsB,CAAC,GAAG,CAAC,QAAQ;AAClD,CAAA,IAAI,SAAS,GAAGA,eAAA,EAAsB,CAAC,GAAG,CAAC,SAAS;AACpD,CAAA,IAAI,QAAQ,GAAGC,aAAA,EAAkB,CAAC,QAAQ;;AAE1C,CAAA,gBAAc,GAAG,cAAc;;AAE/B;CACA,cAAc,CAAC,gBAAgB,GAAG,gBAAgB;CAClD,cAAc,CAAC,aAAa,GAAG,aAAa;CAC5C,cAAc,CAAC,YAAY,GAAG,YAAY;CAC1C,cAAc,CAAC,SAAS,GAAG,SAAS;CACpC,cAAc,CAAC,SAAS,GAAG,SAAS;CACpC,cAAc,CAAC,aAAa,GAAG,aAAa;;AAE5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,cAAc,CAAC,CAAC,EAAE;AAC3B,GAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;GACf,QAAQ,CAAC,CAAC,CAAC;AACb,GAAE,IAAI,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC;GACvB,gBAAgB,CAAC,CAAC,CAAC;AACrB,GAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC;;GAEnB,IAAI,CAAC,EAAE,CAAC;AACV,GAAE,QAAQ,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG;KACzB,CAAC,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;KACtB,aAAa,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;AAC7B,GAAA;AACA,CAAA;;AAEA;AACA;AACA;AACA,CAAA,SAAS,aAAa,CAAC,CAAC,EAAE,CAAC,EAAE;GAC3B,IAAI,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC;AAClC,GAAE,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC;GAC/B,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,SAAS,CAAC,EAAE;AAC5B,KAAI,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;AAC3B,GAAA,CAAG,CAAC;AACJ,CAAA;;AAEA,CAAA,SAAS,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE;GACnC,IAAI,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;AAC9B,GAAE,IAAI,MAAM,GAAG,QAAQ,CAAC,MAAM;AAC9B,GAAE,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,QAAQ,GAAG,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC;AAC5D,CAAA;;AAEA;AACA;AACA;AACA;AACA,CAAA,SAAS,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE;GACjC,IAAI,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;AAC9B,GAAE,IAAI,MAAM,GAAG,QAAQ,CAAC,MAAM;AAC9B;GACE,IAAI,WAAW,GAAG,IAAI;AACxB;GACE,IAAI,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC;AACvC;GACE,IAAI,QAAQ,GAAG,CAAC;;GAEhB,IAAI,CAAC,SAAS,EAAE;KACd,WAAW,GAAG,KAAK;KACnB,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC;AACrC,GAAA;;AAEA,GAAE,QAAQ,GAAG,SAAS,CAAC,MAAM;;AAE7B,GAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,SAAS,CAAC,EAAE;AAC5C,KAAI,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC,KAAK,KAAK;OAC3B,KAAK,GAAG,SAAS,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;;AAEnC,KAAI,IAAI,KAAK,KAAK,MAAM,EAAE;AAC1B,OAAM,IAAI,YAAY,GAAG,SAAS,KAAK,WAAW;SAC1C,WAAW,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM;;AAEtC,OAAM,QAAQ,IAAI,YAAY,GAAG,WAAW,GAAG,CAAC,WAAW;OACrD,IAAI,UAAU,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,EAAE;AACvC,SAAQ,IAAI,aAAa,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,QAAQ;AACzD,SAAQ,QAAQ,IAAI,YAAY,GAAG,CAAC,aAAa,GAAG,aAAa;AACjE,OAAA;AACA,KAAA;AACA,GAAA,CAAG,CAAC;;AAEJ,GAAE,OAAO,QAAQ;AACjB,CAAA;;AAEA,CAAA,SAAS,gBAAgB,CAAC,IAAI,EAAE,IAAI,EAAE;AACtC,GAAE,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE;KACxB,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;AAC1B,GAAA;GACE,eAAe,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC;AACpC,CAAA;;CAEA,SAAS,eAAe,CAAC,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,MAAM,EAAE;GAC1D,IAAI,GAAG,GAAG,OAAO;GACjB,IAAI,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;;AAE1B,GAAE,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI;AACnB,GAAE,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE;KACvC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE;AAC5B,OAAM,OAAO,GAAG,eAAe,CAAC,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC;AAC7D,KAAA;AACA,GAAA,CAAG,CAAC;;AAEJ,GAAE,KAAK,CAAC,GAAG,GAAG,GAAG;AACjB,GAAE,KAAK,CAAC,GAAG,GAAG,OAAO,EAAE;GACrB,IAAI,MAAM,EAAE;AACd,KAAI,KAAK,CAAC,MAAM,GAAG,MAAM;AACzB,GAAA,CAAG,MAAM;AACT;KACI,OAAO,KAAK,CAAC,MAAM;AACvB,GAAA;;AAEA,GAAE,OAAO,OAAO;AAChB,CAAA;;CAEA,SAAS,SAAS,CAAC,IAAI,EAAE;AACzB,GAAE,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KACtC,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC;AACpC,GAAA,CAAG,CAAC;AACJ,CAAA;;AAEA,CAAA,SAAS,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE;AAC/B,GAAE,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;AAChB,GAAE,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;;AAEhB;AACA;AACA;GACE,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;AACxB,KAAI,CAAC,GAAG,IAAI,CAAC,CAAC;AACd,KAAI,CAAC,GAAG,IAAI,CAAC,CAAC;AACd,GAAA;;GAEE,IAAI,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;GACtB,IAAI,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;GACtB,IAAI,SAAS,GAAG,MAAM;GACtB,IAAI,IAAI,GAAG,KAAK;;AAElB;AACA;GACE,IAAI,MAAM,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,EAAE;KAC3B,SAAS,GAAG,MAAM;KAClB,IAAI,GAAG,IAAI;AACf,GAAA;;AAEA,GAAE,IAAI,UAAU,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,IAAI,EAAE;AACtD,KAAI,OAAO,IAAI,KAAK,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC;AAC9D,YAAW,IAAI,KAAK,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC;AAC9D,GAAA,CAAG,CAAC;;GAEF,OAAO,CAAC,CAAC,KAAK,CAAC,UAAU,EAAE,SAAS,IAAI,EAAE,EAAE,OAAO,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC;AACvE,CAAA;;CAEA,SAAS,aAAa,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;AACnC,GAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;AACb,GAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;AACb,GAAE,CAAC,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC;AACpB,GAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;GACvB,gBAAgB,CAAC,CAAC,CAAC;AACrB,GAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC;AACrB,GAAE,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC;AACnB,CAAA;;AAEA,CAAA,SAAS,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE;AAC3B,GAAE,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA,CAAE,CAAC;GACvE,IAAI,EAAE,GAAG,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC;AAC5B,GAAE,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;GAChB,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,SAAS,CAAC,EAAE;KACxB,IAAI,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM;OAC3B,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC;OACxB,OAAO,GAAG,KAAK;;KAEjB,IAAI,CAAC,IAAI,EAAE;OACT,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;OACxB,OAAO,GAAG,IAAI;AACpB,KAAA;;AAEA,KAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,IAAI,OAAO,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC;AACjF,GAAA,CAAG,CAAC;AACJ,CAAA;;AAEA;AACA;AACA;AACA,CAAA,SAAS,UAAU,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE;GAC9B,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC;AAC3B,CAAA;;AAEA;AACA;AACA;AACA;AACA,CAAA,SAAS,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE;AAC/C,GAAE,OAAO,SAAS,CAAC,GAAG,IAAI,MAAM,CAAC,GAAG,IAAI,MAAM,CAAC,GAAG,IAAI,SAAS,CAAC,GAAG;AACnE,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/rank/util.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"util.js","sources":["../../../../../../../../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/rank/util.js"],"sourcesContent":["\"use strict\";\n\nvar _ = require(\"../lodash\");\n\nmodule.exports = {\n  longestPath: longestPath,\n  slack: slack\n};\n\n/*\n * Initializes ranks for the input graph using the longest path algorithm. This\n * algorithm scales well and is fast in practice, it yields rather poor\n * solutions. Nodes are pushed to the lowest layer possible, leaving the bottom\n * ranks wide and leaving edges longer than necessary. However, due to its\n * speed, this algorithm is good for getting an initial ranking that can be fed\n * into other algorithms.\n *\n * This algorithm does not normalize layers because it will be used by other\n * algorithms in most cases. If using this algorithm directly, be sure to\n * run normalize at the end.\n *\n * Pre-conditions:\n *\n *    1. Input graph is a DAG.\n *    2. Input graph node labels can be assigned properties.\n *\n * Post-conditions:\n *\n *    1. Each node will be assign an (unnormalized) \"rank\" property.\n */\nfunction longestPath(g) {\n  var visited = {};\n\n  function dfs(v) {\n    var label = g.node(v);\n    if (_.has(visited, v)) {\n      return label.rank;\n    }\n    visited[v] = true;\n\n    var rank = _.min(_.map(g.outEdges(v), function(e) {\n      return dfs(e.w) - g.edge(e).minlen;\n    }));\n\n    if (rank === Number.POSITIVE_INFINITY || // return value of _.map([]) for Lodash 3\n        rank === undefined || // return value of _.map([]) for Lodash 4\n        rank === null) { // return value of _.map([null])\n      rank = 0;\n    }\n\n    return (label.rank = rank);\n  }\n\n  _.forEach(g.sources(), dfs);\n}\n\n/*\n * Returns the amount of slack for the given edge. The slack is defined as the\n * difference between the length of the edge and its minimum length.\n */\nfunction slack(g, e) {\n  return g.node(e.w).rank - g.node(e.v).rank - g.edge(e).minlen;\n}\n"],"names":["require$$0"],"mappings":";;;;;;;;;CAEA,IAAI,CAAC,GAAGA,aAAA,EAAoB;;AAE5B,CAAA,IAAc,GAAG;GACf,WAAW,EAAE,WAAW;AAC1B,GAAE,KAAK,EAAE;EACR;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,WAAW,CAAC,CAAC,EAAE;GACtB,IAAI,OAAO,GAAG,EAAE;;AAElB,GAAE,SAAS,GAAG,CAAC,CAAC,EAAE;KACd,IAAI,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;KACrB,IAAI,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE;OACrB,OAAO,KAAK,CAAC,IAAI;AACvB,KAAA;AACA,KAAI,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI;;KAEjB,IAAI,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE;AACtD,OAAM,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM;AACxC,KAAA,CAAK,CAAC,CAAC;;AAEP,KAAI,IAAI,IAAI,KAAK,MAAM,CAAC,iBAAiB;SACjC,IAAI,KAAK,SAAS;SAClB,IAAI,KAAK,IAAI,EAAE;OACjB,IAAI,GAAG,CAAC;AACd,KAAA;;AAEA,KAAI,QAAQ,KAAK,CAAC,IAAI,GAAG,IAAI;AAC7B,GAAA;;GAEE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE,GAAG,CAAC;AAC7B,CAAA;;AAEA;AACA;AACA;AACA;AACA,CAAA,SAAS,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE;AACrB,GAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM;AAC/D,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/util.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"util.js","sources":["../../../../../../../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/util.js"],"sourcesContent":["/* eslint \"no-console\": off */\n\n\"use strict\";\n\nvar _ = require(\"./lodash\");\nvar Graph = require(\"./graphlib\").Graph;\n\nmodule.exports = {\n  addDummyNode: addDummyNode,\n  simplify: simplify,\n  asNonCompoundGraph: asNonCompoundGraph,\n  successorWeights: successorWeights,\n  predecessorWeights: predecessorWeights,\n  intersectRect: intersectRect,\n  buildLayerMatrix: buildLayerMatrix,\n  normalizeRanks: normalizeRanks,\n  removeEmptyRanks: removeEmptyRanks,\n  addBorderNode: addBorderNode,\n  maxRank: maxRank,\n  partition: partition,\n  time: time,\n  notime: notime\n};\n\n/*\n * Adds a dummy node to the graph and return v.\n */\nfunction addDummyNode(g, type, attrs, name) {\n  var v;\n  do {\n    v = _.uniqueId(name);\n  } while (g.hasNode(v));\n\n  attrs.dummy = type;\n  g.setNode(v, attrs);\n  return v;\n}\n\n/*\n * Returns a new graph with only simple edges. Handles aggregation of data\n * associated with multi-edges.\n */\nfunction simplify(g) {\n  var simplified = new Graph().setGraph(g.graph());\n  _.forEach(g.nodes(), function(v) { simplified.setNode(v, g.node(v)); });\n  _.forEach(g.edges(), function(e) {\n    var simpleLabel = simplified.edge(e.v, e.w) || { weight: 0, minlen: 1 };\n    var label = g.edge(e);\n    simplified.setEdge(e.v, e.w, {\n      weight: simpleLabel.weight + label.weight,\n      minlen: Math.max(simpleLabel.minlen, label.minlen)\n    });\n  });\n  return simplified;\n}\n\nfunction asNonCompoundGraph(g) {\n  var simplified = new Graph({ multigraph: g.isMultigraph() }).setGraph(g.graph());\n  _.forEach(g.nodes(), function(v) {\n    if (!g.children(v).length) {\n      simplified.setNode(v, g.node(v));\n    }\n  });\n  _.forEach(g.edges(), function(e) {\n    simplified.setEdge(e, g.edge(e));\n  });\n  return simplified;\n}\n\nfunction successorWeights(g) {\n  var weightMap = _.map(g.nodes(), function(v) {\n    var sucs = {};\n    _.forEach(g.outEdges(v), function(e) {\n      sucs[e.w] = (sucs[e.w] || 0) + g.edge(e).weight;\n    });\n    return sucs;\n  });\n  return _.zipObject(g.nodes(), weightMap);\n}\n\nfunction predecessorWeights(g) {\n  var weightMap = _.map(g.nodes(), function(v) {\n    var preds = {};\n    _.forEach(g.inEdges(v), function(e) {\n      preds[e.v] = (preds[e.v] || 0) + g.edge(e).weight;\n    });\n    return preds;\n  });\n  return _.zipObject(g.nodes(), weightMap);\n}\n\n/*\n * Finds where a line starting at point ({x, y}) would intersect a rectangle\n * ({x, y, width, height}) if it were pointing at the rectangle's center.\n */\nfunction intersectRect(rect, point) {\n  var x = rect.x;\n  var y = rect.y;\n\n  // Rectangle intersection algorithm from:\n  // http://math.stackexchange.com/questions/108113/find-edge-between-two-boxes\n  var dx = point.x - x;\n  var dy = point.y - y;\n  var w = rect.width / 2;\n  var h = rect.height / 2;\n\n  if (!dx && !dy) {\n    throw new Error(\"Not possible to find intersection inside of the rectangle\");\n  }\n\n  var sx, sy;\n  if (Math.abs(dy) * w > Math.abs(dx) * h) {\n    // Intersection is top or bottom of rect.\n    if (dy < 0) {\n      h = -h;\n    }\n    sx = h * dx / dy;\n    sy = h;\n  } else {\n    // Intersection is left or right of rect.\n    if (dx < 0) {\n      w = -w;\n    }\n    sx = w;\n    sy = w * dy / dx;\n  }\n\n  return { x: x + sx, y: y + sy };\n}\n\n/*\n * Given a DAG with each node assigned \"rank\" and \"order\" properties, this\n * function will produce a matrix with the ids of each node.\n */\nfunction buildLayerMatrix(g) {\n  var layering = _.map(_.range(maxRank(g) + 1), function() { return []; });\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    var rank = node.rank;\n    if (!_.isUndefined(rank)) {\n      layering[rank][node.order] = v;\n    }\n  });\n  return layering;\n}\n\n/*\n * Adjusts the ranks for all nodes in the graph such that all nodes v have\n * rank(v) >= 0 and at least one node w has rank(w) = 0.\n */\nfunction normalizeRanks(g) {\n  var min = _.min(_.map(g.nodes(), function(v) { return g.node(v).rank; }));\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    if (_.has(node, \"rank\")) {\n      node.rank -= min;\n    }\n  });\n}\n\nfunction removeEmptyRanks(g) {\n  // Ranks may not start at 0, so we need to offset them\n  var offset = _.min(_.map(g.nodes(), function(v) { return g.node(v).rank; }));\n\n  var layers = [];\n  _.forEach(g.nodes(), function(v) {\n    var rank = g.node(v).rank - offset;\n    if (!layers[rank]) {\n      layers[rank] = [];\n    }\n    layers[rank].push(v);\n  });\n\n  var delta = 0;\n  var nodeRankFactor = g.graph().nodeRankFactor;\n  _.forEach(layers, function(vs, i) {\n    if (_.isUndefined(vs) && i % nodeRankFactor !== 0) {\n      --delta;\n    } else if (delta) {\n      _.forEach(vs, function(v) { g.node(v).rank += delta; });\n    }\n  });\n}\n\nfunction addBorderNode(g, prefix, rank, order) {\n  var node = {\n    width: 0,\n    height: 0\n  };\n  if (arguments.length >= 4) {\n    node.rank = rank;\n    node.order = order;\n  }\n  return addDummyNode(g, \"border\", node, prefix);\n}\n\nfunction maxRank(g) {\n  return _.max(_.map(g.nodes(), function(v) {\n    var rank = g.node(v).rank;\n    if (!_.isUndefined(rank)) {\n      return rank;\n    }\n  }));\n}\n\n/*\n * Partition a collection into two groups: `lhs` and `rhs`. If the supplied\n * function returns true for an entry it goes into `lhs`. Otherwise it goes\n * into `rhs.\n */\nfunction partition(collection, fn) {\n  var result = { lhs: [], rhs: [] };\n  _.forEach(collection, function(value) {\n    if (fn(value)) {\n      result.lhs.push(value);\n    } else {\n      result.rhs.push(value);\n    }\n  });\n  return result;\n}\n\n/*\n * Returns a new function that wraps `fn` with a timer. The wrapper logs the\n * time it takes to execute the function.\n */\nfunction time(name, fn) {\n  var start = _.now();\n  try {\n    return fn();\n  } finally {\n    console.log(name + \" time: \" + (_.now() - start) + \"ms\");\n  }\n}\n\nfunction notime(name, fn) {\n  return fn();\n}\n"],"names":["require$$0","require$$1","util"],"mappings":";;;;;;;;;;;;CAIA,IAAI,CAAC,GAAGA,aAAA,EAAmB;AAC3B,CAAA,IAAI,KAAK,GAAGC,eAAA,EAAqB,CAAC,KAAK;;AAEvC,CAAAC,MAAc,GAAG;GACf,YAAY,EAAE,YAAY;GAC1B,QAAQ,EAAE,QAAQ;GAClB,kBAAkB,EAAE,kBAAkB;GACtC,gBAAgB,EAAE,gBAAgB;GAClC,kBAAkB,EAAE,kBAAkB;GACtC,aAAa,EAAE,aAAa;GAC5B,gBAAgB,EAAE,gBAAgB;GAClC,cAAc,EAAE,cAAc;GAC9B,gBAAgB,EAAE,gBAAgB;GAClC,aAAa,EAAE,aAAa;GAC5B,OAAO,EAAE,OAAO;GAChB,SAAS,EAAE,SAAS;GACpB,IAAI,EAAE,IAAI;AACZ,GAAE,MAAM,EAAE;EACT;;AAED;AACA;AACA;CACA,SAAS,YAAY,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE;AAC5C,GAAE,IAAI,CAAC;AACP,GAAE,GAAG;AACL,KAAI,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC;AACxB,GAAA,CAAG,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;;AAEvB,GAAE,KAAK,CAAC,KAAK,GAAG,IAAI;AACpB,GAAE,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC;AACrB,GAAE,OAAO,CAAC;AACV,CAAA;;AAEA;AACA;AACA;AACA;CACA,SAAS,QAAQ,CAAC,CAAC,EAAE;AACrB,GAAE,IAAI,UAAU,GAAG,IAAI,KAAK,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;AAClD,GAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA,CAAE,CAAC;GACvE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KAC/B,IAAI,WAAW,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE;KACvE,IAAI,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;KACrB,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE;OAC3B,MAAM,EAAE,WAAW,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM;AAC/C,OAAM,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM;AACvD,MAAK,CAAC;AACN,GAAA,CAAG,CAAC;AACJ,GAAE,OAAO,UAAU;AACnB,CAAA;;CAEA,SAAS,kBAAkB,CAAC,CAAC,EAAE;GAC7B,IAAI,UAAU,GAAG,IAAI,KAAK,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;GAChF,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KAC/B,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE;AAC/B,OAAM,UAAU,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACtC,KAAA;AACA,GAAA,CAAG,CAAC;GACF,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;AACnC,KAAI,UAAU,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACpC,GAAA,CAAG,CAAC;AACJ,GAAE,OAAO,UAAU;AACnB,CAAA;;CAEA,SAAS,gBAAgB,CAAC,CAAC,EAAE;AAC7B,GAAE,IAAI,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KAC3C,IAAI,IAAI,GAAG,EAAE;AACjB,KAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE;OACnC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM;AACrD,KAAA,CAAK,CAAC;AACN,KAAI,OAAO,IAAI;AACf,GAAA,CAAG,CAAC;GACF,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC;AAC1C,CAAA;;CAEA,SAAS,kBAAkB,CAAC,CAAC,EAAE;AAC/B,GAAE,IAAI,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KAC3C,IAAI,KAAK,GAAG,EAAE;AAClB,KAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE;OAClC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM;AACvD,KAAA,CAAK,CAAC;AACN,KAAI,OAAO,KAAK;AAChB,GAAA,CAAG,CAAC;GACF,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC;AAC1C,CAAA;;AAEA;AACA;AACA;AACA;AACA,CAAA,SAAS,aAAa,CAAC,IAAI,EAAE,KAAK,EAAE;AACpC,GAAE,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;AAChB,GAAE,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;;AAEhB;AACA;AACA,GAAE,IAAI,EAAE,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC;AACtB,GAAE,IAAI,EAAE,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC;AACtB,GAAE,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC;AACxB,GAAE,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC;;AAEzB,GAAE,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE;AAClB,KAAI,MAAM,IAAI,KAAK,CAAC,2DAA2D,CAAC;AAChF,GAAA;;GAEE,IAAI,EAAE,EAAE,EAAE;AACZ,GAAE,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE;AAC3C;AACA,KAAI,IAAI,EAAE,GAAG,CAAC,EAAE;OACV,CAAC,GAAG,CAAC,CAAC;AACZ,KAAA;AACA,KAAI,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE;KAChB,EAAE,GAAG,CAAC;AACV,GAAA,CAAG,MAAM;AACT;AACA,KAAI,IAAI,EAAE,GAAG,CAAC,EAAE;OACV,CAAC,GAAG,CAAC,CAAC;AACZ,KAAA;KACI,EAAE,GAAG,CAAC;AACV,KAAI,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE;AACpB,GAAA;;AAEA,GAAE,OAAO,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;AACjC,CAAA;;AAEA;AACA;AACA;AACA;CACA,SAAS,gBAAgB,CAAC,CAAC,EAAE;GAC3B,IAAI,QAAQ,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,EAAE,OAAO,EAAE,CAAC,CAAA,CAAE,CAAC;GACxE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KAC/B,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AACxB,KAAI,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI;KACpB,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE;OACxB,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;AACpC,KAAA;AACA,GAAA,CAAG,CAAC;AACJ,GAAE,OAAO,QAAQ;AACjB,CAAA;;AAEA;AACA;AACA;AACA;CACA,SAAS,cAAc,CAAC,CAAC,EAAE;AAC3B,GAAE,IAAI,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA,CAAE,CAAC,CAAC;GACzE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KAC/B,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;KACpB,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE;AAC7B,OAAM,IAAI,CAAC,IAAI,IAAI,GAAG;AACtB,KAAA;AACA,GAAA,CAAG,CAAC;AACJ,CAAA;;CAEA,SAAS,gBAAgB,CAAC,CAAC,EAAE;AAC7B;AACA,GAAE,IAAI,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA,CAAE,CAAC,CAAC;;GAE5E,IAAI,MAAM,GAAG,EAAE;GACf,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;AACnC,KAAI,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,MAAM;AACtC,KAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE;AACvB,OAAM,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE;AACvB,KAAA;KACI,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AACxB,GAAA,CAAG,CAAC;;GAEF,IAAI,KAAK,GAAG,CAAC;GACb,IAAI,cAAc,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,cAAc;GAC7C,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,CAAC,EAAE;AACpC,KAAI,IAAI,CAAC,CAAC,WAAW,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,cAAc,KAAK,CAAC,EAAE;AACvD,OAAM,EAAE,KAAK;KACb,CAAK,MAAM,IAAI,KAAK,EAAE;OAChB,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,KAAK,CAAC,CAAA,CAAE,CAAC;AAC7D,KAAA;AACA,GAAA,CAAG,CAAC;AACJ,CAAA;;CAEA,SAAS,aAAa,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE;GAC7C,IAAI,IAAI,GAAG;KACT,KAAK,EAAE,CAAC;AACZ,KAAI,MAAM,EAAE;IACT;AACH,GAAE,IAAI,SAAS,CAAC,MAAM,IAAI,CAAC,EAAE;AAC7B,KAAI,IAAI,CAAC,IAAI,GAAG,IAAI;AACpB,KAAI,IAAI,CAAC,KAAK,GAAG,KAAK;AACtB,GAAA;GACE,OAAO,YAAY,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,CAAC;AAChD,CAAA;;CAEA,SAAS,OAAO,CAAC,CAAC,EAAE;AACpB,GAAE,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KACxC,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI;KACzB,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE;AAC9B,OAAM,OAAO,IAAI;AACjB,KAAA;AACA,GAAA,CAAG,CAAC,CAAC;AACL,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAS,SAAS,CAAC,UAAU,EAAE,EAAE,EAAE;GACjC,IAAI,MAAM,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE;GACjC,CAAC,CAAC,OAAO,CAAC,UAAU,EAAE,SAAS,KAAK,EAAE;AACxC,KAAI,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE;AACnB,OAAM,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC;AAC5B,KAAA,CAAK,MAAM;AACX,OAAM,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC;AAC5B,KAAA;AACA,GAAA,CAAG,CAAC;AACJ,GAAE,OAAO,MAAM;AACf,CAAA;;AAEA;AACA;AACA;AACA;AACA,CAAA,SAAS,IAAI,CAAC,IAAI,EAAE,EAAE,EAAE;AACxB,GAAE,IAAI,KAAK,GAAG,CAAC,CAAC,GAAG,EAAE;AACrB,GAAE,IAAI;KACF,OAAO,EAAE,EAAE;AACf,GAAA,CAAG,SAAS;AACZ,KAAI,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,SAAS,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC;AAC5D,GAAA;AACA,CAAA;;AAEA,CAAA,SAAS,MAAM,CAAC,IAAI,EAAE,EAAE,EAAE;GACxB,OAAO,EAAE,EAAE;AACb,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/version.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"version.js","sources":["../../../../../../../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/version.js"],"sourcesContent":["module.exports = \"0.8.5\";\n"],"names":[],"mappings":";;;;;;AAAA,CAAA,OAAc,GAAG,OAAO;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/index.js"],"sourcesContent":["/**\n * Copyright (c) 2014, Chris Pettitt\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and/or other materials provided with the distribution.\n *\n * 3. Neither the name of the copyright holder nor the names of its contributors\n * may be used to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\nvar lib = require(\"./lib\");\n\nmodule.exports = {\n  Graph: lib.Graph,\n  json: require(\"./lib/json\"),\n  alg: require(\"./lib/alg\"),\n  version: lib.version\n};\n"],"names":["require$$0","require$$1","require$$2"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CA8BA,IAAI,GAAG,GAAGA,UAAA,EAAgB;;AAE1B,CAAA,QAAc,GAAG;AACjB,GAAE,KAAK,EAAE,GAAG,CAAC,KAAK;GAChB,IAAI,EAAEC,WAAA,EAAqB;GAC3B,GAAG,EAAEC,UAAA,EAAoB;GACzB,OAAO,EAAE,GAAG,CAAC;EACd;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/components.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"components.js","sources":["../../../../../../../../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/components.js"],"sourcesContent":["var _ = require(\"../lodash\");\n\nmodule.exports = components;\n\nfunction components(g) {\n  var visited = {};\n  var cmpts = [];\n  var cmpt;\n\n  function dfs(v) {\n    if (_.has(visited, v)) return;\n    visited[v] = true;\n    cmpt.push(v);\n    _.each(g.successors(v), dfs);\n    _.each(g.predecessors(v), dfs);\n  }\n\n  _.each(g.nodes(), function(v) {\n    cmpt = [];\n    dfs(v);\n    if (cmpt.length) {\n      cmpts.push(cmpt);\n    }\n  });\n\n  return cmpts;\n}\n"],"names":["require$$0"],"mappings":";;;;;;;;CAAA,IAAI,CAAC,GAAGA,aAAA,EAAoB;;AAE5B,CAAA,YAAc,GAAG,UAAU;;CAE3B,SAAS,UAAU,CAAC,CAAC,EAAE;GACrB,IAAI,OAAO,GAAG,EAAE;GAChB,IAAI,KAAK,GAAG,EAAE;AAChB,GAAE,IAAI,IAAI;;AAEV,GAAE,SAAS,GAAG,CAAC,CAAC,EAAE;KACd,IAAI,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE;AAC3B,KAAI,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI;AACrB,KAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;AAChB,KAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC;AAChC,KAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC;AAClC,GAAA;;GAEE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KAC5B,IAAI,GAAG,EAAE;KACT,GAAG,CAAC,CAAC,CAAC;AACV,KAAI,IAAI,IAAI,CAAC,MAAM,EAAE;AACrB,OAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;AACtB,KAAA;AACA,GAAA,CAAG,CAAC;;AAEJ,GAAE,OAAO,KAAK;AACd,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/dfs.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dfs.js","sources":["../../../../../../../../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/dfs.js"],"sourcesContent":["var _ = require(\"../lodash\");\n\nmodule.exports = dfs;\n\n/*\n * A helper that preforms a pre- or post-order traversal on the input graph\n * and returns the nodes in the order they were visited. If the graph is\n * undirected then this algorithm will navigate using neighbors. If the graph\n * is directed then this algorithm will navigate using successors.\n *\n * Order must be one of \"pre\" or \"post\".\n */\nfunction dfs(g, vs, order) {\n  if (!_.isArray(vs)) {\n    vs = [vs];\n  }\n\n  var navigation = (g.isDirected() ? g.successors : g.neighbors).bind(g);\n\n  var acc = [];\n  var visited = {};\n  _.each(vs, function(v) {\n    if (!g.hasNode(v)) {\n      throw new Error(\"Graph does not have node: \" + v);\n    }\n\n    doDfs(g, v, order === \"post\", visited, navigation, acc);\n  });\n  return acc;\n}\n\nfunction doDfs(g, v, postorder, visited, navigation, acc) {\n  if (!_.has(visited, v)) {\n    visited[v] = true;\n\n    if (!postorder) { acc.push(v); }\n    _.each(navigation(v), function(w) {\n      doDfs(g, w, postorder, visited, navigation, acc);\n    });\n    if (postorder) { acc.push(v); }\n  }\n}\n"],"names":["require$$0"],"mappings":";;;;;;;;CAAA,IAAI,CAAC,GAAGA,aAAA,EAAoB;;AAE5B,CAAA,KAAc,GAAG,GAAG;;AAEpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAS,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE;GACzB,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;AACtB,KAAI,EAAE,GAAG,CAAC,EAAE,CAAC;AACb,GAAA;;GAEE,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC;;GAEtE,IAAI,GAAG,GAAG,EAAE;GACZ,IAAI,OAAO,GAAG,EAAE;GAChB,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC,EAAE;KACrB,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;AACvB,OAAM,MAAM,IAAI,KAAK,CAAC,4BAA4B,GAAG,CAAC,CAAC;AACvD,KAAA;;AAEA,KAAI,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,KAAK,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,GAAG,CAAC;AAC3D,GAAA,CAAG,CAAC;AACJ,GAAE,OAAO,GAAG;AACZ,CAAA;;AAEA,CAAA,SAAS,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,OAAO,EAAE,UAAU,EAAE,GAAG,EAAE;GACxD,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE;AAC1B,KAAI,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI;;KAEjB,IAAI,CAAC,SAAS,EAAE,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;KAC9B,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE;AACtC,OAAM,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,OAAO,EAAE,UAAU,EAAE,GAAG,CAAC;AACtD,KAAA,CAAK,CAAC;KACF,IAAI,SAAS,EAAE,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;AACjC,GAAA;AACA,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/dijkstra-all.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dijkstra-all.js","sources":["../../../../../../../../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/dijkstra-all.js"],"sourcesContent":["var dijkstra = require(\"./dijkstra\");\nvar _ = require(\"../lodash\");\n\nmodule.exports = dijkstraAll;\n\nfunction dijkstraAll(g, weightFunc, edgeFunc) {\n  return _.transform(g.nodes(), function(acc, v) {\n    acc[v] = dijkstra(g, v, weightFunc, edgeFunc);\n  }, {});\n}\n"],"names":["require$$0","require$$1"],"mappings":";;;;;;;;;CAAA,IAAI,QAAQ,GAAGA,eAAA,EAAqB;CACpC,IAAI,CAAC,GAAGC,aAAA,EAAoB;;AAE5B,CAAA,aAAc,GAAG,WAAW;;AAE5B,CAAA,SAAS,WAAW,CAAC,CAAC,EAAE,UAAU,EAAE,QAAQ,EAAE;AAC9C,GAAE,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,GAAG,EAAE,CAAC,EAAE;AACjD,KAAI,GAAG,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,UAAU,EAAE,QAAQ,CAAC;GACjD,CAAG,EAAE,EAAE,CAAC;AACR,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/dijkstra.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dijkstra.js","sources":["../../../../../../../../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/dijkstra.js"],"sourcesContent":["var _ = require(\"../lodash\");\nvar PriorityQueue = require(\"../data/priority-queue\");\n\nmodule.exports = dijkstra;\n\nvar DEFAULT_WEIGHT_FUNC = _.constant(1);\n\nfunction dijkstra(g, source, weightFn, edgeFn) {\n  return runDijkstra(g, String(source),\n    weightFn || DEFAULT_WEIGHT_FUNC,\n    edgeFn || function(v) { return g.outEdges(v); });\n}\n\nfunction runDijkstra(g, source, weightFn, edgeFn) {\n  var results = {};\n  var pq = new PriorityQueue();\n  var v, vEntry;\n\n  var updateNeighbors = function(edge) {\n    var w = edge.v !== v ? edge.v : edge.w;\n    var wEntry = results[w];\n    var weight = weightFn(edge);\n    var distance = vEntry.distance + weight;\n\n    if (weight < 0) {\n      throw new Error(\"dijkstra does not allow negative edge weights. \" +\n                      \"Bad edge: \" + edge + \" Weight: \" + weight);\n    }\n\n    if (distance < wEntry.distance) {\n      wEntry.distance = distance;\n      wEntry.predecessor = v;\n      pq.decrease(w, distance);\n    }\n  };\n\n  g.nodes().forEach(function(v) {\n    var distance = v === source ? 0 : Number.POSITIVE_INFINITY;\n    results[v] = { distance: distance };\n    pq.add(v, distance);\n  });\n\n  while (pq.size() > 0) {\n    v = pq.removeMin();\n    vEntry = results[v];\n    if (vEntry.distance === Number.POSITIVE_INFINITY) {\n      break;\n    }\n\n    edgeFn(v).forEach(updateNeighbors);\n  }\n\n  return results;\n}\n"],"names":["require$$0","require$$1"],"mappings":";;;;;;;;;CAAA,IAAI,CAAC,GAAGA,aAAA,EAAoB;CAC5B,IAAI,aAAa,GAAGC,oBAAA,EAAiC;;AAErD,CAAA,UAAc,GAAG,QAAQ;;AAEzB,CAAA,IAAI,mBAAmB,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;;CAEvC,SAAS,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE;GAC7C,OAAO,WAAW,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC;KAClC,QAAQ,IAAI,mBAAmB;AACnC,KAAI,MAAM,IAAI,SAAS,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AACpD,CAAA;;CAEA,SAAS,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE;GAChD,IAAI,OAAO,GAAG,EAAE;AAClB,GAAE,IAAI,EAAE,GAAG,IAAI,aAAa,EAAE;GAC5B,IAAI,CAAC,EAAE,MAAM;;AAEf,GAAE,IAAI,eAAe,GAAG,SAAS,IAAI,EAAE;AACvC,KAAI,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;AAC1C,KAAI,IAAI,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC;AAC3B,KAAI,IAAI,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC;AAC/B,KAAI,IAAI,QAAQ,GAAG,MAAM,CAAC,QAAQ,GAAG,MAAM;;AAE3C,KAAI,IAAI,MAAM,GAAG,CAAC,EAAE;AACpB,OAAM,MAAM,IAAI,KAAK,CAAC,iDAAiD;AACvE,uBAAsB,YAAY,GAAG,IAAI,GAAG,WAAW,GAAG,MAAM,CAAC;AACjE,KAAA;;AAEA,KAAI,IAAI,QAAQ,GAAG,MAAM,CAAC,QAAQ,EAAE;AACpC,OAAM,MAAM,CAAC,QAAQ,GAAG,QAAQ;AAChC,OAAM,MAAM,CAAC,WAAW,GAAG,CAAC;AAC5B,OAAM,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,QAAQ,CAAC;AAC9B,KAAA;GACA,CAAG;;GAED,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;KAC5B,IAAI,QAAQ,GAAG,CAAC,KAAK,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,iBAAiB;KAC1D,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE,QAAQ,EAAE,QAAQ,EAAE;AACvC,KAAI,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC;AACvB,GAAA,CAAG,CAAC;;AAEJ,GAAE,OAAO,EAAE,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE;AACxB,KAAI,CAAC,GAAG,EAAE,CAAC,SAAS,EAAE;AACtB,KAAI,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC;KACnB,IAAI,MAAM,CAAC,QAAQ,KAAK,MAAM,CAAC,iBAAiB,EAAE;OAChD;AACN,KAAA;;KAEI,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,eAAe,CAAC;AACtC,GAAA;;AAEA,GAAE,OAAO,OAAO;AAChB,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/find-cycles.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"find-cycles.js","sources":["../../../../../../../../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/find-cycles.js"],"sourcesContent":["var _ = require(\"../lodash\");\nvar tarjan = require(\"./tarjan\");\n\nmodule.exports = findCycles;\n\nfunction findCycles(g) {\n  return _.filter(tarjan(g), function(cmpt) {\n    return cmpt.length > 1 || (cmpt.length === 1 && g.hasEdge(cmpt[0], cmpt[0]));\n  });\n}\n"],"names":["require$$0","require$$1"],"mappings":";;;;;;;;;CAAA,IAAI,CAAC,GAAGA,aAAA,EAAoB;CAC5B,IAAI,MAAM,GAAGC,aAAA,EAAmB;;AAEhC,CAAA,YAAc,GAAG,UAAU;;CAE3B,SAAS,UAAU,CAAC,CAAC,EAAE;AACvB,GAAE,OAAO,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,SAAS,IAAI,EAAE;KACxC,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,KAAK,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AAChF,GAAA,CAAG,CAAC;AACJ,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/floyd-warshall.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"floyd-warshall.js","sources":["../../../../../../../../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/floyd-warshall.js"],"sourcesContent":["var _ = require(\"../lodash\");\n\nmodule.exports = floydWarshall;\n\nvar DEFAULT_WEIGHT_FUNC = _.constant(1);\n\nfunction floydWarshall(g, weightFn, edgeFn) {\n  return runFloydWarshall(g,\n    weightFn || DEFAULT_WEIGHT_FUNC,\n    edgeFn || function(v) { return g.outEdges(v); });\n}\n\nfunction runFloydWarshall(g, weightFn, edgeFn) {\n  var results = {};\n  var nodes = g.nodes();\n\n  nodes.forEach(function(v) {\n    results[v] = {};\n    results[v][v] = { distance: 0 };\n    nodes.forEach(function(w) {\n      if (v !== w) {\n        results[v][w] = { distance: Number.POSITIVE_INFINITY };\n      }\n    });\n    edgeFn(v).forEach(function(edge) {\n      var w = edge.v === v ? edge.w : edge.v;\n      var d = weightFn(edge);\n      results[v][w] = { distance: d, predecessor: v };\n    });\n  });\n\n  nodes.forEach(function(k) {\n    var rowK = results[k];\n    nodes.forEach(function(i) {\n      var rowI = results[i];\n      nodes.forEach(function(j) {\n        var ik = rowI[k];\n        var kj = rowK[j];\n        var ij = rowI[j];\n        var altDistance = ik.distance + kj.distance;\n        if (altDistance < ij.distance) {\n          ij.distance = altDistance;\n          ij.predecessor = kj.predecessor;\n        }\n      });\n    });\n  });\n\n  return results;\n}\n"],"names":["require$$0"],"mappings":";;;;;;;;CAAA,IAAI,CAAC,GAAGA,aAAA,EAAoB;;AAE5B,CAAA,eAAc,GAAG,aAAa;;AAE9B,CAAA,IAAI,mBAAmB,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;;AAEvC,CAAA,SAAS,aAAa,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE;GAC1C,OAAO,gBAAgB,CAAC,CAAC;KACvB,QAAQ,IAAI,mBAAmB;AACnC,KAAI,MAAM,IAAI,SAAS,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AACpD,CAAA;;AAEA,CAAA,SAAS,gBAAgB,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE;GAC7C,IAAI,OAAO,GAAG,EAAE;AAClB,GAAE,IAAI,KAAK,GAAG,CAAC,CAAC,KAAK,EAAE;;AAEvB,GAAE,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;AAC5B,KAAI,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE;AACnB,KAAI,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,QAAQ,EAAE,CAAC,EAAE;AACnC,KAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;AAC9B,OAAM,IAAI,CAAC,KAAK,CAAC,EAAE;AACnB,SAAQ,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,QAAQ,EAAE,MAAM,CAAC,iBAAiB,EAAE;AAC9D,OAAA;AACA,KAAA,CAAK,CAAC;KACF,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,IAAI,EAAE;AACrC,OAAM,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;AAC5C,OAAM,IAAI,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC;AAC5B,OAAM,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,QAAQ,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE;AACrD,KAAA,CAAK,CAAC;AACN,GAAA,CAAG,CAAC;;AAEJ,GAAE,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;AAC5B,KAAI,IAAI,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC;AACzB,KAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;AAC9B,OAAM,IAAI,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC;AAC3B,OAAM,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;AAChC,SAAQ,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;AACxB,SAAQ,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;AACxB,SAAQ,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;SAChB,IAAI,WAAW,GAAG,EAAE,CAAC,QAAQ,GAAG,EAAE,CAAC,QAAQ;AACnD,SAAQ,IAAI,WAAW,GAAG,EAAE,CAAC,QAAQ,EAAE;AACvC,WAAU,EAAE,CAAC,QAAQ,GAAG,WAAW;AACnC,WAAU,EAAE,CAAC,WAAW,GAAG,EAAE,CAAC,WAAW;AACzC,SAAA;AACA,OAAA,CAAO,CAAC;AACR,KAAA,CAAK,CAAC;AACN,GAAA,CAAG,CAAC;;AAEJ,GAAE,OAAO,OAAO;AAChB,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../../../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/index.js"],"sourcesContent":["module.exports = {\n  components: require(\"./components\"),\n  dijkstra: require(\"./dijkstra\"),\n  dijkstraAll: require(\"./dijkstra-all\"),\n  findCycles: require(\"./find-cycles\"),\n  floydWarshall: require(\"./floyd-warshall\"),\n  isAcyclic: require(\"./is-acyclic\"),\n  postorder: require(\"./postorder\"),\n  preorder: require(\"./preorder\"),\n  prim: require(\"./prim\"),\n  tarjan: require(\"./tarjan\"),\n  topsort: require(\"./topsort\")\n};\n"],"names":["require$$0","require$$1","require$$2","require$$3","require$$4","require$$5","require$$6","require$$7","require$$8","require$$9","require$$10"],"mappings":";;;;;;;;;;;;;;;;;;AAAA,CAAA,GAAc,GAAG;GACf,UAAU,EAAEA,iBAAA,EAAuB;GACnC,QAAQ,EAAEC,eAAA,EAAqB;GAC/B,WAAW,EAAEC,kBAAA,EAAyB;GACtC,UAAU,EAAEC,iBAAA,EAAwB;GACpC,aAAa,EAAEC,oBAAA,EAA2B;GAC1C,SAAS,EAAEC,gBAAA,EAAuB;GAClC,SAAS,EAAEC,gBAAA,EAAsB;GACjC,QAAQ,EAAEC,eAAA,EAAqB;GAC/B,IAAI,EAAEC,WAAA,EAAiB;GACvB,MAAM,EAAEC,aAAA,EAAmB;AAC7B,GAAE,OAAO,EAAEC,cAAA;EACV;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/is-acyclic.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"is-acyclic.js","sources":["../../../../../../../../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/is-acyclic.js"],"sourcesContent":["var topsort = require(\"./topsort\");\n\nmodule.exports = isAcyclic;\n\nfunction isAcyclic(g) {\n  try {\n    topsort(g);\n  } catch (e) {\n    if (e instanceof topsort.CycleException) {\n      return false;\n    }\n    throw e;\n  }\n  return true;\n}\n"],"names":["require$$0"],"mappings":";;;;;;;;CAAA,IAAI,OAAO,GAAGA,cAAA,EAAoB;;AAElC,CAAA,WAAc,GAAG,SAAS;;CAE1B,SAAS,SAAS,CAAC,CAAC,EAAE;AACtB,GAAE,IAAI;KACF,OAAO,CAAC,CAAC,CAAC;GACd,CAAG,CAAC,OAAO,CAAC,EAAE;AACd,KAAI,IAAI,CAAC,YAAY,OAAO,CAAC,cAAc,EAAE;AAC7C,OAAM,OAAO,KAAK;AAClB,KAAA;AACA,KAAI,MAAM,CAAC;AACX,GAAA;AACA,GAAE,OAAO,IAAI;AACb,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/postorder.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"postorder.js","sources":["../../../../../../../../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/postorder.js"],"sourcesContent":["var dfs = require(\"./dfs\");\n\nmodule.exports = postorder;\n\nfunction postorder(g, vs) {\n  return dfs(g, vs, \"post\");\n}\n"],"names":["require$$0"],"mappings":";;;;;;;;CAAA,IAAI,GAAG,GAAGA,UAAA,EAAgB;;AAE1B,CAAA,WAAc,GAAG,SAAS;;AAE1B,CAAA,SAAS,SAAS,CAAC,CAAC,EAAE,EAAE,EAAE;GACxB,OAAO,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC;AAC3B,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/preorder.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"preorder.js","sources":["../../../../../../../../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/preorder.js"],"sourcesContent":["var dfs = require(\"./dfs\");\n\nmodule.exports = preorder;\n\nfunction preorder(g, vs) {\n  return dfs(g, vs, \"pre\");\n}\n"],"names":["require$$0"],"mappings":";;;;;;;;CAAA,IAAI,GAAG,GAAGA,UAAA,EAAgB;;AAE1B,CAAA,UAAc,GAAG,QAAQ;;AAEzB,CAAA,SAAS,QAAQ,CAAC,CAAC,EAAE,EAAE,EAAE;GACvB,OAAO,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,CAAC;AAC1B,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/prim.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"prim.js","sources":["../../../../../../../../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/prim.js"],"sourcesContent":["var _ = require(\"../lodash\");\nvar Graph = require(\"../graph\");\nvar PriorityQueue = require(\"../data/priority-queue\");\n\nmodule.exports = prim;\n\nfunction prim(g, weightFunc) {\n  var result = new Graph();\n  var parents = {};\n  var pq = new PriorityQueue();\n  var v;\n\n  function updateNeighbors(edge) {\n    var w = edge.v === v ? edge.w : edge.v;\n    var pri = pq.priority(w);\n    if (pri !== undefined) {\n      var edgeWeight = weightFunc(edge);\n      if (edgeWeight < pri) {\n        parents[w] = v;\n        pq.decrease(w, edgeWeight);\n      }\n    }\n  }\n\n  if (g.nodeCount() === 0) {\n    return result;\n  }\n\n  _.each(g.nodes(), function(v) {\n    pq.add(v, Number.POSITIVE_INFINITY);\n    result.setNode(v);\n  });\n\n  // Start from an arbitrary node\n  pq.decrease(g.nodes()[0], 0);\n\n  var init = false;\n  while (pq.size() > 0) {\n    v = pq.removeMin();\n    if (_.has(parents, v)) {\n      result.setEdge(v, parents[v]);\n    } else if (init) {\n      throw new Error(\"Input graph is not connected: \" + g);\n    } else {\n      init = true;\n    }\n\n    g.nodeEdges(v).forEach(updateNeighbors);\n  }\n\n  return result;\n}\n"],"names":["require$$0","require$$1","require$$2"],"mappings":";;;;;;;;;;CAAA,IAAI,CAAC,GAAGA,aAAA,EAAoB;CAC5B,IAAI,KAAK,GAAGC,YAAA,EAAmB;CAC/B,IAAI,aAAa,GAAGC,oBAAA,EAAiC;;AAErD,CAAA,MAAc,GAAG,IAAI;;AAErB,CAAA,SAAS,IAAI,CAAC,CAAC,EAAE,UAAU,EAAE;AAC7B,GAAE,IAAI,MAAM,GAAG,IAAI,KAAK,EAAE;GACxB,IAAI,OAAO,GAAG,EAAE;AAClB,GAAE,IAAI,EAAE,GAAG,IAAI,aAAa,EAAE;AAC9B,GAAE,IAAI,CAAC;;AAEP,GAAE,SAAS,eAAe,CAAC,IAAI,EAAE;AACjC,KAAI,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;KACtC,IAAI,GAAG,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;AAC5B,KAAI,IAAI,GAAG,KAAK,SAAS,EAAE;AAC3B,OAAM,IAAI,UAAU,GAAG,UAAU,CAAC,IAAI,CAAC;AACvC,OAAM,IAAI,UAAU,GAAG,GAAG,EAAE;AAC5B,SAAQ,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC;AACtB,SAAQ,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,UAAU,CAAC;AAClC,OAAA;AACA,KAAA;AACA,GAAA;;AAEA,GAAE,IAAI,CAAC,CAAC,SAAS,EAAE,KAAK,CAAC,EAAE;AAC3B,KAAI,OAAO,MAAM;AACjB,GAAA;;GAEE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KAC5B,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,iBAAiB,CAAC;AACvC,KAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;AACrB,GAAA,CAAG,CAAC;;AAEJ;AACA,GAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;;GAE5B,IAAI,IAAI,GAAG,KAAK;AAClB,GAAE,OAAO,EAAE,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE;AACxB,KAAI,CAAC,GAAG,EAAE,CAAC,SAAS,EAAE;KAClB,IAAI,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE;OACrB,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;KACnC,CAAK,MAAM,IAAI,IAAI,EAAE;AACrB,OAAM,MAAM,IAAI,KAAK,CAAC,gCAAgC,GAAG,CAAC,CAAC;AAC3D,KAAA,CAAK,MAAM;OACL,IAAI,GAAG,IAAI;AACjB,KAAA;;KAEI,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,eAAe,CAAC;AAC3C,GAAA;;AAEA,GAAE,OAAO,MAAM;AACf,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/tarjan.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"tarjan.js","sources":["../../../../../../../../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/tarjan.js"],"sourcesContent":["var _ = require(\"../lodash\");\n\nmodule.exports = tarjan;\n\nfunction tarjan(g) {\n  var index = 0;\n  var stack = [];\n  var visited = {}; // node id -> { onStack, lowlink, index }\n  var results = [];\n\n  function dfs(v) {\n    var entry = visited[v] = {\n      onStack: true,\n      lowlink: index,\n      index: index++\n    };\n    stack.push(v);\n\n    g.successors(v).forEach(function(w) {\n      if (!_.has(visited, w)) {\n        dfs(w);\n        entry.lowlink = Math.min(entry.lowlink, visited[w].lowlink);\n      } else if (visited[w].onStack) {\n        entry.lowlink = Math.min(entry.lowlink, visited[w].index);\n      }\n    });\n\n    if (entry.lowlink === entry.index) {\n      var cmpt = [];\n      var w;\n      do {\n        w = stack.pop();\n        visited[w].onStack = false;\n        cmpt.push(w);\n      } while (v !== w);\n      results.push(cmpt);\n    }\n  }\n\n  g.nodes().forEach(function(v) {\n    if (!_.has(visited, v)) {\n      dfs(v);\n    }\n  });\n\n  return results;\n}\n"],"names":["require$$0"],"mappings":";;;;;;;;CAAA,IAAI,CAAC,GAAGA,aAAA,EAAoB;;AAE5B,CAAA,QAAc,GAAG,MAAM;;CAEvB,SAAS,MAAM,CAAC,CAAC,EAAE;GACjB,IAAI,KAAK,GAAG,CAAC;GACb,IAAI,KAAK,GAAG,EAAE;AAChB,GAAE,IAAI,OAAO,GAAG,EAAE,CAAC;GACjB,IAAI,OAAO,GAAG,EAAE;;AAElB,GAAE,SAAS,GAAG,CAAC,CAAC,EAAE;AAClB,KAAI,IAAI,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG;OACvB,OAAO,EAAE,IAAI;OACb,OAAO,EAAE,KAAK;OACd,KAAK,EAAE,KAAK;MACb;AACL,KAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;;KAEb,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;OAClC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE;SACtB,GAAG,CAAC,CAAC,CAAC;AACd,SAAQ,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;OACnE,CAAO,MAAM,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE;AACrC,SAAQ,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;AACjE,OAAA;AACA,KAAA,CAAK,CAAC;;KAEF,IAAI,KAAK,CAAC,OAAO,KAAK,KAAK,CAAC,KAAK,EAAE;OACjC,IAAI,IAAI,GAAG,EAAE;AACnB,OAAM,IAAI,CAAC;AACX,OAAM,GAAG;AACT,SAAQ,CAAC,GAAG,KAAK,CAAC,GAAG,EAAE;AACvB,SAAQ,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,KAAK;AAClC,SAAQ,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;OACpB,CAAO,QAAQ,CAAC,KAAK,CAAC;AACtB,OAAM,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC;AACxB,KAAA;AACA,GAAA;;GAEE,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;KAC5B,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE;OACtB,GAAG,CAAC,CAAC,CAAC;AACZ,KAAA;AACA,GAAA,CAAG,CAAC;;AAEJ,GAAE,OAAO,OAAO;AAChB,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/topsort.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"topsort.js","sources":["../../../../../../../../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/topsort.js"],"sourcesContent":["var _ = require(\"../lodash\");\n\nmodule.exports = topsort;\ntopsort.CycleException = CycleException;\n\nfunction topsort(g) {\n  var visited = {};\n  var stack = {};\n  var results = [];\n\n  function visit(node) {\n    if (_.has(stack, node)) {\n      throw new CycleException();\n    }\n\n    if (!_.has(visited, node)) {\n      stack[node] = true;\n      visited[node] = true;\n      _.each(g.predecessors(node), visit);\n      delete stack[node];\n      results.push(node);\n    }\n  }\n\n  _.each(g.sinks(), visit);\n\n  if (_.size(visited) !== g.nodeCount()) {\n    throw new CycleException();\n  }\n\n  return results;\n}\n\nfunction CycleException() {}\nCycleException.prototype = new Error(); // must be an instance of Error to pass testing"],"names":["require$$0"],"mappings":";;;;;;;;CAAA,IAAI,CAAC,GAAGA,aAAA,EAAoB;;AAE5B,CAAA,SAAc,GAAG,OAAO;CACxB,OAAO,CAAC,cAAc,GAAG,cAAc;;CAEvC,SAAS,OAAO,CAAC,CAAC,EAAE;GAClB,IAAI,OAAO,GAAG,EAAE;GAChB,IAAI,KAAK,GAAG,EAAE;GACd,IAAI,OAAO,GAAG,EAAE;;AAElB,GAAE,SAAS,KAAK,CAAC,IAAI,EAAE;KACnB,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE;OACtB,MAAM,IAAI,cAAc,EAAE;AAChC,KAAA;;KAEI,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE;AAC/B,OAAM,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI;AACxB,OAAM,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI;AAC1B,OAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC;AACzC,OAAM,OAAO,KAAK,CAAC,IAAI,CAAC;AACxB,OAAM,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC;AACxB,KAAA;AACA,GAAA;;GAEE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,KAAK,CAAC;;AAE1B,GAAE,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,SAAS,EAAE,EAAE;KACrC,MAAM,IAAI,cAAc,EAAE;AAC9B,GAAA;;AAEA,GAAE,OAAO,OAAO;AAChB,CAAA;;AAEA,CAAA,SAAS,cAAc,GAAG,CAAA;AAC1B,CAAA,cAAc,CAAC,SAAS,GAAG,IAAI,KAAK,EAAE,CAAC;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/data/priority-queue.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"priority-queue.js","sources":["../../../../../../../../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/data/priority-queue.js"],"sourcesContent":["var _ = require(\"../lodash\");\n\nmodule.exports = PriorityQueue;\n\n/**\n * A min-priority queue data structure. This algorithm is derived from Cormen,\n * et al., \"Introduction to Algorithms\". The basic idea of a min-priority\n * queue is that you can efficiently (in O(1) time) get the smallest key in\n * the queue. Adding and removing elements takes O(log n) time. A key can\n * have its priority decreased in O(log n) time.\n */\nfunction PriorityQueue() {\n  this._arr = [];\n  this._keyIndices = {};\n}\n\n/**\n * Returns the number of elements in the queue. Takes `O(1)` time.\n */\nPriorityQueue.prototype.size = function() {\n  return this._arr.length;\n};\n\n/**\n * Returns the keys that are in the queue. Takes `O(n)` time.\n */\nPriorityQueue.prototype.keys = function() {\n  return this._arr.map(function(x) { return x.key; });\n};\n\n/**\n * Returns `true` if **key** is in the queue and `false` if not.\n */\nPriorityQueue.prototype.has = function(key) {\n  return _.has(this._keyIndices, key);\n};\n\n/**\n * Returns the priority for **key**. If **key** is not present in the queue\n * then this function returns `undefined`. Takes `O(1)` time.\n *\n * @param {Object} key\n */\nPriorityQueue.prototype.priority = function(key) {\n  var index = this._keyIndices[key];\n  if (index !== undefined) {\n    return this._arr[index].priority;\n  }\n};\n\n/**\n * Returns the key for the minimum element in this queue. If the queue is\n * empty this function throws an Error. Takes `O(1)` time.\n */\nPriorityQueue.prototype.min = function() {\n  if (this.size() === 0) {\n    throw new Error(\"Queue underflow\");\n  }\n  return this._arr[0].key;\n};\n\n/**\n * Inserts a new key into the priority queue. If the key already exists in\n * the queue this function returns `false`; otherwise it will return `true`.\n * Takes `O(n)` time.\n *\n * @param {Object} key the key to add\n * @param {Number} priority the initial priority for the key\n */\nPriorityQueue.prototype.add = function(key, priority) {\n  var keyIndices = this._keyIndices;\n  key = String(key);\n  if (!_.has(keyIndices, key)) {\n    var arr = this._arr;\n    var index = arr.length;\n    keyIndices[key] = index;\n    arr.push({key: key, priority: priority});\n    this._decrease(index);\n    return true;\n  }\n  return false;\n};\n\n/**\n * Removes and returns the smallest key in the queue. Takes `O(log n)` time.\n */\nPriorityQueue.prototype.removeMin = function() {\n  this._swap(0, this._arr.length - 1);\n  var min = this._arr.pop();\n  delete this._keyIndices[min.key];\n  this._heapify(0);\n  return min.key;\n};\n\n/**\n * Decreases the priority for **key** to **priority**. If the new priority is\n * greater than the previous priority, this function will throw an Error.\n *\n * @param {Object} key the key for which to raise priority\n * @param {Number} priority the new priority for the key\n */\nPriorityQueue.prototype.decrease = function(key, priority) {\n  var index = this._keyIndices[key];\n  if (priority > this._arr[index].priority) {\n    throw new Error(\"New priority is greater than current priority. \" +\n        \"Key: \" + key + \" Old: \" + this._arr[index].priority + \" New: \" + priority);\n  }\n  this._arr[index].priority = priority;\n  this._decrease(index);\n};\n\nPriorityQueue.prototype._heapify = function(i) {\n  var arr = this._arr;\n  var l = 2 * i;\n  var r = l + 1;\n  var largest = i;\n  if (l < arr.length) {\n    largest = arr[l].priority < arr[largest].priority ? l : largest;\n    if (r < arr.length) {\n      largest = arr[r].priority < arr[largest].priority ? r : largest;\n    }\n    if (largest !== i) {\n      this._swap(i, largest);\n      this._heapify(largest);\n    }\n  }\n};\n\nPriorityQueue.prototype._decrease = function(index) {\n  var arr = this._arr;\n  var priority = arr[index].priority;\n  var parent;\n  while (index !== 0) {\n    parent = index >> 1;\n    if (arr[parent].priority < priority) {\n      break;\n    }\n    this._swap(index, parent);\n    index = parent;\n  }\n};\n\nPriorityQueue.prototype._swap = function(i, j) {\n  var arr = this._arr;\n  var keyIndices = this._keyIndices;\n  var origArrI = arr[i];\n  var origArrJ = arr[j];\n  arr[i] = origArrJ;\n  arr[j] = origArrI;\n  keyIndices[origArrJ.key] = i;\n  keyIndices[origArrI.key] = j;\n};\n"],"names":["require$$0"],"mappings":";;;;;;;;CAAA,IAAI,CAAC,GAAGA,aAAA,EAAoB;;AAE5B,CAAA,aAAc,GAAG,aAAa;;AAE9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAS,aAAa,GAAG;AACzB,GAAE,IAAI,CAAC,IAAI,GAAG,EAAE;AAChB,GAAE,IAAI,CAAC,WAAW,GAAG,EAAE;AACvB,CAAA;;AAEA;AACA;AACA;AACA,CAAA,aAAa,CAAC,SAAS,CAAC,IAAI,GAAG,WAAW;AAC1C,GAAE,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM;CACzB,CAAC;;AAED;AACA;AACA;AACA,CAAA,aAAa,CAAC,SAAS,CAAC,IAAI,GAAG,WAAW;AAC1C,GAAE,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;CACrD,CAAC;;AAED;AACA;AACA;AACA,CAAA,aAAa,CAAC,SAAS,CAAC,GAAG,GAAG,SAAS,GAAG,EAAE;GAC1C,OAAO,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,GAAG,CAAC;CACrC,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,aAAa,CAAC,SAAS,CAAC,QAAQ,GAAG,SAAS,GAAG,EAAE;GAC/C,IAAI,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC;AACnC,GAAE,IAAI,KAAK,KAAK,SAAS,EAAE;KACvB,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,QAAQ;AACpC,GAAA;CACA,CAAC;;AAED;AACA;AACA;AACA;AACA,CAAA,aAAa,CAAC,SAAS,CAAC,GAAG,GAAG,WAAW;AACzC,GAAE,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE;AACzB,KAAI,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC;AACtC,GAAA;GACE,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG;CACzB,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;CACA,aAAa,CAAC,SAAS,CAAC,GAAG,GAAG,SAAS,GAAG,EAAE,QAAQ,EAAE;AACtD,GAAE,IAAI,UAAU,GAAG,IAAI,CAAC,WAAW;AACnC,GAAE,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC;GACjB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,EAAE;AAC/B,KAAI,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI;AACvB,KAAI,IAAI,KAAK,GAAG,GAAG,CAAC,MAAM;AAC1B,KAAI,UAAU,CAAC,GAAG,CAAC,GAAG,KAAK;AAC3B,KAAI,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;AAC5C,KAAI,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC;AACzB,KAAI,OAAO,IAAI;AACf,GAAA;AACA,GAAE,OAAO,KAAK;CACd,CAAC;;AAED;AACA;AACA;AACA,CAAA,aAAa,CAAC,SAAS,CAAC,SAAS,GAAG,WAAW;AAC/C,GAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;GACnC,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE;GACzB,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC;AAClC,GAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;GAChB,OAAO,GAAG,CAAC,GAAG;CAChB,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;CACA,aAAa,CAAC,SAAS,CAAC,QAAQ,GAAG,SAAS,GAAG,EAAE,QAAQ,EAAE;GACzD,IAAI,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC;GACjC,IAAI,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,QAAQ,EAAE;AAC5C,KAAI,MAAM,IAAI,KAAK,CAAC,iDAAiD;AACrE,SAAQ,OAAO,GAAG,GAAG,GAAG,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,QAAQ,GAAG,QAAQ,GAAG,QAAQ,CAAC;AACnF,GAAA;GACE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,QAAQ,GAAG,QAAQ;AACtC,GAAE,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC;CACvB,CAAC;;AAED,CAAA,aAAa,CAAC,SAAS,CAAC,QAAQ,GAAG,SAAS,CAAC,EAAE;AAC/C,GAAE,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI;AACrB,GAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;AACf,GAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;GACb,IAAI,OAAO,GAAG,CAAC;AACjB,GAAE,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE;AACtB,KAAI,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC,QAAQ,GAAG,CAAC,GAAG,OAAO;AACnE,KAAI,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE;AACxB,OAAM,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC,QAAQ,GAAG,CAAC,GAAG,OAAO;AACrE,KAAA;AACA,KAAI,IAAI,OAAO,KAAK,CAAC,EAAE;AACvB,OAAM,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC;AAC5B,OAAM,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC;AAC5B,KAAA;AACA,GAAA;CACA,CAAC;;AAED,CAAA,aAAa,CAAC,SAAS,CAAC,SAAS,GAAG,SAAS,KAAK,EAAE;AACpD,GAAE,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI;GACnB,IAAI,QAAQ,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,QAAQ;AACpC,GAAE,IAAI,MAAM;AACZ,GAAE,OAAO,KAAK,KAAK,CAAC,EAAE;AACtB,KAAI,MAAM,GAAG,KAAK,IAAI,CAAC;KACnB,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,QAAQ,GAAG,QAAQ,EAAE;OACnC;AACN,KAAA;AACA,KAAI,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC;KACzB,KAAK,GAAG,MAAM;AAClB,GAAA;CACA,CAAC;;CAED,aAAa,CAAC,SAAS,CAAC,KAAK,GAAG,SAAS,CAAC,EAAE,CAAC,EAAE;AAC/C,GAAE,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI;AACrB,GAAE,IAAI,UAAU,GAAG,IAAI,CAAC,WAAW;AACnC,GAAE,IAAI,QAAQ,GAAG,GAAG,CAAC,CAAC,CAAC;AACvB,GAAE,IAAI,QAAQ,GAAG,GAAG,CAAC,CAAC,CAAC;AACvB,GAAE,GAAG,CAAC,CAAC,CAAC,GAAG,QAAQ;AACnB,GAAE,GAAG,CAAC,CAAC,CAAC,GAAG,QAAQ;AACnB,GAAE,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC;AAC9B,GAAE,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC;CAC9B,CAAC;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/graph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph.js","sources":["../../../../../../../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/graph.js"],"sourcesContent":["\"use strict\";\n\nvar _ = require(\"./lodash\");\n\nmodule.exports = Graph;\n\nvar DEFAULT_EDGE_NAME = \"\\x00\";\nvar GRAPH_NODE = \"\\x00\";\nvar EDGE_KEY_DELIM = \"\\x01\";\n\n// Implementation notes:\n//\n//  * Node id query functions should return string ids for the nodes\n//  * Edge id query functions should return an \"edgeObj\", edge object, that is\n//    composed of enough information to uniquely identify an edge: {v, w, name}.\n//  * Internally we use an \"edgeId\", a stringified form of the edgeObj, to\n//    reference edges. This is because we need a performant way to look these\n//    edges up and, object properties, which have string keys, are the closest\n//    we're going to get to a performant hashtable in JavaScript.\n\nfunction Graph(opts) {\n  this._isDirected = _.has(opts, \"directed\") ? opts.directed : true;\n  this._isMultigraph = _.has(opts, \"multigraph\") ? opts.multigraph : false;\n  this._isCompound = _.has(opts, \"compound\") ? opts.compound : false;\n\n  // Label for the graph itself\n  this._label = undefined;\n\n  // Defaults to be set when creating a new node\n  this._defaultNodeLabelFn = _.constant(undefined);\n\n  // Defaults to be set when creating a new edge\n  this._defaultEdgeLabelFn = _.constant(undefined);\n\n  // v -> label\n  this._nodes = {};\n\n  if (this._isCompound) {\n    // v -> parent\n    this._parent = {};\n\n    // v -> children\n    this._children = {};\n    this._children[GRAPH_NODE] = {};\n  }\n\n  // v -> edgeObj\n  this._in = {};\n\n  // u -> v -> Number\n  this._preds = {};\n\n  // v -> edgeObj\n  this._out = {};\n\n  // v -> w -> Number\n  this._sucs = {};\n\n  // e -> edgeObj\n  this._edgeObjs = {};\n\n  // e -> label\n  this._edgeLabels = {};\n}\n\n/* Number of nodes in the graph. Should only be changed by the implementation. */\nGraph.prototype._nodeCount = 0;\n\n/* Number of edges in the graph. Should only be changed by the implementation. */\nGraph.prototype._edgeCount = 0;\n\n\n/* === Graph functions ========= */\n\nGraph.prototype.isDirected = function() {\n  return this._isDirected;\n};\n\nGraph.prototype.isMultigraph = function() {\n  return this._isMultigraph;\n};\n\nGraph.prototype.isCompound = function() {\n  return this._isCompound;\n};\n\nGraph.prototype.setGraph = function(label) {\n  this._label = label;\n  return this;\n};\n\nGraph.prototype.graph = function() {\n  return this._label;\n};\n\n\n/* === Node functions ========== */\n\nGraph.prototype.setDefaultNodeLabel = function(newDefault) {\n  if (!_.isFunction(newDefault)) {\n    newDefault = _.constant(newDefault);\n  }\n  this._defaultNodeLabelFn = newDefault;\n  return this;\n};\n\nGraph.prototype.nodeCount = function() {\n  return this._nodeCount;\n};\n\nGraph.prototype.nodes = function() {\n  return _.keys(this._nodes);\n};\n\nGraph.prototype.sources = function() {\n  var self = this;\n  return _.filter(this.nodes(), function(v) {\n    return _.isEmpty(self._in[v]);\n  });\n};\n\nGraph.prototype.sinks = function() {\n  var self = this;\n  return _.filter(this.nodes(), function(v) {\n    return _.isEmpty(self._out[v]);\n  });\n};\n\nGraph.prototype.setNodes = function(vs, value) {\n  var args = arguments;\n  var self = this;\n  _.each(vs, function(v) {\n    if (args.length > 1) {\n      self.setNode(v, value);\n    } else {\n      self.setNode(v);\n    }\n  });\n  return this;\n};\n\nGraph.prototype.setNode = function(v, value) {\n  if (_.has(this._nodes, v)) {\n    if (arguments.length > 1) {\n      this._nodes[v] = value;\n    }\n    return this;\n  }\n\n  this._nodes[v] = arguments.length > 1 ? value : this._defaultNodeLabelFn(v);\n  if (this._isCompound) {\n    this._parent[v] = GRAPH_NODE;\n    this._children[v] = {};\n    this._children[GRAPH_NODE][v] = true;\n  }\n  this._in[v] = {};\n  this._preds[v] = {};\n  this._out[v] = {};\n  this._sucs[v] = {};\n  ++this._nodeCount;\n  return this;\n};\n\nGraph.prototype.node = function(v) {\n  return this._nodes[v];\n};\n\nGraph.prototype.hasNode = function(v) {\n  return _.has(this._nodes, v);\n};\n\nGraph.prototype.removeNode =  function(v) {\n  var self = this;\n  if (_.has(this._nodes, v)) {\n    var removeEdge = function(e) { self.removeEdge(self._edgeObjs[e]); };\n    delete this._nodes[v];\n    if (this._isCompound) {\n      this._removeFromParentsChildList(v);\n      delete this._parent[v];\n      _.each(this.children(v), function(child) {\n        self.setParent(child);\n      });\n      delete this._children[v];\n    }\n    _.each(_.keys(this._in[v]), removeEdge);\n    delete this._in[v];\n    delete this._preds[v];\n    _.each(_.keys(this._out[v]), removeEdge);\n    delete this._out[v];\n    delete this._sucs[v];\n    --this._nodeCount;\n  }\n  return this;\n};\n\nGraph.prototype.setParent = function(v, parent) {\n  if (!this._isCompound) {\n    throw new Error(\"Cannot set parent in a non-compound graph\");\n  }\n\n  if (_.isUndefined(parent)) {\n    parent = GRAPH_NODE;\n  } else {\n    // Coerce parent to string\n    parent += \"\";\n    for (var ancestor = parent;\n      !_.isUndefined(ancestor);\n      ancestor = this.parent(ancestor)) {\n      if (ancestor === v) {\n        throw new Error(\"Setting \" + parent+ \" as parent of \" + v +\n                        \" would create a cycle\");\n      }\n    }\n\n    this.setNode(parent);\n  }\n\n  this.setNode(v);\n  this._removeFromParentsChildList(v);\n  this._parent[v] = parent;\n  this._children[parent][v] = true;\n  return this;\n};\n\nGraph.prototype._removeFromParentsChildList = function(v) {\n  delete this._children[this._parent[v]][v];\n};\n\nGraph.prototype.parent = function(v) {\n  if (this._isCompound) {\n    var parent = this._parent[v];\n    if (parent !== GRAPH_NODE) {\n      return parent;\n    }\n  }\n};\n\nGraph.prototype.children = function(v) {\n  if (_.isUndefined(v)) {\n    v = GRAPH_NODE;\n  }\n\n  if (this._isCompound) {\n    var children = this._children[v];\n    if (children) {\n      return _.keys(children);\n    }\n  } else if (v === GRAPH_NODE) {\n    return this.nodes();\n  } else if (this.hasNode(v)) {\n    return [];\n  }\n};\n\nGraph.prototype.predecessors = function(v) {\n  var predsV = this._preds[v];\n  if (predsV) {\n    return _.keys(predsV);\n  }\n};\n\nGraph.prototype.successors = function(v) {\n  var sucsV = this._sucs[v];\n  if (sucsV) {\n    return _.keys(sucsV);\n  }\n};\n\nGraph.prototype.neighbors = function(v) {\n  var preds = this.predecessors(v);\n  if (preds) {\n    return _.union(preds, this.successors(v));\n  }\n};\n\nGraph.prototype.isLeaf = function (v) {\n  var neighbors;\n  if (this.isDirected()) {\n    neighbors = this.successors(v);\n  } else {\n    neighbors = this.neighbors(v);\n  }\n  return neighbors.length === 0;\n};\n\nGraph.prototype.filterNodes = function(filter) {\n  var copy = new this.constructor({\n    directed: this._isDirected,\n    multigraph: this._isMultigraph,\n    compound: this._isCompound\n  });\n\n  copy.setGraph(this.graph());\n\n  var self = this;\n  _.each(this._nodes, function(value, v) {\n    if (filter(v)) {\n      copy.setNode(v, value);\n    }\n  });\n\n  _.each(this._edgeObjs, function(e) {\n    if (copy.hasNode(e.v) && copy.hasNode(e.w)) {\n      copy.setEdge(e, self.edge(e));\n    }\n  });\n\n  var parents = {};\n  function findParent(v) {\n    var parent = self.parent(v);\n    if (parent === undefined || copy.hasNode(parent)) {\n      parents[v] = parent;\n      return parent;\n    } else if (parent in parents) {\n      return parents[parent];\n    } else {\n      return findParent(parent);\n    }\n  }\n\n  if (this._isCompound) {\n    _.each(copy.nodes(), function(v) {\n      copy.setParent(v, findParent(v));\n    });\n  }\n\n  return copy;\n};\n\n/* === Edge functions ========== */\n\nGraph.prototype.setDefaultEdgeLabel = function(newDefault) {\n  if (!_.isFunction(newDefault)) {\n    newDefault = _.constant(newDefault);\n  }\n  this._defaultEdgeLabelFn = newDefault;\n  return this;\n};\n\nGraph.prototype.edgeCount = function() {\n  return this._edgeCount;\n};\n\nGraph.prototype.edges = function() {\n  return _.values(this._edgeObjs);\n};\n\nGraph.prototype.setPath = function(vs, value) {\n  var self = this;\n  var args = arguments;\n  _.reduce(vs, function(v, w) {\n    if (args.length > 1) {\n      self.setEdge(v, w, value);\n    } else {\n      self.setEdge(v, w);\n    }\n    return w;\n  });\n  return this;\n};\n\n/*\n * setEdge(v, w, [value, [name]])\n * setEdge({ v, w, [name] }, [value])\n */\nGraph.prototype.setEdge = function() {\n  var v, w, name, value;\n  var valueSpecified = false;\n  var arg0 = arguments[0];\n\n  if (typeof arg0 === \"object\" && arg0 !== null && \"v\" in arg0) {\n    v = arg0.v;\n    w = arg0.w;\n    name = arg0.name;\n    if (arguments.length === 2) {\n      value = arguments[1];\n      valueSpecified = true;\n    }\n  } else {\n    v = arg0;\n    w = arguments[1];\n    name = arguments[3];\n    if (arguments.length > 2) {\n      value = arguments[2];\n      valueSpecified = true;\n    }\n  }\n\n  v = \"\" + v;\n  w = \"\" + w;\n  if (!_.isUndefined(name)) {\n    name = \"\" + name;\n  }\n\n  var e = edgeArgsToId(this._isDirected, v, w, name);\n  if (_.has(this._edgeLabels, e)) {\n    if (valueSpecified) {\n      this._edgeLabels[e] = value;\n    }\n    return this;\n  }\n\n  if (!_.isUndefined(name) && !this._isMultigraph) {\n    throw new Error(\"Cannot set a named edge when isMultigraph = false\");\n  }\n\n  // It didn't exist, so we need to create it.\n  // First ensure the nodes exist.\n  this.setNode(v);\n  this.setNode(w);\n\n  this._edgeLabels[e] = valueSpecified ? value : this._defaultEdgeLabelFn(v, w, name);\n\n  var edgeObj = edgeArgsToObj(this._isDirected, v, w, name);\n  // Ensure we add undirected edges in a consistent way.\n  v = edgeObj.v;\n  w = edgeObj.w;\n\n  Object.freeze(edgeObj);\n  this._edgeObjs[e] = edgeObj;\n  incrementOrInitEntry(this._preds[w], v);\n  incrementOrInitEntry(this._sucs[v], w);\n  this._in[w][e] = edgeObj;\n  this._out[v][e] = edgeObj;\n  this._edgeCount++;\n  return this;\n};\n\nGraph.prototype.edge = function(v, w, name) {\n  var e = (arguments.length === 1\n    ? edgeObjToId(this._isDirected, arguments[0])\n    : edgeArgsToId(this._isDirected, v, w, name));\n  return this._edgeLabels[e];\n};\n\nGraph.prototype.hasEdge = function(v, w, name) {\n  var e = (arguments.length === 1\n    ? edgeObjToId(this._isDirected, arguments[0])\n    : edgeArgsToId(this._isDirected, v, w, name));\n  return _.has(this._edgeLabels, e);\n};\n\nGraph.prototype.removeEdge = function(v, w, name) {\n  var e = (arguments.length === 1\n    ? edgeObjToId(this._isDirected, arguments[0])\n    : edgeArgsToId(this._isDirected, v, w, name));\n  var edge = this._edgeObjs[e];\n  if (edge) {\n    v = edge.v;\n    w = edge.w;\n    delete this._edgeLabels[e];\n    delete this._edgeObjs[e];\n    decrementOrRemoveEntry(this._preds[w], v);\n    decrementOrRemoveEntry(this._sucs[v], w);\n    delete this._in[w][e];\n    delete this._out[v][e];\n    this._edgeCount--;\n  }\n  return this;\n};\n\nGraph.prototype.inEdges = function(v, u) {\n  var inV = this._in[v];\n  if (inV) {\n    var edges = _.values(inV);\n    if (!u) {\n      return edges;\n    }\n    return _.filter(edges, function(edge) { return edge.v === u; });\n  }\n};\n\nGraph.prototype.outEdges = function(v, w) {\n  var outV = this._out[v];\n  if (outV) {\n    var edges = _.values(outV);\n    if (!w) {\n      return edges;\n    }\n    return _.filter(edges, function(edge) { return edge.w === w; });\n  }\n};\n\nGraph.prototype.nodeEdges = function(v, w) {\n  var inEdges = this.inEdges(v, w);\n  if (inEdges) {\n    return inEdges.concat(this.outEdges(v, w));\n  }\n};\n\nfunction incrementOrInitEntry(map, k) {\n  if (map[k]) {\n    map[k]++;\n  } else {\n    map[k] = 1;\n  }\n}\n\nfunction decrementOrRemoveEntry(map, k) {\n  if (!--map[k]) { delete map[k]; }\n}\n\nfunction edgeArgsToId(isDirected, v_, w_, name) {\n  var v = \"\" + v_;\n  var w = \"\" + w_;\n  if (!isDirected && v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n  return v + EDGE_KEY_DELIM + w + EDGE_KEY_DELIM +\n             (_.isUndefined(name) ? DEFAULT_EDGE_NAME : name);\n}\n\nfunction edgeArgsToObj(isDirected, v_, w_, name) {\n  var v = \"\" + v_;\n  var w = \"\" + w_;\n  if (!isDirected && v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n  var edgeObj =  { v: v, w: w };\n  if (name) {\n    edgeObj.name = name;\n  }\n  return edgeObj;\n}\n\nfunction edgeObjToId(isDirected, edgeObj) {\n  return edgeArgsToId(isDirected, edgeObj.v, edgeObj.w, edgeObj.name);\n}\n"],"names":["require$$0"],"mappings":";;;;;;;;;CAEA,IAAI,CAAC,GAAGA,aAAA,EAAmB;;AAE3B,CAAA,KAAc,GAAG,KAAK;;CAEtB,IAAI,iBAAiB,GAAG,MAAM;CAC9B,IAAI,UAAU,GAAG,MAAM;CACvB,IAAI,cAAc,GAAG,MAAM;;AAE3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;CAEA,SAAS,KAAK,CAAC,IAAI,EAAE;AACrB,GAAE,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,UAAU,CAAC,GAAG,IAAI,CAAC,QAAQ,GAAG,IAAI;AACnE,GAAE,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,YAAY,CAAC,GAAG,IAAI,CAAC,UAAU,GAAG,KAAK;AAC1E,GAAE,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,UAAU,CAAC,GAAG,IAAI,CAAC,QAAQ,GAAG,KAAK;;AAEpE;AACA,GAAE,IAAI,CAAC,MAAM,GAAG,SAAS;;AAEzB;GACE,IAAI,CAAC,mBAAmB,GAAG,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC;;AAElD;GACE,IAAI,CAAC,mBAAmB,GAAG,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC;;AAElD;AACA,GAAE,IAAI,CAAC,MAAM,GAAG,EAAE;;AAElB,GAAE,IAAI,IAAI,CAAC,WAAW,EAAE;AACxB;AACA,KAAI,IAAI,CAAC,OAAO,GAAG,EAAE;;AAErB;AACA,KAAI,IAAI,CAAC,SAAS,GAAG,EAAE;AACvB,KAAI,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,GAAG,EAAE;AACnC,GAAA;;AAEA;AACA,GAAE,IAAI,CAAC,GAAG,GAAG,EAAE;;AAEf;AACA,GAAE,IAAI,CAAC,MAAM,GAAG,EAAE;;AAElB;AACA,GAAE,IAAI,CAAC,IAAI,GAAG,EAAE;;AAEhB;AACA,GAAE,IAAI,CAAC,KAAK,GAAG,EAAE;;AAEjB;AACA,GAAE,IAAI,CAAC,SAAS,GAAG,EAAE;;AAErB;AACA,GAAE,IAAI,CAAC,WAAW,GAAG,EAAE;AACvB,CAAA;;AAEA;AACA,CAAA,KAAK,CAAC,SAAS,CAAC,UAAU,GAAG,CAAC;;AAE9B;AACA,CAAA,KAAK,CAAC,SAAS,CAAC,UAAU,GAAG,CAAC;;;AAG9B;;AAEA,CAAA,KAAK,CAAC,SAAS,CAAC,UAAU,GAAG,WAAW;GACtC,OAAO,IAAI,CAAC,WAAW;CACzB,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,YAAY,GAAG,WAAW;GACxC,OAAO,IAAI,CAAC,aAAa;CAC3B,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,UAAU,GAAG,WAAW;GACtC,OAAO,IAAI,CAAC,WAAW;CACzB,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,QAAQ,GAAG,SAAS,KAAK,EAAE;AAC3C,GAAE,IAAI,CAAC,MAAM,GAAG,KAAK;AACrB,GAAE,OAAO,IAAI;CACb,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,KAAK,GAAG,WAAW;GACjC,OAAO,IAAI,CAAC,MAAM;CACpB,CAAC;;;AAGD;;AAEA,CAAA,KAAK,CAAC,SAAS,CAAC,mBAAmB,GAAG,SAAS,UAAU,EAAE;GACzD,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE;AACjC,KAAI,UAAU,GAAG,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC;AACvC,GAAA;AACA,GAAE,IAAI,CAAC,mBAAmB,GAAG,UAAU;AACvC,GAAE,OAAO,IAAI;CACb,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,SAAS,GAAG,WAAW;GACrC,OAAO,IAAI,CAAC,UAAU;CACxB,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,KAAK,GAAG,WAAW;GACjC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;CAC5B,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,OAAO,GAAG,WAAW;GACnC,IAAI,IAAI,GAAG,IAAI;AACjB,GAAE,OAAO,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KACxC,OAAO,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACjC,GAAA,CAAG,CAAC;CACJ,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,KAAK,GAAG,WAAW;GACjC,IAAI,IAAI,GAAG,IAAI;AACjB,GAAE,OAAO,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KACxC,OAAO,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AAClC,GAAA,CAAG,CAAC;CACJ,CAAC;;CAED,KAAK,CAAC,SAAS,CAAC,QAAQ,GAAG,SAAS,EAAE,EAAE,KAAK,EAAE;GAC7C,IAAI,IAAI,GAAG,SAAS;GACpB,IAAI,IAAI,GAAG,IAAI;GACf,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC,EAAE;AACzB,KAAI,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;AACzB,OAAM,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC;AAC5B,KAAA,CAAK,MAAM;AACX,OAAM,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;AACrB,KAAA;AACA,GAAA,CAAG,CAAC;AACJ,GAAE,OAAO,IAAI;CACb,CAAC;;CAED,KAAK,CAAC,SAAS,CAAC,OAAO,GAAG,SAAS,CAAC,EAAE,KAAK,EAAE;GAC3C,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE;AAC7B,KAAI,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE;AAC9B,OAAM,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK;AAC5B,KAAA;AACA,KAAI,OAAO,IAAI;AACf,GAAA;;GAEE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,GAAG,KAAK,GAAG,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC;AAC7E,GAAE,IAAI,IAAI,CAAC,WAAW,EAAE;AACxB,KAAI,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,UAAU;AAChC,KAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,EAAE;KACtB,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI;AACxC,GAAA;AACA,GAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE;AAClB,GAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE;AACrB,GAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE;AACnB,GAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE;GAClB,EAAE,IAAI,CAAC,UAAU;AACnB,GAAE,OAAO,IAAI;CACb,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,IAAI,GAAG,SAAS,CAAC,EAAE;AACnC,GAAE,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;CACvB,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,OAAO,GAAG,SAAS,CAAC,EAAE;GACpC,OAAO,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;CAC9B,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,UAAU,IAAI,SAAS,CAAC,EAAE;GACxC,IAAI,IAAI,GAAG,IAAI;GACf,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE;AAC7B,KAAI,IAAI,UAAU,GAAG,SAAS,CAAC,EAAE,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA,CAAE;AACxE,KAAI,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;AACzB,KAAI,IAAI,IAAI,CAAC,WAAW,EAAE;AAC1B,OAAM,IAAI,CAAC,2BAA2B,CAAC,CAAC,CAAC;AACzC,OAAM,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;AAC5B,OAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,SAAS,KAAK,EAAE;AAC/C,SAAQ,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC;AAC7B,OAAA,CAAO,CAAC;AACR,OAAM,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;AAC9B,KAAA;AACA,KAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC;AAC3C,KAAI,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;AACtB,KAAI,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;AACzB,KAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC;AAC5C,KAAI,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;AACvB,KAAI,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;KACpB,EAAE,IAAI,CAAC,UAAU;AACrB,GAAA;AACA,GAAE,OAAO,IAAI;CACb,CAAC;;CAED,KAAK,CAAC,SAAS,CAAC,SAAS,GAAG,SAAS,CAAC,EAAE,MAAM,EAAE;AAChD,GAAE,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE;AACzB,KAAI,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC;AAChE,GAAA;;AAEA,GAAE,IAAI,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE;KACzB,MAAM,GAAG,UAAU;AACvB,GAAA,CAAG,MAAM;AACT;KACI,MAAM,IAAI,EAAE;AAChB,KAAI,KAAK,IAAI,QAAQ,GAAG,MAAM;AAC9B,OAAM,CAAC,CAAC,CAAC,WAAW,CAAC,QAAQ,CAAC;OACxB,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE;AACxC,OAAM,IAAI,QAAQ,KAAK,CAAC,EAAE;SAClB,MAAM,IAAI,KAAK,CAAC,UAAU,GAAG,MAAM,EAAE,gBAAgB,GAAG,CAAC;AACjE,yBAAwB,uBAAuB,CAAC;AAChD,OAAA;AACA,KAAA;;AAEA,KAAI,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;AACxB,GAAA;;AAEA,GAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;AACjB,GAAE,IAAI,CAAC,2BAA2B,CAAC,CAAC,CAAC;AACrC,GAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,MAAM;GACxB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI;AAClC,GAAE,OAAO,IAAI;CACb,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,2BAA2B,GAAG,SAAS,CAAC,EAAE;AAC1D,GAAE,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;CAC3C,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,MAAM,GAAG,SAAS,CAAC,EAAE;AACrC,GAAE,IAAI,IAAI,CAAC,WAAW,EAAE;KACpB,IAAI,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;AAChC,KAAI,IAAI,MAAM,KAAK,UAAU,EAAE;AAC/B,OAAM,OAAO,MAAM;AACnB,KAAA;AACA,GAAA;CACA,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,QAAQ,GAAG,SAAS,CAAC,EAAE;AACvC,GAAE,IAAI,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE;KACpB,CAAC,GAAG,UAAU;AAClB,GAAA;;AAEA,GAAE,IAAI,IAAI,CAAC,WAAW,EAAE;KACpB,IAAI,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;KAChC,IAAI,QAAQ,EAAE;AAClB,OAAM,OAAO,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC;AAC7B,KAAA;AACA,GAAA,CAAG,MAAM,IAAI,CAAC,KAAK,UAAU,EAAE;AAC/B,KAAI,OAAO,IAAI,CAAC,KAAK,EAAE;GACvB,CAAG,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;AAC9B,KAAI,OAAO,EAAE;AACb,GAAA;CACA,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,YAAY,GAAG,SAAS,CAAC,EAAE;GACzC,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;GAC3B,IAAI,MAAM,EAAE;AACd,KAAI,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;AACzB,GAAA;CACA,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,UAAU,GAAG,SAAS,CAAC,EAAE;GACvC,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;GACzB,IAAI,KAAK,EAAE;AACb,KAAI,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;AACxB,GAAA;CACA,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,SAAS,GAAG,SAAS,CAAC,EAAE;GACtC,IAAI,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;GAChC,IAAI,KAAK,EAAE;AACb,KAAI,OAAO,CAAC,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;AAC7C,GAAA;CACA,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,MAAM,GAAG,UAAU,CAAC,EAAE;AACtC,GAAE,IAAI,SAAS;AACf,GAAE,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;AACzB,KAAI,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;AAClC,GAAA,CAAG,MAAM;AACT,KAAI,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;AACjC,GAAA;AACA,GAAE,OAAO,SAAS,CAAC,MAAM,KAAK,CAAC;CAC/B,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,WAAW,GAAG,SAAS,MAAM,EAAE;AAC/C,GAAE,IAAI,IAAI,GAAG,IAAI,IAAI,CAAC,WAAW,CAAC;AAClC,KAAI,QAAQ,EAAE,IAAI,CAAC,WAAW;AAC9B,KAAI,UAAU,EAAE,IAAI,CAAC,aAAa;KAC9B,QAAQ,EAAE,IAAI,CAAC;AACnB,IAAG,CAAC;;GAEF,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;;GAE3B,IAAI,IAAI,GAAG,IAAI;AACjB,GAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,SAAS,KAAK,EAAE,CAAC,EAAE;AACzC,KAAI,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE;AACnB,OAAM,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC;AAC5B,KAAA;AACA,GAAA,CAAG,CAAC;;GAEF,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC,EAAE;AACrC,KAAI,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;AAChD,OAAM,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACnC,KAAA;AACA,GAAA,CAAG,CAAC;;GAEF,IAAI,OAAO,GAAG,EAAE;AAClB,GAAE,SAAS,UAAU,CAAC,CAAC,EAAE;KACrB,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;KAC3B,IAAI,MAAM,KAAK,SAAS,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;AACtD,OAAM,OAAO,CAAC,CAAC,CAAC,GAAG,MAAM;AACzB,OAAM,OAAO,MAAM;AACnB,KAAA,CAAK,MAAM,IAAI,MAAM,IAAI,OAAO,EAAE;AAClC,OAAM,OAAO,OAAO,CAAC,MAAM,CAAC;AAC5B,KAAA,CAAK,MAAM;AACX,OAAM,OAAO,UAAU,CAAC,MAAM,CAAC;AAC/B,KAAA;AACA,GAAA;;AAEA,GAAE,IAAI,IAAI,CAAC,WAAW,EAAE;KACpB,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;OAC/B,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC;AACtC,KAAA,CAAK,CAAC;AACN,GAAA;;AAEA,GAAE,OAAO,IAAI;CACb,CAAC;;AAED;;AAEA,CAAA,KAAK,CAAC,SAAS,CAAC,mBAAmB,GAAG,SAAS,UAAU,EAAE;GACzD,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE;AACjC,KAAI,UAAU,GAAG,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC;AACvC,GAAA;AACA,GAAE,IAAI,CAAC,mBAAmB,GAAG,UAAU;AACvC,GAAE,OAAO,IAAI;CACb,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,SAAS,GAAG,WAAW;GACrC,OAAO,IAAI,CAAC,UAAU;CACxB,CAAC;;AAED,CAAA,KAAK,CAAC,SAAS,CAAC,KAAK,GAAG,WAAW;GACjC,OAAO,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC;CACjC,CAAC;;CAED,KAAK,CAAC,SAAS,CAAC,OAAO,GAAG,SAAS,EAAE,EAAE,KAAK,EAAE;GAC5C,IAAI,IAAI,GAAG,IAAI;GACf,IAAI,IAAI,GAAG,SAAS;GACpB,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,SAAS,CAAC,EAAE,CAAC,EAAE;AAC9B,KAAI,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;OACnB,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC;AAC/B,KAAA,CAAK,MAAM;AACX,OAAM,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC;AACxB,KAAA;AACA,KAAI,OAAO,CAAC;AACZ,GAAA,CAAG,CAAC;AACJ,GAAE,OAAO,IAAI;CACb,CAAC;;AAED;AACA;AACA;AACA;AACA,CAAA,KAAK,CAAC,SAAS,CAAC,OAAO,GAAG,WAAW;AACrC,GAAE,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK;GACrB,IAAI,cAAc,GAAG,KAAK;AAC5B,GAAE,IAAI,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC;;AAEzB,GAAE,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE;AAChE,KAAI,CAAC,GAAG,IAAI,CAAC,CAAC;AACd,KAAI,CAAC,GAAG,IAAI,CAAC,CAAC;AACd,KAAI,IAAI,GAAG,IAAI,CAAC,IAAI;AACpB,KAAI,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE;AAChC,OAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC;OACpB,cAAc,GAAG,IAAI;AAC3B,KAAA;AACA,GAAA,CAAG,MAAM;KACL,CAAC,GAAG,IAAI;AACZ,KAAI,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;AACpB,KAAI,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC;AACvB,KAAI,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE;AAC9B,OAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC;OACpB,cAAc,GAAG,IAAI;AAC3B,KAAA;AACA,GAAA;;AAEA,GAAE,CAAC,GAAG,EAAE,GAAG,CAAC;AACZ,GAAE,CAAC,GAAG,EAAE,GAAG,CAAC;GACV,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE;AAC5B,KAAI,IAAI,GAAG,EAAE,GAAG,IAAI;AACpB,GAAA;;AAEA,GAAE,IAAI,CAAC,GAAG,YAAY,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC;GAClD,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,EAAE;KAC9B,IAAI,cAAc,EAAE;AACxB,OAAM,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,KAAK;AACjC,KAAA;AACA,KAAI,OAAO,IAAI;AACf,GAAA;;AAEA,GAAE,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE;AACnD,KAAI,MAAM,IAAI,KAAK,CAAC,mDAAmD,CAAC;AACxE,GAAA;;AAEA;AACA;AACA,GAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;AACjB,GAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;;GAEf,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,cAAc,GAAG,KAAK,GAAG,IAAI,CAAC,mBAAmB,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC;;AAErF,GAAE,IAAI,OAAO,GAAG,aAAa,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC;AAC3D;AACA,GAAE,CAAC,GAAG,OAAO,CAAC,CAAC;AACf,GAAE,CAAC,GAAG,OAAO,CAAC,CAAC;;AAEf,GAAE,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC;AACxB,GAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,OAAO;GAC3B,oBAAoB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;GACvC,oBAAoB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;GACtC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,OAAO;GACxB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,OAAO;GACzB,IAAI,CAAC,UAAU,EAAE;AACnB,GAAE,OAAO,IAAI;CACb,CAAC;;CAED,KAAK,CAAC,SAAS,CAAC,IAAI,GAAG,SAAS,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE;AAC5C,GAAE,IAAI,CAAC,IAAI,SAAS,CAAC,MAAM,KAAK;OAC1B,WAAW,CAAC,IAAI,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC,CAAC;AAChD,OAAM,YAAY,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;AACjD,GAAE,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;CAC5B,CAAC;;CAED,KAAK,CAAC,SAAS,CAAC,OAAO,GAAG,SAAS,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE;AAC/C,GAAE,IAAI,CAAC,IAAI,SAAS,CAAC,MAAM,KAAK;OAC1B,WAAW,CAAC,IAAI,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC,CAAC;AAChD,OAAM,YAAY,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;GAC/C,OAAO,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;CACnC,CAAC;;CAED,KAAK,CAAC,SAAS,CAAC,UAAU,GAAG,SAAS,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE;AAClD,GAAE,IAAI,CAAC,IAAI,SAAS,CAAC,MAAM,KAAK;OAC1B,WAAW,CAAC,IAAI,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC,CAAC;AAChD,OAAM,YAAY,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;GAC/C,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;GAC5B,IAAI,IAAI,EAAE;AACZ,KAAI,CAAC,GAAG,IAAI,CAAC,CAAC;AACd,KAAI,CAAC,GAAG,IAAI,CAAC,CAAC;AACd,KAAI,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;AAC9B,KAAI,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;KACxB,sBAAsB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;KACzC,sBAAsB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;KACxC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KACrB,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KACtB,IAAI,CAAC,UAAU,EAAE;AACrB,GAAA;AACA,GAAE,OAAO,IAAI;CACb,CAAC;;CAED,KAAK,CAAC,SAAS,CAAC,OAAO,GAAG,SAAS,CAAC,EAAE,CAAC,EAAE;GACvC,IAAI,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;GACrB,IAAI,GAAG,EAAE;KACP,IAAI,KAAK,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC;KACzB,IAAI,CAAC,CAAC,EAAE;AACZ,OAAM,OAAO,KAAK;AAClB,KAAA;AACA,KAAI,OAAO,CAAC,CAAC,MAAM,CAAC,KAAK,EAAE,SAAS,IAAI,EAAE,EAAE,OAAO,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;AACnE,GAAA;CACA,CAAC;;CAED,KAAK,CAAC,SAAS,CAAC,QAAQ,GAAG,SAAS,CAAC,EAAE,CAAC,EAAE;GACxC,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;GACvB,IAAI,IAAI,EAAE;KACR,IAAI,KAAK,GAAG,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC;KAC1B,IAAI,CAAC,CAAC,EAAE;AACZ,OAAM,OAAO,KAAK;AAClB,KAAA;AACA,KAAI,OAAO,CAAC,CAAC,MAAM,CAAC,KAAK,EAAE,SAAS,IAAI,EAAE,EAAE,OAAO,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;AACnE,GAAA;CACA,CAAC;;CAED,KAAK,CAAC,SAAS,CAAC,SAAS,GAAG,SAAS,CAAC,EAAE,CAAC,EAAE;GACzC,IAAI,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC;GAChC,IAAI,OAAO,EAAE;AACf,KAAI,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC9C,GAAA;CACA,CAAC;;AAED,CAAA,SAAS,oBAAoB,CAAC,GAAG,EAAE,CAAC,EAAE;AACtC,GAAE,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE;AACd,KAAI,GAAG,CAAC,CAAC,CAAC,EAAE;AACZ,GAAA,CAAG,MAAM;AACT,KAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AACd,GAAA;AACA,CAAA;;AAEA,CAAA,SAAS,sBAAsB,CAAC,GAAG,EAAE,CAAC,EAAE;AACxC,GAAE,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;AACjC,CAAA;;CAEA,SAAS,YAAY,CAAC,UAAU,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE;AAChD,GAAE,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE;AACjB,GAAE,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE;AACjB,GAAE,IAAI,CAAC,UAAU,IAAI,CAAC,GAAG,CAAC,EAAE;KACxB,IAAI,GAAG,GAAG,CAAC;KACX,CAAC,GAAG,CAAC;KACL,CAAC,GAAG,GAAG;AACX,GAAA;AACA,GAAE,OAAO,CAAC,GAAG,cAAc,GAAG,CAAC,GAAG,cAAc;eAClC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,iBAAiB,GAAG,IAAI,CAAC;AAC7D,CAAA;;CAEA,SAAS,aAAa,CAAC,UAAU,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE;AACjD,GAAE,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE;AACjB,GAAE,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE;AACjB,GAAE,IAAI,CAAC,UAAU,IAAI,CAAC,GAAG,CAAC,EAAE;KACxB,IAAI,GAAG,GAAG,CAAC;KACX,CAAC,GAAG,CAAC;KACL,CAAC,GAAG,GAAG;AACX,GAAA;GACE,IAAI,OAAO,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;GAC7B,IAAI,IAAI,EAAE;AACZ,KAAI,OAAO,CAAC,IAAI,GAAG,IAAI;AACvB,GAAA;AACA,GAAE,OAAO,OAAO;AAChB,CAAA;;AAEA,CAAA,SAAS,WAAW,CAAC,UAAU,EAAE,OAAO,EAAE;AAC1C,GAAE,OAAO,YAAY,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,IAAI,CAAC;AACrE,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/index.js"],"sourcesContent":["// Includes only the \"core\" of graphlib\nmodule.exports = {\n  Graph: require(\"./graph\"),\n  version: require(\"./version\")\n};\n"],"names":["require$$0","require$$1"],"mappings":";;;;;;;;;AAAA;AACA,CAAA,GAAc,GAAG;GACf,KAAK,EAAEA,YAAA,EAAkB;AAC3B,GAAE,OAAO,EAAEC,cAAA;EACV;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/json.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"json.js","sources":["../../../../../../../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/json.js"],"sourcesContent":["var _ = require(\"./lodash\");\nvar Graph = require(\"./graph\");\n\nmodule.exports = {\n  write: write,\n  read: read\n};\n\nfunction write(g) {\n  var json = {\n    options: {\n      directed: g.isDirected(),\n      multigraph: g.isMultigraph(),\n      compound: g.isCompound()\n    },\n    nodes: writeNodes(g),\n    edges: writeEdges(g)\n  };\n  if (!_.isUndefined(g.graph())) {\n    json.value = _.clone(g.graph());\n  }\n  return json;\n}\n\nfunction writeNodes(g) {\n  return _.map(g.nodes(), function(v) {\n    var nodeValue = g.node(v);\n    var parent = g.parent(v);\n    var node = { v: v };\n    if (!_.isUndefined(nodeValue)) {\n      node.value = nodeValue;\n    }\n    if (!_.isUndefined(parent)) {\n      node.parent = parent;\n    }\n    return node;\n  });\n}\n\nfunction writeEdges(g) {\n  return _.map(g.edges(), function(e) {\n    var edgeValue = g.edge(e);\n    var edge = { v: e.v, w: e.w };\n    if (!_.isUndefined(e.name)) {\n      edge.name = e.name;\n    }\n    if (!_.isUndefined(edgeValue)) {\n      edge.value = edgeValue;\n    }\n    return edge;\n  });\n}\n\nfunction read(json) {\n  var g = new Graph(json.options).setGraph(json.value);\n  _.each(json.nodes, function(entry) {\n    g.setNode(entry.v, entry.value);\n    if (entry.parent) {\n      g.setParent(entry.v, entry.parent);\n    }\n  });\n  _.each(json.edges, function(entry) {\n    g.setEdge({ v: entry.v, w: entry.w, name: entry.name }, entry.value);\n  });\n  return g;\n}\n"],"names":["require$$0","require$$1"],"mappings":";;;;;;;;;CAAA,IAAI,CAAC,GAAGA,aAAA,EAAmB;CAC3B,IAAI,KAAK,GAAGC,YAAA,EAAkB;;AAE9B,CAAA,IAAc,GAAG;GACf,KAAK,EAAE,KAAK;AACd,GAAE,IAAI,EAAE;EACP;;CAED,SAAS,KAAK,CAAC,CAAC,EAAE;GAChB,IAAI,IAAI,GAAG;AACb,KAAI,OAAO,EAAE;AACb,OAAM,QAAQ,EAAE,CAAC,CAAC,UAAU,EAAE;AAC9B,OAAM,UAAU,EAAE,CAAC,CAAC,YAAY,EAAE;AAClC,OAAM,QAAQ,EAAE,CAAC,CAAC,UAAU;MACvB;AACL,KAAI,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC;AACxB,KAAI,KAAK,EAAE,UAAU,CAAC,CAAC;IACpB;GACD,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE;AACjC,KAAI,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;AACnC,GAAA;AACA,GAAE,OAAO,IAAI;AACb,CAAA;;CAEA,SAAS,UAAU,CAAC,CAAC,EAAE;AACvB,GAAE,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KAClC,IAAI,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;KACzB,IAAI,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;AAC5B,KAAI,IAAI,IAAI,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE;KACnB,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,SAAS,CAAC,EAAE;AACnC,OAAM,IAAI,CAAC,KAAK,GAAG,SAAS;AAC5B,KAAA;KACI,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE;AAChC,OAAM,IAAI,CAAC,MAAM,GAAG,MAAM;AAC1B,KAAA;AACA,KAAI,OAAO,IAAI;AACf,GAAA,CAAG,CAAC;AACJ,CAAA;;CAEA,SAAS,UAAU,CAAC,CAAC,EAAE;AACvB,GAAE,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KAClC,IAAI,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AAC7B,KAAI,IAAI,IAAI,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE;KAC7B,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE;AAChC,OAAM,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI;AACxB,KAAA;KACI,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,SAAS,CAAC,EAAE;AACnC,OAAM,IAAI,CAAC,KAAK,GAAG,SAAS;AAC5B,KAAA;AACA,KAAI,OAAO,IAAI;AACf,GAAA,CAAG,CAAC;AACJ,CAAA;;CAEA,SAAS,IAAI,CAAC,IAAI,EAAE;AACpB,GAAE,IAAI,CAAC,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC;GACpD,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,SAAS,KAAK,EAAE;KACjC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC;AACnC,KAAI,IAAI,KAAK,CAAC,MAAM,EAAE;OAChB,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC;AACxC,KAAA;AACA,GAAA,CAAG,CAAC;GACF,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,SAAS,KAAK,EAAE;KACjC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,EAAE,KAAK,CAAC,KAAK,CAAC;AACxE,GAAA,CAAG,CAAC;AACJ,GAAE,OAAO,CAAC;AACV,CAAA;;;;;;","x_google_ignoreList":[0]}