@antv/layout 2.0.0-beta.2 → 2.0.1

package/lib/node_modules/dagre/lib/lodash.js

@@ -1,83 +0,0 @@
-import { commonjsRequire } from '../../../_virtual/_commonjs-dynamic-modules.js';
-import { __require as requireCloneDeep } from '../../lodash/cloneDeep.js';
-import { __require as requireConstant } from '../../lodash/constant.js';
-import { __require as requireDefaults } from '../../lodash/defaults.js';
-import { __require as requireEach } from '../../lodash/each.js';
-import { __require as requireFilter } from '../../lodash/filter.js';
-import { __require as requireFind } from '../../lodash/find.js';
-import { __require as requireFlatten } from '../../lodash/flatten.js';
-import { __require as requireForEach } from '../../lodash/forEach.js';
-import { __require as requireForIn } from '../../lodash/forIn.js';
-import { __require as requireHas } from '../../lodash/has.js';
-import { __require as requireIsUndefined } from '../../lodash/isUndefined.js';
-import { __require as requireLast } from '../../lodash/last.js';
-import { __require as requireMap } from '../../lodash/map.js';
-import { __require as requireMapValues } from '../../lodash/mapValues.js';
-import { __require as requireMax } from '../../lodash/max.js';
-import { __require as requireMerge } from '../../lodash/merge.js';
-import { __require as requireMin } from '../../lodash/min.js';
-import { __require as requireMinBy } from '../../lodash/minBy.js';
-import { __require as requireNow } from '../../lodash/now.js';
-import { __require as requirePick } from '../../lodash/pick.js';
-import { __require as requireRange } from '../../lodash/range.js';
-import { __require as requireReduce } from '../../lodash/reduce.js';
-import { __require as requireSortBy } from '../../lodash/sortBy.js';
-import { __require as requireUniqueId } from '../../lodash/uniqueId.js';
-import { __require as requireValues } from '../../lodash/values.js';
-import { __require as requireZipObject } from '../../lodash/zipObject.js';
-
-/* global window */
-
-var lodash_1;
-var hasRequiredLodash;
-
-function requireLodash () {
-	if (hasRequiredLodash) return lodash_1;
-	hasRequiredLodash = 1;
-	var lodash;
-
-	if (typeof commonjsRequire === "function") {
-	  try {
-	    lodash = {
-	      cloneDeep: requireCloneDeep(),
-	      constant: requireConstant(),
-	      defaults: requireDefaults(),
-	      each: requireEach(),
-	      filter: requireFilter(),
-	      find: requireFind(),
-	      flatten: requireFlatten(),
-	      forEach: requireForEach(),
-	      forIn: requireForIn(),
-	      has:  requireHas(),
-	      isUndefined: requireIsUndefined(),
-	      last: requireLast(),
-	      map: requireMap(),
-	      mapValues: requireMapValues(),
-	      max: requireMax(),
-	      merge: requireMerge(),
-	      min: requireMin(),
-	      minBy: requireMinBy(),
-	      now: requireNow(),
-	      pick: requirePick(),
-	      range: requireRange(),
-	      reduce: requireReduce(),
-	      sortBy: requireSortBy(),
-	      uniqueId: requireUniqueId(),
-	      values: requireValues(),
-	      zipObject: requireZipObject(),
-	    };
-	  } catch (e) {
-	    // continue regardless of error
-	  }
-	}
-
-	if (!lodash) {
-	  lodash = window._;
-	}
-
-	lodash_1 = lodash;
-	return lodash_1;
-}
-
-export { requireLodash as __require };
-//# sourceMappingURL=lodash.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"lodash.js","sources":["../../../../node_modules/dagre/lib/lodash.js"],"sourcesContent":["/* global window */\n\nvar lodash;\n\nif (typeof require === \"function\") {\n  try {\n    lodash = {\n      cloneDeep: require(\"lodash/cloneDeep\"),\n      constant: require(\"lodash/constant\"),\n      defaults: require(\"lodash/defaults\"),\n      each: require(\"lodash/each\"),\n      filter: require(\"lodash/filter\"),\n      find: require(\"lodash/find\"),\n      flatten: require(\"lodash/flatten\"),\n      forEach: require(\"lodash/forEach\"),\n      forIn: require(\"lodash/forIn\"),\n      has:  require(\"lodash/has\"),\n      isUndefined: require(\"lodash/isUndefined\"),\n      last: require(\"lodash/last\"),\n      map: require(\"lodash/map\"),\n      mapValues: require(\"lodash/mapValues\"),\n      max: require(\"lodash/max\"),\n      merge: require(\"lodash/merge\"),\n      min: require(\"lodash/min\"),\n      minBy: require(\"lodash/minBy\"),\n      now: require(\"lodash/now\"),\n      pick: require(\"lodash/pick\"),\n      range: require(\"lodash/range\"),\n      reduce: require(\"lodash/reduce\"),\n      sortBy: require(\"lodash/sortBy\"),\n      uniqueId: require(\"lodash/uniqueId\"),\n      values: require(\"lodash/values\"),\n      zipObject: require(\"lodash/zipObject\"),\n    };\n  } catch (e) {\n    // continue regardless of error\n  }\n}\n\nif (!lodash) {\n  lodash = window._;\n}\n\nmodule.exports = lodash;\n"],"names":["require","require$$0","require$$1","require$$2","require$$3","require$$4","require$$5","require$$6","require$$7","require$$8","require$$9","require$$10","require$$11","require$$12","require$$13","require$$14","require$$15","require$$16","require$$17","require$$18","require$$19","require$$20","require$$21","require$$22","require$$23","require$$24","require$$25"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEA,CAAA,IAAI,MAAM;;AAEV,CAAA,IAAI,OAAOA,eAAO,KAAK,UAAU,EAAE;AACnC,GAAE,IAAI;AACN,KAAI,MAAM,GAAG;OACP,SAAS,EAAEC,gBAAA,EAA2B;OACtC,QAAQ,EAAEC,eAAA,EAA0B;OACpC,QAAQ,EAAEC,eAAA,EAA0B;OACpC,IAAI,EAAEC,WAAA,EAAsB;OAC5B,MAAM,EAAEC,aAAA,EAAwB;OAChC,IAAI,EAAEC,WAAA,EAAsB;OAC5B,OAAO,EAAEC,cAAA,EAAyB;OAClC,OAAO,EAAEC,cAAA,EAAyB;OAClC,KAAK,EAAEC,YAAA,EAAuB;OAC9B,GAAG,GAAGC,UAAA,EAAqB;OAC3B,WAAW,EAAEC,kBAAA,EAA6B;OAC1C,IAAI,EAAEC,WAAA,EAAsB;OAC5B,GAAG,EAAEC,UAAA,EAAqB;OAC1B,SAAS,EAAEC,gBAAA,EAA2B;OACtC,GAAG,EAAEC,UAAA,EAAqB;OAC1B,KAAK,EAAEC,YAAA,EAAuB;OAC9B,GAAG,EAAEC,UAAA,EAAqB;OAC1B,KAAK,EAAEC,YAAA,EAAuB;OAC9B,GAAG,EAAEC,UAAA,EAAqB;OAC1B,IAAI,EAAEC,WAAA,EAAsB;OAC5B,KAAK,EAAEC,YAAA,EAAuB;OAC9B,MAAM,EAAEC,aAAA,EAAwB;OAChC,MAAM,EAAEC,aAAA,EAAwB;OAChC,QAAQ,EAAEC,eAAA,EAA0B;OACpC,MAAM,EAAEC,aAAA,EAAwB;OAChC,SAAS,EAAEC,gBAAA,EAA2B;MACvC;GACL,CAAG,CAAC,OAAO,CAAC,EAAE;AACd;AACA,GAAA;AACA,CAAA;;CAEA,IAAI,CAAC,MAAM,EAAE;AACb,GAAE,MAAM,GAAG,MAAM,CAAC,CAAC;AACnB,CAAA;;AAEA,CAAA,QAAc,GAAG,MAAM;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/dagre/lib/nesting-graph.js

