@antv/layout 2.0.0-beta.2 → 2.0.1

package/lib/node_modules/d3-timer/src/timer.js

@@ -1,113 +0,0 @@
-var frame = 0, // is an animation frame pending?
-    timeout = 0, // is a timeout pending?
-    interval = 0, // are any timers active?
-    pokeDelay = 1000, // how frequently we check for clock skew
-    taskHead,
-    taskTail,
-    clockLast = 0,
-    clockNow = 0,
-    clockSkew = 0,
-    clock = typeof performance === "object" && performance.now ? performance : Date,
-    setFrame = typeof window === "object" && window.requestAnimationFrame ? window.requestAnimationFrame.bind(window) : function(f) { setTimeout(f, 17); };
-
-function now() {
-  return clockNow || (setFrame(clearNow), clockNow = clock.now() + clockSkew);
-}
-
-function clearNow() {
-  clockNow = 0;
-}
-
-function Timer() {
-  this._call =
-  this._time =
-  this._next = null;
-}
-
-Timer.prototype = timer.prototype = {
-  constructor: Timer,
-  restart: function(callback, delay, time) {
-    if (typeof callback !== "function") throw new TypeError("callback is not a function");
-    time = (time == null ? now() : +time) + (delay == null ? 0 : +delay);
-    if (!this._next && taskTail !== this) {
-      if (taskTail) taskTail._next = this;
-      else taskHead = this;
-      taskTail = this;
-    }
-    this._call = callback;
-    this._time = time;
-    sleep();
-  },
-  stop: function() {
-    if (this._call) {
-      this._call = null;
-      this._time = Infinity;
-      sleep();
-    }
-  }
-};
-
-function timer(callback, delay, time) {
-  var t = new Timer;
-  t.restart(callback, delay, time);
-  return t;
-}
-
-function timerFlush() {
-  now(); // Get the current time, if not already set.
-  ++frame; // Pretend we’ve set an alarm, if we haven’t already.
-  var t = taskHead, e;
-  while (t) {
-    if ((e = clockNow - t._time) >= 0) t._call.call(undefined, e);
-    t = t._next;
-  }
-  --frame;
-}
-
-function wake() {
-  clockNow = (clockLast = clock.now()) + clockSkew;
-  frame = timeout = 0;
-  try {
-    timerFlush();
-  } finally {
-    frame = 0;
-    nap();
-    clockNow = 0;
-  }
-}
-
-function poke() {
-  var now = clock.now(), delay = now - clockLast;
-  if (delay > pokeDelay) clockSkew -= delay, clockLast = now;
-}
-
-function nap() {
-  var t0, t1 = taskHead, t2, time = Infinity;
-  while (t1) {
-    if (t1._call) {
-      if (time > t1._time) time = t1._time;
-      t0 = t1, t1 = t1._next;
-    } else {
-      t2 = t1._next, t1._next = null;
-      t1 = t0 ? t0._next = t2 : taskHead = t2;
-    }
-  }
-  taskTail = t0;
-  sleep(time);
-}
-
-function sleep(time) {
-  if (frame) return; // Soonest alarm already set, or will be.
-  if (timeout) timeout = clearTimeout(timeout);
-  var delay = time - clockNow; // Strictly less than if we recomputed clockNow.
-  if (delay > 24) {
-    if (time < Infinity) timeout = setTimeout(wake, time - clock.now() - clockSkew);
-    if (interval) interval = clearInterval(interval);
-  } else {
-    if (!interval) clockLast = clock.now(), interval = setInterval(poke, pokeDelay);
-    frame = 1, setFrame(wake);
-  }
-}
-
-export { Timer, now, timer, timerFlush };
-//# sourceMappingURL=timer.js.map

