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

package/lib/node_modules/graphlib/lib/alg/tarjan.js

@@ -0,0 +1,60 @@
+import { __require as requireLodash } from '../lodash.js';
+
+var tarjan_1;
+var hasRequiredTarjan;
+
+function requireTarjan () {
+	if (hasRequiredTarjan) return tarjan_1;
+	hasRequiredTarjan = 1;
+	var _ = requireLodash();
+
+	tarjan_1 = tarjan;
+
+	function tarjan(g) {
+	  var index = 0;
+	  var stack = [];
+	  var visited = {}; // node id -> { onStack, lowlink, index }
+	  var results = [];
+
+	  function dfs(v) {
+	    var entry = visited[v] = {
+	      onStack: true,
+	      lowlink: index,
+	      index: index++
+	    };
+	    stack.push(v);
+
+	    g.successors(v).forEach(function(w) {
+	      if (!_.has(visited, w)) {
+	        dfs(w);
+	        entry.lowlink = Math.min(entry.lowlink, visited[w].lowlink);
+	      } else if (visited[w].onStack) {
+	        entry.lowlink = Math.min(entry.lowlink, visited[w].index);
+	      }
+	    });
+
+	    if (entry.lowlink === entry.index) {
+	      var cmpt = [];
+	      var w;
+	      do {
+	        w = stack.pop();
+	        visited[w].onStack = false;
+	        cmpt.push(w);
+	      } while (v !== w);
+	      results.push(cmpt);
+	    }
+	  }
+
+	  g.nodes().forEach(function(v) {
+	    if (!_.has(visited, v)) {
+	      dfs(v);
+	    }
+	  });
+
+	  return results;
+	}
+	return tarjan_1;
+}
+
+export { requireTarjan as __require };
+//# sourceMappingURL=tarjan.js.map

package/lib/node_modules/graphlib/lib/alg/tarjan.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tarjan.js","sources":["../../../../../node_modules/graphlib/lib/alg/tarjan.js"],"sourcesContent":["var _ = require(\"../lodash\");\n\nmodule.exports = tarjan;\n\nfunction tarjan(g) {\n  var index = 0;\n  var stack = [];\n  var visited = {}; // node id -> { onStack, lowlink, index }\n  var results = [];\n\n  function dfs(v) {\n    var entry = visited[v] = {\n      onStack: true,\n      lowlink: index,\n      index: index++\n    };\n    stack.push(v);\n\n    g.successors(v).forEach(function(w) {\n      if (!_.has(visited, w)) {\n        dfs(w);\n        entry.lowlink = Math.min(entry.lowlink, visited[w].lowlink);\n      } else if (visited[w].onStack) {\n        entry.lowlink = Math.min(entry.lowlink, visited[w].index);\n      }\n    });\n\n    if (entry.lowlink === entry.index) {\n      var cmpt = [];\n      var w;\n      do {\n        w = stack.pop();\n        visited[w].onStack = false;\n        cmpt.push(w);\n      } while (v !== w);\n      results.push(cmpt);\n    }\n  }\n\n  g.nodes().forEach(function(v) {\n    if (!_.has(visited, v)) {\n      dfs(v);\n    }\n  });\n\n  return results;\n}\n"],"names":["require$$0"],"mappings":";;;;;;;;CAAA,IAAI,CAAC,GAAGA,aAAA,EAAoB;;AAE5B,CAAA,QAAc,GAAG,MAAM;;CAEvB,SAAS,MAAM,CAAC,CAAC,EAAE;GACjB,IAAI,KAAK,GAAG,CAAC;GACb,IAAI,KAAK,GAAG,EAAE;AAChB,GAAE,IAAI,OAAO,GAAG,EAAE,CAAC;GACjB,IAAI,OAAO,GAAG,EAAE;;AAElB,GAAE,SAAS,GAAG,CAAC,CAAC,EAAE;AAClB,KAAI,IAAI,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG;OACvB,OAAO,EAAE,IAAI;OACb,OAAO,EAAE,KAAK;OACd,KAAK,EAAE,KAAK;MACb;AACL,KAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;;KAEb,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;OAClC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE;SACtB,GAAG,CAAC,CAAC,CAAC;AACd,SAAQ,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;OACnE,CAAO,MAAM,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE;AACrC,SAAQ,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;AACjE,OAAA;AACA,KAAA,CAAK,CAAC;;KAEF,IAAI,KAAK,CAAC,OAAO,KAAK,KAAK,CAAC,KAAK,EAAE;OACjC,IAAI,IAAI,GAAG,EAAE;AACnB,OAAM,IAAI,CAAC;AACX,OAAM,GAAG;AACT,SAAQ,CAAC,GAAG,KAAK,CAAC,GAAG,EAAE;AACvB,SAAQ,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,KAAK;AAClC,SAAQ,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;OACpB,CAAO,QAAQ,CAAC,KAAK,CAAC;AACtB,OAAM,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC;AACxB,KAAA;AACA,GAAA;;GAEE,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;KAC5B,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE;OACtB,GAAG,CAAC,CAAC,CAAC;AACZ,KAAA;AACA,GAAA,CAAG,CAAC;;AAEJ,GAAE,OAAO,OAAO;AAChB,CAAA;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/graphlib/lib/alg/topsort.js