@@ -1,146 +0,0 @@
-import { __require as requireLodash } from './lodash.js';
-import { __require as requireUtil } from './util.js';
-
-var nestingGraph;
-var hasRequiredNestingGraph;
-
-function requireNestingGraph () {
-	if (hasRequiredNestingGraph) return nestingGraph;
-	hasRequiredNestingGraph = 1;
-	var _ = requireLodash();
-	var util = requireUtil();
-
-	nestingGraph = {
-	  run: run,
-	  cleanup: cleanup
-	};
-
-	/*
-	 * A nesting graph creates dummy nodes for the tops and bottoms of subgraphs,
-	 * adds appropriate edges to ensure that all cluster nodes are placed between
-	 * these boundries, and ensures that the graph is connected.
-	 *
-	 * In addition we ensure, through the use of the minlen property, that nodes
-	 * and subgraph border nodes to not end up on the same rank.
-	 *
-	 * Preconditions:
-	 *
-	 *    1. Input graph is a DAG
-	 *    2. Nodes in the input graph has a minlen attribute
-	 *
-	 * Postconditions:
-	 *
-	 *    1. Input graph is connected.
-	 *    2. Dummy nodes are added for the tops and bottoms of subgraphs.
-	 *    3. The minlen attribute for nodes is adjusted to ensure nodes do not
-	 *       get placed on the same rank as subgraph border nodes.
-	 *
-	 * The nesting graph idea comes from Sander, "Layout of Compound Directed
-	 * Graphs."
-	 */
-	function run(g) {
-	  var root = util.addDummyNode(g, "root", {}, "_root");
-	  var depths = treeDepths(g);
-	  var height = _.max(_.values(depths)) - 1; // Note: depths is an Object not an array
-	  var nodeSep = 2 * height + 1;
-
-	  g.graph().nestingRoot = root;
-
-	  // Multiply minlen by nodeSep to align nodes on non-border ranks.
-	  _.forEach(g.edges(), function(e) { g.edge(e).minlen *= nodeSep; });
-
-	  // Calculate a weight that is sufficient to keep subgraphs vertically compact
-	  var weight = sumWeights(g) + 1;
-
-	  // Create border nodes and link them up
-	  _.forEach(g.children(), function(child) {
-	    dfs(g, root, nodeSep, weight, height, depths, child);
-	  });
-
-	  // Save the multiplier for node layers for later removal of empty border
-	  // layers.
-	  g.graph().nodeRankFactor = nodeSep;
-	}
-
-	function dfs(g, root, nodeSep, weight, height, depths, v) {
-	  var children = g.children(v);
-	  if (!children.length) {
-	    if (v !== root) {
-	      g.setEdge(root, v, { weight: 0, minlen: nodeSep });
-	    }
-	    return;
-	  }
-
-	  var top = util.addBorderNode(g, "_bt");
-	  var bottom = util.addBorderNode(g, "_bb");
-	  var label = g.node(v);
-
-	  g.setParent(top, v);
-	  label.borderTop = top;
-	  g.setParent(bottom, v);
-	  label.borderBottom = bottom;
-
-	  _.forEach(children, function(child) {
-	    dfs(g, root, nodeSep, weight, height, depths, child);
-
-	    var childNode = g.node(child);
-	    var childTop = childNode.borderTop ? childNode.borderTop : child;
-	    var childBottom = childNode.borderBottom ? childNode.borderBottom : child;
-	    var thisWeight = childNode.borderTop ? weight : 2 * weight;
-	    var minlen = childTop !== childBottom ? 1 : height - depths[v] + 1;
-
-	    g.setEdge(top, childTop, {
-	      weight: thisWeight,
-	      minlen: minlen,
-	      nestingEdge: true
-	    });
-
-	    g.setEdge(childBottom, bottom, {
-	      weight: thisWeight,
-	      minlen: minlen,
-	      nestingEdge: true
-	    });
-	  });
-
-	  if (!g.parent(v)) {
-	    g.setEdge(root, top, { weight: 0, minlen: height + depths[v] });
-	  }
-	}
-
-	function treeDepths(g) {
-	  var depths = {};
-	  function dfs(v, depth) {
-	    var children = g.children(v);
-	    if (children && children.length) {
-	      _.forEach(children, function(child) {
-	        dfs(child, depth + 1);
-	      });
-	    }
-	    depths[v] = depth;
-	  }
-	  _.forEach(g.children(), function(v) { dfs(v, 1); });
-	  return depths;
-	}
-
-	function sumWeights(g) {
-	  return _.reduce(g.edges(), function(acc, e) {
-	    return acc + g.edge(e).weight;
-	  }, 0);
-	}
-
-	function cleanup(g) {
-	  var graphLabel = g.graph();
-	  g.removeNode(graphLabel.nestingRoot);
-	  delete graphLabel.nestingRoot;
-	  _.forEach(g.edges(), function(e) {
-	    var edge = g.edge(e);
-	    if (edge.nestingEdge) {
-	      g.removeEdge(e);
-	    }
-	  });
-	}
-	return nestingGraph;
-}
-
-export { requireNestingGraph as __require };
-//# sourceMappingURL=nesting-graph.js.map