package/lib/node_modules/d3-timer/src/timer.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"timer.js","sources":["../../../../node_modules/d3-timer/src/timer.js"],"sourcesContent":["var frame = 0, // is an animation frame pending?\n    timeout = 0, // is a timeout pending?\n    interval = 0, // are any timers active?\n    pokeDelay = 1000, // how frequently we check for clock skew\n    taskHead,\n    taskTail,\n    clockLast = 0,\n    clockNow = 0,\n    clockSkew = 0,\n    clock = typeof performance === \"object\" && performance.now ? performance : Date,\n    setFrame = typeof window === \"object\" && window.requestAnimationFrame ? window.requestAnimationFrame.bind(window) : function(f) { setTimeout(f, 17); };\n\nexport function now() {\n  return clockNow || (setFrame(clearNow), clockNow = clock.now() + clockSkew);\n}\n\nfunction clearNow() {\n  clockNow = 0;\n}\n\nexport function Timer() {\n  this._call =\n  this._time =\n  this._next = null;\n}\n\nTimer.prototype = timer.prototype = {\n  constructor: Timer,\n  restart: function(callback, delay, time) {\n    if (typeof callback !== \"function\") throw new TypeError(\"callback is not a function\");\n    time = (time == null ? now() : +time) + (delay == null ? 0 : +delay);\n    if (!this._next && taskTail !== this) {\n      if (taskTail) taskTail._next = this;\n      else taskHead = this;\n      taskTail = this;\n    }\n    this._call = callback;\n    this._time = time;\n    sleep();\n  },\n  stop: function() {\n    if (this._call) {\n      this._call = null;\n      this._time = Infinity;\n      sleep();\n    }\n  }\n};\n\nexport function timer(callback, delay, time) {\n  var t = new Timer;\n  t.restart(callback, delay, time);\n  return t;\n}\n\nexport function timerFlush() {\n  now(); // Get the current time, if not already set.\n  ++frame; // Pretend we’ve set an alarm, if we haven’t already.\n  var t = taskHead, e;\n  while (t) {\n    if ((e = clockNow - t._time) >= 0) t._call.call(undefined, e);\n    t = t._next;\n  }\n  --frame;\n}\n\nfunction wake() {\n  clockNow = (clockLast = clock.now()) + clockSkew;\n  frame = timeout = 0;\n  try {\n    timerFlush();\n  } finally {\n    frame = 0;\n    nap();\n    clockNow = 0;\n  }\n}\n\nfunction poke() {\n  var now = clock.now(), delay = now - clockLast;\n  if (delay > pokeDelay) clockSkew -= delay, clockLast = now;\n}\n\nfunction nap() {\n  var t0, t1 = taskHead, t2, time = Infinity;\n  while (t1) {\n    if (t1._call) {\n      if (time > t1._time) time = t1._time;\n      t0 = t1, t1 = t1._next;\n    } else {\n      t2 = t1._next, t1._next = null;\n      t1 = t0 ? t0._next = t2 : taskHead = t2;\n    }\n  }\n  taskTail = t0;\n  sleep(time);\n}\n\nfunction sleep(time) {\n  if (frame) return; // Soonest alarm already set, or will be.\n  if (timeout) timeout = clearTimeout(timeout);\n  var delay = time - clockNow; // Strictly less than if we recomputed clockNow.\n  if (delay > 24) {\n    if (time < Infinity) timeout = setTimeout(wake, time - clock.now() - clockSkew);\n    if (interval) interval = clearInterval(interval);\n  } else {\n    if (!interval) clockLast = clock.now(), interval = setInterval(poke, pokeDelay);\n    frame = 1, setFrame(wake);\n  }\n}\n"],"names":[],"mappings":"AAAA,IAAI,KAAK,GAAG,CAAC;AACb,IAAI,OAAO,GAAG,CAAC;AACf,IAAI,QAAQ,GAAG,CAAC;AAChB,IAAI,SAAS,GAAG,IAAI;AACpB,IAAI,QAAQ;AACZ,IAAI,QAAQ;AACZ,IAAI,SAAS,GAAG,CAAC;AACjB,IAAI,QAAQ,GAAG,CAAC;AAChB,IAAI,SAAS,GAAG,CAAC;AACjB,IAAI,KAAK,GAAG,OAAO,WAAW,KAAK,QAAQ,IAAI,WAAW,CAAC,GAAG,GAAG,WAAW,GAAG,IAAI;AACnF,IAAI,QAAQ,GAAG,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,CAAC,qBAAqB,GAAG,MAAM,CAAC,qBAAqB,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,SAAS,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;;AAEnJ,SAAS,GAAG,GAAG;AACtB,EAAE,OAAO,QAAQ,KAAK,QAAQ,CAAC,QAAQ,CAAC,EAAE,QAAQ,GAAG,KAAK,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;AAC7E;;AAEA,SAAS,QAAQ,GAAG;AACpB,EAAE,QAAQ,GAAG,CAAC;AACd;;AAEO,SAAS,KAAK,GAAG;AACxB,EAAE,IAAI,CAAC,KAAK;AACZ,EAAE,IAAI,CAAC,KAAK;AACZ,EAAE,IAAI,CAAC,KAAK,GAAG,IAAI;AACnB;;AAEA,KAAK,CAAC,SAAS,GAAG,KAAK,CAAC,SAAS,GAAG;AACpC,EAAE,WAAW,EAAE,KAAK;AACpB,EAAE,OAAO,EAAE,SAAS,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE;AAC3C,IAAI,IAAI,OAAO,QAAQ,KAAK,UAAU,EAAE,MAAM,IAAI,SAAS,CAAC,4BAA4B,CAAC;AACzF,IAAI,IAAI,GAAG,CAAC,IAAI,IAAI,IAAI,GAAG,GAAG,EAAE,GAAG,CAAC,IAAI,KAAK,KAAK,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC;AACxE,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,QAAQ,KAAK,IAAI,EAAE;AAC1C,MAAM,IAAI,QAAQ,EAAE,QAAQ,CAAC,KAAK,GAAG,IAAI;AACzC,WAAW,QAAQ,GAAG,IAAI;AAC1B,MAAM,QAAQ,GAAG,IAAI;AACrB,IAAI;AACJ,IAAI,IAAI,CAAC,KAAK,GAAG,QAAQ;AACzB,IAAI,IAAI,CAAC,KAAK,GAAG,IAAI;AACrB,IAAI,KAAK,EAAE;AACX,EAAE,CAAC;AACH,EAAE,IAAI,EAAE,WAAW;AACnB,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE;AACpB,MAAM,IAAI,CAAC,KAAK,GAAG,IAAI;AACvB,MAAM,IAAI,CAAC,KAAK,GAAG,QAAQ;AAC3B,MAAM,KAAK,EAAE;AACb,IAAI;AACJ,EAAE;AACF,CAAC;;AAEM,SAAS,KAAK,CAAC,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE;AAC7C,EAAE,IAAI,CAAC,GAAG,IAAI,KAAK;AACnB,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC;AAClC,EAAE,OAAO,CAAC;AACV;;AAEO,SAAS,UAAU,GAAG;AAC7B,EAAE,GAAG,EAAE,CAAC;AACR,EAAE,EAAE,KAAK,CAAC;AACV,EAAE,IAAI,CAAC,GAAG,QAAQ,EAAE,CAAC;AACrB,EAAE,OAAO,CAAC,EAAE;AACZ,IAAI,IAAI,CAAC,CAAC,GAAG,QAAQ,GAAG,CAAC,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;AACjE,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK;AACf,EAAE;AACF,EAAE,EAAE,KAAK;AACT;;AAEA,SAAS,IAAI,GAAG;AAChB,EAAE,QAAQ,GAAG,CAAC,SAAS,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,SAAS;AAClD,EAAE,KAAK,GAAG,OAAO,GAAG,CAAC;AACrB,EAAE,IAAI;AACN,IAAI,UAAU,EAAE;AAChB,EAAE,CAAC,SAAS;AACZ,IAAI,KAAK,GAAG,CAAC;AACb,IAAI,GAAG,EAAE;AACT,IAAI,QAAQ,GAAG,CAAC;AAChB,EAAE;AACF;;AAEA,SAAS,IAAI,GAAG;AAChB,EAAE,IAAI,GAAG,GAAG,KAAK,CAAC,GAAG,EAAE,EAAE,KAAK,GAAG,GAAG,GAAG,SAAS;AAChD,EAAE,IAAI,KAAK,GAAG,SAAS,EAAE,SAAS,IAAI,KAAK,EAAE,SAAS,GAAG,GAAG;AAC5D;;AAEA,SAAS,GAAG,GAAG;AACf,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,QAAQ,EAAE,EAAE,EAAE,IAAI,GAAG,QAAQ;AAC5C,EAAE,OAAO,EAAE,EAAE;AACb,IAAI,IAAI,EAAE,CAAC,KAAK,EAAE;AAClB,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC,KAAK,EAAE,IAAI,GAAG,EAAE,CAAC,KAAK;AAC1C,MAAM,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,KAAK;AAC5B,IAAI,CAAC,MAAM;AACX,MAAM,EAAE,GAAG,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,GAAG,IAAI;AACpC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,KAAK,GAAG,EAAE,GAAG,QAAQ,GAAG,EAAE;AAC7C,IAAI;AACJ,EAAE;AACF,EAAE,QAAQ,GAAG,EAAE;AACf,EAAE,KAAK,CAAC,IAAI,CAAC;AACb;;AAEA,SAAS,KAAK,CAAC,IAAI,EAAE;AACrB,EAAE,IAAI,KAAK,EAAE,OAAO;AACpB,EAAE,IAAI,OAAO,EAAE,OAAO,GAAG,YAAY,CAAC,OAAO,CAAC;AAC9C,EAAE,IAAI,KAAK,GAAG,IAAI,GAAG,QAAQ,CAAC;AAC9B,EAAE,IAAI,KAAK,GAAG,EAAE,EAAE;AAClB,IAAI,IAAI,IAAI,GAAG,QAAQ,EAAE,OAAO,GAAG,UAAU,CAAC,IAAI,EAAE,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;AACnF,IAAI,IAAI,QAAQ,EAAE,QAAQ,GAAG,aAAa,CAAC,QAAQ,CAAC;AACpD,EAAE,CAAC,MAAM;AACT,IAAI,IAAI,CAAC,QAAQ,EAAE,SAAS,GAAG,KAAK,CAAC,GAAG,EAAE,EAAE,QAAQ,GAAG,WAAW,CAAC,IAAI,EAAE,SAAS,CAAC;AACnF,IAAI,KAAK,GAAG,CAAC,EAAE,QAAQ,CAAC,IAAI,CAAC;AAC7B,EAAE;AACF;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/dagre/index.js

