@undp/data-viz 2.6.0 → 2.6.1

package/dist/y-B6sP7d7V.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"y-B6sP7d7V.cjs","names":["Quad","Quad","Quad","tree_add","tree_addAll","tree_cover","tree_data","tree_extent","tree_find","tree_remove","tree_removeAll","tree_root","tree_size","tree_visit","tree_visitAfter","tree_x","tree_y","x","y","constant","jiggle","timer","dispatch","lcg","constant","jiggle","constant","constant"],"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"],"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],"mappings":"wCAAA,SAAA,EAAwB,EAAG,CACzB,IAAM,EAAI,CAAC,KAAK,GAAG,KAAK,KAAM,CAAC,EAC3B,EAAI,CAAC,KAAK,GAAG,KAAK,KAAM,CAAC,EAC7B,OAAO,EAAI,KAAK,MAAM,EAAG,CAAC,EAAG,EAAG,EAAG,CAAC,CACtC,CAEA,SAAS,EAAI,EAAM,EAAG,EAAG,EAAG,CAC1B,GAAI,MAAM,CAAC,GAAK,MAAM,CAAC,EAAG,OAAO,EAEjC,IAAI,EACA,EAAO,EAAK,MACZ,EAAO,CAAC,KAAM,CAAC,EACf,EAAK,EAAK,IACV,EAAK,EAAK,IACV,EAAK,EAAK,IACV,EAAK,EAAK,IACV,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EAGJ,GAAI,CAAC,EAAM,MAAO,GAAK,MAAQ,EAAM,EAGrC,KAAO,EAAK,QAGV,IAFI,EAAQ,IAAM,GAAM,EAAK,GAAM,IAAI,EAAK,EAAS,EAAK,GACtD,EAAS,IAAM,GAAM,EAAK,GAAM,IAAI,EAAK,EAAS,EAAK,EACvD,EAAS,EAAM,EAAE,EAAO,EAAK,EAAI,GAAU,EAAI,IAAS,MAAO,GAAO,GAAK,EAAM,EAMvF,GAFA,EAAK,CAAC,EAAK,GAAG,KAAK,KAAM,EAAK,IAAI,EAClC,EAAK,CAAC,EAAK,GAAG,KAAK,KAAM,EAAK,IAAI,EAC9B,IAAM,GAAM,IAAM,EAAI,MAAO,GAAK,KAAO,EAAM,EAAS,EAAO,GAAK,EAAO,EAAK,MAAQ,EAAM,EAGlG,EACE,GAAS,EAAS,EAAO,GAAK,KAAW,EAAI,EAAK,MAAQ,KAAW,GACjE,EAAQ,IAAM,GAAM,EAAK,GAAM,IAAI,EAAK,EAAS,EAAK,GACtD,EAAS,IAAM,GAAM,EAAK,GAAM,IAAI,EAAK,EAAS,EAAK,SACnD,EAAI,GAAU,EAAI,KAAY,GAAK,GAAM,IAAO,EAAK,GAAM,IACrE,MAAO,GAAO,GAAK,EAAM,EAAO,GAAK,EAAM,CAC7C,CAEA,SAAgB,EAAO,EAAM,CAC3B,IAAI,EAAG,EAAG,EAAI,EAAK,OACf,EACA,EACA,EAAS,MAAM,CAAC,EAChB,EAAS,MAAM,CAAC,EAChB,EAAK,IACL,EAAK,IACL,EAAK,KACL,EAAK,KAGT,IAAK,EAAI,EAAG,EAAI,EAAG,EAAE,EACf,MAAM,EAAI,CAAC,KAAK,GAAG,KAAK,KAAM,EAAI,EAAK,EAAE,CAAC,GAAK,MAAM,EAAI,CAAC,KAAK,GAAG,KAAK,KAAM,CAAC,CAAC,IACnF,EAAG,GAAK,EACR,EAAG,GAAK,EACJ,EAAI,IAAI,EAAK,GACb,EAAI,IAAI,EAAK,GACb,EAAI,IAAI,EAAK,GACb,EAAI,IAAI,EAAK,IAInB,GAAI,EAAK,GAAM,EAAK,EAAI,OAAO,KAM/B,IAHA,KAAK,MAAM,EAAI,CAAE,EAAE,MAAM,EAAI,CAAE,EAG1B,EAAI,EAAG,EAAI,EAAG,EAAE,EACnB,EAAI,KAAM,EAAG,GAAI,EAAG,GAAI,EAAK,EAAE,EAGjC,OAAO,IACT,CCnFA,SAAA,EAAwB,EAAG,EAAG,CAC5B,GAAI,MAAM,EAAI,CAAC,CAAC,GAAK,MAAM,EAAI,CAAC,CAAC,EAAG,OAAO,KAE3C,IAAI,EAAK,KAAK,IACV,EAAK,KAAK,IACV,EAAK,KAAK,IACV,EAAK,KAAK,IAKd,GAAI,MAAM,CAAE,EACV,GAAM,EAAK,KAAK,MAAM,CAAC,GAAK,EAC5B,GAAM,EAAK,KAAK,MAAM,CAAC,GAAK,MAIzB,CAMH,IALA,IAAI,EAAI,EAAK,GAAM,EACf,EAAO,KAAK,MACZ,EACA,EAEG,EAAK,GAAK,GAAK,GAAM,EAAK,GAAK,GAAK,GAGzC,OAFA,GAAK,EAAI,IAAO,EAAK,EAAI,EACzB,EAAS,KAAW,EAAG,EAAO,GAAK,EAAM,EAAO,EAAQ,GAAK,EACrD,EAAR,CACE,IAAK,GAAG,EAAK,EAAK,EAAG,EAAK,EAAK,EAAG,MAClC,IAAK,GAAG,EAAK,EAAK,EAAG,EAAK,EAAK,EAAG,MAClC,IAAK,GAAG,EAAK,EAAK,EAAG,EAAK,EAAK,EAAG,MAClC,IAAK,GAAG,EAAK,EAAK,EAAG,EAAK,EAAK,EAAG,KACpC,CAGE,KAAK,OAAS,KAAK,MAAM,SAAQ,KAAK,MAAQ,EACpD,CAMA,MAJA,MAAK,IAAM,EACX,KAAK,IAAM,EACX,KAAK,IAAM,EACX,KAAK,IAAM,EACJ,IACT,CC1CA,SAAA,GAA0B,CACxB,IAAI,EAAO,CAAC,EAIZ,OAHA,KAAK,MAAM,SAAS,EAAM,CACxB,GAAI,CAAC,EAAK,OAAQ,GAAG,EAAK,KAAK,EAAK,IAAI,QAAU,EAAO,EAAK,KAChE,CAAC,EACM,CACT,CCNA,SAAA,EAAwB,EAAG,CACzB,OAAO,UAAU,OACX,KAAK,MAAM,CAAC,EAAE,GAAG,GAAI,CAAC,EAAE,GAAG,EAAE,EAAE,MAAM,CAAC,EAAE,GAAG,GAAI,CAAC,EAAE,GAAG,EAAE,EACvD,MAAM,KAAK,GAAG,EAAI,IAAA,GAAY,CAAC,CAAC,KAAK,IAAK,KAAK,GAAG,EAAG,CAAC,KAAK,IAAK,KAAK,GAAG,CAAC,CACjF,CCJA,SAAA,EAAwB,EAAM,EAAI,EAAI,EAAI,EAAI,CAC5C,KAAK,KAAO,EACZ,KAAK,GAAK,EACV,KAAK,GAAK,EACV,KAAK,GAAK,EACV,KAAK,GAAK,CACZ,CCJA,SAAA,EAAwB,EAAG,EAAG,EAAQ,CACpC,IAAI,EACA,EAAK,KAAK,IACV,EAAK,KAAK,IACV,EACA,EACA,EACA,EACA,EAAK,KAAK,IACV,EAAK,KAAK,IACV,EAAQ,CAAC,EACT,EAAO,KAAK,MACZ,EACA,EAUJ,IARI,GAAM,EAAM,KAAK,IAAIA,EAAK,EAAM,EAAI,EAAI,EAAI,CAAE,CAAC,EAC/C,GAAU,KAAM,EAAS,KAE3B,EAAK,EAAI,EAAQ,EAAK,EAAI,EAC1B,EAAK,EAAI,EAAQ,EAAK,EAAI,EAC1B,GAAU,GAGL,EAAI,EAAM,IAAI,GAGf,OAAE,EAAO,EAAE,QACP,EAAK,EAAE,IAAM,IACb,EAAK,EAAE,IAAM,IACb,EAAK,EAAE,IAAM,IACb,EAAK,EAAE,IAAM,GAGrB,GAAI,EAAK,OAAQ,CACf,IAAI,GAAM,EAAK,GAAM,EACjB,GAAM,EAAK,GAAM,EAErB,EAAM,KACJ,IAAIA,EAAK,EAAK,GAAI,EAAI,EAAI,EAAI,CAAE,EAChC,IAAIA,EAAK,EAAK,GAAI,EAAI,EAAI,EAAI,CAAE,EAChC,IAAIA,EAAK,EAAK,GAAI,EAAI,EAAI,EAAI,CAAE,EAChC,IAAIA,EAAK,EAAK,GAAI,EAAI,EAAI,EAAI,CAAE,CAClC,GAGI,GAAK,GAAK,IAAO,EAAK,GAAK,KAC7B,EAAI,EAAM,EAAM,OAAS,GACzB,EAAM,EAAM,OAAS,GAAK,EAAM,EAAM,OAAS,EAAI,GACnD,EAAM,EAAM,OAAS,EAAI,GAAK,EAElC,KAGK,CACH,IAAI,EAAK,EAAI,CAAC,KAAK,GAAG,KAAK,KAAM,EAAK,IAAI,EACtC,EAAK,EAAI,CAAC,KAAK,GAAG,KAAK,KAAM,EAAK,IAAI,EACtC,EAAK,EAAK,EAAK,EAAK,EACxB,GAAI,EAAK,EAAQ,CACf,IAAI,EAAI,KAAK,KAAK,EAAS,CAAE,EAC7B,EAAK,EAAI,EAAG,EAAK,EAAI,EACrB,EAAK,EAAI,EAAG,EAAK,EAAI,EACrB,EAAO,EAAK,IACd,CACF,CAGF,OAAO,CACT,CCrEA,SAAA,EAAwB,EAAG,CACzB,GAAI,MAAM,EAAI,CAAC,KAAK,GAAG,KAAK,KAAM,CAAC,CAAC,GAAK,MAAM,EAAI,CAAC,KAAK,GAAG,KAAK,KAAM,CAAC,CAAC,EAAG,OAAO,KAEnF,IAAI,EACA,EAAO,KAAK,MACZ,EACA,EACA,EACA,EAAK,KAAK,IACV,EAAK,KAAK,IACV,EAAK,KAAK,IACV,EAAK,KAAK,IACV,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EAGJ,GAAI,CAAC,EAAM,OAAO,KAIlB,GAAI,EAAK,OAAQ,OAAa,CAG5B,IAFI,EAAQ,IAAM,GAAM,EAAK,GAAM,IAAI,EAAK,EAAS,EAAK,GACtD,EAAS,IAAM,GAAM,EAAK,GAAM,IAAI,EAAK,EAAS,EAAK,EACrD,EAAS,EAAM,IAAO,EAAK,EAAI,GAAU,EAAI,IAAS,OAAO,KACnE,GAAI,CAAC,EAAK,OAAQ,OACd,EAAQ,EAAI,EAAK,IAAM,EAAQ,EAAI,EAAK,IAAM,EAAQ,EAAI,EAAK,MAAI,EAAW,EAAQ,EAAI,EAChG,CAGA,KAAO,EAAK,OAAS,GAAG,GAAM,EAAW,EAAM,IAAO,EAAK,MAAO,OAAO,KAoBzE,OAnBI,EAAO,EAAK,OAAM,OAAO,EAAK,KAG9B,GAAkB,EAAO,EAAS,KAAO,EAAO,OAAO,EAAS,KAAO,MAGtE,GAGL,EAAO,EAAO,GAAK,EAAO,OAAO,EAAO,IAGnC,EAAO,EAAO,IAAM,EAAO,IAAM,EAAO,IAAM,EAAO,KACnD,KAAU,EAAO,IAAM,EAAO,IAAM,EAAO,IAAM,EAAO,KACxD,CAAC,EAAK,SACP,EAAU,EAAS,GAAK,EACvB,KAAK,MAAQ,GAGb,OAba,KAAK,MAAQ,EAAM,KAczC,CAEA,SAAgB,EAAU,EAAM,CAC9B,IAAK,IAAI,EAAI,EAAG,EAAI,EAAK,OAAQ,EAAI,EAAG,EAAE,EAAG,KAAK,OAAO,EAAK,EAAE,EAChE,OAAO,IACT,CC7DA,SAAA,GAA0B,CACxB,OAAO,KAAK,KACd,CCFA,SAAA,GAA0B,CACxB,IAAI,EAAO,EAIX,OAHA,KAAK,MAAM,SAAS,EAAM,CACxB,GAAI,CAAC,EAAK,OAAQ,EAAG,EAAE,QAAa,EAAO,EAAK,KAClD,CAAC,EACM,CACT,CCJA,SAAA,EAAwB,EAAU,CAChC,IAAI,EAAQ,CAAC,EAAG,EAAG,EAAO,KAAK,MAAO,EAAO,EAAI,EAAI,EAAI,EAEzD,IADI,GAAM,EAAM,KAAK,IAAIC,EAAK,EAAM,KAAK,IAAK,KAAK,IAAK,KAAK,IAAK,KAAK,GAAG,CAAC,EACpE,EAAI,EAAM,IAAI,GACnB,GAAI,CAAC,EAAS,EAAO,EAAE,KAAM,EAAK,EAAE,GAAI,EAAK,EAAE,GAAI,EAAK,EAAE,GAAI,EAAK,EAAE,EAAE,GAAK,EAAK,OAAQ,CACvF,IAAI,GAAM,EAAK,GAAM,EAAG,GAAM,EAAK,GAAM,GACrC,EAAQ,EAAK,KAAI,EAAM,KAAK,IAAIA,EAAK,EAAO,EAAI,EAAI,EAAI,CAAE,CAAC,GAC3D,EAAQ,EAAK,KAAI,EAAM,KAAK,IAAIA,EAAK,EAAO,EAAI,EAAI,EAAI,CAAE,CAAC,GAC3D,EAAQ,EAAK,KAAI,EAAM,KAAK,IAAIA,EAAK,EAAO,EAAI,EAAI,EAAI,CAAE,CAAC,GAC3D,EAAQ,EAAK,KAAI,EAAM,KAAK,IAAIA,EAAK,EAAO,EAAI,EAAI,EAAI,CAAE,CAAC,CACjE,CAEF,OAAO,IACT,CCbA,SAAA,EAAwB,EAAU,CAChC,IAAI,EAAQ,CAAC,EAAG,EAAO,CAAC,EAAG,EAE3B,IADI,KAAK,OAAO,EAAM,KAAK,IAAIC,EAAK,KAAK,MAAO,KAAK,IAAK,KAAK,IAAK,KAAK,IAAK,KAAK,GAAG,CAAC,EAChF,EAAI,EAAM,IAAI,GAAG,CACtB,IAAI,EAAO,EAAE,KACb,GAAI,EAAK,OAAQ,CACf,IAAI,EAAO,EAAK,EAAE,GAAI,EAAK,EAAE,GAAI,EAAK,EAAE,GAAI,EAAK,EAAE,GAAI,GAAM,EAAK,GAAM,EAAG,GAAM,EAAK,GAAM,GACxF,EAAQ,EAAK,KAAI,EAAM,KAAK,IAAIA,EAAK,EAAO,EAAI,EAAI,EAAI,CAAE,CAAC,GAC3D,EAAQ,EAAK,KAAI,EAAM,KAAK,IAAIA,EAAK,EAAO,EAAI,EAAI,EAAI,CAAE,CAAC,GAC3D,EAAQ,EAAK,KAAI,EAAM,KAAK,IAAIA,EAAK,EAAO,EAAI,EAAI,EAAI,CAAE,CAAC,GAC3D,EAAQ,EAAK,KAAI,EAAM,KAAK,IAAIA,EAAK,EAAO,EAAI,EAAI,EAAI,CAAE,CAAC,CACjE,CACA,EAAK,KAAK,CAAC,CACb,CACA,KAAO,EAAI,EAAK,IAAI,GAClB,EAAS,EAAE,KAAM,EAAE,GAAI,EAAE,GAAI,EAAE,GAAI,EAAE,EAAE,EAEzC,OAAO,IACT,CCpBA,SAAgB,EAAS,EAAG,CAC1B,OAAO,EAAE,EACX,CAEA,SAAA,EAAwB,EAAG,CACzB,OAAO,UAAU,QAAU,KAAK,GAAK,EAAG,MAAQ,KAAK,EACvD,CCNA,SAAgB,EAAS,EAAG,CAC1B,OAAO,EAAE,EACX,CAEA,SAAA,EAAwB,EAAG,CACzB,OAAO,UAAU,QAAU,KAAK,GAAK,EAAG,MAAQ,KAAK,EACvD,CCOA,SAAwB,EAAS,EAAO,EAAG,EAAG,CAC5C,IAAI,EAAO,IAAI,EAAS,GAAY,EAAc,GAAY,EAAc,IAAK,IAAK,IAAK,GAAG,EAC9F,OAAO,GAAS,KAAO,EAAO,EAAK,OAAO,CAAK,CACjD,CAEA,SAAS,EAAS,EAAG,EAAG,EAAI,EAAI,EAAI,EAAI,CACtC,KAAK,GAAK,EACV,KAAK,GAAK,EACV,KAAK,IAAM,EACX,KAAK,IAAM,EACX,KAAK,IAAM,EACX,KAAK,IAAM,EACX,KAAK,MAAQ,IAAA,EACf,CAEA,SAAS,EAAU,EAAM,CAEvB,IADA,IAAI,EAAO,CAAC,KAAM,EAAK,IAAI,EAAG,EAAO,EAC9B,EAAO,EAAK,MAAM,EAAO,EAAK,KAAO,CAAC,KAAM,EAAK,IAAI,EAC5D,OAAO,CACT,CAEA,IAAI,EAAY,EAAS,UAAY,EAAS,UAE9C,EAAU,KAAO,UAAW,CAC1B,IAAI,EAAO,IAAI,EAAS,KAAK,GAAI,KAAK,GAAI,KAAK,IAAK,KAAK,IAAK,KAAK,IAAK,KAAK,GAAG,EAC5E,EAAO,KAAK,MACZ,EACA,EAEJ,GAAI,CAAC,EAAM,OAAO,EAElB,GAAI,CAAC,EAAK,OAAQ,MAAO,GAAK,MAAQ,EAAU,CAAI,EAAG,EAGvD,IADA,EAAQ,CAAC,CAAC,OAAQ,EAAM,OAAQ,EAAK,MAAQ,KAAW,CAAC,CAAC,EACnD,EAAO,EAAM,IAAI,GACtB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,EAAE,GACnB,EAAQ,EAAK,OAAO,MAClB,EAAM,OAAQ,EAAM,KAAK,CAAC,OAAQ,EAAO,OAAQ,EAAK,OAAO,GAAK,KAAW,CAAC,CAAC,EAC9E,EAAK,OAAO,GAAK,EAAU,CAAK,GAK3C,OAAO,CACT,EAEA,EAAU,IAAMC,EAChB,EAAU,OAASC,EACnB,EAAU,MAAQC,EAClB,EAAU,KAAOC,EACjB,EAAU,OAASC,EACnB,EAAU,KAAOC,EACjB,EAAU,OAASC,EACnB,EAAU,UAAYC,EACtB,EAAU,KAAOC,EACjB,EAAU,KAAOC,EACjB,EAAU,MAAQC,EAClB,EAAU,WAAaC,EACvB,EAAU,EAAIC,EACd,EAAU,EAAIC,ECxEd,SAAA,EAAwB,EAAG,CACzB,OAAO,UAAW,CAChB,OAAO,CACT,CACF,CCJA,SAAA,EAAwB,EAAQ,CAC9B,OAAQ,EAAO,EAAI,IAAO,IAC5B,CCEA,SAASC,EAAE,EAAG,CACZ,OAAO,EAAE,EAAI,EAAE,EACjB,CAEA,SAASC,EAAE,EAAG,CACZ,OAAO,EAAE,EAAI,EAAE,EACjB,CAEA,SAAA,EAAwB,EAAQ,CAC9B,IAAI,EACA,EACA,EACA,EAAW,EACX,EAAa,EAEb,OAAO,GAAW,aAAY,EAASC,EAAS,GAAU,KAAO,EAAI,CAAC,CAAM,GAEhF,SAAS,GAAQ,CASf,IAAK,IARD,EAAG,EAAI,EAAM,OACb,EACA,EACA,EACA,EACA,EACA,EAEK,EAAI,EAAG,EAAI,EAAY,EAAE,EAEhC,IADA,EAAO,EAAS,EAAOF,EAAGC,CAAC,EAAE,WAAW,CAAO,EAC1C,EAAI,EAAG,EAAI,EAAG,EAAE,EACnB,EAAO,EAAM,GACb,EAAK,EAAM,EAAK,OAAQ,EAAM,EAAK,EACnC,EAAK,EAAK,EAAI,EAAK,GACnB,EAAK,EAAK,EAAI,EAAK,GACnB,EAAK,MAAM,CAAK,EAIpB,SAAS,EAAM,EAAM,EAAI,EAAI,EAAI,EAAI,CACnC,IAAI,EAAO,EAAK,KAAM,EAAK,EAAK,EAAG,EAAI,EAAK,EAC5C,GAAI,EAAM,CACR,GAAI,EAAK,MAAQ,EAAK,MAAO,CAC3B,IAAI,EAAI,EAAK,EAAK,EAAI,EAAK,GACvB,EAAI,EAAK,EAAK,EAAI,EAAK,GACvB,EAAI,EAAI,EAAI,EAAI,EAChB,EAAI,EAAI,IACN,IAAM,IAAG,EAAIE,EAAO,CAAM,EAAG,GAAK,EAAI,GACtC,IAAM,IAAG,EAAIA,EAAO,CAAM,EAAG,GAAK,EAAI,GAC1C,GAAK,GAAK,EAAI,KAAK,KAAK,CAAC,IAAM,EAAI,EACnC,EAAK,KAAO,GAAK,IAAM,GAAK,GAAM,IAAO,EAAM,IAC/C,EAAK,KAAO,GAAK,GAAK,EACtB,EAAK,IAAM,GAAK,EAAI,EAAI,GACxB,EAAK,IAAM,EAAI,EAEnB,CACA,MACF,CACA,OAAO,EAAK,EAAK,GAAK,EAAK,EAAK,GAAK,EAAK,EAAK,GAAK,EAAK,EAAK,CAChE,CACF,CAEA,SAAS,EAAQ,EAAM,CACrB,GAAI,EAAK,KAAM,MAAO,GAAK,EAAI,EAAM,EAAK,KAAK,OAC/C,IAAK,IAAI,EAAI,EAAK,EAAI,EAAG,EAAI,EAAG,EAAE,EAC5B,EAAK,IAAM,EAAK,GAAG,EAAI,EAAK,IAC9B,EAAK,EAAI,EAAK,GAAG,EAGvB,CAEA,SAAS,GAAa,CACf,KACL,KAAI,EAAG,EAAI,EAAM,OAAQ,EAEzB,IADA,EAAY,MAAM,CAAC,EACd,EAAI,EAAG,EAAI,EAAG,EAAE,EAAG,EAAO,EAAM,GAAI,EAAM,EAAK,OAAS,CAAC,EAAO,EAAM,EAAG,CAAK,CAF1D,CAG3B,CAoBA,MAlBA,GAAM,WAAa,SAAS,EAAQ,EAAS,CAC3C,EAAQ,EACR,EAAS,EACT,EAAW,CACb,EAEA,EAAM,WAAa,SAAS,EAAG,CAC7B,OAAO,UAAU,QAAU,EAAa,CAAC,EAAG,GAAS,CACvD,EAEA,EAAM,SAAW,SAAS,EAAG,CAC3B,OAAO,UAAU,QAAU,EAAW,CAAC,EAAG,GAAS,CACrD,EAEA,EAAM,OAAS,SAAS,EAAG,CACzB,OAAO,UAAU,QAAU,EAAS,OAAO,GAAM,WAAa,EAAID,EAAS,CAAC,CAAC,EAAG,EAAW,EAAG,GAAS,CACzG,EAEO,CACT,CClGA,IAAM,EAAI,QACJ,EAAI,WACJ,EAAI,WAEV,SAAA,GAA0B,CACxB,IAAI,EAAI,EACR,WAAc,GAAK,EAAI,EAAI,GAAK,GAAK,CACvC,CCJA,SAAgB,EAAE,EAAG,CACnB,OAAO,EAAE,CACX,CAEA,SAAgB,EAAE,EAAG,CACnB,OAAO,EAAE,CACX,CAEA,IAAI,EAAgB,GAChB,EAAe,KAAK,IAAM,EAAI,KAAK,KAAK,CAAC,GAE7C,SAAA,EAAwB,EAAO,CAC7B,IAAI,EACA,EAAQ,EACR,EAAW,KACX,EAAa,EAAa,IAAU,EAAI,KACxC,EAAc,EACd,EAAgB,GAChB,EAAS,IAAI,IACb,EAAUE,EAAAA,EAAM,CAAI,EACpB,EAAQC,EAAAA,EAAS,OAAQ,KAAK,EAC9B,EAASC,EAAI,EAEjB,AAAmB,IAAQ,CAAC,EAE5B,SAAS,GAAO,CACd,EAAK,EACL,EAAM,KAAK,OAAQ,CAAU,EACzB,EAAQ,IACV,EAAQ,KAAK,EACb,EAAM,KAAK,MAAO,CAAU,EAEhC,CAEA,SAAS,EAAK,EAAY,CACxB,IAAI,EAAG,EAAI,EAAM,OAAQ,EAErB,IAAe,IAAA,KAAW,EAAa,GAE3C,IAAK,IAAI,EAAI,EAAG,EAAI,EAAY,EAAE,EAOhC,IANA,IAAU,EAAc,GAAS,EAEjC,EAAO,QAAQ,SAAS,EAAO,CAC7B,EAAM,CAAK,CACb,CAAC,EAEI,EAAI,EAAG,EAAI,EAAG,EAAE,EACnB,EAAO,EAAM,GACT,EAAK,IAAM,KAAM,EAAK,GAAK,EAAK,IAAM,GACrC,EAAK,EAAI,EAAK,GAAI,EAAK,GAAK,GAC7B,EAAK,IAAM,KAAM,EAAK,GAAK,EAAK,IAAM,GACrC,EAAK,EAAI,EAAK,GAAI,EAAK,GAAK,GAIrC,OAAO,CACT,CAEA,SAAS,GAAkB,CACzB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,OAAQ,EAAM,EAAI,EAAG,EAAE,EAAG,CAIlD,GAHA,EAAO,EAAM,GAAI,EAAK,MAAQ,EAC1B,EAAK,IAAM,OAAM,EAAK,EAAI,EAAK,IAC/B,EAAK,IAAM,OAAM,EAAK,EAAI,EAAK,IAC/B,MAAM,EAAK,CAAC,GAAK,MAAM,EAAK,CAAC,EAAG,CAClC,IAAI,EAAS,EAAgB,KAAK,KAAK,GAAM,CAAC,EAAG,EAAQ,EAAI,EAC7D,EAAK,EAAI,EAAS,KAAK,IAAI,CAAK,EAChC,EAAK,EAAI,EAAS,KAAK,IAAI,CAAK,CAClC,EACI,MAAM,EAAK,EAAE,GAAK,MAAM,EAAK,EAAE,KACjC,EAAK,GAAK,EAAK,GAAK,EAExB,CACF,CAEA,SAAS,EAAgB,EAAO,CAE9B,OADI,EAAM,YAAY,EAAM,WAAW,EAAO,CAAM,EAC7C,CACT,CAIA,OAFA,EAAgB,EAET,EAAa,CACZ,OAEN,QAAS,UAAW,CAClB,OAAO,EAAQ,QAAQ,CAAI,EAAG,CAChC,EAEA,KAAM,UAAW,CACf,OAAO,EAAQ,KAAK,EAAG,CACzB,EAEA,MAAO,SAAS,EAAG,CACjB,OAAO,UAAU,QAAU,EAAQ,EAAG,EAAgB,EAAG,EAAO,QAAQ,CAAe,EAAG,GAAc,CAC1G,EAEA,MAAO,SAAS,EAAG,CACjB,OAAO,UAAU,QAAU,EAAQ,CAAC,EAAG,GAAc,CACvD,EAEA,SAAU,SAAS,EAAG,CACpB,OAAO,UAAU,QAAU,EAAW,CAAC,EAAG,GAAc,CAC1D,EAEA,WAAY,SAAS,EAAG,CACtB,OAAO,UAAU,QAAU,EAAa,CAAC,EAAG,GAAc,CAAC,CAC7D,EAEA,YAAa,SAAS,EAAG,CACvB,OAAO,UAAU,QAAU,EAAc,CAAC,EAAG,GAAc,CAC7D,EAEA,cAAe,SAAS,EAAG,CACzB,OAAO,UAAU,QAAU,EAAgB,EAAI,EAAG,GAAc,EAAI,CACtE,EAEA,aAAc,SAAS,EAAG,CACxB,OAAO,UAAU,QAAU,EAAS,EAAG,EAAO,QAAQ,CAAe,EAAG,GAAc,CACxF,EAEA,MAAO,SAAS,EAAM,EAAG,CACvB,OAAO,UAAU,OAAS,GAAM,GAAK,KAAO,EAAO,OAAO,CAAI,EAAI,EAAO,IAAI,EAAM,EAAgB,CAAC,CAAC,EAAI,GAAc,EAAO,IAAI,CAAI,CACxI,EAEA,KAAM,SAAS,EAAG,EAAG,EAAQ,CAC3B,IAAI,EAAI,EACJ,EAAI,EAAM,OACV,EACA,EACA,EACA,EACA,EAKJ,IAHI,GAAU,KAAM,EAAS,IACxB,GAAU,EAEV,EAAI,EAAG,EAAI,EAAG,EAAE,EACnB,EAAO,EAAM,GACb,EAAK,EAAI,EAAK,EACd,EAAK,EAAI,EAAK,EACd,EAAK,EAAK,EAAK,EAAK,EAChB,EAAK,IAAQ,EAAU,EAAM,EAAS,GAG5C,OAAO,CACT,EAEA,GAAI,SAAS,EAAM,EAAG,CACpB,OAAO,UAAU,OAAS,GAAK,EAAM,GAAG,EAAM,CAAC,EAAG,GAAc,EAAM,GAAG,CAAI,CAC/E,CACF,CACF,CCtJA,SAAA,GAA0B,CACxB,IAAI,EACA,EACA,EACA,EACA,EAAWC,EAAS,GAAG,EACvB,EACA,EAAe,EACf,EAAe,IACf,EAAS,IAEb,SAAS,EAAM,EAAG,CAChB,IAAI,EAAG,EAAI,EAAM,OAAQ,EAAO,EAAS,EAAO,EAAG,CAAC,EAAE,WAAW,CAAU,EAC3E,IAAK,EAAQ,EAAG,EAAI,EAAG,EAAI,EAAG,EAAE,EAAG,EAAO,EAAM,GAAI,EAAK,MAAM,CAAK,CACtE,CAEA,SAAS,GAAa,CACf,KACL,KAAI,EAAG,EAAI,EAAM,OAAQ,EAEzB,IADA,EAAgB,MAAM,CAAC,EAClB,EAAI,EAAG,EAAI,EAAG,EAAE,EAAG,EAAO,EAAM,GAAI,EAAU,EAAK,OAAS,CAAC,EAAS,EAAM,EAAG,CAAK,CAFhE,CAG3B,CAEA,SAAS,EAAW,EAAM,CACxB,IAAI,EAAW,EAAG,EAAG,EAAG,EAAS,EAAG,EAAG,EAAG,EAG1C,GAAI,EAAK,OAAQ,CACf,IAAK,EAAI,EAAI,EAAI,EAAG,EAAI,EAAG,EAAE,GACtB,EAAI,EAAK,MAAQ,EAAI,KAAK,IAAI,EAAE,KAAK,KACxC,GAAY,EAAE,MAAO,GAAU,EAAG,GAAK,EAAI,EAAE,EAAG,GAAK,EAAI,EAAE,GAG/D,EAAK,EAAI,EAAI,EACb,EAAK,EAAI,EAAI,CACf,KAGK,CACH,EAAI,EACJ,EAAE,EAAI,EAAE,KAAK,EACb,EAAE,EAAI,EAAE,KAAK,EACb,EAAG,IAAY,EAAU,EAAE,KAAK,aACzB,EAAI,EAAE,KACf,CAEA,EAAK,MAAQ,CACf,CAEA,SAAS,EAAM,EAAM,EAAI,EAAG,EAAI,CAC9B,GAAI,CAAC,EAAK,MAAO,MAAO,GAExB,IAAI,EAAI,EAAK,EAAI,EAAK,EAClB,EAAI,EAAK,EAAI,EAAK,EAClB,EAAI,EAAK,EACT,EAAI,EAAI,EAAI,EAAI,EAIpB,GAAI,EAAI,EAAI,EAAS,EAQnB,OAPI,EAAI,IACF,IAAM,IAAG,EAAIC,EAAO,CAAM,EAAG,GAAK,EAAI,GACtC,IAAM,IAAG,EAAIA,EAAO,CAAM,EAAG,GAAK,EAAI,GACtC,EAAI,IAAc,EAAI,KAAK,KAAK,EAAe,CAAC,GACpD,EAAK,IAAM,EAAI,EAAK,MAAQ,EAAQ,EACpC,EAAK,IAAM,EAAI,EAAK,MAAQ,EAAQ,GAE/B,GAIA,OAAK,QAAU,GAAK,GAG7B,EAAI,EAAK,OAAS,GAAQ,EAAK,QACzB,IAAM,IAAG,EAAIA,EAAO,CAAM,EAAG,GAAK,EAAI,GACtC,IAAM,IAAG,EAAIA,EAAO,CAAM,EAAG,GAAK,EAAI,GACtC,EAAI,IAAc,EAAI,KAAK,KAAK,EAAe,CAAC,IAGtD,GAAO,EAAK,OAAS,IACnB,EAAI,EAAU,EAAK,KAAK,OAAS,EAAQ,EACzC,EAAK,IAAM,EAAI,EACf,EAAK,IAAM,EAAI,SACR,EAAO,EAAK,KANrB,CAOF,CAwBA,MAtBA,GAAM,WAAa,SAAS,EAAQ,EAAS,CAC3C,EAAQ,EACR,EAAS,EACT,EAAW,CACb,EAEA,EAAM,SAAW,SAAS,EAAG,CAC3B,OAAO,UAAU,QAAU,EAAW,OAAO,GAAM,WAAa,EAAID,EAAS,CAAC,CAAC,EAAG,EAAW,EAAG,GAAS,CAC3G,EAEA,EAAM,YAAc,SAAS,EAAG,CAC9B,OAAO,UAAU,QAAU,EAAe,EAAI,EAAG,GAAS,KAAK,KAAK,CAAY,CAClF,EAEA,EAAM,YAAc,SAAS,EAAG,CAC9B,OAAO,UAAU,QAAU,EAAe,EAAI,EAAG,GAAS,KAAK,KAAK,CAAY,CAClF,EAEA,EAAM,MAAQ,SAAS,EAAG,CACxB,OAAO,UAAU,QAAU,EAAS,EAAI,EAAG,GAAS,KAAK,KAAK,CAAM,CACtE,EAEO,CACT,CCjHA,SAAA,EAAwB,EAAG,CACzB,IAAI,EAAWE,EAAS,EAAG,EACvB,EACA,EACA,EAEA,OAAO,GAAM,aAAY,EAAIA,EAAS,GAAK,KAAO,EAAI,CAAC,CAAC,GAE5D,SAAS,EAAM,EAAO,CACpB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,OAAQ,EAAM,EAAI,EAAG,EAAE,EAC/C,EAAO,EAAM,GAAI,EAAK,KAAO,EAAG,GAAK,EAAK,GAAK,EAAU,GAAK,CAElE,CAEA,SAAS,GAAa,CACf,KACL,KAAI,EAAG,EAAI,EAAM,OAGjB,IAFA,EAAgB,MAAM,CAAC,EACvB,EAAS,MAAM,CAAC,EACX,EAAI,EAAG,EAAI,EAAG,EAAE,EACnB,EAAU,GAAK,MAAM,EAAG,GAAK,CAAC,EAAE,EAAM,GAAI,EAAG,CAAK,CAAC,EAAI,EAAI,CAAC,EAAS,EAAM,GAAI,EAAG,CAAK,CAJxE,CAMnB,CAeA,MAbA,GAAM,WAAa,SAAS,EAAG,CAC7B,EAAQ,EACR,EAAW,CACb,EAEA,EAAM,SAAW,SAAS,EAAG,CAC3B,OAAO,UAAU,QAAU,EAAW,OAAO,GAAM,WAAa,EAAIA,EAAS,CAAC,CAAC,EAAG,EAAW,EAAG,GAAS,CAC3G,EAEA,EAAM,EAAI,SAAS,EAAG,CACpB,OAAO,UAAU,QAAU,EAAI,OAAO,GAAM,WAAa,EAAIA,EAAS,CAAC,CAAC,EAAG,EAAW,EAAG,GAAS,CACpG,EAEO,CACT,CCtCA,SAAA,EAAwB,EAAG,CACzB,IAAI,EAAWC,EAAS,EAAG,EACvB,EACA,EACA,EAEA,OAAO,GAAM,aAAY,EAAIA,EAAS,GAAK,KAAO,EAAI,CAAC,CAAC,GAE5D,SAAS,EAAM,EAAO,CACpB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,OAAQ,EAAM,EAAI,EAAG,EAAE,EAC/C,EAAO,EAAM,GAAI,EAAK,KAAO,EAAG,GAAK,EAAK,GAAK,EAAU,GAAK,CAElE,CAEA,SAAS,GAAa,CACf,KACL,KAAI,EAAG,EAAI,EAAM,OAGjB,IAFA,EAAgB,MAAM,CAAC,EACvB,EAAS,MAAM,CAAC,EACX,EAAI,EAAG,EAAI,EAAG,EAAE,EACnB,EAAU,GAAK,MAAM,EAAG,GAAK,CAAC,EAAE,EAAM,GAAI,EAAG,CAAK,CAAC,EAAI,EAAI,CAAC,EAAS,EAAM,GAAI,EAAG,CAAK,CAJxE,CAMnB,CAeA,MAbA,GAAM,WAAa,SAAS,EAAG,CAC7B,EAAQ,EACR,EAAW,CACb,EAEA,EAAM,SAAW,SAAS,EAAG,CAC3B,OAAO,UAAU,QAAU,EAAW,OAAO,GAAM,WAAa,EAAIA,EAAS,CAAC,CAAC,EAAG,EAAW,EAAG,GAAS,CAC3G,EAEA,EAAM,EAAI,SAAS,EAAG,CACpB,OAAO,UAAU,QAAU,EAAI,OAAO,GAAM,WAAa,EAAIA,EAAS,CAAC,CAAC,EAAG,EAAW,EAAG,GAAS,CACpG,EAEO,CACT"}