package/lib/node_modules/dagre/lib/nesting-graph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"nesting-graph.js","sources":["../../../../node_modules/dagre/lib/nesting-graph.js"],"sourcesContent":["var _ = require(\"./lodash\");\nvar util = require(\"./util\");\n\nmodule.exports = {\n  run: run,\n  cleanup: cleanup\n};\n\n/*\n * A nesting graph creates dummy nodes for the tops and bottoms of subgraphs,\n * adds appropriate edges to ensure that all cluster nodes are placed between\n * these boundries, and ensures that the graph is connected.\n *\n * In addition we ensure, through the use of the minlen property, that nodes\n * and subgraph border nodes to not end up on the same rank.\n *\n * Preconditions:\n *\n *    1. Input graph is a DAG\n *    2. Nodes in the input graph has a minlen attribute\n *\n * Postconditions:\n *\n *    1. Input graph is connected.\n *    2. Dummy nodes are added for the tops and bottoms of subgraphs.\n *    3. The minlen attribute for nodes is adjusted to ensure nodes do not\n *       get placed on the same rank as subgraph border nodes.\n *\n * The nesting graph idea comes from Sander, \"Layout of Compound Directed\n * Graphs.\"\n */\nfunction run(g) {\n  var root = util.addDummyNode(g, \"root\", {}, \"_root\");\n  var depths = treeDepths(g);\n  var height = _.max(_.values(depths)) - 1; // Note: depths is an Object not an array\n  var nodeSep = 2 * height + 1;\n\n  g.graph().nestingRoot = root;\n\n  // Multiply minlen by nodeSep to align nodes on non-border ranks.\n  _.forEach(g.edges(), function(e) { g.edge(e).minlen *= nodeSep; });\n\n  // Calculate a weight that is sufficient to keep subgraphs vertically compact\n  var weight = sumWeights(g) + 1;\n\n  // Create border nodes and link them up\n  _.forEach(g.children(), function(child) {\n    dfs(g, root, nodeSep, weight, height, depths, child);\n  });\n\n  // Save the multiplier for node layers for later removal of empty border\n  // layers.\n  g.graph().nodeRankFactor = nodeSep;\n}\n\nfunction dfs(g, root, nodeSep, weight, height, depths, v) {\n  var children = g.children(v);\n  if (!children.length) {\n    if (v !== root) {\n      g.setEdge(root, v, { weight: 0, minlen: nodeSep });\n    }\n    return;\n  }\n\n  var top = util.addBorderNode(g, \"_bt\");\n  var bottom = util.addBorderNode(g, \"_bb\");\n  var label = g.node(v);\n\n  g.setParent(top, v);\n  label.borderTop = top;\n  g.setParent(bottom, v);\n  label.borderBottom = bottom;\n\n  _.forEach(children, function(child) {\n    dfs(g, root, nodeSep, weight, height, depths, child);\n\n    var childNode = g.node(child);\n    var childTop = childNode.borderTop ? childNode.borderTop : child;\n    var childBottom = childNode.borderBottom ? childNode.borderBottom : child;\n    var thisWeight = childNode.borderTop ? weight : 2 * weight;\n    var minlen = childTop !== childBottom ? 1 : height - depths[v] + 1;\n\n    g.setEdge(top, childTop, {\n      weight: thisWeight,\n      minlen: minlen,\n      nestingEdge: true\n    });\n\n    g.setEdge(childBottom, bottom, {\n      weight: thisWeight,\n      minlen: minlen,\n      nestingEdge: true\n    });\n  });\n\n  if (!g.parent(v)) {\n    g.setEdge(root, top, { weight: 0, minlen: height + depths[v] });\n  }\n}\n\nfunction treeDepths(g) {\n  var depths = {};\n  function dfs(v, depth) {\n    var children = g.children(v);\n    if (children && children.length) {\n      _.forEach(children, function(child) {\n        dfs(child, depth + 1);\n      });\n    }\n    depths[v] = depth;\n  }\n  _.forEach(g.children(), function(v) { dfs(v, 1); });\n  return depths;\n}\n\nfunction sumWeights(g) {\n  return _.reduce(g.edges(), function(acc, e) {\n    return acc + g.edge(e).weight;\n  }, 0);\n}\n\nfunction cleanup(g) {\n  var graphLabel = g.graph();\n  g.removeNode(graphLabel.nestingRoot);\n  delete graphLabel.nestingRoot;\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    if (edge.nestingEdge) {\n      g.removeEdge(e);\n    }\n  });\n}\n"],"names":["require$$0","require$$1"],"mappings":";;;;;;;;;CAAA,IAAI,CAAC,GAAGA,aAAA,EAAmB;CAC3B,IAAI,IAAI,GAAGC,WAAA,EAAiB;;AAE5B,CAAA,YAAc,GAAG;GACf,GAAG,EAAE,GAAG;AACV,GAAE,OAAO,EAAE;EACV;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,GAAG,CAAC,CAAC,EAAE;AAChB,GAAE,IAAI,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,OAAO,CAAC;AACtD,GAAE,IAAI,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC;AAC5B,GAAE,IAAI,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;AAC3C,GAAE,IAAI,OAAO,GAAG,CAAC,GAAG,MAAM,GAAG,CAAC;;AAE9B,GAAE,CAAC,CAAC,KAAK,EAAE,CAAC,WAAW,GAAG,IAAI;;AAE9B;GACE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,OAAO,CAAC,CAAA,CAAE,CAAC;;AAEpE;GACE,IAAI,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC;;AAEhC;GACE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,EAAE,EAAE,SAAS,KAAK,EAAE;AAC1C,KAAI,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC;AACxD,GAAA,CAAG,CAAC;;AAEJ;AACA;AACA,GAAE,CAAC,CAAC,KAAK,EAAE,CAAC,cAAc,GAAG,OAAO;AACpC,CAAA;;AAEA,CAAA,SAAS,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE;GACxD,IAAI,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;AAC9B,GAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE;AACxB,KAAI,IAAI,CAAC,KAAK,IAAI,EAAE;AACpB,OAAM,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC;AACxD,KAAA;KACI;AACJ,GAAA;;GAEE,IAAI,GAAG,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,KAAK,CAAC;GACtC,IAAI,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,KAAK,CAAC;GACzC,IAAI,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;;AAEvB,GAAE,CAAC,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,CAAC;AACrB,GAAE,KAAK,CAAC,SAAS,GAAG,GAAG;AACvB,GAAE,CAAC,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC;AACxB,GAAE,KAAK,CAAC,YAAY,GAAG,MAAM;;GAE3B,CAAC,CAAC,OAAO,CAAC,QAAQ,EAAE,SAAS,KAAK,EAAE;AACtC,KAAI,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC;;KAEpD,IAAI,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;KAC7B,IAAI,QAAQ,GAAG,SAAS,CAAC,SAAS,GAAG,SAAS,CAAC,SAAS,GAAG,KAAK;KAChE,IAAI,WAAW,GAAG,SAAS,CAAC,YAAY,GAAG,SAAS,CAAC,YAAY,GAAG,KAAK;KACzE,IAAI,UAAU,GAAG,SAAS,CAAC,SAAS,GAAG,MAAM,GAAG,CAAC,GAAG,MAAM;AAC9D,KAAI,IAAI,MAAM,GAAG,QAAQ,KAAK,WAAW,GAAG,CAAC,GAAG,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC;;AAEtE,KAAI,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,QAAQ,EAAE;OACvB,MAAM,EAAE,UAAU;OAClB,MAAM,EAAE,MAAM;AACpB,OAAM,WAAW,EAAE;AACnB,MAAK,CAAC;;AAEN,KAAI,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,MAAM,EAAE;OAC7B,MAAM,EAAE,UAAU;OAClB,MAAM,EAAE,MAAM;AACpB,OAAM,WAAW,EAAE;AACnB,MAAK,CAAC;AACN,GAAA,CAAG,CAAC;;GAEF,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE;KAChB,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;AACnE,GAAA;AACA,CAAA;;CAEA,SAAS,UAAU,CAAC,CAAC,EAAE;GACrB,IAAI,MAAM,GAAG,EAAE;AACjB,GAAE,SAAS,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE;KACrB,IAAI,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;AAChC,KAAI,IAAI,QAAQ,IAAI,QAAQ,CAAC,MAAM,EAAE;OAC/B,CAAC,CAAC,OAAO,CAAC,QAAQ,EAAE,SAAS,KAAK,EAAE;AAC1C,SAAQ,GAAG,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC;AAC7B,OAAA,CAAO,CAAC;AACR,KAAA;AACA,KAAI,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK;AACrB,GAAA;GACE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA,CAAE,CAAC;AACrD,GAAE,OAAO,MAAM;AACf,CAAA;;CAEA,SAAS,UAAU,CAAC,CAAC,EAAE;AACvB,GAAE,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,GAAG,EAAE,CAAC,EAAE;KAC1C,OAAO,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM;GACjC,CAAG,EAAE,CAAC,CAAC;AACP,CAAA;;CAEA,SAAS,OAAO,CAAC,CAAC,EAAE;AACpB,GAAE,IAAI,UAAU,GAAG,CAAC,CAAC,KAAK,EAAE;AAC5B,GAAE,CAAC,CAAC,UAAU,CAAC,UAAU,CAAC,WAAW,CAAC;GACpC,OAAO,UAAU,CAAC,WAAW;GAC7B,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,WAAW,EAAE;AAC1B,OAAM,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;AACrB,KAAA;AACA,GAAA,CAAG,CAAC;AACJ,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/dagre/lib/normalize.js