@@ -1,50 +0,0 @@
-import { __require as requireGraphlib } from './lib/graphlib.js';
-import { __require as requireLayout } from './lib/layout.js';
-import { __require as requireDebug } from './lib/debug.js';
-import { __require as requireUtil } from './lib/util.js';
-import { __require as requireVersion } from './lib/version.js';
-
-/*
-Copyright (c) 2012-2014 Chris Pettitt
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in
-all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-THE SOFTWARE.
-*/
-
-var dagre$1;
-var hasRequiredDagre;
-
-function requireDagre () {
-	if (hasRequiredDagre) return dagre$1;
-	hasRequiredDagre = 1;
-	dagre$1 = {
-	  graphlib: requireGraphlib(),
-
-	  layout: requireLayout(),
-	  debug: requireDebug(),
-	  util: {
-	    time: requireUtil().time,
-	    notime: requireUtil().notime
-	  },
-	  version: requireVersion()
-	};
-	return dagre$1;
-}
-
-export { requireDagre as __require };
-//# sourceMappingURL=index.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../node_modules/dagre/index.js"],"sourcesContent":["/*\nCopyright (c) 2012-2014 Chris Pettitt\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n*/\n\nmodule.exports = {\n  graphlib: require(\"./lib/graphlib\"),\n\n  layout: require(\"./lib/layout\"),\n  debug: require(\"./lib/debug\"),\n  util: {\n    time: require(\"./lib/util\").time,\n    notime: require(\"./lib/util\").notime\n  },\n  version: require(\"./lib/version\")\n};\n"],"names":["dagre","require$$0","require$$1","require$$2","require$$3","require$$4"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAsBA,CAAAA,OAAc,GAAG;GACf,QAAQ,EAAEC,eAAA,EAAyB;;GAEnC,MAAM,EAAEC,aAAA,EAAuB;GAC/B,KAAK,EAAEC,YAAA,EAAsB;AAC/B,GAAE,IAAI,EAAE;AACR,KAAI,IAAI,EAAEC,WAAA,EAAqB,CAAC,IAAI;KAChC,MAAM,EAAEA,WAAA,EAAqB,CAAC;IAC/B;AACH,GAAE,OAAO,EAAEC,cAAA;EACV;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/dagre/lib/acyclic.js

