@undp/data-viz 2.6.0 → 2.6.1

package/dist/y-QcCbqrzx.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"y-QcCbqrzx.cjs","sources":["../node_modules/d3-quadtree/src/add.js","../node_modules/d3-quadtree/src/cover.js","../node_modules/d3-quadtree/src/data.js","../node_modules/d3-quadtree/src/extent.js","../node_modules/d3-quadtree/src/quad.js","../node_modules/d3-quadtree/src/find.js","../node_modules/d3-quadtree/src/remove.js","../node_modules/d3-quadtree/src/root.js","../node_modules/d3-quadtree/src/size.js","../node_modules/d3-quadtree/src/visit.js","../node_modules/d3-quadtree/src/visitAfter.js","../node_modules/d3-quadtree/src/x.js","../node_modules/d3-quadtree/src/y.js","../node_modules/d3-quadtree/src/quadtree.js","../node_modules/d3-force/src/constant.js","../node_modules/d3-force/src/jiggle.js","../node_modules/d3-force/src/collide.js","../node_modules/d3-force/src/lcg.js","../node_modules/d3-force/src/simulation.js","../node_modules/d3-force/src/manyBody.js","../node_modules/d3-force/src/x.js","../node_modules/d3-force/src/y.js"],"sourcesContent":["export default function(d) {\n  const x = +this._x.call(null, d),\n      y = +this._y.call(null, d);\n  return add(this.cover(x, y), x, y, d);\n}\n\nfunction add(tree, x, y, d) {\n  if (isNaN(x) || isNaN(y)) return tree; // ignore invalid points\n\n  var parent,\n      node = tree._root,\n      leaf = {data: d},\n      x0 = tree._x0,\n      y0 = tree._y0,\n      x1 = tree._x1,\n      y1 = tree._y1,\n      xm,\n      ym,\n      xp,\n      yp,\n      right,\n      bottom,\n      i,\n      j;\n\n  // If the tree is empty, initialize the root as a leaf.\n  if (!node) return tree._root = leaf, tree;\n\n  // Find the existing leaf for the new point, or add it.\n  while (node.length) {\n    if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n    if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;\n    if (parent = node, !(node = node[i = bottom << 1 | right])) return parent[i] = leaf, tree;\n  }\n\n  // Is the new point is exactly coincident with the existing point?\n  xp = +tree._x.call(null, node.data);\n  yp = +tree._y.call(null, node.data);\n  if (x === xp && y === yp) return leaf.next = node, parent ? parent[i] = leaf : tree._root = leaf, tree;\n\n  // Otherwise, split the leaf node until the old and new point are separated.\n  do {\n    parent = parent ? parent[i] = new Array(4) : tree._root = new Array(4);\n    if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n    if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;\n  } while ((i = bottom << 1 | right) === (j = (yp >= ym) << 1 | (xp >= xm)));\n  return parent[j] = node, parent[i] = leaf, tree;\n}\n\nexport function addAll(data) {\n  var d, i, n = data.length,\n      x,\n      y,\n      xz = new Array(n),\n      yz = new Array(n),\n      x0 = Infinity,\n      y0 = Infinity,\n      x1 = -Infinity,\n      y1 = -Infinity;\n\n  // Compute the points and their extent.\n  for (i = 0; i < n; ++i) {\n    if (isNaN(x = +this._x.call(null, d = data[i])) || isNaN(y = +this._y.call(null, d))) continue;\n    xz[i] = x;\n    yz[i] = y;\n    if (x < x0) x0 = x;\n    if (x > x1) x1 = x;\n    if (y < y0) y0 = y;\n    if (y > y1) y1 = y;\n  }\n\n  // If there were no (valid) points, abort.\n  if (x0 > x1 || y0 > y1) return this;\n\n  // Expand the tree to cover the new points.\n  this.cover(x0, y0).cover(x1, y1);\n\n  // Add the new points.\n  for (i = 0; i < n; ++i) {\n    add(this, xz[i], yz[i], data[i]);\n  }\n\n  return this;\n}\n","export default function(x, y) {\n  if (isNaN(x = +x) || isNaN(y = +y)) return this; // ignore invalid points\n\n  var x0 = this._x0,\n      y0 = this._y0,\n      x1 = this._x1,\n      y1 = this._y1;\n\n  // If the quadtree has no extent, initialize them.\n  // Integer extent are necessary so that if we later double the extent,\n  // the existing quadrant boundaries don’t change due to floating point error!\n  if (isNaN(x0)) {\n    x1 = (x0 = Math.floor(x)) + 1;\n    y1 = (y0 = Math.floor(y)) + 1;\n  }\n\n  // Otherwise, double repeatedly to cover.\n  else {\n    var z = x1 - x0 || 1,\n        node = this._root,\n        parent,\n        i;\n\n    while (x0 > x || x >= x1 || y0 > y || y >= y1) {\n      i = (y < y0) << 1 | (x < x0);\n      parent = new Array(4), parent[i] = node, node = parent, z *= 2;\n      switch (i) {\n        case 0: x1 = x0 + z, y1 = y0 + z; break;\n        case 1: x0 = x1 - z, y1 = y0 + z; break;\n        case 2: x1 = x0 + z, y0 = y1 - z; break;\n        case 3: x0 = x1 - z, y0 = y1 - z; break;\n      }\n    }\n\n    if (this._root && this._root.length) this._root = node;\n  }\n\n  this._x0 = x0;\n  this._y0 = y0;\n  this._x1 = x1;\n  this._y1 = y1;\n  return this;\n}\n","export default function() {\n  var data = [];\n  this.visit(function(node) {\n    if (!node.length) do data.push(node.data); while (node = node.next)\n  });\n  return data;\n}\n","export default function(_) {\n  return arguments.length\n      ? this.cover(+_[0][0], +_[0][1]).cover(+_[1][0], +_[1][1])\n      : isNaN(this._x0) ? undefined : [[this._x0, this._y0], [this._x1, this._y1]];\n}\n","export default function(node, x0, y0, x1, y1) {\n  this.node = node;\n  this.x0 = x0;\n  this.y0 = y0;\n  this.x1 = x1;\n  this.y1 = y1;\n}\n","import Quad from \"./quad.js\";\n\nexport default function(x, y, radius) {\n  var data,\n      x0 = this._x0,\n      y0 = this._y0,\n      x1,\n      y1,\n      x2,\n      y2,\n      x3 = this._x1,\n      y3 = this._y1,\n      quads = [],\n      node = this._root,\n      q,\n      i;\n\n  if (node) quads.push(new Quad(node, x0, y0, x3, y3));\n  if (radius == null) radius = Infinity;\n  else {\n    x0 = x - radius, y0 = y - radius;\n    x3 = x + radius, y3 = y + radius;\n    radius *= radius;\n  }\n\n  while (q = quads.pop()) {\n\n    // Stop searching if this quadrant can’t contain a closer node.\n    if (!(node = q.node)\n        || (x1 = q.x0) > x3\n        || (y1 = q.y0) > y3\n        || (x2 = q.x1) < x0\n        || (y2 = q.y1) < y0) continue;\n\n    // Bisect the current quadrant.\n    if (node.length) {\n      var xm = (x1 + x2) / 2,\n          ym = (y1 + y2) / 2;\n\n      quads.push(\n        new Quad(node[3], xm, ym, x2, y2),\n        new Quad(node[2], x1, ym, xm, y2),\n        new Quad(node[1], xm, y1, x2, ym),\n        new Quad(node[0], x1, y1, xm, ym)\n      );\n\n      // Visit the closest quadrant first.\n      if (i = (y >= ym) << 1 | (x >= xm)) {\n        q = quads[quads.length - 1];\n        quads[quads.length - 1] = quads[quads.length - 1 - i];\n        quads[quads.length - 1 - i] = q;\n      }\n    }\n\n    // Visit this point. (Visiting coincident points isn’t necessary!)\n    else {\n      var dx = x - +this._x.call(null, node.data),\n          dy = y - +this._y.call(null, node.data),\n          d2 = dx * dx + dy * dy;\n      if (d2 < radius) {\n        var d = Math.sqrt(radius = d2);\n        x0 = x - d, y0 = y - d;\n        x3 = x + d, y3 = y + d;\n        data = node.data;\n      }\n    }\n  }\n\n  return data;\n}\n","export default function(d) {\n  if (isNaN(x = +this._x.call(null, d)) || isNaN(y = +this._y.call(null, d))) return this; // ignore invalid points\n\n  var parent,\n      node = this._root,\n      retainer,\n      previous,\n      next,\n      x0 = this._x0,\n      y0 = this._y0,\n      x1 = this._x1,\n      y1 = this._y1,\n      x,\n      y,\n      xm,\n      ym,\n      right,\n      bottom,\n      i,\n      j;\n\n  // If the tree is empty, initialize the root as a leaf.\n  if (!node) return this;\n\n  // Find the leaf node for the point.\n  // While descending, also retain the deepest parent with a non-removed sibling.\n  if (node.length) while (true) {\n    if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n    if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;\n    if (!(parent = node, node = node[i = bottom << 1 | right])) return this;\n    if (!node.length) break;\n    if (parent[(i + 1) & 3] || parent[(i + 2) & 3] || parent[(i + 3) & 3]) retainer = parent, j = i;\n  }\n\n  // Find the point to remove.\n  while (node.data !== d) if (!(previous = node, node = node.next)) return this;\n  if (next = node.next) delete node.next;\n\n  // If there are multiple coincident points, remove just the point.\n  if (previous) return (next ? previous.next = next : delete previous.next), this;\n\n  // If this is the root point, remove it.\n  if (!parent) return this._root = next, this;\n\n  // Remove this leaf.\n  next ? parent[i] = next : delete parent[i];\n\n  // If the parent now contains exactly one leaf, collapse superfluous parents.\n  if ((node = parent[0] || parent[1] || parent[2] || parent[3])\n      && node === (parent[3] || parent[2] || parent[1] || parent[0])\n      && !node.length) {\n    if (retainer) retainer[j] = node;\n    else this._root = node;\n  }\n\n  return this;\n}\n\nexport function removeAll(data) {\n  for (var i = 0, n = data.length; i < n; ++i) this.remove(data[i]);\n  return this;\n}\n","export default function() {\n  return this._root;\n}\n","export default function() {\n  var size = 0;\n  this.visit(function(node) {\n    if (!node.length) do ++size; while (node = node.next)\n  });\n  return size;\n}\n","import Quad from \"./quad.js\";\n\nexport default function(callback) {\n  var quads = [], q, node = this._root, child, x0, y0, x1, y1;\n  if (node) quads.push(new Quad(node, this._x0, this._y0, this._x1, this._y1));\n  while (q = quads.pop()) {\n    if (!callback(node = q.node, x0 = q.x0, y0 = q.y0, x1 = q.x1, y1 = q.y1) && node.length) {\n      var xm = (x0 + x1) / 2, ym = (y0 + y1) / 2;\n      if (child = node[3]) quads.push(new Quad(child, xm, ym, x1, y1));\n      if (child = node[2]) quads.push(new Quad(child, x0, ym, xm, y1));\n      if (child = node[1]) quads.push(new Quad(child, xm, y0, x1, ym));\n      if (child = node[0]) quads.push(new Quad(child, x0, y0, xm, ym));\n    }\n  }\n  return this;\n}\n","import Quad from \"./quad.js\";\n\nexport default function(callback) {\n  var quads = [], next = [], q;\n  if (this._root) quads.push(new Quad(this._root, this._x0, this._y0, this._x1, this._y1));\n  while (q = quads.pop()) {\n    var node = q.node;\n    if (node.length) {\n      var child, x0 = q.x0, y0 = q.y0, x1 = q.x1, y1 = q.y1, xm = (x0 + x1) / 2, ym = (y0 + y1) / 2;\n      if (child = node[0]) quads.push(new Quad(child, x0, y0, xm, ym));\n      if (child = node[1]) quads.push(new Quad(child, xm, y0, x1, ym));\n      if (child = node[2]) quads.push(new Quad(child, x0, ym, xm, y1));\n      if (child = node[3]) quads.push(new Quad(child, xm, ym, x1, y1));\n    }\n    next.push(q);\n  }\n  while (q = next.pop()) {\n    callback(q.node, q.x0, q.y0, q.x1, q.y1);\n  }\n  return this;\n}\n","export function defaultX(d) {\n  return d[0];\n}\n\nexport default function(_) {\n  return arguments.length ? (this._x = _, this) : this._x;\n}\n","export function defaultY(d) {\n  return d[1];\n}\n\nexport default function(_) {\n  return arguments.length ? (this._y = _, this) : this._y;\n}\n","import tree_add, {addAll as tree_addAll} from \"./add.js\";\nimport tree_cover from \"./cover.js\";\nimport tree_data from \"./data.js\";\nimport tree_extent from \"./extent.js\";\nimport tree_find from \"./find.js\";\nimport tree_remove, {removeAll as tree_removeAll} from \"./remove.js\";\nimport tree_root from \"./root.js\";\nimport tree_size from \"./size.js\";\nimport tree_visit from \"./visit.js\";\nimport tree_visitAfter from \"./visitAfter.js\";\nimport tree_x, {defaultX} from \"./x.js\";\nimport tree_y, {defaultY} from \"./y.js\";\n\nexport default function quadtree(nodes, x, y) {\n  var tree = new Quadtree(x == null ? defaultX : x, y == null ? defaultY : y, NaN, NaN, NaN, NaN);\n  return nodes == null ? tree : tree.addAll(nodes);\n}\n\nfunction Quadtree(x, y, x0, y0, x1, y1) {\n  this._x = x;\n  this._y = y;\n  this._x0 = x0;\n  this._y0 = y0;\n  this._x1 = x1;\n  this._y1 = y1;\n  this._root = undefined;\n}\n\nfunction leaf_copy(leaf) {\n  var copy = {data: leaf.data}, next = copy;\n  while (leaf = leaf.next) next = next.next = {data: leaf.data};\n  return copy;\n}\n\nvar treeProto = quadtree.prototype = Quadtree.prototype;\n\ntreeProto.copy = function() {\n  var copy = new Quadtree(this._x, this._y, this._x0, this._y0, this._x1, this._y1),\n      node = this._root,\n      nodes,\n      child;\n\n  if (!node) return copy;\n\n  if (!node.length) return copy._root = leaf_copy(node), copy;\n\n  nodes = [{source: node, target: copy._root = new Array(4)}];\n  while (node = nodes.pop()) {\n    for (var i = 0; i < 4; ++i) {\n      if (child = node.source[i]) {\n        if (child.length) nodes.push({source: child, target: node.target[i] = new Array(4)});\n        else node.target[i] = leaf_copy(child);\n      }\n    }\n  }\n\n  return copy;\n};\n\ntreeProto.add = tree_add;\ntreeProto.addAll = tree_addAll;\ntreeProto.cover = tree_cover;\ntreeProto.data = tree_data;\ntreeProto.extent = tree_extent;\ntreeProto.find = tree_find;\ntreeProto.remove = tree_remove;\ntreeProto.removeAll = tree_removeAll;\ntreeProto.root = tree_root;\ntreeProto.size = tree_size;\ntreeProto.visit = tree_visit;\ntreeProto.visitAfter = tree_visitAfter;\ntreeProto.x = tree_x;\ntreeProto.y = tree_y;\n","export default function(x) {\n  return function() {\n    return x;\n  };\n}\n","export default function(random) {\n  return (random() - 0.5) * 1e-6;\n}\n","import {quadtree} from \"d3-quadtree\";\nimport constant from \"./constant.js\";\nimport jiggle from \"./jiggle.js\";\n\nfunction x(d) {\n  return d.x + d.vx;\n}\n\nfunction y(d) {\n  return d.y + d.vy;\n}\n\nexport default function(radius) {\n  var nodes,\n      radii,\n      random,\n      strength = 1,\n      iterations = 1;\n\n  if (typeof radius !== \"function\") radius = constant(radius == null ? 1 : +radius);\n\n  function force() {\n    var i, n = nodes.length,\n        tree,\n        node,\n        xi,\n        yi,\n        ri,\n        ri2;\n\n    for (var k = 0; k < iterations; ++k) {\n      tree = quadtree(nodes, x, y).visitAfter(prepare);\n      for (i = 0; i < n; ++i) {\n        node = nodes[i];\n        ri = radii[node.index], ri2 = ri * ri;\n        xi = node.x + node.vx;\n        yi = node.y + node.vy;\n        tree.visit(apply);\n      }\n    }\n\n    function apply(quad, x0, y0, x1, y1) {\n      var data = quad.data, rj = quad.r, r = ri + rj;\n      if (data) {\n        if (data.index > node.index) {\n          var x = xi - data.x - data.vx,\n              y = yi - data.y - data.vy,\n              l = x * x + y * y;\n          if (l < r * r) {\n            if (x === 0) x = jiggle(random), l += x * x;\n            if (y === 0) y = jiggle(random), l += y * y;\n            l = (r - (l = Math.sqrt(l))) / l * strength;\n            node.vx += (x *= l) * (r = (rj *= rj) / (ri2 + rj));\n            node.vy += (y *= l) * r;\n            data.vx -= x * (r = 1 - r);\n            data.vy -= y * r;\n          }\n        }\n        return;\n      }\n      return x0 > xi + r || x1 < xi - r || y0 > yi + r || y1 < yi - r;\n    }\n  }\n\n  function prepare(quad) {\n    if (quad.data) return quad.r = radii[quad.data.index];\n    for (var i = quad.r = 0; i < 4; ++i) {\n      if (quad[i] && quad[i].r > quad.r) {\n        quad.r = quad[i].r;\n      }\n    }\n  }\n\n  function initialize() {\n    if (!nodes) return;\n    var i, n = nodes.length, node;\n    radii = new Array(n);\n    for (i = 0; i < n; ++i) node = nodes[i], radii[node.index] = +radius(node, i, nodes);\n  }\n\n  force.initialize = function(_nodes, _random) {\n    nodes = _nodes;\n    random = _random;\n    initialize();\n  };\n\n  force.iterations = function(_) {\n    return arguments.length ? (iterations = +_, force) : iterations;\n  };\n\n  force.strength = function(_) {\n    return arguments.length ? (strength = +_, force) : strength;\n  };\n\n  force.radius = function(_) {\n    return arguments.length ? (radius = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : radius;\n  };\n\n  return force;\n}\n","// https://en.wikipedia.org/wiki/Linear_congruential_generator#Parameters_in_common_use\nconst a = 1664525;\nconst c = 1013904223;\nconst m = 4294967296; // 2^32\n\nexport default function() {\n  let s = 1;\n  return () => (s = (a * s + c) % m) / m;\n}\n","import {dispatch} from \"d3-dispatch\";\nimport {timer} from \"d3-timer\";\nimport lcg from \"./lcg.js\";\n\nexport function x(d) {\n  return d.x;\n}\n\nexport function y(d) {\n  return d.y;\n}\n\nvar initialRadius = 10,\n    initialAngle = Math.PI * (3 - Math.sqrt(5));\n\nexport default function(nodes) {\n  var simulation,\n      alpha = 1,\n      alphaMin = 0.001,\n      alphaDecay = 1 - Math.pow(alphaMin, 1 / 300),\n      alphaTarget = 0,\n      velocityDecay = 0.6,\n      forces = new Map(),\n      stepper = timer(step),\n      event = dispatch(\"tick\", \"end\"),\n      random = lcg();\n\n  if (nodes == null) nodes = [];\n\n  function step() {\n    tick();\n    event.call(\"tick\", simulation);\n    if (alpha < alphaMin) {\n      stepper.stop();\n      event.call(\"end\", simulation);\n    }\n  }\n\n  function tick(iterations) {\n    var i, n = nodes.length, node;\n\n    if (iterations === undefined) iterations = 1;\n\n    for (var k = 0; k < iterations; ++k) {\n      alpha += (alphaTarget - alpha) * alphaDecay;\n\n      forces.forEach(function(force) {\n        force(alpha);\n      });\n\n      for (i = 0; i < n; ++i) {\n        node = nodes[i];\n        if (node.fx == null) node.x += node.vx *= velocityDecay;\n        else node.x = node.fx, node.vx = 0;\n        if (node.fy == null) node.y += node.vy *= velocityDecay;\n        else node.y = node.fy, node.vy = 0;\n      }\n    }\n\n    return simulation;\n  }\n\n  function initializeNodes() {\n    for (var i = 0, n = nodes.length, node; i < n; ++i) {\n      node = nodes[i], node.index = i;\n      if (node.fx != null) node.x = node.fx;\n      if (node.fy != null) node.y = node.fy;\n      if (isNaN(node.x) || isNaN(node.y)) {\n        var radius = initialRadius * Math.sqrt(0.5 + i), angle = i * initialAngle;\n        node.x = radius * Math.cos(angle);\n        node.y = radius * Math.sin(angle);\n      }\n      if (isNaN(node.vx) || isNaN(node.vy)) {\n        node.vx = node.vy = 0;\n      }\n    }\n  }\n\n  function initializeForce(force) {\n    if (force.initialize) force.initialize(nodes, random);\n    return force;\n  }\n\n  initializeNodes();\n\n  return simulation = {\n    tick: tick,\n\n    restart: function() {\n      return stepper.restart(step), simulation;\n    },\n\n    stop: function() {\n      return stepper.stop(), simulation;\n    },\n\n    nodes: function(_) {\n      return arguments.length ? (nodes = _, initializeNodes(), forces.forEach(initializeForce), simulation) : nodes;\n    },\n\n    alpha: function(_) {\n      return arguments.length ? (alpha = +_, simulation) : alpha;\n    },\n\n    alphaMin: function(_) {\n      return arguments.length ? (alphaMin = +_, simulation) : alphaMin;\n    },\n\n    alphaDecay: function(_) {\n      return arguments.length ? (alphaDecay = +_, simulation) : +alphaDecay;\n    },\n\n    alphaTarget: function(_) {\n      return arguments.length ? (alphaTarget = +_, simulation) : alphaTarget;\n    },\n\n    velocityDecay: function(_) {\n      return arguments.length ? (velocityDecay = 1 - _, simulation) : 1 - velocityDecay;\n    },\n\n    randomSource: function(_) {\n      return arguments.length ? (random = _, forces.forEach(initializeForce), simulation) : random;\n    },\n\n    force: function(name, _) {\n      return arguments.length > 1 ? ((_ == null ? forces.delete(name) : forces.set(name, initializeForce(_))), simulation) : forces.get(name);\n    },\n\n    find: function(x, y, radius) {\n      var i = 0,\n          n = nodes.length,\n          dx,\n          dy,\n          d2,\n          node,\n          closest;\n\n      if (radius == null) radius = Infinity;\n      else radius *= radius;\n\n      for (i = 0; i < n; ++i) {\n        node = nodes[i];\n        dx = x - node.x;\n        dy = y - node.y;\n        d2 = dx * dx + dy * dy;\n        if (d2 < radius) closest = node, radius = d2;\n      }\n\n      return closest;\n    },\n\n    on: function(name, _) {\n      return arguments.length > 1 ? (event.on(name, _), simulation) : event.on(name);\n    }\n  };\n}\n","import {quadtree} from \"d3-quadtree\";\nimport constant from \"./constant.js\";\nimport jiggle from \"./jiggle.js\";\nimport {x, y} from \"./simulation.js\";\n\nexport default function() {\n  var nodes,\n      node,\n      random,\n      alpha,\n      strength = constant(-30),\n      strengths,\n      distanceMin2 = 1,\n      distanceMax2 = Infinity,\n      theta2 = 0.81;\n\n  function force(_) {\n    var i, n = nodes.length, tree = quadtree(nodes, x, y).visitAfter(accumulate);\n    for (alpha = _, i = 0; i < n; ++i) node = nodes[i], tree.visit(apply);\n  }\n\n  function initialize() {\n    if (!nodes) return;\n    var i, n = nodes.length, node;\n    strengths = new Array(n);\n    for (i = 0; i < n; ++i) node = nodes[i], strengths[node.index] = +strength(node, i, nodes);\n  }\n\n  function accumulate(quad) {\n    var strength = 0, q, c, weight = 0, x, y, i;\n\n    // For internal nodes, accumulate forces from child quadrants.\n    if (quad.length) {\n      for (x = y = i = 0; i < 4; ++i) {\n        if ((q = quad[i]) && (c = Math.abs(q.value))) {\n          strength += q.value, weight += c, x += c * q.x, y += c * q.y;\n        }\n      }\n      quad.x = x / weight;\n      quad.y = y / weight;\n    }\n\n    // For leaf nodes, accumulate forces from coincident quadrants.\n    else {\n      q = quad;\n      q.x = q.data.x;\n      q.y = q.data.y;\n      do strength += strengths[q.data.index];\n      while (q = q.next);\n    }\n\n    quad.value = strength;\n  }\n\n  function apply(quad, x1, _, x2) {\n    if (!quad.value) return true;\n\n    var x = quad.x - node.x,\n        y = quad.y - node.y,\n        w = x2 - x1,\n        l = x * x + y * y;\n\n    // Apply the Barnes-Hut approximation if possible.\n    // Limit forces for very close nodes; randomize direction if coincident.\n    if (w * w / theta2 < l) {\n      if (l < distanceMax2) {\n        if (x === 0) x = jiggle(random), l += x * x;\n        if (y === 0) y = jiggle(random), l += y * y;\n        if (l < distanceMin2) l = Math.sqrt(distanceMin2 * l);\n        node.vx += x * quad.value * alpha / l;\n        node.vy += y * quad.value * alpha / l;\n      }\n      return true;\n    }\n\n    // Otherwise, process points directly.\n    else if (quad.length || l >= distanceMax2) return;\n\n    // Limit forces for very close nodes; randomize direction if coincident.\n    if (quad.data !== node || quad.next) {\n      if (x === 0) x = jiggle(random), l += x * x;\n      if (y === 0) y = jiggle(random), l += y * y;\n      if (l < distanceMin2) l = Math.sqrt(distanceMin2 * l);\n    }\n\n    do if (quad.data !== node) {\n      w = strengths[quad.data.index] * alpha / l;\n      node.vx += x * w;\n      node.vy += y * w;\n    } while (quad = quad.next);\n  }\n\n  force.initialize = function(_nodes, _random) {\n    nodes = _nodes;\n    random = _random;\n    initialize();\n  };\n\n  force.strength = function(_) {\n    return arguments.length ? (strength = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : strength;\n  };\n\n  force.distanceMin = function(_) {\n    return arguments.length ? (distanceMin2 = _ * _, force) : Math.sqrt(distanceMin2);\n  };\n\n  force.distanceMax = function(_) {\n    return arguments.length ? (distanceMax2 = _ * _, force) : Math.sqrt(distanceMax2);\n  };\n\n  force.theta = function(_) {\n    return arguments.length ? (theta2 = _ * _, force) : Math.sqrt(theta2);\n  };\n\n  return force;\n}\n","import constant from \"./constant.js\";\n\nexport default function(x) {\n  var strength = constant(0.1),\n      nodes,\n      strengths,\n      xz;\n\n  if (typeof x !== \"function\") x = constant(x == null ? 0 : +x);\n\n  function force(alpha) {\n    for (var i = 0, n = nodes.length, node; i < n; ++i) {\n      node = nodes[i], node.vx += (xz[i] - node.x) * strengths[i] * alpha;\n    }\n  }\n\n  function initialize() {\n    if (!nodes) return;\n    var i, n = nodes.length;\n    strengths = new Array(n);\n    xz = new Array(n);\n    for (i = 0; i < n; ++i) {\n      strengths[i] = isNaN(xz[i] = +x(nodes[i], i, nodes)) ? 0 : +strength(nodes[i], i, nodes);\n    }\n  }\n\n  force.initialize = function(_) {\n    nodes = _;\n    initialize();\n  };\n\n  force.strength = function(_) {\n    return arguments.length ? (strength = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : strength;\n  };\n\n  force.x = function(_) {\n    return arguments.length ? (x = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : x;\n  };\n\n  return force;\n}\n","import constant from \"./constant.js\";\n\nexport default function(y) {\n  var strength = constant(0.1),\n      nodes,\n      strengths,\n      yz;\n\n  if (typeof y !== \"function\") y = constant(y == null ? 0 : +y);\n\n  function force(alpha) {\n    for (var i = 0, n = nodes.length, node; i < n; ++i) {\n      node = nodes[i], node.vy += (yz[i] - node.y) * strengths[i] * alpha;\n    }\n  }\n\n  function initialize() {\n    if (!nodes) return;\n    var i, n = nodes.length;\n    strengths = new Array(n);\n    yz = new Array(n);\n    for (i = 0; i < n; ++i) {\n      strengths[i] = isNaN(yz[i] = +y(nodes[i], i, nodes)) ? 0 : +strength(nodes[i], i, nodes);\n    }\n  }\n\n  force.initialize = function(_) {\n    nodes = _;\n    initialize();\n  };\n\n  force.strength = function(_) {\n    return arguments.length ? (strength = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : strength;\n  };\n\n  force.y = function(_) {\n    return arguments.length ? (y = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : y;\n  };\n\n  return force;\n}\n"],"names":["tree_add","d","x","y","add","tree","parent","node","leaf","x0","y0","x1","y1","xm","ym","xp","yp","right","bottom","i","j","addAll","data","n","xz","yz","tree_cover","z","tree_data","tree_extent","_","Quad","tree_find","radius","x2","y2","x3","y3","quads","q","dx","dy","d2","tree_remove","retainer","previous","next","removeAll","tree_root","tree_size","size","tree_visit","callback","child","tree_visitAfter","defaultX","tree_x","defaultY","tree_y","quadtree","nodes","Quadtree","leaf_copy","copy","treeProto","tree_addAll","tree_removeAll","constant","jiggle","random","forceCollide","radii","strength","iterations","force","xi","yi","ri","ri2","k","prepare","apply","quad","rj","r","l","initialize","_nodes","_random","a","c","m","lcg","s","initialRadius","initialAngle","forceSimulation","simulation","alpha","alphaMin","alphaDecay","alphaTarget","velocityDecay","forces","stepper","timer","step","event","dispatch","tick","initializeNodes","angle","initializeForce","name","closest","forceManyBody","strengths","distanceMin2","distanceMax2","theta2","accumulate","weight","w","forceX","forceY"],"mappings":"qDAAe,SAAAA,EAASC,EAAG,CACzB,MAAMC,EAAI,CAAC,KAAK,GAAG,KAAK,KAAMD,CAAC,EAC3BE,EAAI,CAAC,KAAK,GAAG,KAAK,KAAMF,CAAC,EAC7B,OAAOG,EAAI,KAAK,MAAMF,EAAGC,CAAC,EAAGD,EAAGC,EAAGF,CAAC,CACtC,CAEA,SAASG,EAAIC,EAAMH,EAAGC,EAAGF,EAAG,CAC1B,GAAI,MAAMC,CAAC,GAAK,MAAMC,CAAC,EAAG,OAAOE,EAEjC,IAAIC,EACAC,EAAOF,EAAK,MACZG,EAAO,CAAC,KAAMP,CAAC,EACfQ,EAAKJ,EAAK,IACVK,EAAKL,EAAK,IACVM,EAAKN,EAAK,IACVO,EAAKP,EAAK,IACVQ,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAGJ,GAAI,CAACb,EAAM,OAAOF,EAAK,MAAQG,EAAMH,EAGrC,KAAOE,EAAK,QAGV,IAFIU,EAAQf,IAAMW,GAAMJ,EAAKE,GAAM,IAAIF,EAAKI,EAASF,EAAKE,GACtDK,EAASf,IAAMW,GAAMJ,EAAKE,GAAM,IAAIF,EAAKI,EAASF,EAAKE,EACvDR,EAASC,EAAM,EAAEA,EAAOA,EAAKY,EAAID,GAAU,EAAID,CAAK,GAAI,OAAOX,EAAOa,CAAC,EAAIX,EAAMH,EAMvF,GAFAU,EAAK,CAACV,EAAK,GAAG,KAAK,KAAME,EAAK,IAAI,EAClCS,EAAK,CAACX,EAAK,GAAG,KAAK,KAAME,EAAK,IAAI,EAC9BL,IAAMa,GAAMZ,IAAMa,EAAI,OAAOR,EAAK,KAAOD,EAAMD,EAASA,EAAOa,CAAC,EAAIX,EAAOH,EAAK,MAAQG,EAAMH,EAGlG,GACEC,EAASA,EAASA,EAAOa,CAAC,EAAI,IAAI,MAAM,CAAC,EAAId,EAAK,MAAQ,IAAI,MAAM,CAAC,GACjEY,EAAQf,IAAMW,GAAMJ,EAAKE,GAAM,IAAIF,EAAKI,EAASF,EAAKE,GACtDK,EAASf,IAAMW,GAAMJ,EAAKE,GAAM,IAAIF,EAAKI,EAASF,EAAKE,SACnDK,EAAID,GAAU,EAAID,MAAYG,GAAKJ,GAAMF,IAAO,EAAKC,GAAMF,IACrE,OAAOP,EAAOc,CAAC,EAAIb,EAAMD,EAAOa,CAAC,EAAIX,EAAMH,CAC7C,CAEO,SAASgB,EAAOC,EAAM,CAC3B,IAAIrB,EAAG,EAAGsB,EAAID,EAAK,OACfpB,EACAC,EACAqB,EAAK,IAAI,MAAMD,CAAC,EAChBE,EAAK,IAAI,MAAMF,CAAC,EAChBd,EAAK,IACLC,EAAK,IACLC,EAAK,KACLC,EAAK,KAGT,IAAK,EAAI,EAAG,EAAIW,EAAG,EAAE,EACf,MAAMrB,EAAI,CAAC,KAAK,GAAG,KAAK,KAAMD,EAAIqB,EAAK,CAAC,CAAC,CAAC,GAAK,MAAMnB,EAAI,CAAC,KAAK,GAAG,KAAK,KAAMF,CAAC,CAAC,IACnFuB,EAAG,CAAC,EAAItB,EACRuB,EAAG,CAAC,EAAItB,EACJD,EAAIO,IAAIA,EAAKP,GACbA,EAAIS,IAAIA,EAAKT,GACbC,EAAIO,IAAIA,EAAKP,GACbA,EAAIS,IAAIA,EAAKT,IAInB,GAAIM,EAAKE,GAAMD,EAAKE,EAAI,OAAO,KAM/B,IAHA,KAAK,MAAMH,EAAIC,CAAE,EAAE,MAAMC,EAAIC,CAAE,EAG1B,EAAI,EAAG,EAAIW,EAAG,EAAE,EACnBnB,EAAI,KAAMoB,EAAG,CAAC,EAAGC,EAAG,CAAC,EAAGH,EAAK,CAAC,CAAC,EAGjC,OAAO,IACT,CCnFe,SAAAI,EAASxB,EAAGC,EAAG,CAC5B,GAAI,MAAMD,EAAI,CAACA,CAAC,GAAK,MAAMC,EAAI,CAACA,CAAC,EAAG,OAAO,KAE3C,IAAIM,EAAK,KAAK,IACVC,EAAK,KAAK,IACVC,EAAK,KAAK,IACVC,EAAK,KAAK,IAKd,GAAI,MAAMH,CAAE,EACVE,GAAMF,EAAK,KAAK,MAAMP,CAAC,GAAK,EAC5BU,GAAMF,EAAK,KAAK,MAAMP,CAAC,GAAK,MAIzB,CAMH,QALIwB,EAAIhB,EAAKF,GAAM,EACfF,EAAO,KAAK,MACZD,EACAa,EAEGV,EAAKP,GAAKA,GAAKS,GAAMD,EAAKP,GAAKA,GAAKS,GAGzC,OAFAO,GAAKhB,EAAIO,IAAO,EAAKR,EAAIO,EACzBH,EAAS,IAAI,MAAM,CAAC,EAAGA,EAAOa,CAAC,EAAIZ,EAAMA,EAAOD,EAAQqB,GAAK,EACrDR,EAAC,CACP,IAAK,GAAGR,EAAKF,EAAKkB,EAAGf,EAAKF,EAAKiB,EAAG,MAClC,IAAK,GAAGlB,EAAKE,EAAKgB,EAAGf,EAAKF,EAAKiB,EAAG,MAClC,IAAK,GAAGhB,EAAKF,EAAKkB,EAAGjB,EAAKE,EAAKe,EAAG,MAClC,IAAK,GAAGlB,EAAKE,EAAKgB,EAAGjB,EAAKE,EAAKe,EAAG,KAC1C,CAGQ,KAAK,OAAS,KAAK,MAAM,SAAQ,KAAK,MAAQpB,EACpD,CAEA,YAAK,IAAME,EACX,KAAK,IAAMC,EACX,KAAK,IAAMC,EACX,KAAK,IAAMC,EACJ,IACT,CC1Ce,SAAAgB,GAAW,CACxB,IAAIN,EAAO,CAAA,EACX,YAAK,MAAM,SAASf,EAAM,CACxB,GAAI,CAACA,EAAK,OAAQ,GAAGe,EAAK,KAAKf,EAAK,IAAI,QAAUA,EAAOA,EAAK,KAChE,CAAC,EACMe,CACT,CCNe,SAAAO,EAASC,EAAG,CACzB,OAAO,UAAU,OACX,KAAK,MAAM,CAACA,EAAE,CAAC,EAAE,CAAC,EAAG,CAACA,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,CAACA,EAAE,CAAC,EAAE,CAAC,EAAG,CAACA,EAAE,CAAC,EAAE,CAAC,CAAC,EACvD,MAAM,KAAK,GAAG,EAAI,OAAY,CAAC,CAAC,KAAK,IAAK,KAAK,GAAG,EAAG,CAAC,KAAK,IAAK,KAAK,GAAG,CAAC,CACjF,CCJe,SAAAC,EAASxB,EAAME,EAAIC,EAAIC,EAAIC,EAAI,CAC5C,KAAK,KAAOL,EACZ,KAAK,GAAKE,EACV,KAAK,GAAKC,EACV,KAAK,GAAKC,EACV,KAAK,GAAKC,CACZ,CCJe,SAAAoB,EAAS9B,EAAGC,EAAG8B,EAAQ,CACpC,IAAIX,EACAb,EAAK,KAAK,IACVC,EAAK,KAAK,IACVC,EACAC,EACAsB,EACAC,EACAC,EAAK,KAAK,IACVC,EAAK,KAAK,IACVC,EAAQ,CAAA,EACR/B,EAAO,KAAK,MACZgC,EACApB,EAUJ,IARIZ,GAAM+B,EAAM,KAAK,IAAIP,EAAKxB,EAAME,EAAIC,EAAI0B,EAAIC,CAAE,CAAC,EAC/CJ,GAAU,KAAMA,EAAS,KAE3BxB,EAAKP,EAAI+B,EAAQvB,EAAKP,EAAI8B,EAC1BG,EAAKlC,EAAI+B,EAAQI,EAAKlC,EAAI8B,EAC1BA,GAAUA,GAGLM,EAAID,EAAM,OAGf,GAAI,IAAE/B,EAAOgC,EAAE,QACP5B,EAAK4B,EAAE,IAAMH,IACbxB,EAAK2B,EAAE,IAAMF,IACbH,EAAKK,EAAE,IAAM9B,IACb0B,EAAKI,EAAE,IAAM7B,GAGrB,GAAIH,EAAK,OAAQ,CACf,IAAIM,GAAMF,EAAKuB,GAAM,EACjBpB,GAAMF,EAAKuB,GAAM,EAErBG,EAAM,KACJ,IAAIP,EAAKxB,EAAK,CAAC,EAAGM,EAAIC,EAAIoB,EAAIC,CAAE,EAChC,IAAIJ,EAAKxB,EAAK,CAAC,EAAGI,EAAIG,EAAID,EAAIsB,CAAE,EAChC,IAAIJ,EAAKxB,EAAK,CAAC,EAAGM,EAAID,EAAIsB,EAAIpB,CAAE,EAChC,IAAIiB,EAAKxB,EAAK,CAAC,EAAGI,EAAIC,EAAIC,EAAIC,CAAE,CACxC,GAGUK,GAAKhB,GAAKW,IAAO,EAAKZ,GAAKW,KAC7B0B,EAAID,EAAMA,EAAM,OAAS,CAAC,EAC1BA,EAAMA,EAAM,OAAS,CAAC,EAAIA,EAAMA,EAAM,OAAS,EAAInB,CAAC,EACpDmB,EAAMA,EAAM,OAAS,EAAInB,CAAC,EAAIoB,EAElC,KAGK,CACH,IAAIC,EAAKtC,EAAI,CAAC,KAAK,GAAG,KAAK,KAAMK,EAAK,IAAI,EACtCkC,EAAKtC,EAAI,CAAC,KAAK,GAAG,KAAK,KAAMI,EAAK,IAAI,EACtCmC,EAAKF,EAAKA,EAAKC,EAAKA,EACxB,GAAIC,EAAKT,EAAQ,CACf,IAAIhC,EAAI,KAAK,KAAKgC,EAASS,CAAE,EAC7BjC,EAAKP,EAAID,EAAGS,EAAKP,EAAIF,EACrBmC,EAAKlC,EAAID,EAAGoC,EAAKlC,EAAIF,EACrBqB,EAAOf,EAAK,IACd,CACF,CAGF,OAAOe,CACT,CCrEe,SAAAqB,EAAS1C,EAAG,CACzB,GAAI,MAAMC,EAAI,CAAC,KAAK,GAAG,KAAK,KAAMD,CAAC,CAAC,GAAK,MAAME,EAAI,CAAC,KAAK,GAAG,KAAK,KAAMF,CAAC,CAAC,EAAG,OAAO,KAEnF,IAAIK,EACAC,EAAO,KAAK,MACZqC,EACAC,EACAC,EACArC,EAAK,KAAK,IACVC,EAAK,KAAK,IACVC,EAAK,KAAK,IACVC,EAAK,KAAK,IACVV,EACAC,EACAU,EACAC,EACAG,EACAC,EACAC,EACAC,EAGJ,GAAI,CAACb,EAAM,OAAO,KAIlB,GAAIA,EAAK,OAAQ,OAAa,CAG5B,IAFIU,EAAQf,IAAMW,GAAMJ,EAAKE,GAAM,IAAIF,EAAKI,EAASF,EAAKE,GACtDK,EAASf,IAAMW,GAAMJ,EAAKE,GAAM,IAAIF,EAAKI,EAASF,EAAKE,EACrDR,EAASC,EAAM,EAAAA,EAAOA,EAAKY,EAAID,GAAU,EAAID,CAAK,GAAI,OAAO,KACnE,GAAI,CAACV,EAAK,OAAQ,OACdD,EAAQa,EAAI,EAAK,CAAC,GAAKb,EAAQa,EAAI,EAAK,CAAC,GAAKb,EAAQa,EAAI,EAAK,CAAC,KAAGyB,EAAWtC,EAAQc,EAAID,EAChG,CAGA,KAAOZ,EAAK,OAASN,GAAG,GAAM4C,EAAWtC,EAAM,EAAAA,EAAOA,EAAK,MAAO,OAAO,KAIzE,OAHIuC,EAAOvC,EAAK,OAAM,OAAOA,EAAK,KAG9BsC,GAAkBC,EAAOD,EAAS,KAAOC,EAAO,OAAOD,EAAS,KAAO,MAGtEvC,GAGLwC,EAAOxC,EAAOa,CAAC,EAAI2B,EAAO,OAAOxC,EAAOa,CAAC,GAGpCZ,EAAOD,EAAO,CAAC,GAAKA,EAAO,CAAC,GAAKA,EAAO,CAAC,GAAKA,EAAO,CAAC,IACpDC,KAAUD,EAAO,CAAC,GAAKA,EAAO,CAAC,GAAKA,EAAO,CAAC,GAAKA,EAAO,CAAC,IACzD,CAACC,EAAK,SACPqC,EAAUA,EAASxB,CAAC,EAAIb,EACvB,KAAK,MAAQA,GAGb,OAba,KAAK,MAAQuC,EAAM,KAczC,CAEO,SAASC,EAAUzB,EAAM,CAC9B,QAASH,EAAI,EAAGI,EAAID,EAAK,OAAQH,EAAII,EAAG,EAAEJ,EAAG,KAAK,OAAOG,EAAKH,CAAC,CAAC,EAChE,OAAO,IACT,CC7De,SAAA6B,GAAW,CACxB,OAAO,KAAK,KACd,CCFe,SAAAC,GAAW,CACxB,IAAIC,EAAO,EACX,YAAK,MAAM,SAAS3C,EAAM,CACxB,GAAI,CAACA,EAAK,OAAQ,EAAG,EAAE2C,QAAa3C,EAAOA,EAAK,KAClD,CAAC,EACM2C,CACT,CCJe,SAAAC,EAASC,EAAU,CAChC,IAAId,EAAQ,CAAA,EAAIC,EAAGhC,EAAO,KAAK,MAAO8C,EAAO5C,EAAIC,EAAIC,EAAIC,EAEzD,IADIL,GAAM+B,EAAM,KAAK,IAAIP,EAAKxB,EAAM,KAAK,IAAK,KAAK,IAAK,KAAK,IAAK,KAAK,GAAG,CAAC,EACpEgC,EAAID,EAAM,OACf,GAAI,CAACc,EAAS7C,EAAOgC,EAAE,KAAM9B,EAAK8B,EAAE,GAAI7B,EAAK6B,EAAE,GAAI5B,EAAK4B,EAAE,GAAI3B,EAAK2B,EAAE,EAAE,GAAKhC,EAAK,OAAQ,CACvF,IAAIM,GAAMJ,EAAKE,GAAM,EAAGG,GAAMJ,EAAKE,GAAM,GACrCyC,EAAQ9C,EAAK,CAAC,IAAG+B,EAAM,KAAK,IAAIP,EAAKsB,EAAOxC,EAAIC,EAAIH,EAAIC,CAAE,CAAC,GAC3DyC,EAAQ9C,EAAK,CAAC,IAAG+B,EAAM,KAAK,IAAIP,EAAKsB,EAAO5C,EAAIK,EAAID,EAAID,CAAE,CAAC,GAC3DyC,EAAQ9C,EAAK,CAAC,IAAG+B,EAAM,KAAK,IAAIP,EAAKsB,EAAOxC,EAAIH,EAAIC,EAAIG,CAAE,CAAC,GAC3DuC,EAAQ9C,EAAK,CAAC,IAAG+B,EAAM,KAAK,IAAIP,EAAKsB,EAAO5C,EAAIC,EAAIG,EAAIC,CAAE,CAAC,CACjE,CAEF,OAAO,IACT,CCbe,SAAAwC,EAASF,EAAU,CAChC,IAAId,EAAQ,CAAA,EAAIQ,EAAO,CAAA,EAAIP,EAE3B,IADI,KAAK,OAAOD,EAAM,KAAK,IAAIP,EAAK,KAAK,MAAO,KAAK,IAAK,KAAK,IAAK,KAAK,IAAK,KAAK,GAAG,CAAC,EAChFQ,EAAID,EAAM,OAAO,CACtB,IAAI/B,EAAOgC,EAAE,KACb,GAAIhC,EAAK,OAAQ,CACf,IAAI8C,EAAO5C,EAAK8B,EAAE,GAAI7B,EAAK6B,EAAE,GAAI5B,EAAK4B,EAAE,GAAI3B,EAAK2B,EAAE,GAAI1B,GAAMJ,EAAKE,GAAM,EAAGG,GAAMJ,EAAKE,GAAM,GACxFyC,EAAQ9C,EAAK,CAAC,IAAG+B,EAAM,KAAK,IAAIP,EAAKsB,EAAO5C,EAAIC,EAAIG,EAAIC,CAAE,CAAC,GAC3DuC,EAAQ9C,EAAK,CAAC,IAAG+B,EAAM,KAAK,IAAIP,EAAKsB,EAAOxC,EAAIH,EAAIC,EAAIG,CAAE,CAAC,GAC3DuC,EAAQ9C,EAAK,CAAC,IAAG+B,EAAM,KAAK,IAAIP,EAAKsB,EAAO5C,EAAIK,EAAID,EAAID,CAAE,CAAC,GAC3DyC,EAAQ9C,EAAK,CAAC,IAAG+B,EAAM,KAAK,IAAIP,EAAKsB,EAAOxC,EAAIC,EAAIH,EAAIC,CAAE,CAAC,CACjE,CACAkC,EAAK,KAAKP,CAAC,CACb,CACA,KAAOA,EAAIO,EAAK,OACdM,EAASb,EAAE,KAAMA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,EAAE,EAEzC,OAAO,IACT,CCpBO,SAASgB,EAAStD,EAAG,CAC1B,OAAOA,EAAE,CAAC,CACZ,CAEe,SAAAuD,EAAS1B,EAAG,CACzB,OAAO,UAAU,QAAU,KAAK,GAAKA,EAAG,MAAQ,KAAK,EACvD,CCNO,SAAS2B,GAASxD,EAAG,CAC1B,OAAOA,EAAE,CAAC,CACZ,CAEe,SAAAyD,GAAS5B,EAAG,CACzB,OAAO,UAAU,QAAU,KAAK,GAAKA,EAAG,MAAQ,KAAK,EACvD,CCOe,SAAS6B,EAASC,EAAO1D,EAAGC,EAAG,CAC5C,IAAIE,EAAO,IAAIwD,EAAS3D,GAAYqD,EAAcpD,GAAYsD,GAAc,IAAK,IAAK,IAAK,GAAG,EAC9F,OAAOG,GAAS,KAAOvD,EAAOA,EAAK,OAAOuD,CAAK,CACjD,CAEA,SAASC,EAAS3D,EAAGC,EAAGM,EAAIC,EAAIC,EAAIC,EAAI,CACtC,KAAK,GAAKV,EACV,KAAK,GAAKC,EACV,KAAK,IAAMM,EACX,KAAK,IAAMC,EACX,KAAK,IAAMC,EACX,KAAK,IAAMC,EACX,KAAK,MAAQ,MACf,CAEA,SAASkD,EAAUtD,EAAM,CAEvB,QADIuD,EAAO,CAAC,KAAMvD,EAAK,IAAI,EAAGsC,EAAOiB,EAC9BvD,EAAOA,EAAK,MAAMsC,EAAOA,EAAK,KAAO,CAAC,KAAMtC,EAAK,IAAI,EAC5D,OAAOuD,CACT,CAEA,IAAIC,EAAYL,EAAS,UAAYE,EAAS,UAE9CG,EAAU,KAAO,UAAW,CAC1B,IAAID,EAAO,IAAIF,EAAS,KAAK,GAAI,KAAK,GAAI,KAAK,IAAK,KAAK,IAAK,KAAK,IAAK,KAAK,GAAG,EAC5EtD,EAAO,KAAK,MACZqD,EACAP,EAEJ,GAAI,CAAC9C,EAAM,OAAOwD,EAElB,GAAI,CAACxD,EAAK,OAAQ,OAAOwD,EAAK,MAAQD,EAAUvD,CAAI,EAAGwD,EAGvD,IADAH,EAAQ,CAAC,CAAC,OAAQrD,EAAM,OAAQwD,EAAK,MAAQ,IAAI,MAAM,CAAC,CAAC,CAAC,EACnDxD,EAAOqD,EAAM,OAClB,QAASzC,EAAI,EAAGA,EAAI,EAAG,EAAEA,GACnBkC,EAAQ9C,EAAK,OAAOY,CAAC,KACnBkC,EAAM,OAAQO,EAAM,KAAK,CAAC,OAAQP,EAAO,OAAQ9C,EAAK,OAAOY,CAAC,EAAI,IAAI,MAAM,CAAC,CAAC,CAAC,EAC9EZ,EAAK,OAAOY,CAAC,EAAI2C,EAAUT,CAAK,GAK3C,OAAOU,CACT,EAEAC,EAAU,IAAMhE,EAChBgE,EAAU,OAASC,EACnBD,EAAU,MAAQtC,EAClBsC,EAAU,KAAOpC,EACjBoC,EAAU,OAASnC,EACnBmC,EAAU,KAAOhC,EACjBgC,EAAU,OAASrB,EACnBqB,EAAU,UAAYE,EACtBF,EAAU,KAAOhB,EACjBgB,EAAU,KAAOf,EACjBe,EAAU,MAAQb,EAClBa,EAAU,WAAaV,EACvBU,EAAU,EAAIR,EACdQ,EAAU,EAAIN,GCxEC,SAAAS,EAASjE,EAAG,CACzB,OAAO,UAAW,CAChB,OAAOA,CACT,CACF,CCJe,SAAAkE,EAASC,EAAQ,CAC9B,OAAQA,IAAW,IAAO,IAC5B,CCEA,SAASnE,GAAED,EAAG,CACZ,OAAOA,EAAE,EAAIA,EAAE,EACjB,CAEA,SAASE,GAAEF,EAAG,CACZ,OAAOA,EAAE,EAAIA,EAAE,EACjB,CAEe,SAAAqE,GAASrC,EAAQ,CAC9B,IAAI2B,EACAW,EACAF,EACAG,EAAW,EACXC,EAAa,EAEb,OAAOxC,GAAW,aAAYA,EAASkC,EAASlC,GAAU,KAAO,EAAI,CAACA,CAAM,GAEhF,SAASyC,GAAQ,CASf,QARIvD,EAAGI,EAAIqC,EAAM,OACbvD,EACAE,EACAoE,EACAC,EACAC,EACAC,EAEKC,EAAI,EAAGA,EAAIN,EAAY,EAAEM,EAEhC,IADA1E,EAAOsD,EAASC,EAAO1D,GAAGC,EAAC,EAAE,WAAW6E,CAAO,EAC1C7D,EAAI,EAAGA,EAAII,EAAG,EAAEJ,EACnBZ,EAAOqD,EAAMzC,CAAC,EACd0D,EAAKN,EAAMhE,EAAK,KAAK,EAAGuE,EAAMD,EAAKA,EACnCF,EAAKpE,EAAK,EAAIA,EAAK,GACnBqE,EAAKrE,EAAK,EAAIA,EAAK,GACnBF,EAAK,MAAM4E,CAAK,EAIpB,SAASA,EAAMC,EAAMzE,EAAIC,EAAIC,EAAIC,EAAI,CACnC,IAAIU,EAAO4D,EAAK,KAAMC,EAAKD,EAAK,EAAGE,EAAIP,EAAKM,EAC5C,GAAI7D,EAAM,CACR,GAAIA,EAAK,MAAQf,EAAK,MAAO,CAC3B,IAAIL,EAAIyE,EAAKrD,EAAK,EAAIA,EAAK,GACvBnB,EAAIyE,EAAKtD,EAAK,EAAIA,EAAK,GACvB+D,EAAInF,EAAIA,EAAIC,EAAIA,EAChBkF,EAAID,EAAIA,IACNlF,IAAM,IAAGA,EAAIkE,EAAOC,CAAM,EAAGgB,GAAKnF,EAAIA,GACtCC,IAAM,IAAGA,EAAIiE,EAAOC,CAAM,EAAGgB,GAAKlF,EAAIA,GAC1CkF,GAAKD,GAAKC,EAAI,KAAK,KAAKA,CAAC,IAAMA,EAAIb,EACnCjE,EAAK,KAAOL,GAAKmF,IAAMD,GAAKD,GAAMA,IAAOL,EAAMK,IAC/C5E,EAAK,KAAOJ,GAAKkF,GAAKD,EACtB9D,EAAK,IAAMpB,GAAKkF,EAAI,EAAIA,GACxB9D,EAAK,IAAMnB,EAAIiF,EAEnB,CACA,MACF,CACA,OAAO3E,EAAKkE,EAAKS,GAAKzE,EAAKgE,EAAKS,GAAK1E,EAAKkE,EAAKQ,GAAKxE,EAAKgE,EAAKQ,CAChE,CACF,CAEA,SAASJ,EAAQE,EAAM,CACrB,GAAIA,EAAK,KAAM,OAAOA,EAAK,EAAIX,EAAMW,EAAK,KAAK,KAAK,EACpD,QAAS/D,EAAI+D,EAAK,EAAI,EAAG/D,EAAI,EAAG,EAAEA,EAC5B+D,EAAK/D,CAAC,GAAK+D,EAAK/D,CAAC,EAAE,EAAI+D,EAAK,IAC9BA,EAAK,EAAIA,EAAK/D,CAAC,EAAE,EAGvB,CAEA,SAASmE,GAAa,CACpB,GAAK1B,EACL,KAAIzC,EAAGI,EAAIqC,EAAM,OAAQrD,EAEzB,IADAgE,EAAQ,IAAI,MAAMhD,CAAC,EACdJ,EAAI,EAAGA,EAAII,EAAG,EAAEJ,EAAGZ,EAAOqD,EAAMzC,CAAC,EAAGoD,EAAMhE,EAAK,KAAK,EAAI,CAAC0B,EAAO1B,EAAMY,EAAGyC,CAAK,EACrF,CAEA,OAAAc,EAAM,WAAa,SAASa,EAAQC,EAAS,CAC3C5B,EAAQ2B,EACRlB,EAASmB,EACTF,EAAU,CACZ,EAEAZ,EAAM,WAAa,SAAS5C,EAAG,CAC7B,OAAO,UAAU,QAAU2C,EAAa,CAAC3C,EAAG4C,GAASD,CACvD,EAEAC,EAAM,SAAW,SAAS5C,EAAG,CAC3B,OAAO,UAAU,QAAU0C,EAAW,CAAC1C,EAAG4C,GAASF,CACrD,EAEAE,EAAM,OAAS,SAAS5C,EAAG,CACzB,OAAO,UAAU,QAAUG,EAAS,OAAOH,GAAM,WAAaA,EAAIqC,EAAS,CAACrC,CAAC,EAAGwD,EAAU,EAAIZ,GAASzC,CACzG,EAEOyC,CACT,CClGA,MAAMe,GAAI,QACJC,GAAI,WACJC,EAAI,WAEK,SAAAC,IAAW,CACxB,IAAIC,EAAI,EACR,MAAO,KAAOA,GAAKJ,GAAII,EAAIH,IAAKC,GAAKA,CACvC,CCJO,SAASzF,GAAED,EAAG,CACnB,OAAOA,EAAE,CACX,CAEO,SAASE,GAAEF,EAAG,CACnB,OAAOA,EAAE,CACX,CAEA,IAAI6F,GAAgB,GAChBC,GAAe,KAAK,IAAM,EAAI,KAAK,KAAK,CAAC,GAE9B,SAAAC,GAASpC,EAAO,CAC7B,IAAIqC,EACAC,EAAQ,EACRC,EAAW,KACXC,EAAa,EAAI,KAAK,IAAID,EAAU,EAAI,GAAG,EAC3CE,EAAc,EACdC,EAAgB,GAChBC,EAAS,IAAI,IACbC,EAAUC,EAAAA,MAAMC,CAAI,EACpBC,EAAQC,EAAAA,SAAS,OAAQ,KAAK,EAC9BvC,EAASuB,GAAG,EAEZhC,GAAS,OAAMA,EAAQ,CAAA,GAE3B,SAAS8C,GAAO,CACdG,EAAI,EACJF,EAAM,KAAK,OAAQV,CAAU,EACzBC,EAAQC,IACVK,EAAQ,KAAI,EACZG,EAAM,KAAK,MAAOV,CAAU,EAEhC,CAEA,SAASY,EAAKpC,EAAY,CACxB,IAAItD,EAAGI,EAAIqC,EAAM,OAAQrD,EAErBkE,IAAe,SAAWA,EAAa,GAE3C,QAASM,EAAI,EAAGA,EAAIN,EAAY,EAAEM,EAOhC,IANAmB,IAAUG,EAAcH,GAASE,EAEjCG,EAAO,QAAQ,SAAS7B,EAAO,CAC7BA,EAAMwB,CAAK,CACb,CAAC,EAEI/E,EAAI,EAAGA,EAAII,EAAG,EAAEJ,EACnBZ,EAAOqD,EAAMzC,CAAC,EACVZ,EAAK,IAAM,KAAMA,EAAK,GAAKA,EAAK,IAAM+F,GACrC/F,EAAK,EAAIA,EAAK,GAAIA,EAAK,GAAK,GAC7BA,EAAK,IAAM,KAAMA,EAAK,GAAKA,EAAK,IAAM+F,GACrC/F,EAAK,EAAIA,EAAK,GAAIA,EAAK,GAAK,GAIrC,OAAO0F,CACT,CAEA,SAASa,GAAkB,CACzB,QAAS3F,EAAI,EAAGI,EAAIqC,EAAM,OAAQrD,EAAMY,EAAII,EAAG,EAAEJ,EAAG,CAIlD,GAHAZ,EAAOqD,EAAMzC,CAAC,EAAGZ,EAAK,MAAQY,EAC1BZ,EAAK,IAAM,OAAMA,EAAK,EAAIA,EAAK,IAC/BA,EAAK,IAAM,OAAMA,EAAK,EAAIA,EAAK,IAC/B,MAAMA,EAAK,CAAC,GAAK,MAAMA,EAAK,CAAC,EAAG,CAClC,IAAI0B,EAAS6D,GAAgB,KAAK,KAAK,GAAM3E,CAAC,EAAG4F,EAAQ5F,EAAI4E,GAC7DxF,EAAK,EAAI0B,EAAS,KAAK,IAAI8E,CAAK,EAChCxG,EAAK,EAAI0B,EAAS,KAAK,IAAI8E,CAAK,CAClC,EACI,MAAMxG,EAAK,EAAE,GAAK,MAAMA,EAAK,EAAE,KACjCA,EAAK,GAAKA,EAAK,GAAK,EAExB,CACF,CAEA,SAASyG,EAAgBtC,EAAO,CAC9B,OAAIA,EAAM,YAAYA,EAAM,WAAWd,EAAOS,CAAM,EAC7CK,CACT,CAEA,OAAAoC,EAAe,EAERb,EAAa,CAClB,KAAMY,EAEN,QAAS,UAAW,CAClB,OAAOL,EAAQ,QAAQE,CAAI,EAAGT,CAChC,EAEA,KAAM,UAAW,CACf,OAAOO,EAAQ,KAAI,EAAIP,CACzB,EAEA,MAAO,SAASnE,EAAG,CACjB,OAAO,UAAU,QAAU8B,EAAQ9B,EAAGgF,IAAmBP,EAAO,QAAQS,CAAe,EAAGf,GAAcrC,CAC1G,EAEA,MAAO,SAAS9B,EAAG,CACjB,OAAO,UAAU,QAAUoE,EAAQ,CAACpE,EAAGmE,GAAcC,CACvD,EAEA,SAAU,SAASpE,EAAG,CACpB,OAAO,UAAU,QAAUqE,EAAW,CAACrE,EAAGmE,GAAcE,CAC1D,EAEA,WAAY,SAASrE,EAAG,CACtB,OAAO,UAAU,QAAUsE,EAAa,CAACtE,EAAGmE,GAAc,CAACG,CAC7D,EAEA,YAAa,SAAStE,EAAG,CACvB,OAAO,UAAU,QAAUuE,EAAc,CAACvE,EAAGmE,GAAcI,CAC7D,EAEA,cAAe,SAASvE,EAAG,CACzB,OAAO,UAAU,QAAUwE,EAAgB,EAAIxE,EAAGmE,GAAc,EAAIK,CACtE,EAEA,aAAc,SAASxE,EAAG,CACxB,OAAO,UAAU,QAAUuC,EAASvC,EAAGyE,EAAO,QAAQS,CAAe,EAAGf,GAAc5B,CACxF,EAEA,MAAO,SAAS4C,EAAMnF,EAAG,CACvB,OAAO,UAAU,OAAS,GAAMA,GAAK,KAAOyE,EAAO,OAAOU,CAAI,EAAIV,EAAO,IAAIU,EAAMD,EAAgBlF,CAAC,CAAC,EAAImE,GAAcM,EAAO,IAAIU,CAAI,CACxI,EAEA,KAAM,SAAS/G,EAAGC,EAAG8B,EAAQ,CAC3B,IAAId,EAAI,EACJI,EAAIqC,EAAM,OACVpB,EACAC,EACAC,EACAnC,EACA2G,EAKJ,IAHIjF,GAAU,KAAMA,EAAS,IACxBA,GAAUA,EAEVd,EAAI,EAAGA,EAAII,EAAG,EAAEJ,EACnBZ,EAAOqD,EAAMzC,CAAC,EACdqB,EAAKtC,EAAIK,EAAK,EACdkC,EAAKtC,EAAII,EAAK,EACdmC,EAAKF,EAAKA,EAAKC,EAAKA,EAChBC,EAAKT,IAAQiF,EAAU3G,EAAM0B,EAASS,GAG5C,OAAOwE,CACT,EAEA,GAAI,SAASD,EAAMnF,EAAG,CACpB,OAAO,UAAU,OAAS,GAAK6E,EAAM,GAAGM,EAAMnF,CAAC,EAAGmE,GAAcU,EAAM,GAAGM,CAAI,CAC/E,CACJ,CACA,CCtJe,SAAAE,IAAW,CACxB,IAAIvD,EACArD,EACA8D,EACA6B,EACA1B,EAAWL,EAAS,GAAG,EACvBiD,EACAC,EAAe,EACfC,EAAe,IACfC,EAAS,IAEb,SAAS7C,EAAM5C,EAAG,CAChB,IAAIX,EAAGI,EAAIqC,EAAM,OAAQvD,EAAOsD,EAASC,EAAO1D,GAAGC,EAAC,EAAE,WAAWqH,CAAU,EAC3E,IAAKtB,EAAQpE,EAAGX,EAAI,EAAGA,EAAII,EAAG,EAAEJ,EAAGZ,EAAOqD,EAAMzC,CAAC,EAAGd,EAAK,MAAM4E,CAAK,CACtE,CAEA,SAASK,GAAa,CACpB,GAAK1B,EACL,KAAIzC,EAAGI,EAAIqC,EAAM,OAAQrD,EAEzB,IADA6G,EAAY,IAAI,MAAM7F,CAAC,EAClBJ,EAAI,EAAGA,EAAII,EAAG,EAAEJ,EAAGZ,EAAOqD,EAAMzC,CAAC,EAAGiG,EAAU7G,EAAK,KAAK,EAAI,CAACiE,EAASjE,EAAMY,EAAGyC,CAAK,EAC3F,CAEA,SAAS4D,EAAWtC,EAAM,CACxB,IAAIV,EAAW,EAAGjC,EAAGmD,EAAG+B,EAAS,EAAGvH,EAAGC,EAAGgB,EAG1C,GAAI+D,EAAK,OAAQ,CACf,IAAKhF,EAAIC,EAAIgB,EAAI,EAAGA,EAAI,EAAG,EAAEA,GACtBoB,EAAI2C,EAAK/D,CAAC,KAAOuE,EAAI,KAAK,IAAInD,EAAE,KAAK,KACxCiC,GAAYjC,EAAE,MAAOkF,GAAU/B,EAAGxF,GAAKwF,EAAInD,EAAE,EAAGpC,GAAKuF,EAAInD,EAAE,GAG/D2C,EAAK,EAAIhF,EAAIuH,EACbvC,EAAK,EAAI/E,EAAIsH,CACf,KAGK,CACHlF,EAAI2C,EACJ3C,EAAE,EAAIA,EAAE,KAAK,EACbA,EAAE,EAAIA,EAAE,KAAK,EACb,GAAGiC,GAAY4C,EAAU7E,EAAE,KAAK,KAAK,QAC9BA,EAAIA,EAAE,KACf,CAEA2C,EAAK,MAAQV,CACf,CAEA,SAASS,EAAMC,EAAMvE,EAAImB,EAAGI,EAAI,CAC9B,GAAI,CAACgD,EAAK,MAAO,MAAO,GAExB,IAAIhF,EAAIgF,EAAK,EAAI3E,EAAK,EAClBJ,EAAI+E,EAAK,EAAI3E,EAAK,EAClBmH,EAAIxF,EAAKvB,EACT0E,EAAInF,EAAIA,EAAIC,EAAIA,EAIpB,GAAIuH,EAAIA,EAAIH,EAASlC,EACnB,OAAIA,EAAIiC,IACFpH,IAAM,IAAGA,EAAIkE,EAAOC,CAAM,EAAGgB,GAAKnF,EAAIA,GACtCC,IAAM,IAAGA,EAAIiE,EAAOC,CAAM,EAAGgB,GAAKlF,EAAIA,GACtCkF,EAAIgC,IAAchC,EAAI,KAAK,KAAKgC,EAAehC,CAAC,GACpD9E,EAAK,IAAML,EAAIgF,EAAK,MAAQgB,EAAQb,EACpC9E,EAAK,IAAMJ,EAAI+E,EAAK,MAAQgB,EAAQb,GAE/B,GAIJ,GAAIH,EAAK,QAAUG,GAAKiC,EAAc,QAGvCpC,EAAK,OAAS3E,GAAQ2E,EAAK,QACzBhF,IAAM,IAAGA,EAAIkE,EAAOC,CAAM,EAAGgB,GAAKnF,EAAIA,GACtCC,IAAM,IAAGA,EAAIiE,EAAOC,CAAM,EAAGgB,GAAKlF,EAAIA,GACtCkF,EAAIgC,IAAchC,EAAI,KAAK,KAAKgC,EAAehC,CAAC,IAGtD,GAAOH,EAAK,OAAS3E,IACnBmH,EAAIN,EAAUlC,EAAK,KAAK,KAAK,EAAIgB,EAAQb,EACzC9E,EAAK,IAAML,EAAIwH,EACfnH,EAAK,IAAMJ,EAAIuH,SACRxC,EAAOA,EAAK,KACvB,CAEA,OAAAR,EAAM,WAAa,SAASa,EAAQC,EAAS,CAC3C5B,EAAQ2B,EACRlB,EAASmB,EACTF,EAAU,CACZ,EAEAZ,EAAM,SAAW,SAAS5C,EAAG,CAC3B,OAAO,UAAU,QAAU0C,EAAW,OAAO1C,GAAM,WAAaA,EAAIqC,EAAS,CAACrC,CAAC,EAAGwD,EAAU,EAAIZ,GAASF,CAC3G,EAEAE,EAAM,YAAc,SAAS5C,EAAG,CAC9B,OAAO,UAAU,QAAUuF,EAAevF,EAAIA,EAAG4C,GAAS,KAAK,KAAK2C,CAAY,CAClF,EAEA3C,EAAM,YAAc,SAAS5C,EAAG,CAC9B,OAAO,UAAU,QAAUwF,EAAexF,EAAIA,EAAG4C,GAAS,KAAK,KAAK4C,CAAY,CAClF,EAEA5C,EAAM,MAAQ,SAAS5C,EAAG,CACxB,OAAO,UAAU,QAAUyF,EAASzF,EAAIA,EAAG4C,GAAS,KAAK,KAAK6C,CAAM,CACtE,EAEO7C,CACT,CCjHe,SAAAiD,GAASzH,EAAG,CACzB,IAAIsE,EAAWL,EAAS,EAAG,EACvBP,EACAwD,EACA5F,EAEA,OAAOtB,GAAM,aAAYA,EAAIiE,EAASjE,GAAK,KAAO,EAAI,CAACA,CAAC,GAE5D,SAASwE,EAAMwB,EAAO,CACpB,QAAS/E,EAAI,EAAGI,EAAIqC,EAAM,OAAQrD,EAAMY,EAAII,EAAG,EAAEJ,EAC/CZ,EAAOqD,EAAMzC,CAAC,EAAGZ,EAAK,KAAOiB,EAAGL,CAAC,EAAIZ,EAAK,GAAK6G,EAAUjG,CAAC,EAAI+E,CAElE,CAEA,SAASZ,GAAa,CACpB,GAAK1B,EACL,KAAIzC,EAAGI,EAAIqC,EAAM,OAGjB,IAFAwD,EAAY,IAAI,MAAM7F,CAAC,EACvBC,EAAK,IAAI,MAAMD,CAAC,EACXJ,EAAI,EAAGA,EAAII,EAAG,EAAEJ,EACnBiG,EAAUjG,CAAC,EAAI,MAAMK,EAAGL,CAAC,EAAI,CAACjB,EAAE0D,EAAMzC,CAAC,EAAGA,EAAGyC,CAAK,CAAC,EAAI,EAAI,CAACY,EAASZ,EAAMzC,CAAC,EAAGA,EAAGyC,CAAK,EAE3F,CAEA,OAAAc,EAAM,WAAa,SAAS5C,EAAG,CAC7B8B,EAAQ9B,EACRwD,EAAU,CACZ,EAEAZ,EAAM,SAAW,SAAS5C,EAAG,CAC3B,OAAO,UAAU,QAAU0C,EAAW,OAAO1C,GAAM,WAAaA,EAAIqC,EAAS,CAACrC,CAAC,EAAGwD,EAAU,EAAIZ,GAASF,CAC3G,EAEAE,EAAM,EAAI,SAAS5C,EAAG,CACpB,OAAO,UAAU,QAAU5B,EAAI,OAAO4B,GAAM,WAAaA,EAAIqC,EAAS,CAACrC,CAAC,EAAGwD,EAAU,EAAIZ,GAASxE,CACpG,EAEOwE,CACT,CCtCe,SAAAkD,GAASzH,EAAG,CACzB,IAAIqE,EAAWL,EAAS,EAAG,EACvBP,EACAwD,EACA3F,EAEA,OAAOtB,GAAM,aAAYA,EAAIgE,EAAShE,GAAK,KAAO,EAAI,CAACA,CAAC,GAE5D,SAASuE,EAAMwB,EAAO,CACpB,QAAS/E,EAAI,EAAGI,EAAIqC,EAAM,OAAQrD,EAAMY,EAAII,EAAG,EAAEJ,EAC/CZ,EAAOqD,EAAMzC,CAAC,EAAGZ,EAAK,KAAOkB,EAAGN,CAAC,EAAIZ,EAAK,GAAK6G,EAAUjG,CAAC,EAAI+E,CAElE,CAEA,SAASZ,GAAa,CACpB,GAAK1B,EACL,KAAIzC,EAAGI,EAAIqC,EAAM,OAGjB,IAFAwD,EAAY,IAAI,MAAM7F,CAAC,EACvBE,EAAK,IAAI,MAAMF,CAAC,EACXJ,EAAI,EAAGA,EAAII,EAAG,EAAEJ,EACnBiG,EAAUjG,CAAC,EAAI,MAAMM,EAAGN,CAAC,EAAI,CAAChB,EAAEyD,EAAMzC,CAAC,EAAGA,EAAGyC,CAAK,CAAC,EAAI,EAAI,CAACY,EAASZ,EAAMzC,CAAC,EAAGA,EAAGyC,CAAK,EAE3F,CAEA,OAAAc,EAAM,WAAa,SAAS5C,EAAG,CAC7B8B,EAAQ9B,EACRwD,EAAU,CACZ,EAEAZ,EAAM,SAAW,SAAS5C,EAAG,CAC3B,OAAO,UAAU,QAAU0C,EAAW,OAAO1C,GAAM,WAAaA,EAAIqC,EAAS,CAACrC,CAAC,EAAGwD,EAAU,EAAIZ,GAASF,CAC3G,EAEAE,EAAM,EAAI,SAAS5C,EAAG,CACpB,OAAO,UAAU,QAAU3B,EAAI,OAAO2B,GAAM,WAAaA,EAAIqC,EAAS,CAACrC,CAAC,EAAGwD,EAAU,EAAIZ,GAASvE,CACpG,EAEOuE,CACT","x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21]}