@antv/layout 2.0.0 → 2.0.1

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

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

package/lib/node_modules/dagre/lib/order/index.js

@@ -1,98 +0,0 @@
-import { __require as requireLodash } from '../lodash.js';
-import { __require as requireInitOrder } from './init-order.js';
-import { __require as requireCrossCount } from './cross-count.js';
-import { __require as requireSortSubgraph } from './sort-subgraph.js';
-import { __require as requireBuildLayerGraph } from './build-layer-graph.js';
-import { __require as requireAddSubgraphConstraints } from './add-subgraph-constraints.js';
-import { __require as requireGraphlib } from '../graphlib.js';
-import { __require as requireUtil } from '../util.js';
-
-var order_1;
-var hasRequiredOrder;
-
-function requireOrder () {
-	if (hasRequiredOrder) return order_1;
-	hasRequiredOrder = 1;
-
-	var _ = requireLodash();
-	var initOrder = requireInitOrder();
-	var crossCount = requireCrossCount();
-	var sortSubgraph = requireSortSubgraph();
-	var buildLayerGraph = requireBuildLayerGraph();
-	var addSubgraphConstraints = requireAddSubgraphConstraints();
-	var Graph = requireGraphlib().Graph;
-	var util = requireUtil();
-
-	order_1 = order;
-
-	/*
-	 * Applies heuristics to minimize edge crossings in the graph and sets the best
-	 * order solution as an order attribute on each node.
-	 *
-	 * Pre-conditions:
-	 *
-	 *    1. Graph must be DAG
-	 *    2. Graph nodes must be objects with a "rank" attribute
-	 *    3. Graph edges must have the "weight" attribute
-	 *
-	 * Post-conditions:
-	 *
-	 *    1. Graph nodes will have an "order" attribute based on the results of the
-	 *       algorithm.
-	 */
-	function order(g) {
-	  var maxRank = util.maxRank(g),
-	    downLayerGraphs = buildLayerGraphs(g, _.range(1, maxRank + 1), "inEdges"),
-	    upLayerGraphs = buildLayerGraphs(g, _.range(maxRank - 1, -1, -1), "outEdges");
-
-	  var layering = initOrder(g);
-	  assignOrder(g, layering);
-
-	  var bestCC = Number.POSITIVE_INFINITY,
-	    best;
-
-	  for (var i = 0, lastBest = 0; lastBest < 4; ++i, ++lastBest) {
-	    sweepLayerGraphs(i % 2 ? downLayerGraphs : upLayerGraphs, i % 4 >= 2);
-
-	    layering = util.buildLayerMatrix(g);
-	    var cc = crossCount(g, layering);
-	    if (cc < bestCC) {
-	      lastBest = 0;
-	      best = _.cloneDeep(layering);
-	      bestCC = cc;
-	    }
-	  }
-
-	  assignOrder(g, best);
-	}
-
-	function buildLayerGraphs(g, ranks, relationship) {
-	  return _.map(ranks, function(rank) {
-	    return buildLayerGraph(g, rank, relationship);
-	  });
-	}
-
-	function sweepLayerGraphs(layerGraphs, biasRight) {
-	  var cg = new Graph();
-	  _.forEach(layerGraphs, function(lg) {
-	    var root = lg.graph().root;
-	    var sorted = sortSubgraph(lg, root, cg, biasRight);
-	    _.forEach(sorted.vs, function(v, i) {
-	      lg.node(v).order = i;
-	    });
-	    addSubgraphConstraints(lg, cg, sorted.vs);
-	  });
-	}
-
-	function assignOrder(g, layering) {
-	  _.forEach(layering, function(layer) {
-	    _.forEach(layer, function(v, i) {
-	      g.node(v).order = i;
-	    });
-	  });
-	}
-	return order_1;
-}
-
-export { requireOrder as __require };
-//# sourceMappingURL=index.js.map

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

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

package/lib/node_modules/dagre/lib/order/init-order.js

