@antv/layout 1.2.14-beta.9 → 2.0.0-alpha.2

package/lib/node_modules/dagre/lib/position/bk.js

@@ -0,0 +1,433 @@
+import { __require as requireLodash } from '../lodash.js';
+import { __require as requireGraphlib } from '../graphlib.js';
+import { __require as requireUtil } from '../util.js';
+
+var bk;
+var hasRequiredBk;
+
+function requireBk () {
+	if (hasRequiredBk) return bk;
+	hasRequiredBk = 1;
+
+	var _ = requireLodash();
+	var Graph = requireGraphlib().Graph;
+	var util = requireUtil();
+
+	/*
+	 * This module provides coordinate assignment based on Brandes and Köpf, "Fast
+	 * and Simple Horizontal Coordinate Assignment."
+	 */
+
+	bk = {
+	  positionX: positionX,
+	  findType1Conflicts: findType1Conflicts,
+	  findType2Conflicts: findType2Conflicts,
+	  addConflict: addConflict,
+	  hasConflict: hasConflict,
+	  verticalAlignment: verticalAlignment,
+	  horizontalCompaction: horizontalCompaction,
+	  alignCoordinates: alignCoordinates,
+	  findSmallestWidthAlignment: findSmallestWidthAlignment,
+	  balance: balance
+	};
+
+	/*
+	 * Marks all edges in the graph with a type-1 conflict with the "type1Conflict"
+	 * property. A type-1 conflict is one where a non-inner segment crosses an
+	 * inner segment. An inner segment is an edge with both incident nodes marked
+	 * with the "dummy" property.
+	 *
+	 * This algorithm scans layer by layer, starting with the second, for type-1
+	 * conflicts between the current layer and the previous layer. For each layer
+	 * it scans the nodes from left to right until it reaches one that is incident
+	 * on an inner segment. It then scans predecessors to determine if they have
+	 * edges that cross that inner segment. At the end a final scan is done for all
+	 * nodes on the current rank to see if they cross the last visited inner
+	 * segment.
+	 *
+	 * This algorithm (safely) assumes that a dummy node will only be incident on a
+	 * single node in the layers being scanned.
+	 */
+	function findType1Conflicts(g, layering) {
+	  var conflicts = {};
+
+	  function visitLayer(prevLayer, layer) {
+	    var
+	      // last visited node in the previous layer that is incident on an inner
+	      // segment.
+	      k0 = 0,
+	      // Tracks the last node in this layer scanned for crossings with a type-1
+	      // segment.
+	      scanPos = 0,
+	      prevLayerLength = prevLayer.length,
+	      lastNode = _.last(layer);
+
+	    _.forEach(layer, function(v, i) {
+	      var w = findOtherInnerSegmentNode(g, v),
+	        k1 = w ? g.node(w).order : prevLayerLength;
+
+	      if (w || v === lastNode) {
+	        _.forEach(layer.slice(scanPos, i +1), function(scanNode) {
+	          _.forEach(g.predecessors(scanNode), function(u) {
+	            var uLabel = g.node(u),
+	              uPos = uLabel.order;
+	            if ((uPos < k0 || k1 < uPos) &&
+	                !(uLabel.dummy && g.node(scanNode).dummy)) {
+	              addConflict(conflicts, u, scanNode);
+	            }
+	          });
+	        });
+	        scanPos = i + 1;
+	        k0 = k1;
+	      }
+	    });
+
+	    return layer;
+	  }
+
+	  _.reduce(layering, visitLayer);
+	  return conflicts;
+	}
+
+	function findType2Conflicts(g, layering) {
+	  var conflicts = {};
+
+	  function scan(south, southPos, southEnd, prevNorthBorder, nextNorthBorder) {
+	    var v;
+	    _.forEach(_.range(southPos, southEnd), function(i) {
+	      v = south[i];
+	      if (g.node(v).dummy) {
+	        _.forEach(g.predecessors(v), function(u) {
+	          var uNode = g.node(u);
+	          if (uNode.dummy &&
+	              (uNode.order < prevNorthBorder || uNode.order > nextNorthBorder)) {
+	            addConflict(conflicts, u, v);
+	          }
+	        });
+	      }
+	    });
+	  }
+
+
+	  function visitLayer(north, south) {
+	    var prevNorthPos = -1,
+	      nextNorthPos,
+	      southPos = 0;
+
+	    _.forEach(south, function(v, southLookahead) {
+	      if (g.node(v).dummy === "border") {
+	        var predecessors = g.predecessors(v);
+	        if (predecessors.length) {
+	          nextNorthPos = g.node(predecessors[0]).order;
+	          scan(south, southPos, southLookahead, prevNorthPos, nextNorthPos);
+	          southPos = southLookahead;
+	          prevNorthPos = nextNorthPos;
+	        }
+	      }
+	      scan(south, southPos, south.length, nextNorthPos, north.length);
+	    });
+
+	    return south;
+	  }
+
+	  _.reduce(layering, visitLayer);
+	  return conflicts;
+	}
+
+	function findOtherInnerSegmentNode(g, v) {
+	  if (g.node(v).dummy) {
+	    return _.find(g.predecessors(v), function(u) {
+	      return g.node(u).dummy;
+	    });
+	  }
+	}
+
+	function addConflict(conflicts, v, w) {
+	  if (v > w) {
+	    var tmp = v;
+	    v = w;
+	    w = tmp;
+	  }
+
+	  var conflictsV = conflicts[v];
+	  if (!conflictsV) {
+	    conflicts[v] = conflictsV = {};
+	  }
+	  conflictsV[w] = true;
+	}
+
+	function hasConflict(conflicts, v, w) {
+	  if (v > w) {
+	    var tmp = v;
+	    v = w;
+	    w = tmp;
+	  }
+	  return _.has(conflicts[v], w);
+	}
+
+	/*
+	 * Try to align nodes into vertical "blocks" where possible. This algorithm
+	 * attempts to align a node with one of its median neighbors. If the edge
+	 * connecting a neighbor is a type-1 conflict then we ignore that possibility.
+	 * If a previous node has already formed a block with a node after the node
+	 * we're trying to form a block with, we also ignore that possibility - our
+	 * blocks would be split in that scenario.
+	 */
+	function verticalAlignment(g, layering, conflicts, neighborFn) {
+	  var root = {},
+	    align = {},
+	    pos = {};
+
+	  // We cache the position here based on the layering because the graph and
+	  // layering may be out of sync. The layering matrix is manipulated to
+	  // generate different extreme alignments.
+	  _.forEach(layering, function(layer) {
+	    _.forEach(layer, function(v, order) {
+	      root[v] = v;
+	      align[v] = v;
+	      pos[v] = order;
+	    });
+	  });
+
+	  _.forEach(layering, function(layer) {
+	    var prevIdx = -1;
+	    _.forEach(layer, function(v) {
+	      var ws = neighborFn(v);
+	      if (ws.length) {
+	        ws = _.sortBy(ws, function(w) { return pos[w]; });
+	        var mp = (ws.length - 1) / 2;
+	        for (var i = Math.floor(mp), il = Math.ceil(mp); i <= il; ++i) {
+	          var w = ws[i];
+	          if (align[v] === v &&
+	              prevIdx < pos[w] &&
+	              !hasConflict(conflicts, v, w)) {
+	            align[w] = v;
+	            align[v] = root[v] = root[w];
+	            prevIdx = pos[w];
+	          }
+	        }
+	      }
+	    });
+	  });
+
+	  return { root: root, align: align };
+	}
+
+	function horizontalCompaction(g, layering, root, align, reverseSep) {
+	  // This portion of the algorithm differs from BK due to a number of problems.
+	  // Instead of their algorithm we construct a new block graph and do two
+	  // sweeps. The first sweep places blocks with the smallest possible
+	  // coordinates. The second sweep removes unused space by moving blocks to the
+	  // greatest coordinates without violating separation.
+	  var xs = {},
+	    blockG = buildBlockGraph(g, layering, root, reverseSep),
+	    borderType = reverseSep ? "borderLeft" : "borderRight";
+
+	  function iterate(setXsFunc, nextNodesFunc) {
+	    var stack = blockG.nodes();
+	    var elem = stack.pop();
+	    var visited = {};
+	    while (elem) {
+	      if (visited[elem]) {
+	        setXsFunc(elem);
+	      } else {
+	        visited[elem] = true;
+	        stack.push(elem);
+	        stack = stack.concat(nextNodesFunc(elem));
+	      }
+
+	      elem = stack.pop();
+	    }
+	  }
+
+	  // First pass, assign smallest coordinates
+	  function pass1(elem) {
+	    xs[elem] = blockG.inEdges(elem).reduce(function(acc, e) {
+	      return Math.max(acc, xs[e.v] + blockG.edge(e));
+	    }, 0);
+	  }
+
+	  // Second pass, assign greatest coordinates
+	  function pass2(elem) {
+	    var min = blockG.outEdges(elem).reduce(function(acc, e) {
+	      return Math.min(acc, xs[e.w] - blockG.edge(e));
+	    }, Number.POSITIVE_INFINITY);
+
+	    var node = g.node(elem);
+	    if (min !== Number.POSITIVE_INFINITY && node.borderType !== borderType) {
+	      xs[elem] = Math.max(xs[elem], min);
+	    }
+	  }
+
+	  iterate(pass1, blockG.predecessors.bind(blockG));
+	  iterate(pass2, blockG.successors.bind(blockG));
+
+	  // Assign x coordinates to all nodes
+	  _.forEach(align, function(v) {
+	    xs[v] = xs[root[v]];
+	  });
+
+	  return xs;
+	}
+
+
+	function buildBlockGraph(g, layering, root, reverseSep) {
+	  var blockGraph = new Graph(),
+	    graphLabel = g.graph(),
+	    sepFn = sep(graphLabel.nodesep, graphLabel.edgesep, reverseSep);
+
+	  _.forEach(layering, function(layer) {
+	    var u;
+	    _.forEach(layer, function(v) {
+	      var vRoot = root[v];
+	      blockGraph.setNode(vRoot);
+	      if (u) {
+	        var uRoot = root[u],
+	          prevMax = blockGraph.edge(uRoot, vRoot);
+	        blockGraph.setEdge(uRoot, vRoot, Math.max(sepFn(g, v, u), prevMax || 0));
+	      }
+	      u = v;
+	    });
+	  });
+
+	  return blockGraph;
+	}
+
+	/*
+	 * Returns the alignment that has the smallest width of the given alignments.
+	 */
+	function findSmallestWidthAlignment(g, xss) {
+	  return _.minBy(_.values(xss), function (xs) {
+	    var max = Number.NEGATIVE_INFINITY;
+	    var min = Number.POSITIVE_INFINITY;
+
+	    _.forIn(xs, function (x, v) {
+	      var halfWidth = width(g, v) / 2;
+
+	      max = Math.max(x + halfWidth, max);
+	      min = Math.min(x - halfWidth, min);
+	    });
+
+	    return max - min;
+	  });
+	}
+
+	/*
+	 * Align the coordinates of each of the layout alignments such that
+	 * left-biased alignments have their minimum coordinate at the same point as
+	 * the minimum coordinate of the smallest width alignment and right-biased
+	 * alignments have their maximum coordinate at the same point as the maximum
+	 * coordinate of the smallest width alignment.
+	 */
+	function alignCoordinates(xss, alignTo) {
+	  var alignToVals = _.values(alignTo),
+	    alignToMin = _.min(alignToVals),
+	    alignToMax = _.max(alignToVals);
+
+	  _.forEach(["u", "d"], function(vert) {
+	    _.forEach(["l", "r"], function(horiz) {
+	      var alignment = vert + horiz,
+	        xs = xss[alignment],
+	        delta;
+	      if (xs === alignTo) return;
+
+	      var xsVals = _.values(xs);
+	      delta = horiz === "l" ? alignToMin - _.min(xsVals) : alignToMax - _.max(xsVals);
+
+	      if (delta) {
+	        xss[alignment] = _.mapValues(xs, function(x) { return x + delta; });
+	      }
+	    });
+	  });
+	}
+
+	function balance(xss, align) {
+	  return _.mapValues(xss.ul, function(ignore, v) {
+	    if (align) {
+	      return xss[align.toLowerCase()][v];
+	    } else {
+	      var xs = _.sortBy(_.map(xss, v));
+	      return (xs[1] + xs[2]) / 2;
+	    }
+	  });
+	}
+
+	function positionX(g) {
+	  var layering = util.buildLayerMatrix(g);
+	  var conflicts = _.merge(
+	    findType1Conflicts(g, layering),
+	    findType2Conflicts(g, layering));
+
+	  var xss = {};
+	  var adjustedLayering;
+	  _.forEach(["u", "d"], function(vert) {
+	    adjustedLayering = vert === "u" ? layering : _.values(layering).reverse();
+	    _.forEach(["l", "r"], function(horiz) {
+	      if (horiz === "r") {
+	        adjustedLayering = _.map(adjustedLayering, function(inner) {
+	          return _.values(inner).reverse();
+	        });
+	      }
+
+	      var neighborFn = (vert === "u" ? g.predecessors : g.successors).bind(g);
+	      var align = verticalAlignment(g, adjustedLayering, conflicts, neighborFn);
+	      var xs = horizontalCompaction(g, adjustedLayering,
+	        align.root, align.align, horiz === "r");
+	      if (horiz === "r") {
+	        xs = _.mapValues(xs, function(x) { return -x; });
+	      }
+	      xss[vert + horiz] = xs;
+	    });
+	  });
+
+	  var smallestWidth = findSmallestWidthAlignment(g, xss);
+	  alignCoordinates(xss, smallestWidth);
+	  return balance(xss, g.graph().align);
+	}
+
+	function sep(nodeSep, edgeSep, reverseSep) {
+	  return function(g, v, w) {
+	    var vLabel = g.node(v);
+	    var wLabel = g.node(w);
+	    var sum = 0;
+	    var delta;
+
+	    sum += vLabel.width / 2;
+	    if (_.has(vLabel, "labelpos")) {
+	      switch (vLabel.labelpos.toLowerCase()) {
+	      case "l": delta = -vLabel.width / 2; break;
+	      case "r": delta = vLabel.width / 2; break;
+	      }
+	    }
+	    if (delta) {
+	      sum += reverseSep ? delta : -delta;
+	    }
+	    delta = 0;
+
+	    sum += (vLabel.dummy ? edgeSep : nodeSep) / 2;
+	    sum += (wLabel.dummy ? edgeSep : nodeSep) / 2;
+
+	    sum += wLabel.width / 2;
+	    if (_.has(wLabel, "labelpos")) {
+	      switch (wLabel.labelpos.toLowerCase()) {
+	      case "l": delta = wLabel.width / 2; break;
+	      case "r": delta = -wLabel.width / 2; break;
+	      }
+	    }
+	    if (delta) {
+	      sum += reverseSep ? delta : -delta;
+	    }
+	    delta = 0;
+
+	    return sum;
+	  };
+	}
+
+	function width(g, v) {
+	  return g.node(v).width;
+	}
+	return bk;
+}
+
+export { requireBk as __require };
+//# sourceMappingURL=bk.js.map

