@antv/layout 2.0.0-beta.2 → 2.0.1

package/lib/node_modules/dagre/lib/greedy-fas.js

@@ -1,133 +0,0 @@
-import { __require as requireLodash } from './lodash.js';
-import { __require as requireGraphlib } from './graphlib.js';
-import { __require as requireList } from './data/list.js';
-
-var greedyFas;
-var hasRequiredGreedyFas;
-
-function requireGreedyFas () {
-	if (hasRequiredGreedyFas) return greedyFas;
-	hasRequiredGreedyFas = 1;
-	var _ = requireLodash();
-	var Graph = requireGraphlib().Graph;
-	var List = requireList();
-
-	/*
-	 * A greedy heuristic for finding a feedback arc set for a graph. A feedback
-	 * arc set is a set of edges that can be removed to make a graph acyclic.
-	 * The algorithm comes from: P. Eades, X. Lin, and W. F. Smyth, "A fast and
-	 * effective heuristic for the feedback arc set problem." This implementation
-	 * adjusts that from the paper to allow for weighted edges.
-	 */
-	greedyFas = greedyFAS;
-
-	var DEFAULT_WEIGHT_FN = _.constant(1);
-
-	function greedyFAS(g, weightFn) {
-	  if (g.nodeCount() <= 1) {
-	    return [];
-	  }
-	  var state = buildState(g, weightFn || DEFAULT_WEIGHT_FN);
-	  var results = doGreedyFAS(state.graph, state.buckets, state.zeroIdx);
-
-	  // Expand multi-edges
-	  return _.flatten(_.map(results, function(e) {
-	    return g.outEdges(e.v, e.w);
-	  }), true);
-	}
-
-	function doGreedyFAS(g, buckets, zeroIdx) {
-	  var results = [];
-	  var sources = buckets[buckets.length - 1];
-	  var sinks = buckets[0];
-
-	  var entry;
-	  while (g.nodeCount()) {
-	    while ((entry = sinks.dequeue()))   { removeNode(g, buckets, zeroIdx, entry); }
-	    while ((entry = sources.dequeue())) { removeNode(g, buckets, zeroIdx, entry); }
-	    if (g.nodeCount()) {
-	      for (var i = buckets.length - 2; i > 0; --i) {
-	        entry = buckets[i].dequeue();
-	        if (entry) {
-	          results = results.concat(removeNode(g, buckets, zeroIdx, entry, true));
-	          break;
-	        }
-	      }
-	    }
-	  }
-
-	  return results;
-	}
-
-	function removeNode(g, buckets, zeroIdx, entry, collectPredecessors) {
-	  var results = collectPredecessors ? [] : undefined;
-
-	  _.forEach(g.inEdges(entry.v), function(edge) {
-	    var weight = g.edge(edge);
-	    var uEntry = g.node(edge.v);
-
-	    if (collectPredecessors) {
-	      results.push({ v: edge.v, w: edge.w });
-	    }
-
-	    uEntry.out -= weight;
-	    assignBucket(buckets, zeroIdx, uEntry);
-	  });
-
-	  _.forEach(g.outEdges(entry.v), function(edge) {
-	    var weight = g.edge(edge);
-	    var w = edge.w;
-	    var wEntry = g.node(w);
-	    wEntry["in"] -= weight;
-	    assignBucket(buckets, zeroIdx, wEntry);
-	  });
-
-	  g.removeNode(entry.v);
-
-	  return results;
-	}
-
-	function buildState(g, weightFn) {
-	  var fasGraph = new Graph();
-	  var maxIn = 0;
-	  var maxOut = 0;
-
-	  _.forEach(g.nodes(), function(v) {
-	    fasGraph.setNode(v, { v: v, "in": 0, out: 0 });
-	  });
-
-	  // Aggregate weights on nodes, but also sum the weights across multi-edges
-	  // into a single edge for the fasGraph.
-	  _.forEach(g.edges(), function(e) {
-	    var prevWeight = fasGraph.edge(e.v, e.w) || 0;
-	    var weight = weightFn(e);
-	    var edgeWeight = prevWeight + weight;
-	    fasGraph.setEdge(e.v, e.w, edgeWeight);
-	    maxOut = Math.max(maxOut, fasGraph.node(e.v).out += weight);
-	    maxIn  = Math.max(maxIn,  fasGraph.node(e.w)["in"]  += weight);
-	  });
-
-	  var buckets = _.range(maxOut + maxIn + 3).map(function() { return new List(); });
-	  var zeroIdx = maxIn + 1;
-
-	  _.forEach(fasGraph.nodes(), function(v) {
-	    assignBucket(buckets, zeroIdx, fasGraph.node(v));
-	  });
-
-	  return { graph: fasGraph, buckets: buckets, zeroIdx: zeroIdx };
-	}
-
-	function assignBucket(buckets, zeroIdx, entry) {
-	  if (!entry.out) {
-	    buckets[0].enqueue(entry);
-	  } else if (!entry["in"]) {
-	    buckets[buckets.length - 1].enqueue(entry);
-	  } else {
-	    buckets[entry.out - entry["in"] + zeroIdx].enqueue(entry);
-	  }
-	}
-	return greedyFas;
-}
-
-export { requireGreedyFas as __require };
-//# sourceMappingURL=greedy-fas.js.map