@@ -1,80 +0,0 @@
-import { __require as requireLodash } from './lodash.js';
-import { __require as requireGreedyFas } from './greedy-fas.js';
-
-var acyclic;
-var hasRequiredAcyclic;
-
-function requireAcyclic () {
-	if (hasRequiredAcyclic) return acyclic;
-	hasRequiredAcyclic = 1;
-
-	var _ = requireLodash();
-	var greedyFAS = requireGreedyFas();
-
-	acyclic = {
-	  run: run,
-	  undo: undo
-	};
-
-	function run(g) {
-	  var fas = (g.graph().acyclicer === "greedy"
-	    ? greedyFAS(g, weightFn(g))
-	    : dfsFAS(g));
-	  _.forEach(fas, function(e) {
-	    var label = g.edge(e);
-	    g.removeEdge(e);
-	    label.forwardName = e.name;
-	    label.reversed = true;
-	    g.setEdge(e.w, e.v, label, _.uniqueId("rev"));
-	  });
-
-	  function weightFn(g) {
-	    return function(e) {
-	      return g.edge(e).weight;
-	    };
-	  }
-	}
-
-	function dfsFAS(g) {
-	  var fas = [];
-	  var stack = {};
-	  var visited = {};
-
-	  function dfs(v) {
-	    if (_.has(visited, v)) {
-	      return;
-	    }
-	    visited[v] = true;
-	    stack[v] = true;
-	    _.forEach(g.outEdges(v), function(e) {
-	      if (_.has(stack, e.w)) {
-	        fas.push(e);
-	      } else {
-	        dfs(e.w);
-	      }
-	    });
-	    delete stack[v];
-	  }
-
-	  _.forEach(g.nodes(), dfs);
-	  return fas;
-	}
-
-	function undo(g) {
-	  _.forEach(g.edges(), function(e) {
-	    var label = g.edge(e);
-	    if (label.reversed) {
-	      g.removeEdge(e);
-
-	      var forwardName = label.forwardName;
-	      delete label.reversed;
-	      delete label.forwardName;
-	      g.setEdge(e.w, e.v, label, forwardName);
-	    }
-	  });
-	}
-	return acyclic;
-}
-
-export { requireAcyclic as __require };
-//# sourceMappingURL=acyclic.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"acyclic.js","sources":["../../../../node_modules/dagre/lib/acyclic.js"],"sourcesContent":["\"use strict\";\n\nvar _ = require(\"./lodash\");\nvar greedyFAS = require(\"./greedy-fas\");\n\nmodule.exports = {\n  run: run,\n  undo: undo\n};\n\nfunction run(g) {\n  var fas = (g.graph().acyclicer === \"greedy\"\n    ? greedyFAS(g, weightFn(g))\n    : dfsFAS(g));\n  _.forEach(fas, function(e) {\n    var label = g.edge(e);\n    g.removeEdge(e);\n    label.forwardName = e.name;\n    label.reversed = true;\n    g.setEdge(e.w, e.v, label, _.uniqueId(\"rev\"));\n  });\n\n  function weightFn(g) {\n    return function(e) {\n      return g.edge(e).weight;\n    };\n  }\n}\n\nfunction dfsFAS(g) {\n  var fas = [];\n  var stack = {};\n  var visited = {};\n\n  function dfs(v) {\n    if (_.has(visited, v)) {\n      return;\n    }\n    visited[v] = true;\n    stack[v] = true;\n    _.forEach(g.outEdges(v), function(e) {\n      if (_.has(stack, e.w)) {\n        fas.push(e);\n      } else {\n        dfs(e.w);\n      }\n    });\n    delete stack[v];\n  }\n\n  _.forEach(g.nodes(), dfs);\n  return fas;\n}\n\nfunction undo(g) {\n  _.forEach(g.edges(), function(e) {\n    var label = g.edge(e);\n    if (label.reversed) {\n      g.removeEdge(e);\n\n      var forwardName = label.forwardName;\n      delete label.reversed;\n      delete label.forwardName;\n      g.setEdge(e.w, e.v, label, forwardName);\n    }\n  });\n}\n"],"names":["require$$0","require$$1"],"mappings":";;;;;;;;;;CAEA,IAAI,CAAC,GAAGA,aAAA,EAAmB;CAC3B,IAAI,SAAS,GAAGC,gBAAA,EAAuB;;AAEvC,CAAA,OAAc,GAAG;GACf,GAAG,EAAE,GAAG;AACV,GAAE,IAAI,EAAE;EACP;;CAED,SAAS,GAAG,CAAC,CAAC,EAAE;GACd,IAAI,GAAG,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC,SAAS,KAAK;AACrC,OAAM,SAAS,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC;AAC9B,OAAM,MAAM,CAAC,CAAC,CAAC,CAAC;GACd,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,SAAS,CAAC,EAAE;KACzB,IAAI,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AACzB,KAAI,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;AACnB,KAAI,KAAK,CAAC,WAAW,GAAG,CAAC,CAAC,IAAI;AAC9B,KAAI,KAAK,CAAC,QAAQ,GAAG,IAAI;KACrB,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;AACjD,GAAA,CAAG,CAAC;;AAEJ,GAAE,SAAS,QAAQ,CAAC,CAAC,EAAE;KACnB,OAAO,SAAS,CAAC,EAAE;OACjB,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM;KAC7B,CAAK;AACL,GAAA;AACA,CAAA;;CAEA,SAAS,MAAM,CAAC,CAAC,EAAE;GACjB,IAAI,GAAG,GAAG,EAAE;GACZ,IAAI,KAAK,GAAG,EAAE;GACd,IAAI,OAAO,GAAG,EAAE;;AAElB,GAAE,SAAS,GAAG,CAAC,CAAC,EAAE;KACd,IAAI,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE;OACrB;AACN,KAAA;AACA,KAAI,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI;AACrB,KAAI,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI;AACnB,KAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE;OACnC,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE;AAC7B,SAAQ,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;AACnB,OAAA,CAAO,MAAM;AACb,SAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAChB,OAAA;AACA,KAAA,CAAK,CAAC;AACN,KAAI,OAAO,KAAK,CAAC,CAAC,CAAC;AACnB,GAAA;;GAEE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,GAAG,CAAC;AAC3B,GAAE,OAAO,GAAG;AACZ,CAAA;;CAEA,SAAS,IAAI,CAAC,CAAC,EAAE;GACf,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KAC/B,IAAI,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AACzB,KAAI,IAAI,KAAK,CAAC,QAAQ,EAAE;AACxB,OAAM,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;;AAErB,OAAM,IAAI,WAAW,GAAG,KAAK,CAAC,WAAW;OACnC,OAAO,KAAK,CAAC,QAAQ;OACrB,OAAO,KAAK,CAAC,WAAW;AAC9B,OAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC;AAC7C,KAAA;AACA,GAAA,CAAG,CAAC;AACJ,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/dagre/lib/add-border-segments.js

@@ -1,52 +0,0 @@
-import { __require as requireLodash } from './lodash.js';
-import { __require as requireUtil } from './util.js';
-
-var addBorderSegments_1;
-var hasRequiredAddBorderSegments;
-
-function requireAddBorderSegments () {
-	if (hasRequiredAddBorderSegments) return addBorderSegments_1;
-	hasRequiredAddBorderSegments = 1;
-	var _ = requireLodash();
-	var util = requireUtil();
-
-	addBorderSegments_1 = addBorderSegments;
-
-	function addBorderSegments(g) {
-	  function dfs(v) {
-	    var children = g.children(v);
-	    var node = g.node(v);
-	    if (children.length) {
-	      _.forEach(children, dfs);
-	    }
-
-	    if (_.has(node, "minRank")) {
-	      node.borderLeft = [];
-	      node.borderRight = [];
-	      for (var rank = node.minRank, maxRank = node.maxRank + 1;
-	        rank < maxRank;
-	        ++rank) {
-	        addBorderNode(g, "borderLeft", "_bl", v, node, rank);
-	        addBorderNode(g, "borderRight", "_br", v, node, rank);
-	      }
-	    }
-	  }
-
-	  _.forEach(g.children(), dfs);
-	}
-
-	function addBorderNode(g, prop, prefix, sg, sgNode, rank) {
-	  var label = { width: 0, height: 0, rank: rank, borderType: prop };
-	  var prev = sgNode[prop][rank - 1];
-	  var curr = util.addDummyNode(g, "border", label, prefix);
-	  sgNode[prop][rank] = curr;
-	  g.setParent(curr, sg);
-	  if (prev) {
-	    g.setEdge(prev, curr, { weight: 1 });
-	  }
-	}
-	return addBorderSegments_1;
-}
-
-export { requireAddBorderSegments as __require };
-//# sourceMappingURL=add-border-segments.js.map