package/lib/node_modules/dagre/lib/position/bk.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bk.js","sources":["../../../../../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/dagre/lib/position/index.js

@@ -0,0 +1,43 @@
+import { __require as requireLodash } from '../lodash.js';
+import { __require as requireUtil } from '../util.js';
+import { __require as requireBk } from './bk.js';
+
+var position_1;
+var hasRequiredPosition;
+
+function requirePosition () {
+	if (hasRequiredPosition) return position_1;
+	hasRequiredPosition = 1;
+
+	var _ = requireLodash();
+	var util = requireUtil();
+	var positionX = requireBk().positionX;
+
+	position_1 = position;
+
+	function position(g) {
+	  g = util.asNonCompoundGraph(g);
+
+	  positionY(g);
+	  _.forEach(positionX(g), function(x, v) {
+	    g.node(v).x = x;
+	  });
+	}
+
+	function positionY(g) {
+	  var layering = util.buildLayerMatrix(g);
+	  var rankSep = g.graph().ranksep;
+	  var prevY = 0;
+	  _.forEach(layering, function(layer) {
+	    var maxHeight = _.max(_.map(layer, function(v) { return g.node(v).height; }));
+	    _.forEach(layer, function(v) {
+	      g.node(v).y = prevY + maxHeight / 2;
+	    });
+	    prevY += maxHeight + rankSep;
+	  });
+	}
+	return position_1;
+}
+
+export { requirePosition as __require };
+//# sourceMappingURL=index.js.map