package/lib/node_modules/dagre/lib/greedy-fas.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"greedy-fas.js","sources":["../../../../node_modules/dagre/lib/greedy-fas.js"],"sourcesContent":["var _ = require(\"./lodash\");\nvar Graph = require(\"./graphlib\").Graph;\nvar List = require(\"./data/list\");\n\n/*\n * A greedy heuristic for finding a feedback arc set for a graph. A feedback\n * arc set is a set of edges that can be removed to make a graph acyclic.\n * The algorithm comes from: P. Eades, X. Lin, and W. F. Smyth, \"A fast and\n * effective heuristic for the feedback arc set problem.\" This implementation\n * adjusts that from the paper to allow for weighted edges.\n */\nmodule.exports = greedyFAS;\n\nvar DEFAULT_WEIGHT_FN = _.constant(1);\n\nfunction greedyFAS(g, weightFn) {\n  if (g.nodeCount() <= 1) {\n    return [];\n  }\n  var state = buildState(g, weightFn || DEFAULT_WEIGHT_FN);\n  var results = doGreedyFAS(state.graph, state.buckets, state.zeroIdx);\n\n  // Expand multi-edges\n  return _.flatten(_.map(results, function(e) {\n    return g.outEdges(e.v, e.w);\n  }), true);\n}\n\nfunction doGreedyFAS(g, buckets, zeroIdx) {\n  var results = [];\n  var sources = buckets[buckets.length - 1];\n  var sinks = buckets[0];\n\n  var entry;\n  while (g.nodeCount()) {\n    while ((entry = sinks.dequeue()))   { removeNode(g, buckets, zeroIdx, entry); }\n    while ((entry = sources.dequeue())) { removeNode(g, buckets, zeroIdx, entry); }\n    if (g.nodeCount()) {\n      for (var i = buckets.length - 2; i > 0; --i) {\n        entry = buckets[i].dequeue();\n        if (entry) {\n          results = results.concat(removeNode(g, buckets, zeroIdx, entry, true));\n          break;\n        }\n      }\n    }\n  }\n\n  return results;\n}\n\nfunction removeNode(g, buckets, zeroIdx, entry, collectPredecessors) {\n  var results = collectPredecessors ? [] : undefined;\n\n  _.forEach(g.inEdges(entry.v), function(edge) {\n    var weight = g.edge(edge);\n    var uEntry = g.node(edge.v);\n\n    if (collectPredecessors) {\n      results.push({ v: edge.v, w: edge.w });\n    }\n\n    uEntry.out -= weight;\n    assignBucket(buckets, zeroIdx, uEntry);\n  });\n\n  _.forEach(g.outEdges(entry.v), function(edge) {\n    var weight = g.edge(edge);\n    var w = edge.w;\n    var wEntry = g.node(w);\n    wEntry[\"in\"] -= weight;\n    assignBucket(buckets, zeroIdx, wEntry);\n  });\n\n  g.removeNode(entry.v);\n\n  return results;\n}\n\nfunction buildState(g, weightFn) {\n  var fasGraph = new Graph();\n  var maxIn = 0;\n  var maxOut = 0;\n\n  _.forEach(g.nodes(), function(v) {\n    fasGraph.setNode(v, { v: v, \"in\": 0, out: 0 });\n  });\n\n  // Aggregate weights on nodes, but also sum the weights across multi-edges\n  // into a single edge for the fasGraph.\n  _.forEach(g.edges(), function(e) {\n    var prevWeight = fasGraph.edge(e.v, e.w) || 0;\n    var weight = weightFn(e);\n    var edgeWeight = prevWeight + weight;\n    fasGraph.setEdge(e.v, e.w, edgeWeight);\n    maxOut = Math.max(maxOut, fasGraph.node(e.v).out += weight);\n    maxIn  = Math.max(maxIn,  fasGraph.node(e.w)[\"in\"]  += weight);\n  });\n\n  var buckets = _.range(maxOut + maxIn + 3).map(function() { return new List(); });\n  var zeroIdx = maxIn + 1;\n\n  _.forEach(fasGraph.nodes(), function(v) {\n    assignBucket(buckets, zeroIdx, fasGraph.node(v));\n  });\n\n  return { graph: fasGraph, buckets: buckets, zeroIdx: zeroIdx };\n}\n\nfunction assignBucket(buckets, zeroIdx, entry) {\n  if (!entry.out) {\n    buckets[0].enqueue(entry);\n  } else if (!entry[\"in\"]) {\n    buckets[buckets.length - 1].enqueue(entry);\n  } else {\n    buckets[entry.out - entry[\"in\"] + zeroIdx].enqueue(entry);\n  }\n}\n"],"names":["require$$0","require$$1","require$$2"],"mappings":";;;;;;;;;;CAAA,IAAI,CAAC,GAAGA,aAAA,EAAmB;AAC3B,CAAA,IAAI,KAAK,GAAGC,eAAA,EAAqB,CAAC,KAAK;CACvC,IAAI,IAAI,GAAGC,WAAA,EAAsB;;AAEjC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAc,GAAG,SAAS;;AAE1B,CAAA,IAAI,iBAAiB,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;;AAErC,CAAA,SAAS,SAAS,CAAC,CAAC,EAAE,QAAQ,EAAE;AAChC,GAAE,IAAI,CAAC,CAAC,SAAS,EAAE,IAAI,CAAC,EAAE;AAC1B,KAAI,OAAO,EAAE;AACb,GAAA;GACE,IAAI,KAAK,GAAG,UAAU,CAAC,CAAC,EAAE,QAAQ,IAAI,iBAAiB,CAAC;AAC1D,GAAE,IAAI,OAAO,GAAG,WAAW,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC;;AAEtE;AACA,GAAE,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,SAAS,CAAC,EAAE;AAC9C,KAAI,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;GAC/B,CAAG,CAAC,EAAE,IAAI,CAAC;AACX,CAAA;;AAEA,CAAA,SAAS,WAAW,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE;GACxC,IAAI,OAAO,GAAG,EAAE;GAChB,IAAI,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;AAC3C,GAAE,IAAI,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC;;AAExB,GAAE,IAAI,KAAK;AACX,GAAE,OAAO,CAAC,CAAC,SAAS,EAAE,EAAE;AACxB,KAAI,QAAQ,KAAK,GAAG,KAAK,CAAC,OAAO,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,CAAA;AACjF,KAAI,QAAQ,KAAK,GAAG,OAAO,CAAC,OAAO,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,CAAA;AACjF,KAAI,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE;AACvB,OAAM,KAAK,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE;SAC3C,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE;SAC5B,IAAI,KAAK,EAAE;AACnB,WAAU,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;WACtE;AACV,SAAA;AACA,OAAA;AACA,KAAA;AACA,GAAA;;AAEA,GAAE,OAAO,OAAO;AAChB,CAAA;;CAEA,SAAS,UAAU,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,mBAAmB,EAAE;AACrE,GAAE,IAAI,OAAO,GAAG,mBAAmB,GAAG,EAAE,GAAG,SAAS;;AAEpD,GAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,SAAS,IAAI,EAAE;KAC3C,IAAI,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;KACzB,IAAI,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;;KAE3B,IAAI,mBAAmB,EAAE;AAC7B,OAAM,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC;AAC5C,KAAA;;AAEA,KAAI,MAAM,CAAC,GAAG,IAAI,MAAM;AACxB,KAAI,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,MAAM,CAAC;AAC1C,GAAA,CAAG,CAAC;;AAEJ,GAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,SAAS,IAAI,EAAE;KAC5C,IAAI,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;AAC7B,KAAI,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;KACd,IAAI,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AAC1B,KAAI,MAAM,CAAC,IAAI,CAAC,IAAI,MAAM;AAC1B,KAAI,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,MAAM,CAAC;AAC1C,GAAA,CAAG,CAAC;;AAEJ,GAAE,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC;;AAEvB,GAAE,OAAO,OAAO;AAChB,CAAA;;AAEA,CAAA,SAAS,UAAU,CAAC,CAAC,EAAE,QAAQ,EAAE;AACjC,GAAE,IAAI,QAAQ,GAAG,IAAI,KAAK,EAAE;GAC1B,IAAI,KAAK,GAAG,CAAC;GACb,IAAI,MAAM,GAAG,CAAC;;GAEd,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;AACnC,KAAI,QAAQ,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;AAClD,GAAA,CAAG,CAAC;;AAEJ;AACA;GACE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;AACnC,KAAI,IAAI,UAAU,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AACjD,KAAI,IAAI,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC;AAC5B,KAAI,IAAI,UAAU,GAAG,UAAU,GAAG,MAAM;AACxC,KAAI,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC;KACtC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,MAAM,CAAC;KAC3D,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,MAAM,CAAC;AAClE,GAAA,CAAG,CAAC;;GAEF,IAAI,OAAO,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,WAAW,EAAE,OAAO,IAAI,IAAI,EAAE,CAAC,CAAA,CAAE,CAAC;AAClF,GAAE,IAAI,OAAO,GAAG,KAAK,GAAG,CAAC;;GAEvB,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;AAC1C,KAAI,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACpD,GAAA,CAAG,CAAC;;AAEJ,GAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE;AAChE,CAAA;;AAEA,CAAA,SAAS,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE;AAC/C,GAAE,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE;KACd,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC;AAC7B,GAAA,CAAG,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE;AAC3B,KAAI,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC;AAC9C,GAAA,CAAG,MAAM;AACT,KAAI,OAAO,CAAC,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC;AAC7D,GAAA;AACA,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/dagre/lib/layout.js