@@ -1,50 +0,0 @@
-import { __require as requireLodash } from '../lodash.js';
-
-var initOrder_1;
-var hasRequiredInitOrder;
-
-function requireInitOrder () {
-	if (hasRequiredInitOrder) return initOrder_1;
-	hasRequiredInitOrder = 1;
-
-	var _ = requireLodash();
-
-	initOrder_1 = initOrder;
-
-	/*
-	 * Assigns an initial order value for each node by performing a DFS search
-	 * starting from nodes in the first rank. Nodes are assigned an order in their
-	 * rank as they are first visited.
-	 *
-	 * This approach comes from Gansner, et al., "A Technique for Drawing Directed
-	 * Graphs."
-	 *
-	 * Returns a layering matrix with an array per layer and each layer sorted by
-	 * the order of its nodes.
-	 */
-	function initOrder(g) {
-	  var visited = {};
-	  var simpleNodes = _.filter(g.nodes(), function(v) {
-	    return !g.children(v).length;
-	  });
-	  var maxRank = _.max(_.map(simpleNodes, function(v) { return g.node(v).rank; }));
-	  var layers = _.map(_.range(maxRank + 1), function() { return []; });
-
-	  function dfs(v) {
-	    if (_.has(visited, v)) return;
-	    visited[v] = true;
-	    var node = g.node(v);
-	    layers[node.rank].push(v);
-	    _.forEach(g.successors(v), dfs);
-	  }
-
-	  var orderedVs = _.sortBy(simpleNodes, function(v) { return g.node(v).rank; });
-	  _.forEach(orderedVs, dfs);
-
-	  return layers;
-	}
-	return initOrder_1;
-}
-
-export { requireInitOrder as __require };
-//# sourceMappingURL=init-order.js.map

package/lib/node_modules/dagre/lib/order/init-order.js.map

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

package/lib/node_modules/dagre/lib/order/resolve-conflicts.js