package/lib/node_modules/dagre/lib/add-border-segments.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"add-border-segments.js","sources":["../../../../node_modules/dagre/lib/add-border-segments.js"],"sourcesContent":["var _ = require(\"./lodash\");\nvar util = require(\"./util\");\n\nmodule.exports = addBorderSegments;\n\nfunction addBorderSegments(g) {\n  function dfs(v) {\n    var children = g.children(v);\n    var node = g.node(v);\n    if (children.length) {\n      _.forEach(children, dfs);\n    }\n\n    if (_.has(node, \"minRank\")) {\n      node.borderLeft = [];\n      node.borderRight = [];\n      for (var rank = node.minRank, maxRank = node.maxRank + 1;\n        rank < maxRank;\n        ++rank) {\n        addBorderNode(g, \"borderLeft\", \"_bl\", v, node, rank);\n        addBorderNode(g, \"borderRight\", \"_br\", v, node, rank);\n      }\n    }\n  }\n\n  _.forEach(g.children(), dfs);\n}\n\nfunction addBorderNode(g, prop, prefix, sg, sgNode, rank) {\n  var label = { width: 0, height: 0, rank: rank, borderType: prop };\n  var prev = sgNode[prop][rank - 1];\n  var curr = util.addDummyNode(g, \"border\", label, prefix);\n  sgNode[prop][rank] = curr;\n  g.setParent(curr, sg);\n  if (prev) {\n    g.setEdge(prev, curr, { weight: 1 });\n  }\n}\n"],"names":["require$$0","require$$1"],"mappings":";;;;;;;;;CAAA,IAAI,CAAC,GAAGA,aAAA,EAAmB;CAC3B,IAAI,IAAI,GAAGC,WAAA,EAAiB;;AAE5B,CAAA,mBAAc,GAAG,iBAAiB;;CAElC,SAAS,iBAAiB,CAAC,CAAC,EAAE;AAC9B,GAAE,SAAS,GAAG,CAAC,CAAC,EAAE;KACd,IAAI,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;KAC5B,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AACxB,KAAI,IAAI,QAAQ,CAAC,MAAM,EAAE;AACzB,OAAM,CAAC,CAAC,OAAO,CAAC,QAAQ,EAAE,GAAG,CAAC;AAC9B,KAAA;;KAEI,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,EAAE;AAChC,OAAM,IAAI,CAAC,UAAU,GAAG,EAAE;AAC1B,OAAM,IAAI,CAAC,WAAW,GAAG,EAAE;AAC3B,OAAM,KAAK,IAAI,IAAI,GAAG,IAAI,CAAC,OAAO,EAAE,OAAO,GAAG,IAAI,CAAC,OAAO,GAAG,CAAC;SACtD,IAAI,GAAG,OAAO;SACd,EAAE,IAAI,EAAE;AAChB,SAAQ,aAAa,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC;AAC5D,SAAQ,aAAa,CAAC,CAAC,EAAE,aAAa,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC;AAC7D,OAAA;AACA,KAAA;AACA,GAAA;;GAEE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,EAAE,EAAE,GAAG,CAAC;AAC9B,CAAA;;AAEA,CAAA,SAAS,aAAa,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE;AAC1D,GAAE,IAAI,KAAK,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE;GACjE,IAAI,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;AACnC,GAAE,IAAI,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,CAAC;GACxD,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI;AAC3B,GAAE,CAAC,CAAC,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC;GACrB,IAAI,IAAI,EAAE;AACZ,KAAI,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;AACxC,GAAA;AACA,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/dagre/lib/coordinate-system.js

@@ -1,84 +0,0 @@
-import { __require as requireLodash } from './lodash.js';
-
-var coordinateSystem;
-var hasRequiredCoordinateSystem;
-
-function requireCoordinateSystem () {
-	if (hasRequiredCoordinateSystem) return coordinateSystem;
-	hasRequiredCoordinateSystem = 1;
-
-	var _ = requireLodash();
-
-	coordinateSystem = {
-	  adjust: adjust,
-	  undo: undo
-	};
-
-	function adjust(g) {
-	  var rankDir = g.graph().rankdir.toLowerCase();
-	  if (rankDir === "lr" || rankDir === "rl") {
-	    swapWidthHeight(g);
-	  }
-	}
-
-	function undo(g) {
-	  var rankDir = g.graph().rankdir.toLowerCase();
-	  if (rankDir === "bt" || rankDir === "rl") {
-	    reverseY(g);
-	  }
-
-	  if (rankDir === "lr" || rankDir === "rl") {
-	    swapXY(g);
-	    swapWidthHeight(g);
-	  }
-	}
-
-	function swapWidthHeight(g) {
-	  _.forEach(g.nodes(), function(v) { swapWidthHeightOne(g.node(v)); });
-	  _.forEach(g.edges(), function(e) { swapWidthHeightOne(g.edge(e)); });
-	}
-
-	function swapWidthHeightOne(attrs) {
-	  var w = attrs.width;
-	  attrs.width = attrs.height;
-	  attrs.height = w;
-	}
-
-	function reverseY(g) {
-	  _.forEach(g.nodes(), function(v) { reverseYOne(g.node(v)); });
-
-	  _.forEach(g.edges(), function(e) {
-	    var edge = g.edge(e);
-	    _.forEach(edge.points, reverseYOne);
-	    if (_.has(edge, "y")) {
-	      reverseYOne(edge);
-	    }
-	  });
-	}
-
-	function reverseYOne(attrs) {
-	  attrs.y = -attrs.y;
-	}
-
-	function swapXY(g) {
-	  _.forEach(g.nodes(), function(v) { swapXYOne(g.node(v)); });
-
-	  _.forEach(g.edges(), function(e) {
-	    var edge = g.edge(e);
-	    _.forEach(edge.points, swapXYOne);
-	    if (_.has(edge, "x")) {
-	      swapXYOne(edge);
-	    }
-	  });
-	}
-
-	function swapXYOne(attrs) {
-	  var x = attrs.x;
-	  attrs.x = attrs.y;
-	  attrs.y = x;
-	}
-	return coordinateSystem;
-}
-
-export { requireCoordinateSystem as __require };
-//# sourceMappingURL=coordinate-system.js.map