package/dist/y-C3UBwapx.js

@@ -0,0 +1,450 @@
+import { i as e, r as t } from "./timer-BSVEY28v.js";
+//#region node_modules/d3-quadtree/src/add.js
+function n(e) {
+	let t = +this._x.call(null, e), n = +this._y.call(null, e);
+	return r(this.cover(t, n), t, n, e);
+}
+function r(e, t, n, r) {
+	if (isNaN(t) || isNaN(n)) return e;
+	var i, a = e._root, o = { data: r }, s = e._x0, c = e._y0, l = e._x1, u = e._y1, d, f, p, m, h, g, _, v;
+	if (!a) return e._root = o, e;
+	for (; a.length;) if ((h = t >= (d = (s + l) / 2)) ? s = d : l = d, (g = n >= (f = (c + u) / 2)) ? c = f : u = f, i = a, !(a = a[_ = g << 1 | h])) return i[_] = o, e;
+	if (p = +e._x.call(null, a.data), m = +e._y.call(null, a.data), t === p && n === m) return o.next = a, i ? i[_] = o : e._root = o, e;
+	do
+		i = i ? i[_] = [
+			,
+			,
+			,
+			,
+		] : e._root = [
+			,
+			,
+			,
+			,
+		], (h = t >= (d = (s + l) / 2)) ? s = d : l = d, (g = n >= (f = (c + u) / 2)) ? c = f : u = f;
+	while ((_ = g << 1 | h) == (v = (m >= f) << 1 | p >= d));
+	return i[v] = a, i[_] = o, e;
+}
+function i(e) {
+	var t, n, i = e.length, a, o, s = Array(i), c = Array(i), l = Infinity, u = Infinity, d = -Infinity, f = -Infinity;
+	for (n = 0; n < i; ++n) isNaN(a = +this._x.call(null, t = e[n])) || isNaN(o = +this._y.call(null, t)) || (s[n] = a, c[n] = o, a < l && (l = a), a > d && (d = a), o < u && (u = o), o > f && (f = o));
+	if (l > d || u > f) return this;
+	for (this.cover(l, u).cover(d, f), n = 0; n < i; ++n) r(this, s[n], c[n], e[n]);
+	return this;
+}
+//#endregion
+//#region node_modules/d3-quadtree/src/cover.js
+function a(e, t) {
+	if (isNaN(e = +e) || isNaN(t = +t)) return this;
+	var n = this._x0, r = this._y0, i = this._x1, a = this._y1;
+	if (isNaN(n)) i = (n = Math.floor(e)) + 1, a = (r = Math.floor(t)) + 1;
+	else {
+		for (var o = i - n || 1, s = this._root, c, l; n > e || e >= i || r > t || t >= a;) switch (l = (t < r) << 1 | e < n, c = [
+			,
+			,
+			,
+			,
+		], c[l] = s, s = c, o *= 2, l) {
+			case 0:
+				i = n + o, a = r + o;
+				break;
+			case 1:
+				n = i - o, a = r + o;
+				break;
+			case 2:
+				i = n + o, r = a - o;
+				break;
+			case 3:
+				n = i - o, r = a - o;
+				break;
+		}
+		this._root && this._root.length && (this._root = s);
+	}
+	return this._x0 = n, this._y0 = r, this._x1 = i, this._y1 = a, this;
+}
+//#endregion
+//#region node_modules/d3-quadtree/src/data.js
+function o() {
+	var e = [];
+	return this.visit(function(t) {
+		if (!t.length) do
+			e.push(t.data);
+		while (t = t.next);
+	}), e;
+}
+//#endregion
+//#region node_modules/d3-quadtree/src/extent.js
+function s(e) {
+	return arguments.length ? this.cover(+e[0][0], +e[0][1]).cover(+e[1][0], +e[1][1]) : isNaN(this._x0) ? void 0 : [[this._x0, this._y0], [this._x1, this._y1]];
+}
+//#endregion
+//#region node_modules/d3-quadtree/src/quad.js
+function c(e, t, n, r, i) {
+	this.node = e, this.x0 = t, this.y0 = n, this.x1 = r, this.y1 = i;
+}
+//#endregion
+//#region node_modules/d3-quadtree/src/find.js
+function l(e, t, n) {
+	var r, i = this._x0, a = this._y0, o, s, l, u, d = this._x1, f = this._y1, p = [], m = this._root, h, g;
+	for (m && p.push(new c(m, i, a, d, f)), n == null ? n = Infinity : (i = e - n, a = t - n, d = e + n, f = t + n, n *= n); h = p.pop();) if (!(!(m = h.node) || (o = h.x0) > d || (s = h.y0) > f || (l = h.x1) < i || (u = h.y1) < a)) if (m.length) {
+		var _ = (o + l) / 2, v = (s + u) / 2;
+		p.push(new c(m[3], _, v, l, u), new c(m[2], o, v, _, u), new c(m[1], _, s, l, v), new c(m[0], o, s, _, v)), (g = (t >= v) << 1 | e >= _) && (h = p[p.length - 1], p[p.length - 1] = p[p.length - 1 - g], p[p.length - 1 - g] = h);
+	} else {
+		var y = e - +this._x.call(null, m.data), b = t - +this._y.call(null, m.data), x = y * y + b * b;
+		if (x < n) {
+			var S = Math.sqrt(n = x);
+			i = e - S, a = t - S, d = e + S, f = t + S, r = m.data;
+		}
+	}
+	return r;
+}
+//#endregion
+//#region node_modules/d3-quadtree/src/remove.js
+function u(e) {
+	if (isNaN(u = +this._x.call(null, e)) || isNaN(d = +this._y.call(null, e))) return this;
+	var t, n = this._root, r, i, a, o = this._x0, s = this._y0, c = this._x1, l = this._y1, u, d, f, p, m, h, g, _;
+	if (!n) return this;
+	if (n.length) for (;;) {
+		if ((m = u >= (f = (o + c) / 2)) ? o = f : c = f, (h = d >= (p = (s + l) / 2)) ? s = p : l = p, t = n, !(n = n[g = h << 1 | m])) return this;
+		if (!n.length) break;
+		(t[g + 1 & 3] || t[g + 2 & 3] || t[g + 3 & 3]) && (r = t, _ = g);
+	}
+	for (; n.data !== e;) if (i = n, !(n = n.next)) return this;
+	return (a = n.next) && delete n.next, i ? (a ? i.next = a : delete i.next, this) : t ? (a ? t[g] = a : delete t[g], (n = t[0] || t[1] || t[2] || t[3]) && n === (t[3] || t[2] || t[1] || t[0]) && !n.length && (r ? r[_] = n : this._root = n), this) : (this._root = a, this);
+}
+function d(e) {
+	for (var t = 0, n = e.length; t < n; ++t) this.remove(e[t]);
+	return this;
+}
+//#endregion
+//#region node_modules/d3-quadtree/src/root.js
+function f() {
+	return this._root;
+}
+//#endregion
+//#region node_modules/d3-quadtree/src/size.js
+function p() {
+	var e = 0;
+	return this.visit(function(t) {
+		if (!t.length) do
+			++e;
+		while (t = t.next);
+	}), e;
+}
+//#endregion
+//#region node_modules/d3-quadtree/src/visit.js
+function m(e) {
+	var t = [], n, r = this._root, i, a, o, s, l;
+	for (r && t.push(new c(r, this._x0, this._y0, this._x1, this._y1)); n = t.pop();) if (!e(r = n.node, a = n.x0, o = n.y0, s = n.x1, l = n.y1) && r.length) {
+		var u = (a + s) / 2, d = (o + l) / 2;
+		(i = r[3]) && t.push(new c(i, u, d, s, l)), (i = r[2]) && t.push(new c(i, a, d, u, l)), (i = r[1]) && t.push(new c(i, u, o, s, d)), (i = r[0]) && t.push(new c(i, a, o, u, d));
+	}
+	return this;
+}
+//#endregion
+//#region node_modules/d3-quadtree/src/visitAfter.js
+function h(e) {
+	var t = [], n = [], r;
+	for (this._root && t.push(new c(this._root, this._x0, this._y0, this._x1, this._y1)); r = t.pop();) {
+		var i = r.node;
+		if (i.length) {
+			var a, o = r.x0, s = r.y0, l = r.x1, u = r.y1, d = (o + l) / 2, f = (s + u) / 2;
+			(a = i[0]) && t.push(new c(a, o, s, d, f)), (a = i[1]) && t.push(new c(a, d, s, l, f)), (a = i[2]) && t.push(new c(a, o, f, d, u)), (a = i[3]) && t.push(new c(a, d, f, l, u));
+		}
+		n.push(r);
+	}
+	for (; r = n.pop();) e(r.node, r.x0, r.y0, r.x1, r.y1);
+	return this;
+}
+//#endregion
+//#region node_modules/d3-quadtree/src/x.js
+function g(e) {
+	return e[0];
+}
+function _(e) {
+	return arguments.length ? (this._x = e, this) : this._x;
+}
+//#endregion
+//#region node_modules/d3-quadtree/src/y.js
+function v(e) {
+	return e[1];
+}
+function y(e) {
+	return arguments.length ? (this._y = e, this) : this._y;
+}
+//#endregion
+//#region node_modules/d3-quadtree/src/quadtree.js
+function b(e, t, n) {
+	var r = new x(t ?? g, n ?? v, NaN, NaN, NaN, NaN);
+	return e == null ? r : r.addAll(e);
+}
+function x(e, t, n, r, i, a) {
+	this._x = e, this._y = t, this._x0 = n, this._y0 = r, this._x1 = i, this._y1 = a, this._root = void 0;
+}
+function S(e) {
+	for (var t = { data: e.data }, n = t; e = e.next;) n = n.next = { data: e.data };
+	return t;
+}
+var C = b.prototype = x.prototype;
+C.copy = function() {
+	var e = new x(this._x, this._y, this._x0, this._y0, this._x1, this._y1), t = this._root, n, r;
+	if (!t) return e;
+	if (!t.length) return e._root = S(t), e;
+	for (n = [{
+		source: t,
+		target: e._root = [
+			,
+			,
+			,
+			,
+		]
+	}]; t = n.pop();) for (var i = 0; i < 4; ++i) (r = t.source[i]) && (r.length ? n.push({
+		source: r,
+		target: t.target[i] = [
+			,
+			,
+			,
+			,
+		]
+	}) : t.target[i] = S(r));
+	return e;
+}, C.add = n, C.addAll = i, C.cover = a, C.data = o, C.extent = s, C.find = l, C.remove = u, C.removeAll = d, C.root = f, C.size = p, C.visit = m, C.visitAfter = h, C.x = _, C.y = y;
+//#endregion
+//#region node_modules/d3-force/src/constant.js
+function w(e) {
+	return function() {
+		return e;
+	};
+}
+//#endregion
+//#region node_modules/d3-force/src/jiggle.js
+function T(e) {
+	return (e() - .5) * 1e-6;
+}
+//#endregion
+//#region node_modules/d3-force/src/collide.js
+function E(e) {
+	return e.x + e.vx;
+}
+function D(e) {
+	return e.y + e.vy;
+}
+function O(e) {
+	var t, n, r, i = 1, a = 1;
+	typeof e != "function" && (e = w(e == null ? 1 : +e));
+	function o() {
+		for (var e, o = t.length, c, l, u, d, f, p, m = 0; m < a; ++m) for (c = b(t, E, D).visitAfter(s), e = 0; e < o; ++e) l = t[e], f = n[l.index], p = f * f, u = l.x + l.vx, d = l.y + l.vy, c.visit(h);
+		function h(e, t, n, a, o) {
+			var s = e.data, c = e.r, m = f + c;
+			if (s) {
+				if (s.index > l.index) {
+					var h = u - s.x - s.vx, g = d - s.y - s.vy, _ = h * h + g * g;
+					_ < m * m && (h === 0 && (h = T(r), _ += h * h), g === 0 && (g = T(r), _ += g * g), _ = (m - (_ = Math.sqrt(_))) / _ * i, l.vx += (h *= _) * (m = (c *= c) / (p + c)), l.vy += (g *= _) * m, s.vx -= h * (m = 1 - m), s.vy -= g * m);
+				}
+				return;
+			}
+			return t > u + m || a < u - m || n > d + m || o < d - m;
+		}
+	}
+	function s(e) {
+		if (e.data) return e.r = n[e.data.index];
+		for (var t = e.r = 0; t < 4; ++t) e[t] && e[t].r > e.r && (e.r = e[t].r);
+	}
+	function c() {
+		if (t) {
+			var r, i = t.length, a;
+			for (n = Array(i), r = 0; r < i; ++r) a = t[r], n[a.index] = +e(a, r, t);
+		}
+	}
+	return o.initialize = function(e, n) {
+		t = e, r = n, c();
+	}, o.iterations = function(e) {
+		return arguments.length ? (a = +e, o) : a;
+	}, o.strength = function(e) {
+		return arguments.length ? (i = +e, o) : i;
+	}, o.radius = function(t) {
+		return arguments.length ? (e = typeof t == "function" ? t : w(+t), c(), o) : e;
+	}, o;
+}
+//#endregion
+//#region node_modules/d3-force/src/lcg.js
+var k = 1664525, A = 1013904223, j = 4294967296;
+function M() {
+	let e = 1;
+	return () => (e = (k * e + A) % j) / j;
+}
+//#endregion
+//#region node_modules/d3-force/src/simulation.js
+function N(e) {
+	return e.x;
+}
+function P(e) {
+	return e.y;
+}
+var F = 10, I = Math.PI * (3 - Math.sqrt(5));
+function L(n) {
+	var r, i = 1, a = .001, o = 1 - a ** (1 / 300), s = 0, c = .6, l = /* @__PURE__ */ new Map(), u = t(p), d = e("tick", "end"), f = M();
+	n ??= [];
+	function p() {
+		m(), d.call("tick", r), i < a && (u.stop(), d.call("end", r));
+	}
+	function m(e) {
+		var t, a = n.length, u;
+		e === void 0 && (e = 1);
+		for (var d = 0; d < e; ++d) for (i += (s - i) * o, l.forEach(function(e) {
+			e(i);
+		}), t = 0; t < a; ++t) u = n[t], u.fx == null ? u.x += u.vx *= c : (u.x = u.fx, u.vx = 0), u.fy == null ? u.y += u.vy *= c : (u.y = u.fy, u.vy = 0);
+		return r;
+	}
+	function h() {
+		for (var e = 0, t = n.length, r; e < t; ++e) {
+			if (r = n[e], r.index = e, r.fx != null && (r.x = r.fx), r.fy != null && (r.y = r.fy), isNaN(r.x) || isNaN(r.y)) {
+				var i = F * Math.sqrt(.5 + e), a = e * I;
+				r.x = i * Math.cos(a), r.y = i * Math.sin(a);
+			}
+			(isNaN(r.vx) || isNaN(r.vy)) && (r.vx = r.vy = 0);
+		}
+	}
+	function g(e) {
+		return e.initialize && e.initialize(n, f), e;
+	}
+	return h(), r = {
+		tick: m,
+		restart: function() {
+			return u.restart(p), r;
+		},
+		stop: function() {
+			return u.stop(), r;
+		},
+		nodes: function(e) {
+			return arguments.length ? (n = e, h(), l.forEach(g), r) : n;
+		},
+		alpha: function(e) {
+			return arguments.length ? (i = +e, r) : i;
+		},
+		alphaMin: function(e) {
+			return arguments.length ? (a = +e, r) : a;
+		},
+		alphaDecay: function(e) {
+			return arguments.length ? (o = +e, r) : +o;
+		},
+		alphaTarget: function(e) {
+			return arguments.length ? (s = +e, r) : s;
+		},
+		velocityDecay: function(e) {
+			return arguments.length ? (c = 1 - e, r) : 1 - c;
+		},
+		randomSource: function(e) {
+			return arguments.length ? (f = e, l.forEach(g), r) : f;
+		},
+		force: function(e, t) {
+			return arguments.length > 1 ? (t == null ? l.delete(e) : l.set(e, g(t)), r) : l.get(e);
+		},
+		find: function(e, t, r) {
+			var i = 0, a = n.length, o, s, c, l, u;
+			for (r == null ? r = Infinity : r *= r, i = 0; i < a; ++i) l = n[i], o = e - l.x, s = t - l.y, c = o * o + s * s, c < r && (u = l, r = c);
+			return u;
+		},
+		on: function(e, t) {
+			return arguments.length > 1 ? (d.on(e, t), r) : d.on(e);
+		}
+	};
+}
+//#endregion
+//#region node_modules/d3-force/src/manyBody.js
+function R() {
+	var e, t, n, r, i = w(-30), a, o = 1, s = Infinity, c = .81;
+	function l(n) {
+		var i, a = e.length, o = b(e, N, P).visitAfter(d);
+		for (r = n, i = 0; i < a; ++i) t = e[i], o.visit(f);
+	}
+	function u() {
+		if (e) {
+			var t, n = e.length, r;
+			for (a = Array(n), t = 0; t < n; ++t) r = e[t], a[r.index] = +i(r, t, e);
+		}
+	}
+	function d(e) {
+		var t = 0, n, r, i = 0, o, s, c;
+		if (e.length) {
+			for (o = s = c = 0; c < 4; ++c) (n = e[c]) && (r = Math.abs(n.value)) && (t += n.value, i += r, o += r * n.x, s += r * n.y);
+			e.x = o / i, e.y = s / i;
+		} else {
+			n = e, n.x = n.data.x, n.y = n.data.y;
+			do
+				t += a[n.data.index];
+			while (n = n.next);
+		}
+		e.value = t;
+	}
+	function f(e, i, l, u) {
+		if (!e.value) return !0;
+		var d = e.x - t.x, f = e.y - t.y, p = u - i, m = d * d + f * f;
+		if (p * p / c < m) return m < s && (d === 0 && (d = T(n), m += d * d), f === 0 && (f = T(n), m += f * f), m < o && (m = Math.sqrt(o * m)), t.vx += d * e.value * r / m, t.vy += f * e.value * r / m), !0;
+		if (!(e.length || m >= s)) {
+			(e.data !== t || e.next) && (d === 0 && (d = T(n), m += d * d), f === 0 && (f = T(n), m += f * f), m < o && (m = Math.sqrt(o * m)));
+			do
+				e.data !== t && (p = a[e.data.index] * r / m, t.vx += d * p, t.vy += f * p);
+			while (e = e.next);
+		}
+	}
+	return l.initialize = function(t, r) {
+		e = t, n = r, u();
+	}, l.strength = function(e) {
+		return arguments.length ? (i = typeof e == "function" ? e : w(+e), u(), l) : i;
+	}, l.distanceMin = function(e) {
+		return arguments.length ? (o = e * e, l) : Math.sqrt(o);
+	}, l.distanceMax = function(e) {
+		return arguments.length ? (s = e * e, l) : Math.sqrt(s);
+	}, l.theta = function(e) {
+		return arguments.length ? (c = e * e, l) : Math.sqrt(c);
+	}, l;
+}
+//#endregion
+//#region node_modules/d3-force/src/x.js
+function z(e) {
+	var t = w(.1), n, r, i;
+	typeof e != "function" && (e = w(e == null ? 0 : +e));
+	function a(e) {
+		for (var t = 0, a = n.length, o; t < a; ++t) o = n[t], o.vx += (i[t] - o.x) * r[t] * e;
+	}
+	function o() {
+		if (n) {
+			var a, o = n.length;
+			for (r = Array(o), i = Array(o), a = 0; a < o; ++a) r[a] = isNaN(i[a] = +e(n[a], a, n)) ? 0 : +t(n[a], a, n);
+		}
+	}
+	return a.initialize = function(e) {
+		n = e, o();
+	}, a.strength = function(e) {
+		return arguments.length ? (t = typeof e == "function" ? e : w(+e), o(), a) : t;
+	}, a.x = function(t) {
+		return arguments.length ? (e = typeof t == "function" ? t : w(+t), o(), a) : e;
+	}, a;
+}
+//#endregion
+//#region node_modules/d3-force/src/y.js
+function B(e) {
+	var t = w(.1), n, r, i;
+	typeof e != "function" && (e = w(e == null ? 0 : +e));
+	function a(e) {
+		for (var t = 0, a = n.length, o; t < a; ++t) o = n[t], o.vy += (i[t] - o.y) * r[t] * e;
+	}
+	function o() {
+		if (n) {
+			var a, o = n.length;
+			for (r = Array(o), i = Array(o), a = 0; a < o; ++a) r[a] = isNaN(i[a] = +e(n[a], a, n)) ? 0 : +t(n[a], a, n);
+		}
+	}
+	return a.initialize = function(e) {
+		n = e, o();
+	}, a.strength = function(e) {
+		return arguments.length ? (t = typeof e == "function" ? e : w(+e), o(), a) : t;
+	}, a.y = function(t) {
+		return arguments.length ? (e = typeof t == "function" ? t : w(+t), o(), a) : e;
+	}, a;
+}
+//#endregion
+export { O as a, L as i, z as n, R as r, B as t };
+
+//# sourceMappingURL=y-C3UBwapx.js.map