@@ -1,103 +0,0 @@
-import { __require as requireLodash } from './lodash.js';
-import { __require as requireUtil } from './util.js';
-
-var normalize;
-var hasRequiredNormalize;
-
-function requireNormalize () {
-	if (hasRequiredNormalize) return normalize;
-	hasRequiredNormalize = 1;
-
-	var _ = requireLodash();
-	var util = requireUtil();
-
-	normalize = {
-	  run: run,
-	  undo: undo
-	};
-
-	/*
-	 * Breaks any long edges in the graph into short segments that span 1 layer
-	 * each. This operation is undoable with the denormalize function.
-	 *
-	 * Pre-conditions:
-	 *
-	 *    1. The input graph is a DAG.
-	 *    2. Each node in the graph has a "rank" property.
-	 *
-	 * Post-condition:
-	 *
-	 *    1. All edges in the graph have a length of 1.
-	 *    2. Dummy nodes are added where edges have been split into segments.
-	 *    3. The graph is augmented with a "dummyChains" attribute which contains
-	 *       the first dummy in each chain of dummy nodes produced.
-	 */
-	function run(g) {
-	  g.graph().dummyChains = [];
-	  _.forEach(g.edges(), function(edge) { normalizeEdge(g, edge); });
-	}
-
-	function normalizeEdge(g, e) {
-	  var v = e.v;
-	  var vRank = g.node(v).rank;
-	  var w = e.w;
-	  var wRank = g.node(w).rank;
-	  var name = e.name;
-	  var edgeLabel = g.edge(e);
-	  var labelRank = edgeLabel.labelRank;
-
-	  if (wRank === vRank + 1) return;
-
-	  g.removeEdge(e);
-
-	  var dummy, attrs, i;
-	  for (i = 0, ++vRank; vRank < wRank; ++i, ++vRank) {
-	    edgeLabel.points = [];
-	    attrs = {
-	      width: 0, height: 0,
-	      edgeLabel: edgeLabel, edgeObj: e,
-	      rank: vRank
-	    };
-	    dummy = util.addDummyNode(g, "edge", attrs, "_d");
-	    if (vRank === labelRank) {
-	      attrs.width = edgeLabel.width;
-	      attrs.height = edgeLabel.height;
-	      attrs.dummy = "edge-label";
-	      attrs.labelpos = edgeLabel.labelpos;
-	    }
-	    g.setEdge(v, dummy, { weight: edgeLabel.weight }, name);
-	    if (i === 0) {
-	      g.graph().dummyChains.push(dummy);
-	    }
-	    v = dummy;
-	  }
-
-	  g.setEdge(v, w, { weight: edgeLabel.weight }, name);
-	}
-
-	function undo(g) {
-	  _.forEach(g.graph().dummyChains, function(v) {
-	    var node = g.node(v);
-	    var origLabel = node.edgeLabel;
-	    var w;
-	    g.setEdge(node.edgeObj, origLabel);
-	    while (node.dummy) {
-	      w = g.successors(v)[0];
-	      g.removeNode(v);
-	      origLabel.points.push({ x: node.x, y: node.y });
-	      if (node.dummy === "edge-label") {
-	        origLabel.x = node.x;
-	        origLabel.y = node.y;
-	        origLabel.width = node.width;
-	        origLabel.height = node.height;
-	      }
-	      v = w;
-	      node = g.node(v);
-	    }
-	  });
-	}
-	return normalize;
-}
-
-export { requireNormalize as __require };
-//# sourceMappingURL=normalize.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"normalize.js","sources":["../../../../node_modules/dagre/lib/normalize.js"],"sourcesContent":["\"use strict\";\n\nvar _ = require(\"./lodash\");\nvar util = require(\"./util\");\n\nmodule.exports = {\n  run: run,\n  undo: undo\n};\n\n/*\n * Breaks any long edges in the graph into short segments that span 1 layer\n * each. This operation is undoable with the denormalize function.\n *\n * Pre-conditions:\n *\n *    1. The input graph is a DAG.\n *    2. Each node in the graph has a \"rank\" property.\n *\n * Post-condition:\n *\n *    1. All edges in the graph have a length of 1.\n *    2. Dummy nodes are added where edges have been split into segments.\n *    3. The graph is augmented with a \"dummyChains\" attribute which contains\n *       the first dummy in each chain of dummy nodes produced.\n */\nfunction run(g) {\n  g.graph().dummyChains = [];\n  _.forEach(g.edges(), function(edge) { normalizeEdge(g, edge); });\n}\n\nfunction normalizeEdge(g, e) {\n  var v = e.v;\n  var vRank = g.node(v).rank;\n  var w = e.w;\n  var wRank = g.node(w).rank;\n  var name = e.name;\n  var edgeLabel = g.edge(e);\n  var labelRank = edgeLabel.labelRank;\n\n  if (wRank === vRank + 1) return;\n\n  g.removeEdge(e);\n\n  var dummy, attrs, i;\n  for (i = 0, ++vRank; vRank < wRank; ++i, ++vRank) {\n    edgeLabel.points = [];\n    attrs = {\n      width: 0, height: 0,\n      edgeLabel: edgeLabel, edgeObj: e,\n      rank: vRank\n    };\n    dummy = util.addDummyNode(g, \"edge\", attrs, \"_d\");\n    if (vRank === labelRank) {\n      attrs.width = edgeLabel.width;\n      attrs.height = edgeLabel.height;\n      attrs.dummy = \"edge-label\";\n      attrs.labelpos = edgeLabel.labelpos;\n    }\n    g.setEdge(v, dummy, { weight: edgeLabel.weight }, name);\n    if (i === 0) {\n      g.graph().dummyChains.push(dummy);\n    }\n    v = dummy;\n  }\n\n  g.setEdge(v, w, { weight: edgeLabel.weight }, name);\n}\n\nfunction undo(g) {\n  _.forEach(g.graph().dummyChains, function(v) {\n    var node = g.node(v);\n    var origLabel = node.edgeLabel;\n    var w;\n    g.setEdge(node.edgeObj, origLabel);\n    while (node.dummy) {\n      w = g.successors(v)[0];\n      g.removeNode(v);\n      origLabel.points.push({ x: node.x, y: node.y });\n      if (node.dummy === \"edge-label\") {\n        origLabel.x = node.x;\n        origLabel.y = node.y;\n        origLabel.width = node.width;\n        origLabel.height = node.height;\n      }\n      v = w;\n      node = g.node(v);\n    }\n  });\n}\n"],"names":["require$$0","require$$1"],"mappings":";;;;;;;;;;CAEA,IAAI,CAAC,GAAGA,aAAA,EAAmB;CAC3B,IAAI,IAAI,GAAGC,WAAA,EAAiB;;AAE5B,CAAA,SAAc,GAAG;GACf,GAAG,EAAE,GAAG;AACV,GAAE,IAAI,EAAE;EACP;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,GAAG,CAAC,CAAC,EAAE;AAChB,GAAE,CAAC,CAAC,KAAK,EAAE,CAAC,WAAW,GAAG,EAAE;GAC1B,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,IAAI,EAAE,EAAE,aAAa,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAA,CAAE,CAAC;AAClE,CAAA;;AAEA,CAAA,SAAS,aAAa,CAAC,CAAC,EAAE,CAAC,EAAE;AAC7B,GAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;GACX,IAAI,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI;AAC5B,GAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;GACX,IAAI,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI;AAC5B,GAAE,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI;GACjB,IAAI,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AAC3B,GAAE,IAAI,SAAS,GAAG,SAAS,CAAC,SAAS;;AAErC,GAAE,IAAI,KAAK,KAAK,KAAK,GAAG,CAAC,EAAE;;AAE3B,GAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;;AAEjB,GAAE,IAAI,KAAK,EAAE,KAAK,EAAE,CAAC;AACrB,GAAE,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,EAAE,KAAK,GAAG,KAAK,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE;AACpD,KAAI,SAAS,CAAC,MAAM,GAAG,EAAE;AACzB,KAAI,KAAK,GAAG;AACZ,OAAM,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC;AACzB,OAAM,SAAS,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC;AACtC,OAAM,IAAI,EAAE;MACP;AACL,KAAI,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC;AACrD,KAAI,IAAI,KAAK,KAAK,SAAS,EAAE;AAC7B,OAAM,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC,KAAK;AACnC,OAAM,KAAK,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM;AACrC,OAAM,KAAK,CAAC,KAAK,GAAG,YAAY;AAChC,OAAM,KAAK,CAAC,QAAQ,GAAG,SAAS,CAAC,QAAQ;AACzC,KAAA;AACA,KAAI,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,MAAM,EAAE,SAAS,CAAC,MAAM,EAAE,EAAE,IAAI,CAAC;AAC3D,KAAI,IAAI,CAAC,KAAK,CAAC,EAAE;OACX,CAAC,CAAC,KAAK,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC;AACvC,KAAA;KACI,CAAC,GAAG,KAAK;AACb,GAAA;;AAEA,GAAE,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,SAAS,CAAC,MAAM,EAAE,EAAE,IAAI,CAAC;AACrD,CAAA;;CAEA,SAAS,IAAI,CAAC,CAAC,EAAE;AACjB,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,SAAS,GAAG,IAAI,CAAC,SAAS;AAClC,KAAI,IAAI,CAAC;KACL,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,SAAS,CAAC;AACtC,KAAI,OAAO,IAAI,CAAC,KAAK,EAAE;OACjB,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC5B,OAAM,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;AACrB,OAAM,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC;AACrD,OAAM,IAAI,IAAI,CAAC,KAAK,KAAK,YAAY,EAAE;AACvC,SAAQ,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;AAC5B,SAAQ,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;AAC5B,SAAQ,SAAS,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK;AACpC,SAAQ,SAAS,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM;AACtC,OAAA;OACM,CAAC,GAAG,CAAC;AACX,OAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AACtB,KAAA;AACA,GAAA,CAAG,CAAC;AACJ,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/dagre/lib/order/add-subgraph-constraints.js