@@ -1,415 +0,0 @@
-import { __require as requireLodash } from './lodash.js';
-import { __require as requireAcyclic } from './acyclic.js';
-import { __require as requireNormalize } from './normalize.js';
-import { __require as requireRank } from './rank/index.js';
-import { __require as requireUtil } from './util.js';
-import { __require as requireParentDummyChains } from './parent-dummy-chains.js';
-import { __require as requireNestingGraph } from './nesting-graph.js';
-import { __require as requireAddBorderSegments } from './add-border-segments.js';
-import { __require as requireCoordinateSystem } from './coordinate-system.js';
-import { __require as requireOrder } from './order/index.js';
-import { __require as requirePosition } from './position/index.js';
-import { __require as requireGraphlib } from './graphlib.js';
-
-var layout_1;
-var hasRequiredLayout;
-
-function requireLayout () {
-	if (hasRequiredLayout) return layout_1;
-	hasRequiredLayout = 1;
-
-	var _ = requireLodash();
-	var acyclic = requireAcyclic();
-	var normalize = requireNormalize();
-	var rank = requireRank();
-	var normalizeRanks = requireUtil().normalizeRanks;
-	var parentDummyChains = requireParentDummyChains();
-	var removeEmptyRanks = requireUtil().removeEmptyRanks;
-	var nestingGraph = requireNestingGraph();
-	var addBorderSegments = requireAddBorderSegments();
-	var coordinateSystem = requireCoordinateSystem();
-	var order = requireOrder();
-	var position = requirePosition();
-	var util = requireUtil();
-	var Graph = requireGraphlib().Graph;
-
-	layout_1 = layout;
-
-	function layout(g, opts) {
-	  var time = opts && opts.debugTiming ? util.time : util.notime;
-	  time("layout", function() {
-	    var layoutGraph = 
-	      time("  buildLayoutGraph", function() { return buildLayoutGraph(g); });
-	    time("  runLayout",        function() { runLayout(layoutGraph, time); });
-	    time("  updateInputGraph", function() { updateInputGraph(g, layoutGraph); });
-	  });
-	}
-
-	function runLayout(g, time) {
-	  time("    makeSpaceForEdgeLabels", function() { makeSpaceForEdgeLabels(g); });
-	  time("    removeSelfEdges",        function() { removeSelfEdges(g); });
-	  time("    acyclic",                function() { acyclic.run(g); });
-	  time("    nestingGraph.run",       function() { nestingGraph.run(g); });
-	  time("    rank",                   function() { rank(util.asNonCompoundGraph(g)); });
-	  time("    injectEdgeLabelProxies", function() { injectEdgeLabelProxies(g); });
-	  time("    removeEmptyRanks",       function() { removeEmptyRanks(g); });
-	  time("    nestingGraph.cleanup",   function() { nestingGraph.cleanup(g); });
-	  time("    normalizeRanks",         function() { normalizeRanks(g); });
-	  time("    assignRankMinMax",       function() { assignRankMinMax(g); });
-	  time("    removeEdgeLabelProxies", function() { removeEdgeLabelProxies(g); });
-	  time("    normalize.run",          function() { normalize.run(g); });
-	  time("    parentDummyChains",      function() { parentDummyChains(g); });
-	  time("    addBorderSegments",      function() { addBorderSegments(g); });
-	  time("    order",                  function() { order(g); });
-	  time("    insertSelfEdges",        function() { insertSelfEdges(g); });
-	  time("    adjustCoordinateSystem", function() { coordinateSystem.adjust(g); });
-	  time("    position",               function() { position(g); });
-	  time("    positionSelfEdges",      function() { positionSelfEdges(g); });
-	  time("    removeBorderNodes",      function() { removeBorderNodes(g); });
-	  time("    normalize.undo",         function() { normalize.undo(g); });
-	  time("    fixupEdgeLabelCoords",   function() { fixupEdgeLabelCoords(g); });
-	  time("    undoCoordinateSystem",   function() { coordinateSystem.undo(g); });
-	  time("    translateGraph",         function() { translateGraph(g); });
-	  time("    assignNodeIntersects",   function() { assignNodeIntersects(g); });
-	  time("    reversePoints",          function() { reversePointsForReversedEdges(g); });
-	  time("    acyclic.undo",           function() { acyclic.undo(g); });
-	}
-
-	/*
-	 * Copies final layout information from the layout graph back to the input
-	 * graph. This process only copies whitelisted attributes from the layout graph
-	 * to the input graph, so it serves as a good place to determine what
-	 * attributes can influence layout.
-	 */
-	function updateInputGraph(inputGraph, layoutGraph) {
-	  _.forEach(inputGraph.nodes(), function(v) {
-	    var inputLabel = inputGraph.node(v);
-	    var layoutLabel = layoutGraph.node(v);
-
-	    if (inputLabel) {
-	      inputLabel.x = layoutLabel.x;
-	      inputLabel.y = layoutLabel.y;
-
-	      if (layoutGraph.children(v).length) {
-	        inputLabel.width = layoutLabel.width;
-	        inputLabel.height = layoutLabel.height;
-	      }
-	    }
-	  });
-
-	  _.forEach(inputGraph.edges(), function(e) {
-	    var inputLabel = inputGraph.edge(e);
-	    var layoutLabel = layoutGraph.edge(e);
-
-	    inputLabel.points = layoutLabel.points;
-	    if (_.has(layoutLabel, "x")) {
-	      inputLabel.x = layoutLabel.x;
-	      inputLabel.y = layoutLabel.y;
-	    }
-	  });
-
-	  inputGraph.graph().width = layoutGraph.graph().width;
-	  inputGraph.graph().height = layoutGraph.graph().height;
-	}
-
-	var graphNumAttrs = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"];
-	var graphDefaults = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" };
-	var graphAttrs = ["acyclicer", "ranker", "rankdir", "align"];
-	var nodeNumAttrs = ["width", "height"];
-	var nodeDefaults = { width: 0, height: 0 };
-	var edgeNumAttrs = ["minlen", "weight", "width", "height", "labeloffset"];
-	var edgeDefaults = {
-	  minlen: 1, weight: 1, width: 0, height: 0,
-	  labeloffset: 10, labelpos: "r"
-	};
-	var edgeAttrs = ["labelpos"];
-
-	/*
-	 * Constructs a new graph from the input graph, which can be used for layout.
-	 * This process copies only whitelisted attributes from the input graph to the
-	 * layout graph. Thus this function serves as a good place to determine what
-	 * attributes can influence layout.
-	 */
-	function buildLayoutGraph(inputGraph) {
-	  var g = new Graph({ multigraph: true, compound: true });
-	  var graph = canonicalize(inputGraph.graph());
-
-	  g.setGraph(_.merge({},
-	    graphDefaults,
-	    selectNumberAttrs(graph, graphNumAttrs),
-	    _.pick(graph, graphAttrs)));
-
-	  _.forEach(inputGraph.nodes(), function(v) {
-	    var node = canonicalize(inputGraph.node(v));
-	    g.setNode(v, _.defaults(selectNumberAttrs(node, nodeNumAttrs), nodeDefaults));
-	    g.setParent(v, inputGraph.parent(v));
-	  });
-
-	  _.forEach(inputGraph.edges(), function(e) {
-	    var edge = canonicalize(inputGraph.edge(e));
-	    g.setEdge(e, _.merge({},
-	      edgeDefaults,
-	      selectNumberAttrs(edge, edgeNumAttrs),
-	      _.pick(edge, edgeAttrs)));
-	  });
-
-	  return g;
-	}
-
-	/*
-	 * This idea comes from the Gansner paper: to account for edge labels in our
-	 * layout we split each rank in half by doubling minlen and halving ranksep.
-	 * Then we can place labels at these mid-points between nodes.
-	 *
-	 * We also add some minimal padding to the width to push the label for the edge
-	 * away from the edge itself a bit.
-	 */
-	function makeSpaceForEdgeLabels(g) {
-	  var graph = g.graph();
-	  graph.ranksep /= 2;
-	  _.forEach(g.edges(), function(e) {
-	    var edge = g.edge(e);
-	    edge.minlen *= 2;
-	    if (edge.labelpos.toLowerCase() !== "c") {
-	      if (graph.rankdir === "TB" || graph.rankdir === "BT") {
-	        edge.width += edge.labeloffset;
-	      } else {
-	        edge.height += edge.labeloffset;
-	      }
-	    }
-	  });
-	}
-
-	/*
-	 * Creates temporary dummy nodes that capture the rank in which each edge's
-	 * label is going to, if it has one of non-zero width and height. We do this
-	 * so that we can safely remove empty ranks while preserving balance for the
-	 * label's position.
-	 */
-	function injectEdgeLabelProxies(g) {
-	  _.forEach(g.edges(), function(e) {
-	    var edge = g.edge(e);
-	    if (edge.width && edge.height) {
-	      var v = g.node(e.v);
-	      var w = g.node(e.w);
-	      var label = { rank: (w.rank - v.rank) / 2 + v.rank, e: e };
-	      util.addDummyNode(g, "edge-proxy", label, "_ep");
-	    }
-	  });
-	}
-
-	function assignRankMinMax(g) {
-	  var maxRank = 0;
-	  _.forEach(g.nodes(), function(v) {
-	    var node = g.node(v);
-	    if (node.borderTop) {
-	      node.minRank = g.node(node.borderTop).rank;
-	      node.maxRank = g.node(node.borderBottom).rank;
-	      maxRank = _.max(maxRank, node.maxRank);
-	    }
-	  });
-	  g.graph().maxRank = maxRank;
-	}
-
-	function removeEdgeLabelProxies(g) {
-	  _.forEach(g.nodes(), function(v) {
-	    var node = g.node(v);
-	    if (node.dummy === "edge-proxy") {
-	      g.edge(node.e).labelRank = node.rank;
-	      g.removeNode(v);
-	    }
-	  });
-	}
-
-	function translateGraph(g) {
-	  var minX = Number.POSITIVE_INFINITY;
-	  var maxX = 0;
-	  var minY = Number.POSITIVE_INFINITY;
-	  var maxY = 0;
-	  var graphLabel = g.graph();
-	  var marginX = graphLabel.marginx || 0;
-	  var marginY = graphLabel.marginy || 0;
-
-	  function getExtremes(attrs) {
-	    var x = attrs.x;
-	    var y = attrs.y;
-	    var w = attrs.width;
-	    var h = attrs.height;
-	    minX = Math.min(minX, x - w / 2);
-	    maxX = Math.max(maxX, x + w / 2);
-	    minY = Math.min(minY, y - h / 2);
-	    maxY = Math.max(maxY, y + h / 2);
-	  }
-
-	  _.forEach(g.nodes(), function(v) { getExtremes(g.node(v)); });
-	  _.forEach(g.edges(), function(e) {
-	    var edge = g.edge(e);
-	    if (_.has(edge, "x")) {
-	      getExtremes(edge);
-	    }
-	  });
-
-	  minX -= marginX;
-	  minY -= marginY;
-
-	  _.forEach(g.nodes(), function(v) {
-	    var node = g.node(v);
-	    node.x -= minX;
-	    node.y -= minY;
-	  });
-
-	  _.forEach(g.edges(), function(e) {
-	    var edge = g.edge(e);
-	    _.forEach(edge.points, function(p) {
-	      p.x -= minX;
-	      p.y -= minY;
-	    });
-	    if (_.has(edge, "x")) { edge.x -= minX; }
-	    if (_.has(edge, "y")) { edge.y -= minY; }
-	  });
-
-	  graphLabel.width = maxX - minX + marginX;
-	  graphLabel.height = maxY - minY + marginY;
-	}
-
-	function assignNodeIntersects(g) {
-	  _.forEach(g.edges(), function(e) {
-	    var edge = g.edge(e);
-	    var nodeV = g.node(e.v);
-	    var nodeW = g.node(e.w);
-	    var p1, p2;
-	    if (!edge.points) {
-	      edge.points = [];
-	      p1 = nodeW;
-	      p2 = nodeV;
-	    } else {
-	      p1 = edge.points[0];
-	      p2 = edge.points[edge.points.length - 1];
-	    }
-	    edge.points.unshift(util.intersectRect(nodeV, p1));
-	    edge.points.push(util.intersectRect(nodeW, p2));
-	  });
-	}
-
-	function fixupEdgeLabelCoords(g) {
-	  _.forEach(g.edges(), function(e) {
-	    var edge = g.edge(e);
-	    if (_.has(edge, "x")) {
-	      if (edge.labelpos === "l" || edge.labelpos === "r") {
-	        edge.width -= edge.labeloffset;
-	      }
-	      switch (edge.labelpos) {
-	      case "l": edge.x -= edge.width / 2 + edge.labeloffset; break;
-	      case "r": edge.x += edge.width / 2 + edge.labeloffset; break;
-	      }
-	    }
-	  });
-	}
-
-	function reversePointsForReversedEdges(g) {
-	  _.forEach(g.edges(), function(e) {
-	    var edge = g.edge(e);
-	    if (edge.reversed) {
-	      edge.points.reverse();
-	    }
-	  });
-	}
-
-	function removeBorderNodes(g) {
-	  _.forEach(g.nodes(), function(v) {
-	    if (g.children(v).length) {
-	      var node = g.node(v);
-	      var t = g.node(node.borderTop);
-	      var b = g.node(node.borderBottom);
-	      var l = g.node(_.last(node.borderLeft));
-	      var r = g.node(_.last(node.borderRight));
-
-	      node.width = Math.abs(r.x - l.x);
-	      node.height = Math.abs(b.y - t.y);
-	      node.x = l.x + node.width / 2;
-	      node.y = t.y + node.height / 2;
-	    }
-	  });
-
-	  _.forEach(g.nodes(), function(v) {
-	    if (g.node(v).dummy === "border") {
-	      g.removeNode(v);
-	    }
-	  });
-	}
-
-	function removeSelfEdges(g) {
-	  _.forEach(g.edges(), function(e) {
-	    if (e.v === e.w) {
-	      var node = g.node(e.v);
-	      if (!node.selfEdges) {
-	        node.selfEdges = [];
-	      }
-	      node.selfEdges.push({ e: e, label: g.edge(e) });
-	      g.removeEdge(e);
-	    }
-	  });
-	}
-
-	function insertSelfEdges(g) {
-	  var layers = util.buildLayerMatrix(g);
-	  _.forEach(layers, function(layer) {
-	    var orderShift = 0;
-	    _.forEach(layer, function(v, i) {
-	      var node = g.node(v);
-	      node.order = i + orderShift;
-	      _.forEach(node.selfEdges, function(selfEdge) {
-	        util.addDummyNode(g, "selfedge", {
-	          width: selfEdge.label.width,
-	          height: selfEdge.label.height,
-	          rank: node.rank,
-	          order: i + (++orderShift),
-	          e: selfEdge.e,
-	          label: selfEdge.label
-	        }, "_se");
-	      });
-	      delete node.selfEdges;
-	    });
-	  });
-	}
-
-	function positionSelfEdges(g) {
-	  _.forEach(g.nodes(), function(v) {
-	    var node = g.node(v);
-	    if (node.dummy === "selfedge") {
-	      var selfNode = g.node(node.e.v);
-	      var x = selfNode.x + selfNode.width / 2;
-	      var y = selfNode.y;
-	      var dx = node.x - x;
-	      var dy = selfNode.height / 2;
-	      g.setEdge(node.e, node.label);
-	      g.removeNode(v);
-	      node.label.points = [
-	        { x: x + 2 * dx / 3, y: y - dy },
-	        { x: x + 5 * dx / 6, y: y - dy },
-	        { x: x +     dx    , y: y },
-	        { x: x + 5 * dx / 6, y: y + dy },
-	        { x: x + 2 * dx / 3, y: y + dy }
-	      ];
-	      node.label.x = node.x;
-	      node.label.y = node.y;
-	    }
-	  });
-	}
-
-	function selectNumberAttrs(obj, attrs) {
-	  return _.mapValues(_.pick(obj, attrs), Number);
-	}
-
-	function canonicalize(attrs) {
-	  var newAttrs = {};
-	  _.forEach(attrs, function(v, k) {
-	    newAttrs[k.toLowerCase()] = v;
-	  });
-	  return newAttrs;
-	}
-	return layout_1;
-}
-
-export { requireLayout as __require };
-//# sourceMappingURL=layout.js.map