package/dist/y-C3UBwapx.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"y-C3UBwapx.js","names":["Quad","Quad","Quad","tree_add","tree_addAll","tree_cover","tree_data","tree_extent","tree_find","tree_remove","tree_removeAll","tree_root","tree_size","tree_visit","tree_visitAfter","tree_x","tree_y","x","y","constant","jiggle","lcg","constant","jiggle","constant","constant"],"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"],"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],"mappings":";;AAAA,SAAA,EAAwB,GAAG;CACzB,IAAM,IAAI,CAAC,KAAK,GAAG,KAAK,MAAM,CAAC,GAC3B,IAAI,CAAC,KAAK,GAAG,KAAK,MAAM,CAAC;CAC7B,OAAO,EAAI,KAAK,MAAM,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC;AACtC;AAEA,SAAS,EAAI,GAAM,GAAG,GAAG,GAAG;CAC1B,IAAI,MAAM,CAAC,KAAK,MAAM,CAAC,GAAG,OAAO;CAEjC,IAAI,GACA,IAAO,EAAK,OACZ,IAAO,EAAC,MAAM,EAAC,GACf,IAAK,EAAK,KACV,IAAK,EAAK,KACV,IAAK,EAAK,KACV,IAAK,EAAK,KACV,GACA,GACA,GACA,GACA,GACA,GACA,GACA;CAGJ,IAAI,CAAC,GAAM,OAAO,EAAK,QAAQ,GAAM;CAGrC,OAAO,EAAK,SAGV,KAFI,IAAQ,MAAM,KAAM,IAAK,KAAM,MAAI,IAAK,IAAS,IAAK,IACtD,IAAS,MAAM,KAAM,IAAK,KAAM,MAAI,IAAK,IAAS,IAAK,GACvD,IAAS,GAAM,EAAE,IAAO,EAAK,IAAI,KAAU,IAAI,KAAS,OAAO,EAAO,KAAK,GAAM;CAMvF,IAFA,IAAK,CAAC,EAAK,GAAG,KAAK,MAAM,EAAK,IAAI,GAClC,IAAK,CAAC,EAAK,GAAG,KAAK,MAAM,EAAK,IAAI,GAC9B,MAAM,KAAM,MAAM,GAAI,OAAO,EAAK,OAAO,GAAM,IAAS,EAAO,KAAK,IAAO,EAAK,QAAQ,GAAM;CAGlG;EAGE,AAFA,IAAS,IAAS,EAAO,KAAK;;;;;EAAW,IAAI,EAAK,QAAQ;;;;;EAAW,IACjE,IAAQ,MAAM,KAAM,IAAK,KAAM,MAAI,IAAK,IAAS,IAAK,IACtD,IAAS,MAAM,KAAM,IAAK,KAAM,MAAI,IAAK,IAAS,IAAK;SACnD,IAAI,KAAU,IAAI,OAAY,KAAK,KAAM,MAAO,IAAK,KAAM;CACrE,OAAO,EAAO,KAAK,GAAM,EAAO,KAAK,GAAM;AAC7C;AAEA,SAAgB,EAAO,GAAM;CAC3B,IAAI,GAAG,GAAG,IAAI,EAAK,QACf,GACA,GACA,IAAS,MAAM,CAAC,GAChB,IAAS,MAAM,CAAC,GAChB,IAAK,UACL,IAAK,UACL,IAAK,WACL,IAAK;CAGT,KAAK,IAAI,GAAG,IAAI,GAAG,EAAE,GACf,MAAM,IAAI,CAAC,KAAK,GAAG,KAAK,MAAM,IAAI,EAAK,EAAE,CAAC,KAAK,MAAM,IAAI,CAAC,KAAK,GAAG,KAAK,MAAM,CAAC,CAAC,MACnF,EAAG,KAAK,GACR,EAAG,KAAK,GACJ,IAAI,MAAI,IAAK,IACb,IAAI,MAAI,IAAK,IACb,IAAI,MAAI,IAAK,IACb,IAAI,MAAI,IAAK;CAInB,IAAI,IAAK,KAAM,IAAK,GAAI,OAAO;CAM/B,KAHA,KAAK,MAAM,GAAI,CAAE,EAAE,MAAM,GAAI,CAAE,GAG1B,IAAI,GAAG,IAAI,GAAG,EAAE,GACnB,EAAI,MAAM,EAAG,IAAI,EAAG,IAAI,EAAK,EAAE;CAGjC,OAAO;AACT;;;ACnFA,SAAA,EAAwB,GAAG,GAAG;CAC5B,IAAI,MAAM,IAAI,CAAC,CAAC,KAAK,MAAM,IAAI,CAAC,CAAC,GAAG,OAAO;CAE3C,IAAI,IAAK,KAAK,KACV,IAAK,KAAK,KACV,IAAK,KAAK,KACV,IAAK,KAAK;CAKd,IAAI,MAAM,CAAE,GAEV,AADA,KAAM,IAAK,KAAK,MAAM,CAAC,KAAK,GAC5B,KAAM,IAAK,KAAK,MAAM,CAAC,KAAK;MAIzB;EAMH,KALA,IAAI,IAAI,IAAK,KAAM,GACf,IAAO,KAAK,OACZ,GACA,GAEG,IAAK,KAAK,KAAK,KAAM,IAAK,KAAK,KAAK,IAGzC,QAFA,KAAK,IAAI,MAAO,IAAK,IAAI,GACzB,IAAS;;;;;EAAW,GAAG,EAAO,KAAK,GAAM,IAAO,GAAQ,KAAK,GACrD,GAAR;GACE,KAAK;IAAG,IAAK,IAAK,GAAG,IAAK,IAAK;IAAG;GAClC,KAAK;IAAG,IAAK,IAAK,GAAG,IAAK,IAAK;IAAG;GAClC,KAAK;IAAG,IAAK,IAAK,GAAG,IAAK,IAAK;IAAG;GAClC,KAAK;IAAG,IAAK,IAAK,GAAG,IAAK,IAAK;IAAG;EACpC;EAGF,AAAI,KAAK,SAAS,KAAK,MAAM,WAAQ,KAAK,QAAQ;CACpD;CAMA,OAJA,KAAK,MAAM,GACX,KAAK,MAAM,GACX,KAAK,MAAM,GACX,KAAK,MAAM,GACJ;AACT;;;AC1CA,SAAA,IAA0B;CACxB,IAAI,IAAO,CAAC;CAIZ,OAHA,KAAK,MAAM,SAAS,GAAM;EACxB,IAAI,CAAC,EAAK,QAAQ;GAAG,EAAK,KAAK,EAAK,IAAI;SAAU,IAAO,EAAK;CAChE,CAAC,GACM;AACT;;;ACNA,SAAA,EAAwB,GAAG;CACzB,OAAO,UAAU,SACX,KAAK,MAAM,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,EAAE,EAAE,MAAM,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,EAAE,IACvD,MAAM,KAAK,GAAG,IAAI,KAAA,IAAY,CAAC,CAAC,KAAK,KAAK,KAAK,GAAG,GAAG,CAAC,KAAK,KAAK,KAAK,GAAG,CAAC;AACjF;;;ACJA,SAAA,EAAwB,GAAM,GAAI,GAAI,GAAI,GAAI;CAK5C,AAJA,KAAK,OAAO,GACZ,KAAK,KAAK,GACV,KAAK,KAAK,GACV,KAAK,KAAK,GACV,KAAK,KAAK;AACZ;;;ACJA,SAAA,EAAwB,GAAG,GAAG,GAAQ;CACpC,IAAI,GACA,IAAK,KAAK,KACV,IAAK,KAAK,KACV,GACA,GACA,GACA,GACA,IAAK,KAAK,KACV,IAAK,KAAK,KACV,IAAQ,CAAC,GACT,IAAO,KAAK,OACZ,GACA;CAUJ,KARI,KAAM,EAAM,KAAK,IAAIA,EAAK,GAAM,GAAI,GAAI,GAAI,CAAE,CAAC,GAC/C,KAAU,OAAM,IAAS,YAE3B,IAAK,IAAI,GAAQ,IAAK,IAAI,GAC1B,IAAK,IAAI,GAAQ,IAAK,IAAI,GAC1B,KAAU,IAGL,IAAI,EAAM,IAAI,IAGf,QAAE,IAAO,EAAE,UACP,IAAK,EAAE,MAAM,MACb,IAAK,EAAE,MAAM,MACb,IAAK,EAAE,MAAM,MACb,IAAK,EAAE,MAAM,IAGrB,IAAI,EAAK,QAAQ;EACf,IAAI,KAAM,IAAK,KAAM,GACjB,KAAM,IAAK,KAAM;EAUrB,AARA,EAAM,KACJ,IAAIA,EAAK,EAAK,IAAI,GAAI,GAAI,GAAI,CAAE,GAChC,IAAIA,EAAK,EAAK,IAAI,GAAI,GAAI,GAAI,CAAE,GAChC,IAAIA,EAAK,EAAK,IAAI,GAAI,GAAI,GAAI,CAAE,GAChC,IAAIA,EAAK,EAAK,IAAI,GAAI,GAAI,GAAI,CAAE,CAClC,IAGI,KAAK,KAAK,MAAO,IAAK,KAAK,OAC7B,IAAI,EAAM,EAAM,SAAS,IACzB,EAAM,EAAM,SAAS,KAAK,EAAM,EAAM,SAAS,IAAI,IACnD,EAAM,EAAM,SAAS,IAAI,KAAK;CAElC,OAGK;EACH,IAAI,IAAK,IAAI,CAAC,KAAK,GAAG,KAAK,MAAM,EAAK,IAAI,GACtC,IAAK,IAAI,CAAC,KAAK,GAAG,KAAK,MAAM,EAAK,IAAI,GACtC,IAAK,IAAK,IAAK,IAAK;EACxB,IAAI,IAAK,GAAQ;GACf,IAAI,IAAI,KAAK,KAAK,IAAS,CAAE;GAG7B,AAFA,IAAK,IAAI,GAAG,IAAK,IAAI,GACrB,IAAK,IAAI,GAAG,IAAK,IAAI,GACrB,IAAO,EAAK;EACd;CACF;CAGF,OAAO;AACT;;;ACrEA,SAAA,EAAwB,GAAG;CACzB,IAAI,MAAM,IAAI,CAAC,KAAK,GAAG,KAAK,MAAM,CAAC,CAAC,KAAK,MAAM,IAAI,CAAC,KAAK,GAAG,KAAK,MAAM,CAAC,CAAC,GAAG,OAAO;CAEnF,IAAI,GACA,IAAO,KAAK,OACZ,GACA,GACA,GACA,IAAK,KAAK,KACV,IAAK,KAAK,KACV,IAAK,KAAK,KACV,IAAK,KAAK,KACV,GACA,GACA,GACA,GACA,GACA,GACA,GACA;CAGJ,IAAI,CAAC,GAAM,OAAO;CAIlB,IAAI,EAAK,QAAQ,SAAa;EAG5B,KAFI,IAAQ,MAAM,KAAM,IAAK,KAAM,MAAI,IAAK,IAAS,IAAK,IACtD,IAAS,MAAM,KAAM,IAAK,KAAM,MAAI,IAAK,IAAS,IAAK,GACrD,IAAS,GAAM,MAAO,EAAK,IAAI,KAAU,IAAI,KAAS,OAAO;EACnE,IAAI,CAAC,EAAK,QAAQ;EAClB,CAAI,EAAQ,IAAI,IAAK,MAAM,EAAQ,IAAI,IAAK,MAAM,EAAQ,IAAI,IAAK,QAAI,IAAW,GAAQ,IAAI;CAChG;CAGA,OAAO,EAAK,SAAS,IAAG,IAAM,IAAW,GAAM,MAAO,EAAK,OAAO,OAAO;CAoBzE,QAnBI,IAAO,EAAK,SAAM,OAAO,EAAK,MAG9B,KAAkB,IAAO,EAAS,OAAO,IAAO,OAAO,EAAS,MAAO,QAGtE,KAGL,IAAO,EAAO,KAAK,IAAO,OAAO,EAAO,KAGnC,IAAO,EAAO,MAAM,EAAO,MAAM,EAAO,MAAM,EAAO,OACnD,OAAU,EAAO,MAAM,EAAO,MAAM,EAAO,MAAM,EAAO,OACxD,CAAC,EAAK,WACP,IAAU,EAAS,KAAK,IACvB,KAAK,QAAQ,IAGb,SAba,KAAK,QAAQ,GAAM;AAczC;AAEA,SAAgB,EAAU,GAAM;CAC9B,KAAK,IAAI,IAAI,GAAG,IAAI,EAAK,QAAQ,IAAI,GAAG,EAAE,GAAG,KAAK,OAAO,EAAK,EAAE;CAChE,OAAO;AACT;;;AC7DA,SAAA,IAA0B;CACxB,OAAO,KAAK;AACd;;;ACFA,SAAA,IAA0B;CACxB,IAAI,IAAO;CAIX,OAHA,KAAK,MAAM,SAAS,GAAM;EACxB,IAAI,CAAC,EAAK,QAAQ;GAAG,EAAE;SAAa,IAAO,EAAK;CAClD,CAAC,GACM;AACT;;;ACJA,SAAA,EAAwB,GAAU;CAChC,IAAI,IAAQ,CAAC,GAAG,GAAG,IAAO,KAAK,OAAO,GAAO,GAAI,GAAI,GAAI;CAEzD,KADI,KAAM,EAAM,KAAK,IAAIC,EAAK,GAAM,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,CAAC,GACpE,IAAI,EAAM,IAAI,IACnB,IAAI,CAAC,EAAS,IAAO,EAAE,MAAM,IAAK,EAAE,IAAI,IAAK,EAAE,IAAI,IAAK,EAAE,IAAI,IAAK,EAAE,EAAE,KAAK,EAAK,QAAQ;EACvF,IAAI,KAAM,IAAK,KAAM,GAAG,KAAM,IAAK,KAAM;EAIzC,CAHI,IAAQ,EAAK,OAAI,EAAM,KAAK,IAAIA,EAAK,GAAO,GAAI,GAAI,GAAI,CAAE,CAAC,IAC3D,IAAQ,EAAK,OAAI,EAAM,KAAK,IAAIA,EAAK,GAAO,GAAI,GAAI,GAAI,CAAE,CAAC,IAC3D,IAAQ,EAAK,OAAI,EAAM,KAAK,IAAIA,EAAK,GAAO,GAAI,GAAI,GAAI,CAAE,CAAC,IAC3D,IAAQ,EAAK,OAAI,EAAM,KAAK,IAAIA,EAAK,GAAO,GAAI,GAAI,GAAI,CAAE,CAAC;CACjE;CAEF,OAAO;AACT;;;ACbA,SAAA,EAAwB,GAAU;CAChC,IAAI,IAAQ,CAAC,GAAG,IAAO,CAAC,GAAG;CAE3B,KADI,KAAK,SAAO,EAAM,KAAK,IAAIC,EAAK,KAAK,OAAO,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,CAAC,GAChF,IAAI,EAAM,IAAI,IAAG;EACtB,IAAI,IAAO,EAAE;EACb,IAAI,EAAK,QAAQ;GACf,IAAI,GAAO,IAAK,EAAE,IAAI,IAAK,EAAE,IAAI,IAAK,EAAE,IAAI,IAAK,EAAE,IAAI,KAAM,IAAK,KAAM,GAAG,KAAM,IAAK,KAAM;GAI5F,CAHI,IAAQ,EAAK,OAAI,EAAM,KAAK,IAAIA,EAAK,GAAO,GAAI,GAAI,GAAI,CAAE,CAAC,IAC3D,IAAQ,EAAK,OAAI,EAAM,KAAK,IAAIA,EAAK,GAAO,GAAI,GAAI,GAAI,CAAE,CAAC,IAC3D,IAAQ,EAAK,OAAI,EAAM,KAAK,IAAIA,EAAK,GAAO,GAAI,GAAI,GAAI,CAAE,CAAC,IAC3D,IAAQ,EAAK,OAAI,EAAM,KAAK,IAAIA,EAAK,GAAO,GAAI,GAAI,GAAI,CAAE,CAAC;EACjE;EACA,EAAK,KAAK,CAAC;CACb;CACA,OAAO,IAAI,EAAK,IAAI,IAClB,EAAS,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE;CAEzC,OAAO;AACT;;;ACpBA,SAAgB,EAAS,GAAG;CAC1B,OAAO,EAAE;AACX;AAEA,SAAA,EAAwB,GAAG;CACzB,OAAO,UAAU,UAAU,KAAK,KAAK,GAAG,QAAQ,KAAK;AACvD;;;ACNA,SAAgB,EAAS,GAAG;CAC1B,OAAO,EAAE;AACX;AAEA,SAAA,EAAwB,GAAG;CACzB,OAAO,UAAU,UAAU,KAAK,KAAK,GAAG,QAAQ,KAAK;AACvD;;;ACOA,SAAwB,EAAS,GAAO,GAAG,GAAG;CAC5C,IAAI,IAAO,IAAI,EAAS,KAAY,GAAc,KAAY,GAAc,KAAK,KAAK,KAAK,GAAG;CAC9F,OAAO,KAAS,OAAO,IAAO,EAAK,OAAO,CAAK;AACjD;AAEA,SAAS,EAAS,GAAG,GAAG,GAAI,GAAI,GAAI,GAAI;CAOtC,AANA,KAAK,KAAK,GACV,KAAK,KAAK,GACV,KAAK,MAAM,GACX,KAAK,MAAM,GACX,KAAK,MAAM,GACX,KAAK,MAAM,GACX,KAAK,QAAQ,KAAA;AACf;AAEA,SAAS,EAAU,GAAM;CAEvB,KADA,IAAI,IAAO,EAAC,MAAM,EAAK,KAAI,GAAG,IAAO,GAC9B,IAAO,EAAK,OAAM,IAAO,EAAK,OAAO,EAAC,MAAM,EAAK,KAAI;CAC5D,OAAO;AACT;AAEA,IAAI,IAAY,EAAS,YAAY,EAAS;AAE9C,EAAU,OAAO,WAAW;CAC1B,IAAI,IAAO,IAAI,EAAS,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,GAC5E,IAAO,KAAK,OACZ,GACA;CAEJ,IAAI,CAAC,GAAM,OAAO;CAElB,IAAI,CAAC,EAAK,QAAQ,OAAO,EAAK,QAAQ,EAAU,CAAI,GAAG;CAGvD,KADA,IAAQ,CAAC;EAAC,QAAQ;EAAM,QAAQ,EAAK,QAAQ;;;;;EAAW;CAAC,CAAC,GACnD,IAAO,EAAM,IAAI,IACtB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,EAAE,GACvB,CAAI,IAAQ,EAAK,OAAO,QAClB,EAAM,SAAQ,EAAM,KAAK;EAAC,QAAQ;EAAO,QAAQ,EAAK,OAAO,KAAK;;;;;EAAW;CAAC,CAAC,IAC9E,EAAK,OAAO,KAAK,EAAU,CAAK;CAK3C,OAAO;AACT,GAEA,EAAU,MAAMC,GAChB,EAAU,SAASC,GACnB,EAAU,QAAQC,GAClB,EAAU,OAAOC,GACjB,EAAU,SAASC,GACnB,EAAU,OAAOC,GACjB,EAAU,SAASC,GACnB,EAAU,YAAYC,GACtB,EAAU,OAAOC,GACjB,EAAU,OAAOC,GACjB,EAAU,QAAQC,GAClB,EAAU,aAAaC,GACvB,EAAU,IAAIC,GACd,EAAU,IAAIC;;;ACxEd,SAAA,EAAwB,GAAG;CACzB,OAAO,WAAW;EAChB,OAAO;CACT;AACF;;;ACJA,SAAA,EAAwB,GAAQ;CAC9B,QAAQ,EAAO,IAAI,MAAO;AAC5B;;;ACEA,SAASC,EAAE,GAAG;CACZ,OAAO,EAAE,IAAI,EAAE;AACjB;AAEA,SAASC,EAAE,GAAG;CACZ,OAAO,EAAE,IAAI,EAAE;AACjB;AAEA,SAAA,EAAwB,GAAQ;CAC9B,IAAI,GACA,GACA,GACA,IAAW,GACX,IAAa;CAEjB,AAAI,OAAO,KAAW,eAAY,IAASC,EAAS,KAAU,OAAO,IAAI,CAAC,CAAM;CAEhF,SAAS,IAAQ;EASf,KAAK,IARD,GAAG,IAAI,EAAM,QACb,GACA,GACA,GACA,GACA,GACA,GAEK,IAAI,GAAG,IAAI,GAAY,EAAE,GAEhC,KADA,IAAO,EAAS,GAAOF,GAAGC,CAAC,EAAE,WAAW,CAAO,GAC1C,IAAI,GAAG,IAAI,GAAG,EAAE,GAKnB,AAJA,IAAO,EAAM,IACb,IAAK,EAAM,EAAK,QAAQ,IAAM,IAAK,GACnC,IAAK,EAAK,IAAI,EAAK,IACnB,IAAK,EAAK,IAAI,EAAK,IACnB,EAAK,MAAM,CAAK;EAIpB,SAAS,EAAM,GAAM,GAAI,GAAI,GAAI,GAAI;GACnC,IAAI,IAAO,EAAK,MAAM,IAAK,EAAK,GAAG,IAAI,IAAK;GAC5C,IAAI,GAAM;IACR,IAAI,EAAK,QAAQ,EAAK,OAAO;KAC3B,IAAI,IAAI,IAAK,EAAK,IAAI,EAAK,IACvB,IAAI,IAAK,EAAK,IAAI,EAAK,IACvB,IAAI,IAAI,IAAI,IAAI;KACpB,AAAI,IAAI,IAAI,MACN,MAAM,MAAG,IAAIE,EAAO,CAAM,GAAG,KAAK,IAAI,IACtC,MAAM,MAAG,IAAIA,EAAO,CAAM,GAAG,KAAK,IAAI,IAC1C,KAAK,KAAK,IAAI,KAAK,KAAK,CAAC,MAAM,IAAI,GACnC,EAAK,OAAO,KAAK,MAAM,KAAK,KAAM,MAAO,IAAM,KAC/C,EAAK,OAAO,KAAK,KAAK,GACtB,EAAK,MAAM,KAAK,IAAI,IAAI,IACxB,EAAK,MAAM,IAAI;IAEnB;IACA;GACF;GACA,OAAO,IAAK,IAAK,KAAK,IAAK,IAAK,KAAK,IAAK,IAAK,KAAK,IAAK,IAAK;EAChE;CACF;CAEA,SAAS,EAAQ,GAAM;EACrB,IAAI,EAAK,MAAM,OAAO,EAAK,IAAI,EAAM,EAAK,KAAK;EAC/C,KAAK,IAAI,IAAI,EAAK,IAAI,GAAG,IAAI,GAAG,EAAE,GAChC,AAAI,EAAK,MAAM,EAAK,GAAG,IAAI,EAAK,MAC9B,EAAK,IAAI,EAAK,GAAG;CAGvB;CAEA,SAAS,IAAa;EACf,OACL;OAAI,GAAG,IAAI,EAAM,QAAQ;GAEzB,KADA,IAAY,MAAM,CAAC,GACd,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG,IAAO,EAAM,IAAI,EAAM,EAAK,SAAS,CAAC,EAAO,GAAM,GAAG,CAAK;EAF1D;CAG3B;CAoBA,OAlBA,EAAM,aAAa,SAAS,GAAQ,GAAS;EAG3C,AAFA,IAAQ,GACR,IAAS,GACT,EAAW;CACb,GAEA,EAAM,aAAa,SAAS,GAAG;EAC7B,OAAO,UAAU,UAAU,IAAa,CAAC,GAAG,KAAS;CACvD,GAEA,EAAM,WAAW,SAAS,GAAG;EAC3B,OAAO,UAAU,UAAU,IAAW,CAAC,GAAG,KAAS;CACrD,GAEA,EAAM,SAAS,SAAS,GAAG;EACzB,OAAO,UAAU,UAAU,IAAS,OAAO,KAAM,aAAa,IAAID,EAAS,CAAC,CAAC,GAAG,EAAW,GAAG,KAAS;CACzG,GAEO;AACT;;;AClGA,IAAM,IAAI,SACJ,IAAI,YACJ,IAAI;AAEV,SAAA,IAA0B;CACxB,IAAI,IAAI;CACR,cAAc,KAAK,IAAI,IAAI,KAAK,KAAK;AACvC;;;ACJA,SAAgB,EAAE,GAAG;CACnB,OAAO,EAAE;AACX;AAEA,SAAgB,EAAE,GAAG;CACnB,OAAO,EAAE;AACX;AAEA,IAAI,IAAgB,IAChB,IAAe,KAAK,MAAM,IAAI,KAAK,KAAK,CAAC;AAE7C,SAAA,EAAwB,GAAO;CAC7B,IAAI,GACA,IAAQ,GACR,IAAW,MACX,IAAa,IAAa,MAAU,IAAI,MACxC,IAAc,GACd,IAAgB,IAChB,oBAAS,IAAI,IAAI,GACjB,IAAU,EAAM,CAAI,GACpB,IAAQ,EAAS,QAAQ,KAAK,GAC9B,IAASE,EAAI;CAEjB,AAAmB,MAAQ,CAAC;CAE5B,SAAS,IAAO;EAGd,AAFA,EAAK,GACL,EAAM,KAAK,QAAQ,CAAU,GACzB,IAAQ,MACV,EAAQ,KAAK,GACb,EAAM,KAAK,OAAO,CAAU;CAEhC;CAEA,SAAS,EAAK,GAAY;EACxB,IAAI,GAAG,IAAI,EAAM,QAAQ;EAEzB,AAAI,MAAe,KAAA,MAAW,IAAa;EAE3C,KAAK,IAAI,IAAI,GAAG,IAAI,GAAY,EAAE,GAOhC,KANA,MAAU,IAAc,KAAS,GAEjC,EAAO,QAAQ,SAAS,GAAO;GAC7B,EAAM,CAAK;EACb,CAAC,GAEI,IAAI,GAAG,IAAI,GAAG,EAAE,GAInB,AAHA,IAAO,EAAM,IACT,EAAK,MAAM,OAAM,EAAK,KAAK,EAAK,MAAM,KACrC,EAAK,IAAI,EAAK,IAAI,EAAK,KAAK,IAC7B,EAAK,MAAM,OAAM,EAAK,KAAK,EAAK,MAAM,KACrC,EAAK,IAAI,EAAK,IAAI,EAAK,KAAK;EAIrC,OAAO;CACT;CAEA,SAAS,IAAkB;EACzB,KAAK,IAAI,IAAI,GAAG,IAAI,EAAM,QAAQ,GAAM,IAAI,GAAG,EAAE,GAAG;GAIlD,IAHA,IAAO,EAAM,IAAI,EAAK,QAAQ,GAC1B,EAAK,MAAM,SAAM,EAAK,IAAI,EAAK,KAC/B,EAAK,MAAM,SAAM,EAAK,IAAI,EAAK,KAC/B,MAAM,EAAK,CAAC,KAAK,MAAM,EAAK,CAAC,GAAG;IAClC,IAAI,IAAS,IAAgB,KAAK,KAAK,KAAM,CAAC,GAAG,IAAQ,IAAI;IAE7D,AADA,EAAK,IAAI,IAAS,KAAK,IAAI,CAAK,GAChC,EAAK,IAAI,IAAS,KAAK,IAAI,CAAK;GAClC;GACA,CAAI,MAAM,EAAK,EAAE,KAAK,MAAM,EAAK,EAAE,OACjC,EAAK,KAAK,EAAK,KAAK;EAExB;CACF;CAEA,SAAS,EAAgB,GAAO;EAE9B,OADI,EAAM,cAAY,EAAM,WAAW,GAAO,CAAM,GAC7C;CACT;CAIA,OAFA,EAAgB,GAET,IAAa;EACZ;EAEN,SAAS,WAAW;GAClB,OAAO,EAAQ,QAAQ,CAAI,GAAG;EAChC;EAEA,MAAM,WAAW;GACf,OAAO,EAAQ,KAAK,GAAG;EACzB;EAEA,OAAO,SAAS,GAAG;GACjB,OAAO,UAAU,UAAU,IAAQ,GAAG,EAAgB,GAAG,EAAO,QAAQ,CAAe,GAAG,KAAc;EAC1G;EAEA,OAAO,SAAS,GAAG;GACjB,OAAO,UAAU,UAAU,IAAQ,CAAC,GAAG,KAAc;EACvD;EAEA,UAAU,SAAS,GAAG;GACpB,OAAO,UAAU,UAAU,IAAW,CAAC,GAAG,KAAc;EAC1D;EAEA,YAAY,SAAS,GAAG;GACtB,OAAO,UAAU,UAAU,IAAa,CAAC,GAAG,KAAc,CAAC;EAC7D;EAEA,aAAa,SAAS,GAAG;GACvB,OAAO,UAAU,UAAU,IAAc,CAAC,GAAG,KAAc;EAC7D;EAEA,eAAe,SAAS,GAAG;GACzB,OAAO,UAAU,UAAU,IAAgB,IAAI,GAAG,KAAc,IAAI;EACtE;EAEA,cAAc,SAAS,GAAG;GACxB,OAAO,UAAU,UAAU,IAAS,GAAG,EAAO,QAAQ,CAAe,GAAG,KAAc;EACxF;EAEA,OAAO,SAAS,GAAM,GAAG;GACvB,OAAO,UAAU,SAAS,KAAM,KAAK,OAAO,EAAO,OAAO,CAAI,IAAI,EAAO,IAAI,GAAM,EAAgB,CAAC,CAAC,GAAI,KAAc,EAAO,IAAI,CAAI;EACxI;EAEA,MAAM,SAAS,GAAG,GAAG,GAAQ;GAC3B,IAAI,IAAI,GACJ,IAAI,EAAM,QACV,GACA,GACA,GACA,GACA;GAKJ,KAHI,KAAU,OAAM,IAAS,WACxB,KAAU,GAEV,IAAI,GAAG,IAAI,GAAG,EAAE,GAKnB,AAJA,IAAO,EAAM,IACb,IAAK,IAAI,EAAK,GACd,IAAK,IAAI,EAAK,GACd,IAAK,IAAK,IAAK,IAAK,GAChB,IAAK,MAAQ,IAAU,GAAM,IAAS;GAG5C,OAAO;EACT;EAEA,IAAI,SAAS,GAAM,GAAG;GACpB,OAAO,UAAU,SAAS,KAAK,EAAM,GAAG,GAAM,CAAC,GAAG,KAAc,EAAM,GAAG,CAAI;EAC/E;CACF;AACF;;;ACtJA,SAAA,IAA0B;CACxB,IAAI,GACA,GACA,GACA,GACA,IAAWC,EAAS,GAAG,GACvB,GACA,IAAe,GACf,IAAe,UACf,IAAS;CAEb,SAAS,EAAM,GAAG;EAChB,IAAI,GAAG,IAAI,EAAM,QAAQ,IAAO,EAAS,GAAO,GAAG,CAAC,EAAE,WAAW,CAAU;EAC3E,KAAK,IAAQ,GAAG,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG,IAAO,EAAM,IAAI,EAAK,MAAM,CAAK;CACtE;CAEA,SAAS,IAAa;EACf,OACL;OAAI,GAAG,IAAI,EAAM,QAAQ;GAEzB,KADA,IAAgB,MAAM,CAAC,GAClB,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG,IAAO,EAAM,IAAI,EAAU,EAAK,SAAS,CAAC,EAAS,GAAM,GAAG,CAAK;EAFhE;CAG3B;CAEA,SAAS,EAAW,GAAM;EACxB,IAAI,IAAW,GAAG,GAAG,GAAG,IAAS,GAAG,GAAG,GAAG;EAG1C,IAAI,EAAK,QAAQ;GACf,KAAK,IAAI,IAAI,IAAI,GAAG,IAAI,GAAG,EAAE,GAC3B,CAAK,IAAI,EAAK,QAAQ,IAAI,KAAK,IAAI,EAAE,KAAK,OACxC,KAAY,EAAE,OAAO,KAAU,GAAG,KAAK,IAAI,EAAE,GAAG,KAAK,IAAI,EAAE;GAI/D,AADA,EAAK,IAAI,IAAI,GACb,EAAK,IAAI,IAAI;EACf,OAGK;GAGH,AAFA,IAAI,GACJ,EAAE,IAAI,EAAE,KAAK,GACb,EAAE,IAAI,EAAE,KAAK;GACb;IAAG,KAAY,EAAU,EAAE,KAAK;UACzB,IAAI,EAAE;EACf;EAEA,EAAK,QAAQ;CACf;CAEA,SAAS,EAAM,GAAM,GAAI,GAAG,GAAI;EAC9B,IAAI,CAAC,EAAK,OAAO,OAAO;EAExB,IAAI,IAAI,EAAK,IAAI,EAAK,GAClB,IAAI,EAAK,IAAI,EAAK,GAClB,IAAI,IAAK,GACT,IAAI,IAAI,IAAI,IAAI;EAIpB,IAAI,IAAI,IAAI,IAAS,GAQnB,OAPI,IAAI,MACF,MAAM,MAAG,IAAIC,EAAO,CAAM,GAAG,KAAK,IAAI,IACtC,MAAM,MAAG,IAAIA,EAAO,CAAM,GAAG,KAAK,IAAI,IACtC,IAAI,MAAc,IAAI,KAAK,KAAK,IAAe,CAAC,IACpD,EAAK,MAAM,IAAI,EAAK,QAAQ,IAAQ,GACpC,EAAK,MAAM,IAAI,EAAK,QAAQ,IAAQ,IAE/B;EAIA,QAAK,UAAU,KAAK,IAG7B;IAAI,EAAK,SAAS,KAAQ,EAAK,UACzB,MAAM,MAAG,IAAIA,EAAO,CAAM,GAAG,KAAK,IAAI,IACtC,MAAM,MAAG,IAAIA,EAAO,CAAM,GAAG,KAAK,IAAI,IACtC,IAAI,MAAc,IAAI,KAAK,KAAK,IAAe,CAAC;GAGtD;IAAG,AAAI,EAAK,SAAS,MACnB,IAAI,EAAU,EAAK,KAAK,SAAS,IAAQ,GACzC,EAAK,MAAM,IAAI,GACf,EAAK,MAAM,IAAI;UACR,IAAO,EAAK;EANrB;CAOF;CAwBA,OAtBA,EAAM,aAAa,SAAS,GAAQ,GAAS;EAG3C,AAFA,IAAQ,GACR,IAAS,GACT,EAAW;CACb,GAEA,EAAM,WAAW,SAAS,GAAG;EAC3B,OAAO,UAAU,UAAU,IAAW,OAAO,KAAM,aAAa,IAAID,EAAS,CAAC,CAAC,GAAG,EAAW,GAAG,KAAS;CAC3G,GAEA,EAAM,cAAc,SAAS,GAAG;EAC9B,OAAO,UAAU,UAAU,IAAe,IAAI,GAAG,KAAS,KAAK,KAAK,CAAY;CAClF,GAEA,EAAM,cAAc,SAAS,GAAG;EAC9B,OAAO,UAAU,UAAU,IAAe,IAAI,GAAG,KAAS,KAAK,KAAK,CAAY;CAClF,GAEA,EAAM,QAAQ,SAAS,GAAG;EACxB,OAAO,UAAU,UAAU,IAAS,IAAI,GAAG,KAAS,KAAK,KAAK,CAAM;CACtE,GAEO;AACT;;;ACjHA,SAAA,EAAwB,GAAG;CACzB,IAAI,IAAWE,EAAS,EAAG,GACvB,GACA,GACA;CAEJ,AAAI,OAAO,KAAM,eAAY,IAAIA,EAAS,KAAK,OAAO,IAAI,CAAC,CAAC;CAE5D,SAAS,EAAM,GAAO;EACpB,KAAK,IAAI,IAAI,GAAG,IAAI,EAAM,QAAQ,GAAM,IAAI,GAAG,EAAE,GAC/C,IAAO,EAAM,IAAI,EAAK,OAAO,EAAG,KAAK,EAAK,KAAK,EAAU,KAAK;CAElE;CAEA,SAAS,IAAa;EACf,OACL;OAAI,GAAG,IAAI,EAAM;GAGjB,KAFA,IAAgB,MAAM,CAAC,GACvB,IAAS,MAAM,CAAC,GACX,IAAI,GAAG,IAAI,GAAG,EAAE,GACnB,EAAU,KAAK,MAAM,EAAG,KAAK,CAAC,EAAE,EAAM,IAAI,GAAG,CAAK,CAAC,IAAI,IAAI,CAAC,EAAS,EAAM,IAAI,GAAG,CAAK;EAJxE;CAMnB;CAeA,OAbA,EAAM,aAAa,SAAS,GAAG;EAE7B,AADA,IAAQ,GACR,EAAW;CACb,GAEA,EAAM,WAAW,SAAS,GAAG;EAC3B,OAAO,UAAU,UAAU,IAAW,OAAO,KAAM,aAAa,IAAIA,EAAS,CAAC,CAAC,GAAG,EAAW,GAAG,KAAS;CAC3G,GAEA,EAAM,IAAI,SAAS,GAAG;EACpB,OAAO,UAAU,UAAU,IAAI,OAAO,KAAM,aAAa,IAAIA,EAAS,CAAC,CAAC,GAAG,EAAW,GAAG,KAAS;CACpG,GAEO;AACT;;;ACtCA,SAAA,EAAwB,GAAG;CACzB,IAAI,IAAWC,EAAS,EAAG,GACvB,GACA,GACA;CAEJ,AAAI,OAAO,KAAM,eAAY,IAAIA,EAAS,KAAK,OAAO,IAAI,CAAC,CAAC;CAE5D,SAAS,EAAM,GAAO;EACpB,KAAK,IAAI,IAAI,GAAG,IAAI,EAAM,QAAQ,GAAM,IAAI,GAAG,EAAE,GAC/C,IAAO,EAAM,IAAI,EAAK,OAAO,EAAG,KAAK,EAAK,KAAK,EAAU,KAAK;CAElE;CAEA,SAAS,IAAa;EACf,OACL;OAAI,GAAG,IAAI,EAAM;GAGjB,KAFA,IAAgB,MAAM,CAAC,GACvB,IAAS,MAAM,CAAC,GACX,IAAI,GAAG,IAAI,GAAG,EAAE,GACnB,EAAU,KAAK,MAAM,EAAG,KAAK,CAAC,EAAE,EAAM,IAAI,GAAG,CAAK,CAAC,IAAI,IAAI,CAAC,EAAS,EAAM,IAAI,GAAG,CAAK;EAJxE;CAMnB;CAeA,OAbA,EAAM,aAAa,SAAS,GAAG;EAE7B,AADA,IAAQ,GACR,EAAW;CACb,GAEA,EAAM,WAAW,SAAS,GAAG;EAC3B,OAAO,UAAU,UAAU,IAAW,OAAO,KAAM,aAAa,IAAIA,EAAS,CAAC,CAAC,GAAG,EAAW,GAAG,KAAS;CAC3G,GAEA,EAAM,IAAI,SAAS,GAAG;EACpB,OAAO,UAAU,UAAU,IAAI,OAAO,KAAM,aAAa,IAAIA,EAAS,CAAC,CAAC,GAAG,EAAW,GAAG,KAAS;CACpG,GAEO;AACT"}