@@ -1,66 +0,0 @@
-import { __require as requireLodash } from '../lodash.js';
-
-var addSubgraphConstraints_1;
-var hasRequiredAddSubgraphConstraints;
-
-function requireAddSubgraphConstraints () {
-	if (hasRequiredAddSubgraphConstraints) return addSubgraphConstraints_1;
-	hasRequiredAddSubgraphConstraints = 1;
-	var _ = requireLodash();
-
-	addSubgraphConstraints_1 = addSubgraphConstraints;
-
-	function addSubgraphConstraints(g, cg, vs) {
-	  var prev = {},
-	    rootPrev;
-
-	  _.forEach(vs, function(v) {
-	    var child = g.parent(v),
-	      parent,
-	      prevChild;
-	    while (child) {
-	      parent = g.parent(child);
-	      if (parent) {
-	        prevChild = prev[parent];
-	        prev[parent] = child;
-	      } else {
-	        prevChild = rootPrev;
-	        rootPrev = child;
-	      }
-	      if (prevChild && prevChild !== child) {
-	        cg.setEdge(prevChild, child);
-	        return;
-	      }
-	      child = parent;
-	    }
-	  });
-
-	  /*
-	  function dfs(v) {
-	    var children = v ? g.children(v) : g.children();
-	    if (children.length) {
-	      var min = Number.POSITIVE_INFINITY,
-	          subgraphs = [];
-	      _.each(children, function(child) {
-	        var childMin = dfs(child);
-	        if (g.children(child).length) {
-	          subgraphs.push({ v: child, order: childMin });
-	        }
-	        min = Math.min(min, childMin);
-	      });
-	      _.reduce(_.sortBy(subgraphs, "order"), function(prev, curr) {
-	        cg.setEdge(prev.v, curr.v);
-	        return curr;
-	      });
-	      return min;
-	    }
-	    return g.node(v).order;
-	  }
-	  dfs(undefined);
-	  */
-	}
-	return addSubgraphConstraints_1;
-}
-
-export { requireAddSubgraphConstraints as __require };
-//# sourceMappingURL=add-subgraph-constraints.js.map

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

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

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