package/lib/node_modules/dagre/lib/position/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../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/dagre/lib/rank/feasible-tree.js

@@ -0,0 +1,103 @@
+import { __require as requireLodash } from '../lodash.js';
+import { __require as requireGraphlib } from '../graphlib.js';
+import { __require as requireUtil } from './util.js';
+
+var feasibleTree_1;
+var hasRequiredFeasibleTree;
+
+function requireFeasibleTree () {
+	if (hasRequiredFeasibleTree) return feasibleTree_1;
+	hasRequiredFeasibleTree = 1;
+
+	var _ = requireLodash();
+	var Graph = requireGraphlib().Graph;
+	var slack = requireUtil().slack;
+
+	feasibleTree_1 = feasibleTree;
+
+	/*
+	 * Constructs a spanning tree with tight edges and adjusted the input node's
+	 * ranks to achieve this. A tight edge is one that is has a length that matches
+	 * its "minlen" attribute.
+	 *
+	 * The basic structure for this function is derived from Gansner, et al., "A
+	 * Technique for Drawing Directed Graphs."
+	 *
+	 * Pre-conditions:
+	 *
+	 *    1. Graph must be a DAG.
+	 *    2. Graph must be connected.
+	 *    3. Graph must have at least one node.
+	 *    5. Graph nodes must have been previously assigned a "rank" property that
+	 *       respects the "minlen" property of incident edges.
+	 *    6. Graph edges must have a "minlen" property.
+	 *
+	 * Post-conditions:
+	 *
+	 *    - Graph nodes will have their rank adjusted to ensure that all edges are
+	 *      tight.
+	 *
+	 * Returns a tree (undirected graph) that is constructed using only "tight"
+	 * edges.
+	 */
+	function feasibleTree(g) {
+	  var t = new Graph({ directed: false });
+
+	  // Choose arbitrary node from which to start our tree
+	  var start = g.nodes()[0];
+	  var size = g.nodeCount();
+	  t.setNode(start, {});
+
+	  var edge, delta;
+	  while (tightTree(t, g) < size) {
+	    edge = findMinSlackEdge(t, g);
+	    delta = t.hasNode(edge.v) ? slack(g, edge) : -slack(g, edge);
+	    shiftRanks(t, g, delta);
+	  }
+
+	  return t;
+	}
+
+	/*
+	 * Finds a maximal tree of tight edges and returns the number of nodes in the
+	 * tree.
+	 */
+	function tightTree(t, g) {
+	  function dfs(v) {
+	    _.forEach(g.nodeEdges(v), function(e) {
+	      var edgeV = e.v,
+	        w = (v === edgeV) ? e.w : edgeV;
+	      if (!t.hasNode(w) && !slack(g, e)) {
+	        t.setNode(w, {});
+	        t.setEdge(v, w, {});
+	        dfs(w);
+	      }
+	    });
+	  }
+
+	  _.forEach(t.nodes(), dfs);
+	  return t.nodeCount();
+	}
+
+	/*
+	 * Finds the edge with the smallest slack that is incident on tree and returns
+	 * it.
+	 */
+	function findMinSlackEdge(t, g) {
+	  return _.minBy(g.edges(), function(e) {
+	    if (t.hasNode(e.v) !== t.hasNode(e.w)) {
+	      return slack(g, e);
+	    }
+	  });
+	}
+
+	function shiftRanks(t, g, delta) {
+	  _.forEach(t.nodes(), function(v) {
+	    g.node(v).rank += delta;
+	  });
+	}
+	return feasibleTree_1;
+}
+
+export { requireFeasibleTree as __require };
+//# sourceMappingURL=feasible-tree.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"feasible-tree.js","sources":["../../../../../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]}