@@ -0,0 +1,48 @@
+import { __require as requireLodash } from '../lodash.js';
+
+var topsort_1;
+var hasRequiredTopsort;
+
+function requireTopsort () {
+	if (hasRequiredTopsort) return topsort_1;
+	hasRequiredTopsort = 1;
+	var _ = requireLodash();
+
+	topsort_1 = topsort;
+	topsort.CycleException = CycleException;
+
+	function topsort(g) {
+	  var visited = {};
+	  var stack = {};
+	  var results = [];
+
+	  function visit(node) {
+	    if (_.has(stack, node)) {
+	      throw new CycleException();
+	    }
+
+	    if (!_.has(visited, node)) {
+	      stack[node] = true;
+	      visited[node] = true;
+	      _.each(g.predecessors(node), visit);
+	      delete stack[node];
+	      results.push(node);
+	    }
+	  }
+
+	  _.each(g.sinks(), visit);
+
+	  if (_.size(visited) !== g.nodeCount()) {
+	    throw new CycleException();
+	  }
+
+	  return results;
+	}
+
+	function CycleException() {}
+	CycleException.prototype = new Error(); // must be an instance of Error to pass testing
+	return topsort_1;
+}
+
+export { requireTopsort as __require };
+//# sourceMappingURL=topsort.js.map

package/lib/node_modules/graphlib/lib/alg/topsort.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"topsort.js","sources":["../../../../../node_modules/graphlib/lib/alg/topsort.js"],"sourcesContent":["var _ = require(\"../lodash\");\n\nmodule.exports = topsort;\ntopsort.CycleException = CycleException;\n\nfunction topsort(g) {\n  var visited = {};\n  var stack = {};\n  var results = [];\n\n  function visit(node) {\n    if (_.has(stack, node)) {\n      throw new CycleException();\n    }\n\n    if (!_.has(visited, node)) {\n      stack[node] = true;\n      visited[node] = true;\n      _.each(g.predecessors(node), visit);\n      delete stack[node];\n      results.push(node);\n    }\n  }\n\n  _.each(g.sinks(), visit);\n\n  if (_.size(visited) !== g.nodeCount()) {\n    throw new CycleException();\n  }\n\n  return results;\n}\n\nfunction CycleException() {}\nCycleException.prototype = new Error(); // must be an instance of Error to pass testing"],"names":["require$$0"],"mappings":";;;;;;;;CAAA,IAAI,CAAC,GAAGA,aAAA,EAAoB;;AAE5B,CAAA,SAAc,GAAG,OAAO;CACxB,OAAO,CAAC,cAAc,GAAG,cAAc;;CAEvC,SAAS,OAAO,CAAC,CAAC,EAAE;GAClB,IAAI,OAAO,GAAG,EAAE;GAChB,IAAI,KAAK,GAAG,EAAE;GACd,IAAI,OAAO,GAAG,EAAE;;AAElB,GAAE,SAAS,KAAK,CAAC,IAAI,EAAE;KACnB,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE;OACtB,MAAM,IAAI,cAAc,EAAE;AAChC,KAAA;;KAEI,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE;AAC/B,OAAM,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI;AACxB,OAAM,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI;AAC1B,OAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC;AACzC,OAAM,OAAO,KAAK,CAAC,IAAI,CAAC;AACxB,OAAM,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC;AACxB,KAAA;AACA,GAAA;;GAEE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,KAAK,CAAC;;AAE1B,GAAE,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,SAAS,EAAE,EAAE;KACrC,MAAM,IAAI,cAAc,EAAE;AAC9B,GAAA;;AAEA,GAAE,OAAO,OAAO;AAChB,CAAA;;AAEA,CAAA,SAAS,cAAc,GAAG,CAAA;AAC1B,CAAA,cAAc,CAAC,SAAS,GAAG,IAAI,KAAK,EAAE,CAAC;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/graphlib/lib/data/priority-queue.js