@@ -1,134 +0,0 @@
-import { __require as requireLodash } from '../lodash.js';
-
-var resolveConflicts_1;
-var hasRequiredResolveConflicts;
-
-function requireResolveConflicts () {
-	if (hasRequiredResolveConflicts) return resolveConflicts_1;
-	hasRequiredResolveConflicts = 1;
-
-	var _ = requireLodash();
-
-	resolveConflicts_1 = resolveConflicts;
-
-	/*
-	 * Given a list of entries of the form {v, barycenter, weight} and a
-	 * constraint graph this function will resolve any conflicts between the
-	 * constraint graph and the barycenters for the entries. If the barycenters for
-	 * an entry would violate a constraint in the constraint graph then we coalesce
-	 * the nodes in the conflict into a new node that respects the contraint and
-	 * aggregates barycenter and weight information.
-	 *
-	 * This implementation is based on the description in Forster, "A Fast and
-	 * Simple Hueristic for Constrained Two-Level Crossing Reduction," thought it
-	 * differs in some specific details.
-	 *
-	 * Pre-conditions:
-	 *
-	 *    1. Each entry has the form {v, barycenter, weight}, or if the node has
-	 *       no barycenter, then {v}.
-	 *
-	 * Returns:
-	 *
-	 *    A new list of entries of the form {vs, i, barycenter, weight}. The list
-	 *    `vs` may either be a singleton or it may be an aggregation of nodes
-	 *    ordered such that they do not violate constraints from the constraint
-	 *    graph. The property `i` is the lowest original index of any of the
-	 *    elements in `vs`.
-	 */
-	function resolveConflicts(entries, cg) {
-	  var mappedEntries = {};
-	  _.forEach(entries, function(entry, i) {
-	    var tmp = mappedEntries[entry.v] = {
-	      indegree: 0,
-	      "in": [],
-	      out: [],
-	      vs: [entry.v],
-	      i: i
-	    };
-	    if (!_.isUndefined(entry.barycenter)) {
-	      tmp.barycenter = entry.barycenter;
-	      tmp.weight = entry.weight;
-	    }
-	  });
-
-	  _.forEach(cg.edges(), function(e) {
-	    var entryV = mappedEntries[e.v];
-	    var entryW = mappedEntries[e.w];
-	    if (!_.isUndefined(entryV) && !_.isUndefined(entryW)) {
-	      entryW.indegree++;
-	      entryV.out.push(mappedEntries[e.w]);
-	    }
-	  });
-
-	  var sourceSet = _.filter(mappedEntries, function(entry) {
-	    return !entry.indegree;
-	  });
-
-	  return doResolveConflicts(sourceSet);
-	}
-
-	function doResolveConflicts(sourceSet) {
-	  var entries = [];
-
-	  function handleIn(vEntry) {
-	    return function(uEntry) {
-	      if (uEntry.merged) {
-	        return;
-	      }
-	      if (_.isUndefined(uEntry.barycenter) ||
-	          _.isUndefined(vEntry.barycenter) ||
-	          uEntry.barycenter >= vEntry.barycenter) {
-	        mergeEntries(vEntry, uEntry);
-	      }
-	    };
-	  }
-
-	  function handleOut(vEntry) {
-	    return function(wEntry) {
-	      wEntry["in"].push(vEntry);
-	      if (--wEntry.indegree === 0) {
-	        sourceSet.push(wEntry);
-	      }
-	    };
-	  }
-
-	  while (sourceSet.length) {
-	    var entry = sourceSet.pop();
-	    entries.push(entry);
-	    _.forEach(entry["in"].reverse(), handleIn(entry));
-	    _.forEach(entry.out, handleOut(entry));
-	  }
-
-	  return _.map(_.filter(entries, function(entry) { return !entry.merged; }),
-	    function(entry) {
-	      return _.pick(entry, ["vs", "i", "barycenter", "weight"]);
-	    });
-
-	}
-
-	function mergeEntries(target, source) {
-	  var sum = 0;
-	  var weight = 0;
-
-	  if (target.weight) {
-	    sum += target.barycenter * target.weight;
-	    weight += target.weight;
-	  }
-
-	  if (source.weight) {
-	    sum += source.barycenter * source.weight;
-	    weight += source.weight;
-	  }
-
-	  target.vs = source.vs.concat(target.vs);
-	  target.barycenter = sum / weight;
-	  target.weight = weight;
-	  target.i = Math.min(source.i, target.i);
-	  source.merged = true;
-	}
-	return resolveConflicts_1;
-}
-
-export { requireResolveConflicts as __require };
-//# sourceMappingURL=resolve-conflicts.js.map

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

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

package/lib/node_modules/dagre/lib/order/sort-subgraph.js