package/lib/node_modules/dagre/lib/coordinate-system.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"coordinate-system.js","sources":["../../../../node_modules/dagre/lib/coordinate-system.js"],"sourcesContent":["\"use strict\";\n\nvar _ = require(\"./lodash\");\n\nmodule.exports = {\n  adjust: adjust,\n  undo: undo\n};\n\nfunction adjust(g) {\n  var rankDir = g.graph().rankdir.toLowerCase();\n  if (rankDir === \"lr\" || rankDir === \"rl\") {\n    swapWidthHeight(g);\n  }\n}\n\nfunction undo(g) {\n  var rankDir = g.graph().rankdir.toLowerCase();\n  if (rankDir === \"bt\" || rankDir === \"rl\") {\n    reverseY(g);\n  }\n\n  if (rankDir === \"lr\" || rankDir === \"rl\") {\n    swapXY(g);\n    swapWidthHeight(g);\n  }\n}\n\nfunction swapWidthHeight(g) {\n  _.forEach(g.nodes(), function(v) { swapWidthHeightOne(g.node(v)); });\n  _.forEach(g.edges(), function(e) { swapWidthHeightOne(g.edge(e)); });\n}\n\nfunction swapWidthHeightOne(attrs) {\n  var w = attrs.width;\n  attrs.width = attrs.height;\n  attrs.height = w;\n}\n\nfunction reverseY(g) {\n  _.forEach(g.nodes(), function(v) { reverseYOne(g.node(v)); });\n\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    _.forEach(edge.points, reverseYOne);\n    if (_.has(edge, \"y\")) {\n      reverseYOne(edge);\n    }\n  });\n}\n\nfunction reverseYOne(attrs) {\n  attrs.y = -attrs.y;\n}\n\nfunction swapXY(g) {\n  _.forEach(g.nodes(), function(v) { swapXYOne(g.node(v)); });\n\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    _.forEach(edge.points, swapXYOne);\n    if (_.has(edge, \"x\")) {\n      swapXYOne(edge);\n    }\n  });\n}\n\nfunction swapXYOne(attrs) {\n  var x = attrs.x;\n  attrs.x = attrs.y;\n  attrs.y = x;\n}\n"],"names":["require$$0"],"mappings":";;;;;;;;;CAEA,IAAI,CAAC,GAAGA,aAAA,EAAmB;;AAE3B,CAAA,gBAAc,GAAG;GACf,MAAM,EAAE,MAAM;AAChB,GAAE,IAAI,EAAE;EACP;;CAED,SAAS,MAAM,CAAC,CAAC,EAAE;GACjB,IAAI,OAAO,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,WAAW,EAAE;GAC7C,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,KAAK,IAAI,EAAE;KACxC,eAAe,CAAC,CAAC,CAAC;AACtB,GAAA;AACA,CAAA;;CAEA,SAAS,IAAI,CAAC,CAAC,EAAE;GACf,IAAI,OAAO,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,WAAW,EAAE;GAC7C,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,KAAK,IAAI,EAAE;KACxC,QAAQ,CAAC,CAAC,CAAC;AACf,GAAA;;GAEE,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,KAAK,IAAI,EAAE;KACxC,MAAM,CAAC,CAAC,CAAC;KACT,eAAe,CAAC,CAAC,CAAC;AACtB,GAAA;AACA,CAAA;;CAEA,SAAS,eAAe,CAAC,CAAC,EAAE;GAC1B,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA,CAAE,CAAC;GACpE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA,CAAE,CAAC;AACtE,CAAA;;CAEA,SAAS,kBAAkB,CAAC,KAAK,EAAE;AACnC,GAAE,IAAI,CAAC,GAAG,KAAK,CAAC,KAAK;AACrB,GAAE,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,MAAM;AAC5B,GAAE,KAAK,CAAC,MAAM,GAAG,CAAC;AAClB,CAAA;;CAEA,SAAS,QAAQ,CAAC,CAAC,EAAE;GACnB,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA,CAAE,CAAC;;GAE7D,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KAC/B,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;KACpB,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,WAAW,CAAC;KACnC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE;OACpB,WAAW,CAAC,IAAI,CAAC;AACvB,KAAA;AACA,GAAA,CAAG,CAAC;AACJ,CAAA;;CAEA,SAAS,WAAW,CAAC,KAAK,EAAE;AAC5B,GAAE,KAAK,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;AACpB,CAAA;;CAEA,SAAS,MAAM,CAAC,CAAC,EAAE;GACjB,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA,CAAE,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;KACpB,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC;KACjC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE;OACpB,SAAS,CAAC,IAAI,CAAC;AACrB,KAAA;AACA,GAAA,CAAG,CAAC;AACJ,CAAA;;CAEA,SAAS,SAAS,CAAC,KAAK,EAAE;AAC1B,GAAE,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC;AACjB,GAAE,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;AACnB,GAAE,KAAK,CAAC,CAAC,GAAG,CAAC;AACb,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/dagre/lib/data/list.js