@@ -1,40 +0,0 @@
-import { __require as requireLodash } from '../lodash.js';
-
-var barycenter_1;
-var hasRequiredBarycenter;
-
-function requireBarycenter () {
-	if (hasRequiredBarycenter) return barycenter_1;
-	hasRequiredBarycenter = 1;
-	var _ = requireLodash();
-
-	barycenter_1 = barycenter;
-
-	function barycenter(g, movable) {
-	  return _.map(movable, function(v) {
-	    var inV = g.inEdges(v);
-	    if (!inV.length) {
-	      return { v: v };
-	    } else {
-	      var result = _.reduce(inV, function(acc, e) {
-	        var edge = g.edge(e),
-	          nodeU = g.node(e.v);
-	        return {
-	          sum: acc.sum + (edge.weight * nodeU.order),
-	          weight: acc.weight + edge.weight
-	        };
-	      }, { sum: 0, weight: 0 });
-
-	      return {
-	        v: v,
-	        barycenter: result.sum / result.weight,
-	        weight: result.weight
-	      };
-	    }
-	  });
-	}
-	return barycenter_1;
-}
-
-export { requireBarycenter as __require };
-//# sourceMappingURL=barycenter.js.map

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

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

package/lib/node_modules/dagre/lib/order/build-layer-graph.js