@@ -1,92 +0,0 @@
-import { __require as requireLodash } from '../lodash.js';
-import { __require as requireBarycenter } from './barycenter.js';
-import { __require as requireResolveConflicts } from './resolve-conflicts.js';
-import { __require as requireSort } from './sort.js';
-
-var sortSubgraph_1;
-var hasRequiredSortSubgraph;
-
-function requireSortSubgraph () {
-	if (hasRequiredSortSubgraph) return sortSubgraph_1;
-	hasRequiredSortSubgraph = 1;
-	var _ = requireLodash();
-	var barycenter = requireBarycenter();
-	var resolveConflicts = requireResolveConflicts();
-	var sort = requireSort();
-
-	sortSubgraph_1 = sortSubgraph;
-
-	function sortSubgraph(g, v, cg, biasRight) {
-	  var movable = g.children(v);
-	  var node = g.node(v);
-	  var bl = node ? node.borderLeft : undefined;
-	  var br = node ? node.borderRight: undefined;
-	  var subgraphs = {};
-
-	  if (bl) {
-	    movable = _.filter(movable, function(w) {
-	      return w !== bl && w !== br;
-	    });
-	  }
-
-	  var barycenters = barycenter(g, movable);
-	  _.forEach(barycenters, function(entry) {
-	    if (g.children(entry.v).length) {
-	      var subgraphResult = sortSubgraph(g, entry.v, cg, biasRight);
-	      subgraphs[entry.v] = subgraphResult;
-	      if (_.has(subgraphResult, "barycenter")) {
-	        mergeBarycenters(entry, subgraphResult);
-	      }
-	    }
-	  });
-
-	  var entries = resolveConflicts(barycenters, cg);
-	  expandSubgraphs(entries, subgraphs);
-
-	  var result = sort(entries, biasRight);
-
-	  if (bl) {
-	    result.vs = _.flatten([bl, result.vs, br], true);
-	    if (g.predecessors(bl).length) {
-	      var blPred = g.node(g.predecessors(bl)[0]),
-	        brPred = g.node(g.predecessors(br)[0]);
-	      if (!_.has(result, "barycenter")) {
-	        result.barycenter = 0;
-	        result.weight = 0;
-	      }
-	      result.barycenter = (result.barycenter * result.weight +
-	                           blPred.order + brPred.order) / (result.weight + 2);
-	      result.weight += 2;
-	    }
-	  }
-
-	  return result;
-	}
-
-	function expandSubgraphs(entries, subgraphs) {
-	  _.forEach(entries, function(entry) {
-	    entry.vs = _.flatten(entry.vs.map(function(v) {
-	      if (subgraphs[v]) {
-	        return subgraphs[v].vs;
-	      }
-	      return v;
-	    }), true);
-	  });
-	}
-
-	function mergeBarycenters(target, other) {
-	  if (!_.isUndefined(target.barycenter)) {
-	    target.barycenter = (target.barycenter * target.weight +
-	                         other.barycenter * other.weight) /
-	                        (target.weight + other.weight);
-	    target.weight += other.weight;
-	  } else {
-	    target.barycenter = other.barycenter;
-	    target.weight = other.weight;
-	  }
-	}
-	return sortSubgraph_1;
-}
-
-export { requireSortSubgraph as __require };
-//# sourceMappingURL=sort-subgraph.js.map

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

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

package/lib/node_modules/dagre/lib/order/sort.js

@@ -1,71 +0,0 @@
-import { __require as requireLodash } from '../lodash.js';
-import { __require as requireUtil } from '../util.js';
-
-var sort_1;
-var hasRequiredSort;
-
-function requireSort () {
-	if (hasRequiredSort) return sort_1;
-	hasRequiredSort = 1;
-	var _ = requireLodash();
-	var util = requireUtil();
-
-	sort_1 = sort;
-
-	function sort(entries, biasRight) {
-	  var parts = util.partition(entries, function(entry) {
-	    return _.has(entry, "barycenter");
-	  });
-	  var sortable = parts.lhs,
-	    unsortable = _.sortBy(parts.rhs, function(entry) { return -entry.i; }),
-	    vs = [],
-	    sum = 0,
-	    weight = 0,
-	    vsIndex = 0;
-
-	  sortable.sort(compareWithBias(!!biasRight));
-
-	  vsIndex = consumeUnsortable(vs, unsortable, vsIndex);
-
-	  _.forEach(sortable, function (entry) {
-	    vsIndex += entry.vs.length;
-	    vs.push(entry.vs);
-	    sum += entry.barycenter * entry.weight;
-	    weight += entry.weight;
-	    vsIndex = consumeUnsortable(vs, unsortable, vsIndex);
-	  });
-
-	  var result = { vs: _.flatten(vs, true) };
-	  if (weight) {
-	    result.barycenter = sum / weight;
-	    result.weight = weight;
-	  }
-	  return result;
-	}
-
-	function consumeUnsortable(vs, unsortable, index) {
-	  var last;
-	  while (unsortable.length && (last = _.last(unsortable)).i <= index) {
-	    unsortable.pop();
-	    vs.push(last.vs);
-	    index++;
-	  }
-	  return index;
-	}
-
-	function compareWithBias(bias) {
-	  return function(entryV, entryW) {
-	    if (entryV.barycenter < entryW.barycenter) {
-	      return -1;
-	    } else if (entryV.barycenter > entryW.barycenter) {
-	      return 1;
-	    }
-
-	    return !bias ? entryV.i - entryW.i : entryW.i - entryV.i;
-	  };
-	}
-	return sort_1;
-}
-
-export { requireSort as __require };
-//# sourceMappingURL=sort.js.map