@@ -1,67 +0,0 @@
-/*
- * Simple doubly linked list implementation derived from Cormen, et al.,
- * "Introduction to Algorithms".
- */
-
-var list;
-var hasRequiredList;
-
-function requireList () {
-	if (hasRequiredList) return list;
-	hasRequiredList = 1;
-	list = List;
-
-	function List() {
-	  var sentinel = {};
-	  sentinel._next = sentinel._prev = sentinel;
-	  this._sentinel = sentinel;
-	}
-
-	List.prototype.dequeue = function() {
-	  var sentinel = this._sentinel;
-	  var entry = sentinel._prev;
-	  if (entry !== sentinel) {
-	    unlink(entry);
-	    return entry;
-	  }
-	};
-
-	List.prototype.enqueue = function(entry) {
-	  var sentinel = this._sentinel;
-	  if (entry._prev && entry._next) {
-	    unlink(entry);
-	  }
-	  entry._next = sentinel._next;
-	  sentinel._next._prev = entry;
-	  sentinel._next = entry;
-	  entry._prev = sentinel;
-	};
-
-	List.prototype.toString = function() {
-	  var strs = [];
-	  var sentinel = this._sentinel;
-	  var curr = sentinel._prev;
-	  while (curr !== sentinel) {
-	    strs.push(JSON.stringify(curr, filterOutLinks));
-	    curr = curr._prev;
-	  }
-	  return "[" + strs.join(", ") + "]";
-	};
-
-	function unlink(entry) {
-	  entry._prev._next = entry._next;
-	  entry._next._prev = entry._prev;
-	  delete entry._next;
-	  delete entry._prev;
-	}
-
-	function filterOutLinks(k, v) {
-	  if (k !== "_next" && k !== "_prev") {
-	    return v;
-	  }
-	}
-	return list;
-}
-
-export { requireList as __require };
-//# sourceMappingURL=list.js.map

package/lib/node_modules/dagre/lib/data/list.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"list.js","sources":["../../../../../node_modules/dagre/lib/data/list.js"],"sourcesContent":["/*\n * Simple doubly linked list implementation derived from Cormen, et al.,\n * \"Introduction to Algorithms\".\n */\n\nmodule.exports = List;\n\nfunction List() {\n  var sentinel = {};\n  sentinel._next = sentinel._prev = sentinel;\n  this._sentinel = sentinel;\n}\n\nList.prototype.dequeue = function() {\n  var sentinel = this._sentinel;\n  var entry = sentinel._prev;\n  if (entry !== sentinel) {\n    unlink(entry);\n    return entry;\n  }\n};\n\nList.prototype.enqueue = function(entry) {\n  var sentinel = this._sentinel;\n  if (entry._prev && entry._next) {\n    unlink(entry);\n  }\n  entry._next = sentinel._next;\n  sentinel._next._prev = entry;\n  sentinel._next = entry;\n  entry._prev = sentinel;\n};\n\nList.prototype.toString = function() {\n  var strs = [];\n  var sentinel = this._sentinel;\n  var curr = sentinel._prev;\n  while (curr !== sentinel) {\n    strs.push(JSON.stringify(curr, filterOutLinks));\n    curr = curr._prev;\n  }\n  return \"[\" + strs.join(\", \") + \"]\";\n};\n\nfunction unlink(entry) {\n  entry._prev._next = entry._next;\n  entry._next._prev = entry._prev;\n  delete entry._next;\n  delete entry._prev;\n}\n\nfunction filterOutLinks(k, v) {\n  if (k !== \"_next\" && k !== \"_prev\") {\n    return v;\n  }\n}\n"],"names":[],"mappings":";;;;;;;;;;;AAKA,CAAA,IAAc,GAAG,IAAI;;AAErB,CAAA,SAAS,IAAI,GAAG;GACd,IAAI,QAAQ,GAAG,EAAE;GACjB,QAAQ,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK,GAAG,QAAQ;AAC5C,GAAE,IAAI,CAAC,SAAS,GAAG,QAAQ;AAC3B,CAAA;;AAEA,CAAA,IAAI,CAAC,SAAS,CAAC,OAAO,GAAG,WAAW;AACpC,GAAE,IAAI,QAAQ,GAAG,IAAI,CAAC,SAAS;AAC/B,GAAE,IAAI,KAAK,GAAG,QAAQ,CAAC,KAAK;AAC5B,GAAE,IAAI,KAAK,KAAK,QAAQ,EAAE;KACtB,MAAM,CAAC,KAAK,CAAC;AACjB,KAAI,OAAO,KAAK;AAChB,GAAA;CACA,CAAC;;AAED,CAAA,IAAI,CAAC,SAAS,CAAC,OAAO,GAAG,SAAS,KAAK,EAAE;AACzC,GAAE,IAAI,QAAQ,GAAG,IAAI,CAAC,SAAS;GAC7B,IAAI,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,EAAE;KAC9B,MAAM,CAAC,KAAK,CAAC;AACjB,GAAA;AACA,GAAE,KAAK,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK;AAC9B,GAAE,QAAQ,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK;AAC9B,GAAE,QAAQ,CAAC,KAAK,GAAG,KAAK;AACxB,GAAE,KAAK,CAAC,KAAK,GAAG,QAAQ;CACxB,CAAC;;AAED,CAAA,IAAI,CAAC,SAAS,CAAC,QAAQ,GAAG,WAAW;GACnC,IAAI,IAAI,GAAG,EAAE;AACf,GAAE,IAAI,QAAQ,GAAG,IAAI,CAAC,SAAS;AAC/B,GAAE,IAAI,IAAI,GAAG,QAAQ,CAAC,KAAK;AAC3B,GAAE,OAAO,IAAI,KAAK,QAAQ,EAAE;AAC5B,KAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;AACnD,KAAI,IAAI,GAAG,IAAI,CAAC,KAAK;AACrB,GAAA;GACE,OAAO,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG;CACpC,CAAC;;CAED,SAAS,MAAM,CAAC,KAAK,EAAE;GACrB,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK;GAC/B,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK;GAC/B,OAAO,KAAK,CAAC,KAAK;GAClB,OAAO,KAAK,CAAC,KAAK;AACpB,CAAA;;AAEA,CAAA,SAAS,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE;GAC5B,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC,KAAK,OAAO,EAAE;AACtC,KAAI,OAAO,CAAC;AACZ,GAAA;AACA,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/dagre/lib/debug.js