package/lib/node_modules/dagre/lib/layout.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"layout.js","sources":["../../../../node_modules/dagre/lib/layout.js"],"sourcesContent":["\"use strict\";\n\nvar _ = require(\"./lodash\");\nvar acyclic = require(\"./acyclic\");\nvar normalize = require(\"./normalize\");\nvar rank = require(\"./rank\");\nvar normalizeRanks = require(\"./util\").normalizeRanks;\nvar parentDummyChains = require(\"./parent-dummy-chains\");\nvar removeEmptyRanks = require(\"./util\").removeEmptyRanks;\nvar nestingGraph = require(\"./nesting-graph\");\nvar addBorderSegments = require(\"./add-border-segments\");\nvar coordinateSystem = require(\"./coordinate-system\");\nvar order = require(\"./order\");\nvar position = require(\"./position\");\nvar util = require(\"./util\");\nvar Graph = require(\"./graphlib\").Graph;\n\nmodule.exports = layout;\n\nfunction layout(g, opts) {\n  var time = opts && opts.debugTiming ? util.time : util.notime;\n  time(\"layout\", function() {\n    var layoutGraph = \n      time(\"  buildLayoutGraph\", function() { return buildLayoutGraph(g); });\n    time(\"  runLayout\",        function() { runLayout(layoutGraph, time); });\n    time(\"  updateInputGraph\", function() { updateInputGraph(g, layoutGraph); });\n  });\n}\n\nfunction runLayout(g, time) {\n  time(\"    makeSpaceForEdgeLabels\", function() { makeSpaceForEdgeLabels(g); });\n  time(\"    removeSelfEdges\",        function() { removeSelfEdges(g); });\n  time(\"    acyclic\",                function() { acyclic.run(g); });\n  time(\"    nestingGraph.run\",       function() { nestingGraph.run(g); });\n  time(\"    rank\",                   function() { rank(util.asNonCompoundGraph(g)); });\n  time(\"    injectEdgeLabelProxies\", function() { injectEdgeLabelProxies(g); });\n  time(\"    removeEmptyRanks\",       function() { removeEmptyRanks(g); });\n  time(\"    nestingGraph.cleanup\",   function() { nestingGraph.cleanup(g); });\n  time(\"    normalizeRanks\",         function() { normalizeRanks(g); });\n  time(\"    assignRankMinMax\",       function() { assignRankMinMax(g); });\n  time(\"    removeEdgeLabelProxies\", function() { removeEdgeLabelProxies(g); });\n  time(\"    normalize.run\",          function() { normalize.run(g); });\n  time(\"    parentDummyChains\",      function() { parentDummyChains(g); });\n  time(\"    addBorderSegments\",      function() { addBorderSegments(g); });\n  time(\"    order\",                  function() { order(g); });\n  time(\"    insertSelfEdges\",        function() { insertSelfEdges(g); });\n  time(\"    adjustCoordinateSystem\", function() { coordinateSystem.adjust(g); });\n  time(\"    position\",               function() { position(g); });\n  time(\"    positionSelfEdges\",      function() { positionSelfEdges(g); });\n  time(\"    removeBorderNodes\",      function() { removeBorderNodes(g); });\n  time(\"    normalize.undo\",         function() { normalize.undo(g); });\n  time(\"    fixupEdgeLabelCoords\",   function() { fixupEdgeLabelCoords(g); });\n  time(\"    undoCoordinateSystem\",   function() { coordinateSystem.undo(g); });\n  time(\"    translateGraph\",         function() { translateGraph(g); });\n  time(\"    assignNodeIntersects\",   function() { assignNodeIntersects(g); });\n  time(\"    reversePoints\",          function() { reversePointsForReversedEdges(g); });\n  time(\"    acyclic.undo\",           function() { acyclic.undo(g); });\n}\n\n/*\n * Copies final layout information from the layout graph back to the input\n * graph. This process only copies whitelisted attributes from the layout graph\n * to the input graph, so it serves as a good place to determine what\n * attributes can influence layout.\n */\nfunction updateInputGraph(inputGraph, layoutGraph) {\n  _.forEach(inputGraph.nodes(), function(v) {\n    var inputLabel = inputGraph.node(v);\n    var layoutLabel = layoutGraph.node(v);\n\n    if (inputLabel) {\n      inputLabel.x = layoutLabel.x;\n      inputLabel.y = layoutLabel.y;\n\n      if (layoutGraph.children(v).length) {\n        inputLabel.width = layoutLabel.width;\n        inputLabel.height = layoutLabel.height;\n      }\n    }\n  });\n\n  _.forEach(inputGraph.edges(), function(e) {\n    var inputLabel = inputGraph.edge(e);\n    var layoutLabel = layoutGraph.edge(e);\n\n    inputLabel.points = layoutLabel.points;\n    if (_.has(layoutLabel, \"x\")) {\n      inputLabel.x = layoutLabel.x;\n      inputLabel.y = layoutLabel.y;\n    }\n  });\n\n  inputGraph.graph().width = layoutGraph.graph().width;\n  inputGraph.graph().height = layoutGraph.graph().height;\n}\n\nvar graphNumAttrs = [\"nodesep\", \"edgesep\", \"ranksep\", \"marginx\", \"marginy\"];\nvar graphDefaults = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: \"tb\" };\nvar graphAttrs = [\"acyclicer\", \"ranker\", \"rankdir\", \"align\"];\nvar nodeNumAttrs = [\"width\", \"height\"];\nvar nodeDefaults = { width: 0, height: 0 };\nvar edgeNumAttrs = [\"minlen\", \"weight\", \"width\", \"height\", \"labeloffset\"];\nvar edgeDefaults = {\n  minlen: 1, weight: 1, width: 0, height: 0,\n  labeloffset: 10, labelpos: \"r\"\n};\nvar edgeAttrs = [\"labelpos\"];\n\n/*\n * Constructs a new graph from the input graph, which can be used for layout.\n * This process copies only whitelisted attributes from the input graph to the\n * layout graph. Thus this function serves as a good place to determine what\n * attributes can influence layout.\n */\nfunction buildLayoutGraph(inputGraph) {\n  var g = new Graph({ multigraph: true, compound: true });\n  var graph = canonicalize(inputGraph.graph());\n\n  g.setGraph(_.merge({},\n    graphDefaults,\n    selectNumberAttrs(graph, graphNumAttrs),\n    _.pick(graph, graphAttrs)));\n\n  _.forEach(inputGraph.nodes(), function(v) {\n    var node = canonicalize(inputGraph.node(v));\n    g.setNode(v, _.defaults(selectNumberAttrs(node, nodeNumAttrs), nodeDefaults));\n    g.setParent(v, inputGraph.parent(v));\n  });\n\n  _.forEach(inputGraph.edges(), function(e) {\n    var edge = canonicalize(inputGraph.edge(e));\n    g.setEdge(e, _.merge({},\n      edgeDefaults,\n      selectNumberAttrs(edge, edgeNumAttrs),\n      _.pick(edge, edgeAttrs)));\n  });\n\n  return g;\n}\n\n/*\n * This idea comes from the Gansner paper: to account for edge labels in our\n * layout we split each rank in half by doubling minlen and halving ranksep.\n * Then we can place labels at these mid-points between nodes.\n *\n * We also add some minimal padding to the width to push the label for the edge\n * away from the edge itself a bit.\n */\nfunction makeSpaceForEdgeLabels(g) {\n  var graph = g.graph();\n  graph.ranksep /= 2;\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    edge.minlen *= 2;\n    if (edge.labelpos.toLowerCase() !== \"c\") {\n      if (graph.rankdir === \"TB\" || graph.rankdir === \"BT\") {\n        edge.width += edge.labeloffset;\n      } else {\n        edge.height += edge.labeloffset;\n      }\n    }\n  });\n}\n\n/*\n * Creates temporary dummy nodes that capture the rank in which each edge's\n * label is going to, if it has one of non-zero width and height. We do this\n * so that we can safely remove empty ranks while preserving balance for the\n * label's position.\n */\nfunction injectEdgeLabelProxies(g) {\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    if (edge.width && edge.height) {\n      var v = g.node(e.v);\n      var w = g.node(e.w);\n      var label = { rank: (w.rank - v.rank) / 2 + v.rank, e: e };\n      util.addDummyNode(g, \"edge-proxy\", label, \"_ep\");\n    }\n  });\n}\n\nfunction assignRankMinMax(g) {\n  var maxRank = 0;\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    if (node.borderTop) {\n      node.minRank = g.node(node.borderTop).rank;\n      node.maxRank = g.node(node.borderBottom).rank;\n      maxRank = _.max(maxRank, node.maxRank);\n    }\n  });\n  g.graph().maxRank = maxRank;\n}\n\nfunction removeEdgeLabelProxies(g) {\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    if (node.dummy === \"edge-proxy\") {\n      g.edge(node.e).labelRank = node.rank;\n      g.removeNode(v);\n    }\n  });\n}\n\nfunction translateGraph(g) {\n  var minX = Number.POSITIVE_INFINITY;\n  var maxX = 0;\n  var minY = Number.POSITIVE_INFINITY;\n  var maxY = 0;\n  var graphLabel = g.graph();\n  var marginX = graphLabel.marginx || 0;\n  var marginY = graphLabel.marginy || 0;\n\n  function getExtremes(attrs) {\n    var x = attrs.x;\n    var y = attrs.y;\n    var w = attrs.width;\n    var h = attrs.height;\n    minX = Math.min(minX, x - w / 2);\n    maxX = Math.max(maxX, x + w / 2);\n    minY = Math.min(minY, y - h / 2);\n    maxY = Math.max(maxY, y + h / 2);\n  }\n\n  _.forEach(g.nodes(), function(v) { getExtremes(g.node(v)); });\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    if (_.has(edge, \"x\")) {\n      getExtremes(edge);\n    }\n  });\n\n  minX -= marginX;\n  minY -= marginY;\n\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    node.x -= minX;\n    node.y -= minY;\n  });\n\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    _.forEach(edge.points, function(p) {\n      p.x -= minX;\n      p.y -= minY;\n    });\n    if (_.has(edge, \"x\")) { edge.x -= minX; }\n    if (_.has(edge, \"y\")) { edge.y -= minY; }\n  });\n\n  graphLabel.width = maxX - minX + marginX;\n  graphLabel.height = maxY - minY + marginY;\n}\n\nfunction assignNodeIntersects(g) {\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    var nodeV = g.node(e.v);\n    var nodeW = g.node(e.w);\n    var p1, p2;\n    if (!edge.points) {\n      edge.points = [];\n      p1 = nodeW;\n      p2 = nodeV;\n    } else {\n      p1 = edge.points[0];\n      p2 = edge.points[edge.points.length - 1];\n    }\n    edge.points.unshift(util.intersectRect(nodeV, p1));\n    edge.points.push(util.intersectRect(nodeW, p2));\n  });\n}\n\nfunction fixupEdgeLabelCoords(g) {\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    if (_.has(edge, \"x\")) {\n      if (edge.labelpos === \"l\" || edge.labelpos === \"r\") {\n        edge.width -= edge.labeloffset;\n      }\n      switch (edge.labelpos) {\n      case \"l\": edge.x -= edge.width / 2 + edge.labeloffset; break;\n      case \"r\": edge.x += edge.width / 2 + edge.labeloffset; break;\n      }\n    }\n  });\n}\n\nfunction reversePointsForReversedEdges(g) {\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    if (edge.reversed) {\n      edge.points.reverse();\n    }\n  });\n}\n\nfunction removeBorderNodes(g) {\n  _.forEach(g.nodes(), function(v) {\n    if (g.children(v).length) {\n      var node = g.node(v);\n      var t = g.node(node.borderTop);\n      var b = g.node(node.borderBottom);\n      var l = g.node(_.last(node.borderLeft));\n      var r = g.node(_.last(node.borderRight));\n\n      node.width = Math.abs(r.x - l.x);\n      node.height = Math.abs(b.y - t.y);\n      node.x = l.x + node.width / 2;\n      node.y = t.y + node.height / 2;\n    }\n  });\n\n  _.forEach(g.nodes(), function(v) {\n    if (g.node(v).dummy === \"border\") {\n      g.removeNode(v);\n    }\n  });\n}\n\nfunction removeSelfEdges(g) {\n  _.forEach(g.edges(), function(e) {\n    if (e.v === e.w) {\n      var node = g.node(e.v);\n      if (!node.selfEdges) {\n        node.selfEdges = [];\n      }\n      node.selfEdges.push({ e: e, label: g.edge(e) });\n      g.removeEdge(e);\n    }\n  });\n}\n\nfunction insertSelfEdges(g) {\n  var layers = util.buildLayerMatrix(g);\n  _.forEach(layers, function(layer) {\n    var orderShift = 0;\n    _.forEach(layer, function(v, i) {\n      var node = g.node(v);\n      node.order = i + orderShift;\n      _.forEach(node.selfEdges, function(selfEdge) {\n        util.addDummyNode(g, \"selfedge\", {\n          width: selfEdge.label.width,\n          height: selfEdge.label.height,\n          rank: node.rank,\n          order: i + (++orderShift),\n          e: selfEdge.e,\n          label: selfEdge.label\n        }, \"_se\");\n      });\n      delete node.selfEdges;\n    });\n  });\n}\n\nfunction positionSelfEdges(g) {\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    if (node.dummy === \"selfedge\") {\n      var selfNode = g.node(node.e.v);\n      var x = selfNode.x + selfNode.width / 2;\n      var y = selfNode.y;\n      var dx = node.x - x;\n      var dy = selfNode.height / 2;\n      g.setEdge(node.e, node.label);\n      g.removeNode(v);\n      node.label.points = [\n        { x: x + 2 * dx / 3, y: y - dy },\n        { x: x + 5 * dx / 6, y: y - dy },\n        { x: x +     dx    , y: y },\n        { x: x + 5 * dx / 6, y: y + dy },\n        { x: x + 2 * dx / 3, y: y + dy }\n      ];\n      node.label.x = node.x;\n      node.label.y = node.y;\n    }\n  });\n}\n\nfunction selectNumberAttrs(obj, attrs) {\n  return _.mapValues(_.pick(obj, attrs), Number);\n}\n\nfunction canonicalize(attrs) {\n  var newAttrs = {};\n  _.forEach(attrs, function(v, k) {\n    newAttrs[k.toLowerCase()] = v;\n  });\n  return newAttrs;\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","require$$11"],"mappings":";;;;;;;;;;;;;;;;;;;;CAEA,IAAI,CAAC,GAAGA,aAAA,EAAmB;CAC3B,IAAI,OAAO,GAAGC,cAAA,EAAoB;CAClC,IAAI,SAAS,GAAGC,gBAAA,EAAsB;CACtC,IAAI,IAAI,GAAGC,WAAA,EAAiB;AAC5B,CAAA,IAAI,cAAc,GAAGC,WAAA,EAAiB,CAAC,cAAc;CACrD,IAAI,iBAAiB,GAAGC,wBAAA,EAAgC;AACxD,CAAA,IAAI,gBAAgB,GAAGD,WAAA,EAAiB,CAAC,gBAAgB;CACzD,IAAI,YAAY,GAAGE,mBAAA,EAA0B;CAC7C,IAAI,iBAAiB,GAAGC,wBAAA,EAAgC;CACxD,IAAI,gBAAgB,GAAGC,uBAAA,EAA8B;CACrD,IAAI,KAAK,GAAGC,YAAA,EAAkB;CAC9B,IAAI,QAAQ,GAAGC,eAAA,EAAqB;CACpC,IAAI,IAAI,GAAGN,WAAA,EAAiB;AAC5B,CAAA,IAAI,KAAK,GAAGO,eAAA,EAAqB,CAAC,KAAK;;AAEvC,CAAA,QAAc,GAAG,MAAM;;AAEvB,CAAA,SAAS,MAAM,CAAC,CAAC,EAAE,IAAI,EAAE;AACzB,GAAE,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM;AAC/D,GAAE,IAAI,CAAC,QAAQ,EAAE,WAAW;AAC5B,KAAI,IAAI,WAAW;AACnB,OAAM,IAAI,CAAC,oBAAoB,EAAE,WAAW,EAAE,OAAO,gBAAgB,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AAC5E,KAAI,IAAI,CAAC,aAAa,SAAS,WAAW,EAAE,SAAS,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC;AAC5E,KAAI,IAAI,CAAC,oBAAoB,EAAE,WAAW,EAAE,gBAAgB,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC;AAChF,GAAA,CAAG,CAAC;AACJ,CAAA;;AAEA,CAAA,SAAS,SAAS,CAAC,CAAC,EAAE,IAAI,EAAE;AAC5B,GAAE,IAAI,CAAC,4BAA4B,EAAE,WAAW,EAAE,sBAAsB,CAAC,CAAC,CAAC,CAAC,CAAA,CAAE,CAAC;AAC/E,GAAE,IAAI,CAAC,qBAAqB,SAAS,WAAW,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC,CAAA,CAAE,CAAC;AACxE,GAAE,IAAI,CAAC,aAAa,iBAAiB,WAAW,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AACpE,GAAE,IAAI,CAAC,sBAAsB,QAAQ,WAAW,EAAE,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AACzE,GAAE,IAAI,CAAC,UAAU,oBAAoB,WAAW,EAAE,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AACtF,GAAE,IAAI,CAAC,4BAA4B,EAAE,WAAW,EAAE,sBAAsB,CAAC,CAAC,CAAC,CAAC,CAAA,CAAE,CAAC;AAC/E,GAAE,IAAI,CAAC,sBAAsB,QAAQ,WAAW,EAAE,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAA,CAAE,CAAC;AACzE,GAAE,IAAI,CAAC,0BAA0B,IAAI,WAAW,EAAE,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AAC7E,GAAE,IAAI,CAAC,oBAAoB,UAAU,WAAW,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,CAAA,CAAE,CAAC;AACvE,GAAE,IAAI,CAAC,sBAAsB,QAAQ,WAAW,EAAE,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAA,CAAE,CAAC;AACzE,GAAE,IAAI,CAAC,4BAA4B,EAAE,WAAW,EAAE,sBAAsB,CAAC,CAAC,CAAC,CAAC,CAAA,CAAE,CAAC;AAC/E,GAAE,IAAI,CAAC,mBAAmB,WAAW,WAAW,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AACtE,GAAE,IAAI,CAAC,uBAAuB,OAAO,WAAW,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAA,CAAE,CAAC;AAC1E,GAAE,IAAI,CAAC,uBAAuB,OAAO,WAAW,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAA,CAAE,CAAC;AAC1E,GAAE,IAAI,CAAC,WAAW,mBAAmB,WAAW,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA,CAAE,CAAC;AAC9D,GAAE,IAAI,CAAC,qBAAqB,SAAS,WAAW,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC,CAAA,CAAE,CAAC;AACxE,GAAE,IAAI,CAAC,4BAA4B,EAAE,WAAW,EAAE,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AAChF,GAAE,IAAI,CAAC,cAAc,gBAAgB,WAAW,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAA,CAAE,CAAC;AACjE,GAAE,IAAI,CAAC,uBAAuB,OAAO,WAAW,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAA,CAAE,CAAC;AAC1E,GAAE,IAAI,CAAC,uBAAuB,OAAO,WAAW,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAA,CAAE,CAAC;AAC1E,GAAE,IAAI,CAAC,oBAAoB,UAAU,WAAW,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AACvE,GAAE,IAAI,CAAC,0BAA0B,IAAI,WAAW,EAAE,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAA,CAAE,CAAC;AAC7E,GAAE,IAAI,CAAC,0BAA0B,IAAI,WAAW,EAAE,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AAC9E,GAAE,IAAI,CAAC,oBAAoB,UAAU,WAAW,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,CAAA,CAAE,CAAC;AACvE,GAAE,IAAI,CAAC,0BAA0B,IAAI,WAAW,EAAE,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAA,CAAE,CAAC;AAC7E,GAAE,IAAI,CAAC,mBAAmB,WAAW,WAAW,EAAE,6BAA6B,CAAC,CAAC,CAAC,CAAC,CAAA,CAAE,CAAC;AACtF,GAAE,IAAI,CAAC,kBAAkB,YAAY,WAAW,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AACrE,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAS,gBAAgB,CAAC,UAAU,EAAE,WAAW,EAAE;GACjD,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KACxC,IAAI,UAAU,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;KACnC,IAAI,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC;;KAErC,IAAI,UAAU,EAAE;AACpB,OAAM,UAAU,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC;AAClC,OAAM,UAAU,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC;;OAE5B,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE;AAC1C,SAAQ,UAAU,CAAC,KAAK,GAAG,WAAW,CAAC,KAAK;AAC5C,SAAQ,UAAU,CAAC,MAAM,GAAG,WAAW,CAAC,MAAM;AAC9C,OAAA;AACA,KAAA;AACA,GAAA,CAAG,CAAC;;GAEF,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KACxC,IAAI,UAAU,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;KACnC,IAAI,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC;;AAEzC,KAAI,UAAU,CAAC,MAAM,GAAG,WAAW,CAAC,MAAM;KACtC,IAAI,CAAC,CAAC,GAAG,CAAC,WAAW,EAAE,GAAG,CAAC,EAAE;AACjC,OAAM,UAAU,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC;AAClC,OAAM,UAAU,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC;AAClC,KAAA;AACA,GAAA,CAAG,CAAC;;AAEJ,GAAE,UAAU,CAAC,KAAK,EAAE,CAAC,KAAK,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC,KAAK;AACtD,GAAE,UAAU,CAAC,KAAK,EAAE,CAAC,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC,MAAM;AACxD,CAAA;;AAEA,CAAA,IAAI,aAAa,GAAG,CAAC,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,CAAC;AAC3E,CAAA,IAAI,aAAa,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE;CAC5E,IAAI,UAAU,GAAG,CAAC,WAAW,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,CAAC;AAC5D,CAAA,IAAI,YAAY,GAAG,CAAC,OAAO,EAAE,QAAQ,CAAC;CACtC,IAAI,YAAY,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE;AAC1C,CAAA,IAAI,YAAY,GAAG,CAAC,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,aAAa,CAAC;AACzE,CAAA,IAAI,YAAY,GAAG;AACnB,GAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC;AAC3C,GAAE,WAAW,EAAE,EAAE,EAAE,QAAQ,EAAE;EAC5B;AACD,CAAA,IAAI,SAAS,GAAG,CAAC,UAAU,CAAC;;AAE5B;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,gBAAgB,CAAC,UAAU,EAAE;AACtC,GAAE,IAAI,CAAC,GAAG,IAAI,KAAK,CAAC,EAAE,UAAU,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;GACvD,IAAI,KAAK,GAAG,YAAY,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;;GAE5C,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE;AACvB,KAAI,aAAa;AACjB,KAAI,iBAAiB,CAAC,KAAK,EAAE,aAAa,CAAC;KACvC,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC;;GAE7B,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KACxC,IAAI,IAAI,GAAG,YAAY,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AAC/C,KAAI,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,iBAAiB,CAAC,IAAI,EAAE,YAAY,CAAC,EAAE,YAAY,CAAC,CAAC;AACjF,KAAI,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;AACxC,GAAA,CAAG,CAAC;;GAEF,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KACxC,IAAI,IAAI,GAAG,YAAY,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;KAC3C,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE;AAC3B,OAAM,YAAY;AAClB,OAAM,iBAAiB,CAAC,IAAI,EAAE,YAAY,CAAC;OACrC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC;AAC/B,GAAA,CAAG,CAAC;;AAEJ,GAAE,OAAO,CAAC;AACV,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,sBAAsB,CAAC,CAAC,EAAE;AACnC,GAAE,IAAI,KAAK,GAAG,CAAC,CAAC,KAAK,EAAE;AACvB,GAAE,KAAK,CAAC,OAAO,IAAI,CAAC;GAClB,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,CAAC,MAAM,IAAI,CAAC;KAChB,IAAI,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE,KAAK,GAAG,EAAE;AAC7C,OAAM,IAAI,KAAK,CAAC,OAAO,KAAK,IAAI,IAAI,KAAK,CAAC,OAAO,KAAK,IAAI,EAAE;AAC5D,SAAQ,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,WAAW;AACtC,OAAA,CAAO,MAAM;AACb,SAAQ,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,WAAW;AACvC,OAAA;AACA,KAAA;AACA,GAAA,CAAG,CAAC;AACJ,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,sBAAsB,CAAC,CAAC,EAAE;GACjC,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,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE;OAC7B,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;OACnB,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;OACnB,IAAI,KAAK,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE;OAC1D,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,EAAE,KAAK,CAAC;AACtD,KAAA;AACA,GAAA,CAAG,CAAC;AACJ,CAAA;;CAEA,SAAS,gBAAgB,CAAC,CAAC,EAAE;GAC3B,IAAI,OAAO,GAAG,CAAC;GACf,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,CAAC,SAAS,EAAE;AACxB,OAAM,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI;AAChD,OAAM,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,IAAI;OAC7C,OAAO,GAAG,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC;AAC5C,KAAA;AACA,GAAA,CAAG,CAAC;AACJ,GAAE,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,GAAG,OAAO;AAC7B,CAAA;;CAEA,SAAS,sBAAsB,CAAC,CAAC,EAAE;GACjC,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,CAAC,KAAK,KAAK,YAAY,EAAE;AACrC,OAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,IAAI,CAAC,IAAI;AAC1C,OAAM,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;AACrB,KAAA;AACA,GAAA,CAAG,CAAC;AACJ,CAAA;;CAEA,SAAS,cAAc,CAAC,CAAC,EAAE;AAC3B,GAAE,IAAI,IAAI,GAAG,MAAM,CAAC,iBAAiB;GACnC,IAAI,IAAI,GAAG,CAAC;AACd,GAAE,IAAI,IAAI,GAAG,MAAM,CAAC,iBAAiB;GACnC,IAAI,IAAI,GAAG,CAAC;AACd,GAAE,IAAI,UAAU,GAAG,CAAC,CAAC,KAAK,EAAE;AAC5B,GAAE,IAAI,OAAO,GAAG,UAAU,CAAC,OAAO,IAAI,CAAC;AACvC,GAAE,IAAI,OAAO,GAAG,UAAU,CAAC,OAAO,IAAI,CAAC;;AAEvC,GAAE,SAAS,WAAW,CAAC,KAAK,EAAE;AAC9B,KAAI,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC;AACnB,KAAI,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC;AACnB,KAAI,IAAI,CAAC,GAAG,KAAK,CAAC,KAAK;AACvB,KAAI,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM;AACxB,KAAI,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AACpC,KAAI,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AACpC,KAAI,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AACpC,KAAI,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AACpC,GAAA;;GAEE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA,CAAE,CAAC;GAC7D,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,GAAG,CAAC,EAAE;OACpB,WAAW,CAAC,IAAI,CAAC;AACvB,KAAA;AACA,GAAA,CAAG,CAAC;;GAEF,IAAI,IAAI,OAAO;GACf,IAAI,IAAI,OAAO;;GAEf,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,CAAC,CAAC,IAAI,IAAI;AAClB,KAAI,IAAI,CAAC,CAAC,IAAI,IAAI;AAClB,GAAA,CAAG,CAAC;;GAEF,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KAC/B,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;KACpB,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE;AACvC,OAAM,CAAC,CAAC,CAAC,IAAI,IAAI;AACjB,OAAM,CAAC,CAAC,CAAC,IAAI,IAAI;AACjB,KAAA,CAAK,CAAC;AACN,KAAI,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAA;AAC3C,KAAI,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAA;AAC3C,GAAA,CAAG,CAAC;;GAEF,UAAU,CAAC,KAAK,GAAG,IAAI,GAAG,IAAI,GAAG,OAAO;GACxC,UAAU,CAAC,MAAM,GAAG,IAAI,GAAG,IAAI,GAAG,OAAO;AAC3C,CAAA;;CAEA,SAAS,oBAAoB,CAAC,CAAC,EAAE;GAC/B,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,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;KACvB,IAAI,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;KACvB,IAAI,EAAE,EAAE,EAAE;AACd,KAAI,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;AACtB,OAAM,IAAI,CAAC,MAAM,GAAG,EAAE;OAChB,EAAE,GAAG,KAAK;OACV,EAAE,GAAG,KAAK;AAChB,KAAA,CAAK,MAAM;AACX,OAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;AACzB,OAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;AAC9C,KAAA;AACA,KAAI,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;AACtD,KAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;AACnD,GAAA,CAAG,CAAC;AACJ,CAAA;;CAEA,SAAS,oBAAoB,CAAC,CAAC,EAAE;GAC/B,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,GAAG,CAAC,EAAE;AAC1B,OAAM,IAAI,IAAI,CAAC,QAAQ,KAAK,GAAG,IAAI,IAAI,CAAC,QAAQ,KAAK,GAAG,EAAE;AAC1D,SAAQ,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,WAAW;AACtC,OAAA;OACM,QAAQ,IAAI,CAAC,QAAQ;AAC3B,OAAM,KAAK,GAAG,EAAE,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;AAC7D,OAAM,KAAK,GAAG,EAAE,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;AAC7D;AACA,KAAA;AACA,GAAA,CAAG,CAAC;AACJ,CAAA;;CAEA,SAAS,6BAA6B,CAAC,CAAC,EAAE;GACxC,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,CAAC,QAAQ,EAAE;AACvB,OAAM,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE;AAC3B,KAAA;AACA,GAAA,CAAG,CAAC;AACJ,CAAA;;CAEA,SAAS,iBAAiB,CAAC,CAAC,EAAE;GAC5B,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KAC/B,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE;OACxB,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;OACpB,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC;OAC9B,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC;AACvC,OAAM,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;AAC7C,OAAM,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;;AAE9C,OAAM,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACtC,OAAM,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACvC,OAAM,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC;AACnC,OAAM,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC;AACpC,KAAA;AACA,GAAA,CAAG,CAAC;;GAEF,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KAC/B,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,KAAK,QAAQ,EAAE;AACtC,OAAM,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;AACrB,KAAA;AACA,GAAA,CAAG,CAAC;AACJ,CAAA;;CAEA,SAAS,eAAe,CAAC,CAAC,EAAE;GAC1B,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KAC/B,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE;OACf,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AAC5B,OAAM,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE;AAC3B,SAAQ,IAAI,CAAC,SAAS,GAAG,EAAE;AAC3B,OAAA;OACM,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;AACrD,OAAM,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;AACrB,KAAA;AACA,GAAA,CAAG,CAAC;AACJ,CAAA;;CAEA,SAAS,eAAe,CAAC,CAAC,EAAE;GAC1B,IAAI,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;GACrC,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,SAAS,KAAK,EAAE;KAChC,IAAI,UAAU,GAAG,CAAC;KAClB,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,CAAC,EAAE;OAC9B,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AAC1B,OAAM,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,UAAU;OAC3B,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,EAAE,SAAS,QAAQ,EAAE;AACnD,SAAQ,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,UAAU,EAAE;AACzC,WAAU,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,KAAK;AACrC,WAAU,MAAM,EAAE,QAAQ,CAAC,KAAK,CAAC,MAAM;AACvC,WAAU,IAAI,EAAE,IAAI,CAAC,IAAI;AACzB,WAAU,KAAK,EAAE,CAAC,IAAI,EAAE,UAAU,CAAC;AACnC,WAAU,CAAC,EAAE,QAAQ,CAAC,CAAC;WACb,KAAK,EAAE,QAAQ,CAAC;UACjB,EAAE,KAAK,CAAC;AACjB,OAAA,CAAO,CAAC;OACF,OAAO,IAAI,CAAC,SAAS;AAC3B,KAAA,CAAK,CAAC;AACN,GAAA,CAAG,CAAC;AACJ,CAAA;;CAEA,SAAS,iBAAiB,CAAC,CAAC,EAAE;GAC5B,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,CAAC,KAAK,KAAK,UAAU,EAAE;AACnC,OAAM,IAAI,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;OAC/B,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC,GAAG,QAAQ,CAAC,KAAK,GAAG,CAAC;AAC7C,OAAM,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC;AACxB,OAAM,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC;AACzB,OAAM,IAAI,EAAE,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC;OAC5B,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC;AACnC,OAAM,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;AACrB,OAAM,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG;AAC1B,SAAQ,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;AACxC,SAAQ,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;SAChC,EAAE,CAAC,EAAE,CAAC,OAAO,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE;AACnC,SAAQ,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;AACxC,SAAQ,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE;QAC/B;OACD,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;OACrB,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;AAC3B,KAAA;AACA,GAAA,CAAG,CAAC;AACJ,CAAA;;AAEA,CAAA,SAAS,iBAAiB,CAAC,GAAG,EAAE,KAAK,EAAE;AACvC,GAAE,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,MAAM,CAAC;AAChD,CAAA;;CAEA,SAAS,YAAY,CAAC,KAAK,EAAE;GAC3B,IAAI,QAAQ,GAAG,EAAE;GACjB,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,CAAC,EAAE;KAC9B,QAAQ,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,GAAG,CAAC;AACjC,GAAA,CAAG,CAAC;AACJ,GAAE,OAAO,QAAQ;AACjB,CAAA;;;;;;","x_google_ignoreList":[0]}