package/lib/node_modules/dagre/lib/order/sort.js.map

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

package/lib/node_modules/dagre/lib/parent-dummy-chains.js

@@ -1,99 +0,0 @@
-import { __require as requireLodash } from './lodash.js';
-
-var parentDummyChains_1;
-var hasRequiredParentDummyChains;
-
-function requireParentDummyChains () {
-	if (hasRequiredParentDummyChains) return parentDummyChains_1;
-	hasRequiredParentDummyChains = 1;
-	var _ = requireLodash();
-
-	parentDummyChains_1 = parentDummyChains;
-
-	function parentDummyChains(g) {
-	  var postorderNums = postorder(g);
-
-	  _.forEach(g.graph().dummyChains, function(v) {
-	    var node = g.node(v);
-	    var edgeObj = node.edgeObj;
-	    var pathData = findPath(g, postorderNums, edgeObj.v, edgeObj.w);
-	    var path = pathData.path;
-	    var lca = pathData.lca;
-	    var pathIdx = 0;
-	    var pathV = path[pathIdx];
-	    var ascending = true;
-
-	    while (v !== edgeObj.w) {
-	      node = g.node(v);
-
-	      if (ascending) {
-	        while ((pathV = path[pathIdx]) !== lca &&
-	               g.node(pathV).maxRank < node.rank) {
-	          pathIdx++;
-	        }
-
-	        if (pathV === lca) {
-	          ascending = false;
-	        }
-	      }
-
-	      if (!ascending) {
-	        while (pathIdx < path.length - 1 &&
-	               g.node(pathV = path[pathIdx + 1]).minRank <= node.rank) {
-	          pathIdx++;
-	        }
-	        pathV = path[pathIdx];
-	      }
-
-	      g.setParent(v, pathV);
-	      v = g.successors(v)[0];
-	    }
-	  });
-	}
-
-	// Find a path from v to w through the lowest common ancestor (LCA). Return the
-	// full path and the LCA.
-	function findPath(g, postorderNums, v, w) {
-	  var vPath = [];
-	  var wPath = [];
-	  var low = Math.min(postorderNums[v].low, postorderNums[w].low);
-	  var lim = Math.max(postorderNums[v].lim, postorderNums[w].lim);
-	  var parent;
-	  var lca;
-
-	  // Traverse up from v to find the LCA
-	  parent = v;
-	  do {
-	    parent = g.parent(parent);
-	    vPath.push(parent);
-	  } while (parent &&
-	           (postorderNums[parent].low > low || lim > postorderNums[parent].lim));
-	  lca = parent;
-
-	  // Traverse from w to LCA
-	  parent = w;
-	  while ((parent = g.parent(parent)) !== lca) {
-	    wPath.push(parent);
-	  }
-
-	  return { path: vPath.concat(wPath.reverse()), lca: lca };
-	}
-
-	function postorder(g) {
-	  var result = {};
-	  var lim = 0;
-
-	  function dfs(v) {
-	    var low = lim;
-	    _.forEach(g.children(v), dfs);
-	    result[v] = { low: low, lim: lim++ };
-	  }
-	  _.forEach(g.children(), dfs);
-
-	  return result;
-	}
-	return parentDummyChains_1;
-}
-
-export { requireParentDummyChains as __require };
-//# sourceMappingURL=parent-dummy-chains.js.map

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

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