@@ -1,87 +0,0 @@
-import { __require as requireLodash } from '../lodash.js';
-import { __require as requireGraphlib } from '../graphlib.js';
-
-var buildLayerGraph_1;
-var hasRequiredBuildLayerGraph;
-
-function requireBuildLayerGraph () {
-	if (hasRequiredBuildLayerGraph) return buildLayerGraph_1;
-	hasRequiredBuildLayerGraph = 1;
-	var _ = requireLodash();
-	var Graph = requireGraphlib().Graph;
-
-	buildLayerGraph_1 = buildLayerGraph;
-
-	/*
-	 * Constructs a graph that can be used to sort a layer of nodes. The graph will
-	 * contain all base and subgraph nodes from the request layer in their original
-	 * hierarchy and any edges that are incident on these nodes and are of the type
-	 * requested by the "relationship" parameter.
-	 *
-	 * Nodes from the requested rank that do not have parents are assigned a root
-	 * node in the output graph, which is set in the root graph attribute. This
-	 * makes it easy to walk the hierarchy of movable nodes during ordering.
-	 *
-	 * Pre-conditions:
-	 *
-	 *    1. Input graph is a DAG
-	 *    2. Base nodes in the input graph have a rank attribute
-	 *    3. Subgraph nodes in the input graph has minRank and maxRank attributes
-	 *    4. Edges have an assigned weight
-	 *
-	 * Post-conditions:
-	 *
-	 *    1. Output graph has all nodes in the movable rank with preserved
-	 *       hierarchy.
-	 *    2. Root nodes in the movable layer are made children of the node
-	 *       indicated by the root attribute of the graph.
-	 *    3. Non-movable nodes incident on movable nodes, selected by the
-	 *       relationship parameter, are included in the graph (without hierarchy).
-	 *    4. Edges incident on movable nodes, selected by the relationship
-	 *       parameter, are added to the output graph.
-	 *    5. The weights for copied edges are aggregated as need, since the output
-	 *       graph is not a multi-graph.
-	 */
-	function buildLayerGraph(g, rank, relationship) {
-	  var root = createRootNode(g),
-	    result = new Graph({ compound: true }).setGraph({ root: root })
-	      .setDefaultNodeLabel(function(v) { return g.node(v); });
-
-	  _.forEach(g.nodes(), function(v) {
-	    var node = g.node(v),
-	      parent = g.parent(v);
-
-	    if (node.rank === rank || node.minRank <= rank && rank <= node.maxRank) {
-	      result.setNode(v);
-	      result.setParent(v, parent || root);
-
-	      // This assumes we have only short edges!
-	      _.forEach(g[relationship](v), function(e) {
-	        var u = e.v === v ? e.w : e.v,
-	          edge = result.edge(u, v),
-	          weight = !_.isUndefined(edge) ? edge.weight : 0;
-	        result.setEdge(u, v, { weight: g.edge(e).weight + weight });
-	      });
-
-	      if (_.has(node, "minRank")) {
-	        result.setNode(v, {
-	          borderLeft: node.borderLeft[rank],
-	          borderRight: node.borderRight[rank]
-	        });
-	      }
-	    }
-	  });
-
-	  return result;
-	}
-
-	function createRootNode(g) {
-	  var v;
-	  while (g.hasNode((v = _.uniqueId("_root"))));
-	  return v;
-	}
-	return buildLayerGraph_1;
-}
-
-export { requireBuildLayerGraph as __require };
-//# sourceMappingURL=build-layer-graph.js.map

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

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

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