@@ -0,0 +1,165 @@
+import { __require as requireLodash } from '../lodash.js';
+
+var priorityQueue;
+var hasRequiredPriorityQueue;
+
+function requirePriorityQueue () {
+	if (hasRequiredPriorityQueue) return priorityQueue;
+	hasRequiredPriorityQueue = 1;
+	var _ = requireLodash();
+
+	priorityQueue = PriorityQueue;
+
+	/**
+	 * A min-priority queue data structure. This algorithm is derived from Cormen,
+	 * et al., "Introduction to Algorithms". The basic idea of a min-priority
+	 * queue is that you can efficiently (in O(1) time) get the smallest key in
+	 * the queue. Adding and removing elements takes O(log n) time. A key can
+	 * have its priority decreased in O(log n) time.
+	 */
+	function PriorityQueue() {
+	  this._arr = [];
+	  this._keyIndices = {};
+	}
+
+	/**
+	 * Returns the number of elements in the queue. Takes `O(1)` time.
+	 */
+	PriorityQueue.prototype.size = function() {
+	  return this._arr.length;
+	};
+
+	/**
+	 * Returns the keys that are in the queue. Takes `O(n)` time.
+	 */
+	PriorityQueue.prototype.keys = function() {
+	  return this._arr.map(function(x) { return x.key; });
+	};
+
+	/**
+	 * Returns `true` if **key** is in the queue and `false` if not.
+	 */
+	PriorityQueue.prototype.has = function(key) {
+	  return _.has(this._keyIndices, key);
+	};
+
+	/**
+	 * Returns the priority for **key**. If **key** is not present in the queue
+	 * then this function returns `undefined`. Takes `O(1)` time.
+	 *
+	 * @param {Object} key
+	 */
+	PriorityQueue.prototype.priority = function(key) {
+	  var index = this._keyIndices[key];
+	  if (index !== undefined) {
+	    return this._arr[index].priority;
+	  }
+	};
+
+	/**
+	 * Returns the key for the minimum element in this queue. If the queue is
+	 * empty this function throws an Error. Takes `O(1)` time.
+	 */
+	PriorityQueue.prototype.min = function() {
+	  if (this.size() === 0) {
+	    throw new Error("Queue underflow");
+	  }
+	  return this._arr[0].key;
+	};
+
+	/**
+	 * Inserts a new key into the priority queue. If the key already exists in
+	 * the queue this function returns `false`; otherwise it will return `true`.
+	 * Takes `O(n)` time.
+	 *
+	 * @param {Object} key the key to add
+	 * @param {Number} priority the initial priority for the key
+	 */
+	PriorityQueue.prototype.add = function(key, priority) {
+	  var keyIndices = this._keyIndices;
+	  key = String(key);
+	  if (!_.has(keyIndices, key)) {
+	    var arr = this._arr;
+	    var index = arr.length;
+	    keyIndices[key] = index;
+	    arr.push({key: key, priority: priority});
+	    this._decrease(index);
+	    return true;
+	  }
+	  return false;
+	};
+
+	/**
+	 * Removes and returns the smallest key in the queue. Takes `O(log n)` time.
+	 */
+	PriorityQueue.prototype.removeMin = function() {
+	  this._swap(0, this._arr.length - 1);
+	  var min = this._arr.pop();
+	  delete this._keyIndices[min.key];
+	  this._heapify(0);
+	  return min.key;
+	};
+
+	/**
+	 * Decreases the priority for **key** to **priority**. If the new priority is
+	 * greater than the previous priority, this function will throw an Error.
+	 *
+	 * @param {Object} key the key for which to raise priority
+	 * @param {Number} priority the new priority for the key
+	 */
+	PriorityQueue.prototype.decrease = function(key, priority) {
+	  var index = this._keyIndices[key];
+	  if (priority > this._arr[index].priority) {
+	    throw new Error("New priority is greater than current priority. " +
+	        "Key: " + key + " Old: " + this._arr[index].priority + " New: " + priority);
+	  }
+	  this._arr[index].priority = priority;
+	  this._decrease(index);
+	};
+
+	PriorityQueue.prototype._heapify = function(i) {
+	  var arr = this._arr;
+	  var l = 2 * i;
+	  var r = l + 1;
+	  var largest = i;
+	  if (l < arr.length) {
+	    largest = arr[l].priority < arr[largest].priority ? l : largest;
+	    if (r < arr.length) {
+	      largest = arr[r].priority < arr[largest].priority ? r : largest;
+	    }
+	    if (largest !== i) {
+	      this._swap(i, largest);
+	      this._heapify(largest);
+	    }
+	  }
+	};
+
+	PriorityQueue.prototype._decrease = function(index) {
+	  var arr = this._arr;
+	  var priority = arr[index].priority;
+	  var parent;
+	  while (index !== 0) {
+	    parent = index >> 1;
+	    if (arr[parent].priority < priority) {
+	      break;
+	    }
+	    this._swap(index, parent);
+	    index = parent;
+	  }
+	};
+
+	PriorityQueue.prototype._swap = function(i, j) {
+	  var arr = this._arr;
+	  var keyIndices = this._keyIndices;
+	  var origArrI = arr[i];
+	  var origArrJ = arr[j];
+	  arr[i] = origArrJ;
+	  arr[j] = origArrI;
+	  keyIndices[origArrJ.key] = i;
+	  keyIndices[origArrI.key] = j;
+	};
+	return priorityQueue;
+}
+
+export { requirePriorityQueue as __require };
+//# sourceMappingURL=priority-queue.js.map