@@ -1,49 +0,0 @@
-import { __require as requireLodash } from './lodash.js';
-import { __require as requireUtil } from './util.js';
-import { __require as requireGraphlib } from './graphlib.js';
-
-var debug;
-var hasRequiredDebug;
-
-function requireDebug () {
-	if (hasRequiredDebug) return debug;
-	hasRequiredDebug = 1;
-	var _ = requireLodash();
-	var util = requireUtil();
-	var Graph = requireGraphlib().Graph;
-
-	debug = {
-	  debugOrdering: debugOrdering
-	};
-
-	/* istanbul ignore next */
-	function debugOrdering(g) {
-	  var layerMatrix = util.buildLayerMatrix(g);
-
-	  var h = new Graph({ compound: true, multigraph: true }).setGraph({});
-
-	  _.forEach(g.nodes(), function(v) {
-	    h.setNode(v, { label: v });
-	    h.setParent(v, "layer" + g.node(v).rank);
-	  });
-
-	  _.forEach(g.edges(), function(e) {
-	    h.setEdge(e.v, e.w, {}, e.name);
-	  });
-
-	  _.forEach(layerMatrix, function(layer, i) {
-	    var layerV = "layer" + i;
-	    h.setNode(layerV, { rank: "same" });
-	    _.reduce(layer, function(u, v) {
-	      h.setEdge(u, v, { style: "invis" });
-	      return v;
-	    });
-	  });
-
-	  return h;
-	}
-	return debug;
-}
-
-export { requireDebug as __require };
-//# sourceMappingURL=debug.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"debug.js","sources":["../../../../node_modules/dagre/lib/debug.js"],"sourcesContent":["var _ = require(\"./lodash\");\nvar util = require(\"./util\");\nvar Graph = require(\"./graphlib\").Graph;\n\nmodule.exports = {\n  debugOrdering: debugOrdering\n};\n\n/* istanbul ignore next */\nfunction debugOrdering(g) {\n  var layerMatrix = util.buildLayerMatrix(g);\n\n  var h = new Graph({ compound: true, multigraph: true }).setGraph({});\n\n  _.forEach(g.nodes(), function(v) {\n    h.setNode(v, { label: v });\n    h.setParent(v, \"layer\" + g.node(v).rank);\n  });\n\n  _.forEach(g.edges(), function(e) {\n    h.setEdge(e.v, e.w, {}, e.name);\n  });\n\n  _.forEach(layerMatrix, function(layer, i) {\n    var layerV = \"layer\" + i;\n    h.setNode(layerV, { rank: \"same\" });\n    _.reduce(layer, function(u, v) {\n      h.setEdge(u, v, { style: \"invis\" });\n      return v;\n    });\n  });\n\n  return h;\n}\n"],"names":["require$$0","require$$1","require$$2"],"mappings":";;;;;;;;;;CAAA,IAAI,CAAC,GAAGA,aAAA,EAAmB;CAC3B,IAAI,IAAI,GAAGC,WAAA,EAAiB;AAC5B,CAAA,IAAI,KAAK,GAAGC,eAAA,EAAqB,CAAC,KAAK;;AAEvC,CAAA,KAAc,GAAG;AACjB,GAAE,aAAa,EAAE;EAChB;;AAED;CACA,SAAS,aAAa,CAAC,CAAC,EAAE;GACxB,IAAI,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;;GAE1C,IAAI,CAAC,GAAG,IAAI,KAAK,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;;GAEpE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;KAC/B,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;AAC9B,KAAI,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AAC5C,GAAA,CAAG,CAAC;;GAEF,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,EAAE;AACnC,KAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC;AACnC,GAAA,CAAG,CAAC;;GAEF,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,SAAS,KAAK,EAAE,CAAC,EAAE;AAC5C,KAAI,IAAI,MAAM,GAAG,OAAO,GAAG,CAAC;KACxB,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;KACnC,CAAC,CAAC,MAAM,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,CAAC,EAAE;AACnC,OAAM,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC;AACzC,OAAM,OAAO,CAAC;AACd,KAAA,CAAK,CAAC;AACN,GAAA,CAAG,CAAC;;AAEJ,GAAE,OAAO,CAAC;AACV,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/dagre/lib/graphlib.js

@@ -1,31 +0,0 @@
-import { commonjsRequire } from '../../../_virtual/_commonjs-dynamic-modules.js';
-import { __require as requireGraphlib$1 } from '../../graphlib/index.js';
-
-/* global window */
-
-var graphlib_1;
-var hasRequiredGraphlib;
-
-function requireGraphlib () {
-	if (hasRequiredGraphlib) return graphlib_1;
-	hasRequiredGraphlib = 1;
-	var graphlib;
-
-	if (typeof commonjsRequire === "function") {
-	  try {
-	    graphlib = requireGraphlib$1();
-	  } catch (e) {
-	    // continue regardless of error
-	  }
-	}
-
-	if (!graphlib) {
-	  graphlib = window.graphlib;
-	}
-
-	graphlib_1 = graphlib;
-	return graphlib_1;
-}
-
-export { requireGraphlib as __require };
-//# sourceMappingURL=graphlib.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"graphlib.js","sources":["../../../../node_modules/dagre/lib/graphlib.js"],"sourcesContent":["/* global window */\n\nvar graphlib;\n\nif (typeof require === \"function\") {\n  try {\n    graphlib = require(\"graphlib\");\n  } catch (e) {\n    // continue regardless of error\n  }\n}\n\nif (!graphlib) {\n  graphlib = window.graphlib;\n}\n\nmodule.exports = graphlib;\n"],"names":["require","require$$0"],"mappings":";;;;;;;;;;;AAEA,CAAA,IAAI,QAAQ;;AAEZ,CAAA,IAAI,OAAOA,eAAO,KAAK,UAAU,EAAE;AACnC,GAAE,IAAI;KACF,QAAQ,GAAGC,iBAAA,EAAmB;GAClC,CAAG,CAAC,OAAO,CAAC,EAAE;AACd;AACA,GAAA;AACA,CAAA;;CAEA,IAAI,CAAC,QAAQ,EAAE;AACf,GAAE,QAAQ,GAAG,MAAM,CAAC,QAAQ;AAC5B,CAAA;;AAEA,CAAA,UAAc,GAAG,QAAQ;;;;;;","x_google_ignoreList":[0]}