@@ -1,79 +0,0 @@
-import { __require as requireLodash } from '../lodash.js';
-
-var crossCount_1;
-var hasRequiredCrossCount;
-
-function requireCrossCount () {
-	if (hasRequiredCrossCount) return crossCount_1;
-	hasRequiredCrossCount = 1;
-
-	var _ = requireLodash();
-
-	crossCount_1 = crossCount;
-
-	/*
-	 * A function that takes a layering (an array of layers, each with an array of
-	 * ordererd nodes) and a graph and returns a weighted crossing count.
-	 *
-	 * Pre-conditions:
-	 *
-	 *    1. Input graph must be simple (not a multigraph), directed, and include
-	 *       only simple edges.
-	 *    2. Edges in the input graph must have assigned weights.
-	 *
-	 * Post-conditions:
-	 *
-	 *    1. The graph and layering matrix are left unchanged.
-	 *
-	 * This algorithm is derived from Barth, et al., "Bilayer Cross Counting."
-	 */
-	function crossCount(g, layering) {
-	  var cc = 0;
-	  for (var i = 1; i < layering.length; ++i) {
-	    cc += twoLayerCrossCount(g, layering[i-1], layering[i]);
-	  }
-	  return cc;
-	}
-
-	function twoLayerCrossCount(g, northLayer, southLayer) {
-	  // Sort all of the edges between the north and south layers by their position
-	  // in the north layer and then the south. Map these edges to the position of
-	  // their head in the south layer.
-	  var southPos = _.zipObject(southLayer,
-	    _.map(southLayer, function (v, i) { return i; }));
-	  var southEntries = _.flatten(_.map(northLayer, function(v) {
-	    return _.sortBy(_.map(g.outEdges(v), function(e) {
-	      return { pos: southPos[e.w], weight: g.edge(e).weight };
-	    }), "pos");
-	  }), true);
-
-	  // Build the accumulator tree
-	  var firstIndex = 1;
-	  while (firstIndex < southLayer.length) firstIndex <<= 1;
-	  var treeSize = 2 * firstIndex - 1;
-	  firstIndex -= 1;
-	  var tree = _.map(new Array(treeSize), function() { return 0; });
-
-	  // Calculate the weighted crossings
-	  var cc = 0;
-	  _.forEach(southEntries.forEach(function(entry) {
-	    var index = entry.pos + firstIndex;
-	    tree[index] += entry.weight;
-	    var weightSum = 0;
-	    while (index > 0) {
-	      if (index % 2) {
-	        weightSum += tree[index + 1];
-	      }
-	      index = (index - 1) >> 1;
-	      tree[index] += entry.weight;
-	    }
-	    cc += entry.weight * weightSum;
-	  }));
-
-	  return cc;
-	}
-	return crossCount_1;
-}
-
-export { requireCrossCount as __require };
-//# sourceMappingURL=cross-count.js.map