package/lib/node_modules/graphlib/lib/data/priority-queue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"priority-queue.js","sources":["../../../../../node_modules/graphlib/lib/data/priority-queue.js"],"sourcesContent":["var _ = require(\"../lodash\");\n\nmodule.exports = PriorityQueue;\n\n/**\n * A min-priority queue data structure. This algorithm is derived from Cormen,\n * et al., \"Introduction to Algorithms\". The basic idea of a min-priority\n * queue is that you can efficiently (in O(1) time) get the smallest key in\n * the queue. Adding and removing elements takes O(log n) time. A key can\n * have its priority decreased in O(log n) time.\n */\nfunction PriorityQueue() {\n  this._arr = [];\n  this._keyIndices = {};\n}\n\n/**\n * Returns the number of elements in the queue. Takes `O(1)` time.\n */\nPriorityQueue.prototype.size = function() {\n  return this._arr.length;\n};\n\n/**\n * Returns the keys that are in the queue. Takes `O(n)` time.\n */\nPriorityQueue.prototype.keys = function() {\n  return this._arr.map(function(x) { return x.key; });\n};\n\n/**\n * Returns `true` if **key** is in the queue and `false` if not.\n */\nPriorityQueue.prototype.has = function(key) {\n  return _.has(this._keyIndices, key);\n};\n\n/**\n * Returns the priority for **key**. If **key** is not present in the queue\n * then this function returns `undefined`. Takes `O(1)` time.\n *\n * @param {Object} key\n */\nPriorityQueue.prototype.priority = function(key) {\n  var index = this._keyIndices[key];\n  if (index !== undefined) {\n    return this._arr[index].priority;\n  }\n};\n\n/**\n * Returns the key for the minimum element in this queue. If the queue is\n * empty this function throws an Error. Takes `O(1)` time.\n */\nPriorityQueue.prototype.min = function() {\n  if (this.size() === 0) {\n    throw new Error(\"Queue underflow\");\n  }\n  return this._arr[0].key;\n};\n\n/**\n * Inserts a new key into the priority queue. If the key already exists in\n * the queue this function returns `false`; otherwise it will return `true`.\n * Takes `O(n)` time.\n *\n * @param {Object} key the key to add\n * @param {Number} priority the initial priority for the key\n */\nPriorityQueue.prototype.add = function(key, priority) {\n  var keyIndices = this._keyIndices;\n  key = String(key);\n  if (!_.has(keyIndices, key)) {\n    var arr = this._arr;\n    var index = arr.length;\n    keyIndices[key] = index;\n    arr.push({key: key, priority: priority});\n    this._decrease(index);\n    return true;\n  }\n  return false;\n};\n\n/**\n * Removes and returns the smallest key in the queue. Takes `O(log n)` time.\n */\nPriorityQueue.prototype.removeMin = function() {\n  this._swap(0, this._arr.length - 1);\n  var min = this._arr.pop();\n  delete this._keyIndices[min.key];\n  this._heapify(0);\n  return min.key;\n};\n\n/**\n * Decreases the priority for **key** to **priority**. If the new priority is\n * greater than the previous priority, this function will throw an Error.\n *\n * @param {Object} key the key for which to raise priority\n * @param {Number} priority the new priority for the key\n */\nPriorityQueue.prototype.decrease = function(key, priority) {\n  var index = this._keyIndices[key];\n  if (priority > this._arr[index].priority) {\n    throw new Error(\"New priority is greater than current priority. \" +\n        \"Key: \" + key + \" Old: \" + this._arr[index].priority + \" New: \" + priority);\n  }\n  this._arr[index].priority = priority;\n  this._decrease(index);\n};\n\nPriorityQueue.prototype._heapify = function(i) {\n  var arr = this._arr;\n  var l = 2 * i;\n  var r = l + 1;\n  var largest = i;\n  if (l < arr.length) {\n    largest = arr[l].priority < arr[largest].priority ? l : largest;\n    if (r < arr.length) {\n      largest = arr[r].priority < arr[largest].priority ? r : largest;\n    }\n    if (largest !== i) {\n      this._swap(i, largest);\n      this._heapify(largest);\n    }\n  }\n};\n\nPriorityQueue.prototype._decrease = function(index) {\n  var arr = this._arr;\n  var priority = arr[index].priority;\n  var parent;\n  while (index !== 0) {\n    parent = index >> 1;\n    if (arr[parent].priority < priority) {\n      break;\n    }\n    this._swap(index, parent);\n    index = parent;\n  }\n};\n\nPriorityQueue.prototype._swap = function(i, j) {\n  var arr = this._arr;\n  var keyIndices = this._keyIndices;\n  var origArrI = arr[i];\n  var origArrJ = arr[j];\n  arr[i] = origArrJ;\n  arr[j] = origArrI;\n  keyIndices[origArrJ.key] = i;\n  keyIndices[origArrI.key] = j;\n};\n"],"names":["require$$0"],"mappings":";;;;;;;;CAAA,IAAI,CAAC,GAAGA,aAAA,EAAoB;;AAE5B,CAAA,aAAc,GAAG,aAAa;;AAE9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAS,aAAa,GAAG;AACzB,GAAE,IAAI,CAAC,IAAI,GAAG,EAAE;AAChB,GAAE,IAAI,CAAC,WAAW,GAAG,EAAE;AACvB,CAAA;;AAEA;AACA;AACA;AACA,CAAA,aAAa,CAAC,SAAS,CAAC,IAAI,GAAG,WAAW;AAC1C,GAAE,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM;CACzB,CAAC;;AAED;AACA;AACA;AACA,CAAA,aAAa,CAAC,SAAS,CAAC,IAAI,GAAG,WAAW;AAC1C,GAAE,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;CACrD,CAAC;;AAED;AACA;AACA;AACA,CAAA,aAAa,CAAC,SAAS,CAAC,GAAG,GAAG,SAAS,GAAG,EAAE;GAC1C,OAAO,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,GAAG,CAAC;CACrC,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,aAAa,CAAC,SAAS,CAAC,QAAQ,GAAG,SAAS,GAAG,EAAE;GAC/C,IAAI,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC;AACnC,GAAE,IAAI,KAAK,KAAK,SAAS,EAAE;KACvB,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,QAAQ;AACpC,GAAA;CACA,CAAC;;AAED;AACA;AACA;AACA;AACA,CAAA,aAAa,CAAC,SAAS,CAAC,GAAG,GAAG,WAAW;AACzC,GAAE,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE;AACzB,KAAI,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC;AACtC,GAAA;GACE,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG;CACzB,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;CACA,aAAa,CAAC,SAAS,CAAC,GAAG,GAAG,SAAS,GAAG,EAAE,QAAQ,EAAE;AACtD,GAAE,IAAI,UAAU,GAAG,IAAI,CAAC,WAAW;AACnC,GAAE,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC;GACjB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,EAAE;AAC/B,KAAI,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI;AACvB,KAAI,IAAI,KAAK,GAAG,GAAG,CAAC,MAAM;AAC1B,KAAI,UAAU,CAAC,GAAG,CAAC,GAAG,KAAK;AAC3B,KAAI,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;AAC5C,KAAI,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC;AACzB,KAAI,OAAO,IAAI;AACf,GAAA;AACA,GAAE,OAAO,KAAK;CACd,CAAC;;AAED;AACA;AACA;AACA,CAAA,aAAa,CAAC,SAAS,CAAC,SAAS,GAAG,WAAW;AAC/C,GAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;GACnC,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE;GACzB,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC;AAClC,GAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;GAChB,OAAO,GAAG,CAAC,GAAG;CAChB,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;CACA,aAAa,CAAC,SAAS,CAAC,QAAQ,GAAG,SAAS,GAAG,EAAE,QAAQ,EAAE;GACzD,IAAI,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC;GACjC,IAAI,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,QAAQ,EAAE;AAC5C,KAAI,MAAM,IAAI,KAAK,CAAC,iDAAiD;AACrE,SAAQ,OAAO,GAAG,GAAG,GAAG,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,QAAQ,GAAG,QAAQ,GAAG,QAAQ,CAAC;AACnF,GAAA;GACE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,QAAQ,GAAG,QAAQ;AACtC,GAAE,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC;CACvB,CAAC;;AAED,CAAA,aAAa,CAAC,SAAS,CAAC,QAAQ,GAAG,SAAS,CAAC,EAAE;AAC/C,GAAE,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI;AACrB,GAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;AACf,GAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;GACb,IAAI,OAAO,GAAG,CAAC;AACjB,GAAE,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE;AACtB,KAAI,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC,QAAQ,GAAG,CAAC,GAAG,OAAO;AACnE,KAAI,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE;AACxB,OAAM,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC,QAAQ,GAAG,CAAC,GAAG,OAAO;AACrE,KAAA;AACA,KAAI,IAAI,OAAO,KAAK,CAAC,EAAE;AACvB,OAAM,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC;AAC5B,OAAM,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC;AAC5B,KAAA;AACA,GAAA;CACA,CAAC;;AAED,CAAA,aAAa,CAAC,SAAS,CAAC,SAAS,GAAG,SAAS,KAAK,EAAE;AACpD,GAAE,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI;GACnB,IAAI,QAAQ,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,QAAQ;AACpC,GAAE,IAAI,MAAM;AACZ,GAAE,OAAO,KAAK,KAAK,CAAC,EAAE;AACtB,KAAI,MAAM,GAAG,KAAK,IAAI,CAAC;KACnB,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,QAAQ,GAAG,QAAQ,EAAE;OACnC;AACN,KAAA;AACA,KAAI,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC;KACzB,KAAK,GAAG,MAAM;AAClB,GAAA;CACA,CAAC;;CAED,aAAa,CAAC,SAAS,CAAC,KAAK,GAAG,SAAS,CAAC,EAAE,CAAC,EAAE;AAC/C,GAAE,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI;AACrB,GAAE,IAAI,UAAU,GAAG,IAAI,CAAC,WAAW;AACnC,GAAE,IAAI,QAAQ,GAAG,GAAG,CAAC,CAAC,CAAC;AACvB,GAAE,IAAI,QAAQ,GAAG,GAAG,CAAC,CAAC,CAAC;AACvB,GAAE,GAAG,CAAC,CAAC,CAAC,GAAG,QAAQ;AACnB,GAAE,GAAG,CAAC,CAAC,CAAC,GAAG,QAAQ;AACnB,GAAE,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC;AAC9B,GAAE,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC;CAC9B,CAAC;;;;;;","x_google_ignoreList":[0]}