@milaboratories/miplots4 1.0.129 → 1.0.131

package/dist/node_modules/d3-quadtree/src/cover.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"cover.js","sources":["../../../../node_modules/d3-quadtree/src/cover.js"],"sourcesContent":["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"],"names":["tree_cover","x","y","x0","y0","x1","y1","z","node","parent","i"],"mappings":"AAAe,SAAAA,EAASC,GAAGC,GAAG;AAC5B,MAAI,MAAMD,IAAI,CAACA,CAAC,KAAK,MAAMC,IAAI,CAACA,CAAC,EAAG,QAAO;AAE3C,MAAIC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,IAAK,KAAK;AAKd,MAAI,MAAMH,CAAE;AACV,IAAAE,KAAMF,IAAK,KAAK,MAAMF,CAAC,KAAK,GAC5BK,KAAMF,IAAK,KAAK,MAAMF,CAAC,KAAK;AAAA,OAIzB;AAMH,aALIK,IAAIF,IAAKF,KAAM,GACfK,IAAO,KAAK,OACZC,GACAC,GAEGP,IAAKF,KAAKA,KAAKI,KAAMD,IAAKF,KAAKA,KAAKI;AAGzC,cAFAI,KAAKR,IAAIE,MAAO,IAAKH,IAAIE,GACzBM,IAAS,IAAI,MAAM,CAAC,GAAGA,EAAOC,CAAC,IAAIF,GAAMA,IAAOC,GAAQF,KAAK,GACrDG,GAAC;AAAA,QACP,KAAK;AAAG,UAAAL,IAAKF,IAAKI,GAAGD,IAAKF,IAAKG;AAAG;AAAA,QAClC,KAAK;AAAG,UAAAJ,IAAKE,IAAKE,GAAGD,IAAKF,IAAKG;AAAG;AAAA,QAClC,KAAK;AAAG,UAAAF,IAAKF,IAAKI,GAAGH,IAAKE,IAAKC;AAAG;AAAA,QAClC,KAAK;AAAG,UAAAJ,IAAKE,IAAKE,GAAGH,IAAKE,IAAKC;AAAG;AAAA,MAC1C;AAGI,IAAI,KAAK,SAAS,KAAK,MAAM,WAAQ,KAAK,QAAQC;AAAA,EACpD;AAEA,cAAK,MAAML,GACX,KAAK,MAAMC,GACX,KAAK,MAAMC,GACX,KAAK,MAAMC,GACJ;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-quadtree/src/data.js

@@ -1,12 +0,0 @@
-function i() {
-  var a = [];
-  return this.visit(function(t) {
-    if (!t.length) do
-      a.push(t.data);
-    while (t = t.next);
-  }), a;
-}
-export {
-  i as default
-};
-//# sourceMappingURL=data.js.map

package/dist/node_modules/d3-quadtree/src/data.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"data.js","sources":["../../../../node_modules/d3-quadtree/src/data.js"],"sourcesContent":["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"],"names":["tree_data","data","node"],"mappings":"AAAe,SAAAA,IAAW;AACxB,MAAIC,IAAO,CAAA;AACX,cAAK,MAAM,SAASC,GAAM;AACxB,QAAI,CAACA,EAAK,OAAQ;AAAG,MAAAD,EAAK,KAAKC,EAAK,IAAI;AAAA,WAAUA,IAAOA,EAAK;AAAA,EAChE,CAAC,GACMD;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-quadtree/src/extent.js

@@ -1,7 +0,0 @@
-function e(t) {
-  return arguments.length ? this.cover(+t[0][0], +t[0][1]).cover(+t[1][0], +t[1][1]) : isNaN(this._x0) ? void 0 : [[this._x0, this._y0], [this._x1, this._y1]];
-}
-export {
-  e as default
-};
-//# sourceMappingURL=extent.js.map

package/dist/node_modules/d3-quadtree/src/extent.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"extent.js","sources":["../../../../node_modules/d3-quadtree/src/extent.js"],"sourcesContent":["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"],"names":["tree_extent","_"],"mappings":"AAAe,SAAAA,EAASC,GAAG;AACzB,SAAO,UAAU,SACX,KAAK,MAAM,CAACA,EAAE,CAAC,EAAE,CAAC,GAAG,CAACA,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,CAACA,EAAE,CAAC,EAAE,CAAC,GAAG,CAACA,EAAE,CAAC,EAAE,CAAC,CAAC,IACvD,MAAM,KAAK,GAAG,IAAI,SAAY,CAAC,CAAC,KAAK,KAAK,KAAK,GAAG,GAAG,CAAC,KAAK,KAAK,KAAK,GAAG,CAAC;AACjF;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-quadtree/src/find.js

@@ -1,26 +0,0 @@
-import o from "./quad.js";
-function k(h, i, n) {
-  var I, _ = this._x0, p = this._y0, w, g, s, c, v = this._x1, q = this._y1, t = [], e = this._root, l, u;
-  for (e && t.push(new o(e, _, p, v, q)), n == null ? n = 1 / 0 : (_ = h - n, p = i - n, v = h + n, q = i + n, n *= n); l = t.pop(); )
-    if (!(!(e = l.node) || (w = l.x0) > v || (g = l.y0) > q || (s = l.x1) < _ || (c = l.y1) < p))
-      if (e.length) {
-        var f = (w + s) / 2, a = (g + c) / 2;
-        t.push(
-          new o(e[3], f, a, s, c),
-          new o(e[2], w, a, f, c),
-          new o(e[1], f, g, s, a),
-          new o(e[0], w, g, f, a)
-        ), (u = (i >= a) << 1 | h >= f) && (l = t[t.length - 1], t[t.length - 1] = t[t.length - 1 - u], t[t.length - 1 - u] = l);
-      } else {
-        var M = h - +this._x.call(null, e.data), Q = i - +this._y.call(null, e.data), b = M * M + Q * Q;
-        if (b < n) {
-          var r = Math.sqrt(n = b);
-          _ = h - r, p = i - r, v = h + r, q = i + r, I = e.data;
-        }
-      }
-  return I;
-}
-export {
-  k as default
-};
-//# sourceMappingURL=find.js.map

package/dist/node_modules/d3-quadtree/src/find.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"find.js","sources":["../../../../node_modules/d3-quadtree/src/find.js"],"sourcesContent":["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"],"names":["tree_find","x","y","radius","data","x0","y0","x1","y1","x2","y2","x3","y3","quads","node","q","i","Quad","xm","ym","dx","dy","d2","d"],"mappings":";AAEe,SAAAA,EAASC,GAAGC,GAAGC,GAAQ;AACpC,MAAIC,GACAC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,GACAC,GACAC,GACAC,GACAC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,IAAQ,CAAA,GACRC,IAAO,KAAK,OACZC,GACAC;AAUJ,OARIF,KAAMD,EAAM,KAAK,IAAII,EAAKH,GAAMT,GAAIC,GAAIK,GAAIC,CAAE,CAAC,GAC/CT,KAAU,OAAMA,IAAS,SAE3BE,IAAKJ,IAAIE,GAAQG,IAAKJ,IAAIC,GAC1BQ,IAAKV,IAAIE,GAAQS,IAAKV,IAAIC,GAC1BA,KAAUA,IAGLY,IAAIF,EAAM;AAGf,QAAI,IAAEC,IAAOC,EAAE,UACPR,IAAKQ,EAAE,MAAMJ,MACbH,IAAKO,EAAE,MAAMH,MACbH,IAAKM,EAAE,MAAMV,MACbK,IAAKK,EAAE,MAAMT;AAGrB,UAAIQ,EAAK,QAAQ;AACf,YAAII,KAAMX,IAAKE,KAAM,GACjBU,KAAMX,IAAKE,KAAM;AAErB,QAAAG,EAAM;AAAA,UACJ,IAAII,EAAKH,EAAK,CAAC,GAAGI,GAAIC,GAAIV,GAAIC,CAAE;AAAA,UAChC,IAAIO,EAAKH,EAAK,CAAC,GAAGP,GAAIY,GAAID,GAAIR,CAAE;AAAA,UAChC,IAAIO,EAAKH,EAAK,CAAC,GAAGI,GAAIV,GAAIC,GAAIU,CAAE;AAAA,UAChC,IAAIF,EAAKH,EAAK,CAAC,GAAGP,GAAIC,GAAIU,GAAIC,CAAE;AAAA,QACxC,IAGUH,KAAKd,KAAKiB,MAAO,IAAKlB,KAAKiB,OAC7BH,IAAIF,EAAMA,EAAM,SAAS,CAAC,GAC1BA,EAAMA,EAAM,SAAS,CAAC,IAAIA,EAAMA,EAAM,SAAS,IAAIG,CAAC,GACpDH,EAAMA,EAAM,SAAS,IAAIG,CAAC,IAAID;AAAA,MAElC,OAGK;AACH,YAAIK,IAAKnB,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMa,EAAK,IAAI,GACtCO,IAAKnB,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMY,EAAK,IAAI,GACtCQ,IAAKF,IAAKA,IAAKC,IAAKA;AACxB,YAAIC,IAAKnB,GAAQ;AACf,cAAIoB,IAAI,KAAK,KAAKpB,IAASmB,CAAE;AAC7B,UAAAjB,IAAKJ,IAAIsB,GAAGjB,IAAKJ,IAAIqB,GACrBZ,IAAKV,IAAIsB,GAAGX,IAAKV,IAAIqB,GACrBnB,IAAOU,EAAK;AAAA,QACd;AAAA,MACF;AAGF,SAAOV;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-quadtree/src/quad.js

@@ -1,7 +0,0 @@
-function d(t, i, s, h, a) {
-  this.node = t, this.x0 = i, this.y0 = s, this.x1 = h, this.y1 = a;
-}
-export {
-  d as default
-};
-//# sourceMappingURL=quad.js.map

package/dist/node_modules/d3-quadtree/src/quad.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"quad.js","sources":["../../../../node_modules/d3-quadtree/src/quad.js"],"sourcesContent":["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"],"names":["Quad","node","x0","y0","x1","y1"],"mappings":"AAAe,SAAAA,EAASC,GAAMC,GAAIC,GAAIC,GAAIC,GAAI;AAC5C,OAAK,OAAOJ,GACZ,KAAK,KAAKC,GACV,KAAK,KAAKC,GACV,KAAK,KAAKC,GACV,KAAK,KAAKC;AACZ;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-quadtree/src/quadtree.js

@@ -1,51 +0,0 @@
-import d, { addAll as f } from "./add.js";
-import s from "./cover.js";
-import p from "./data.js";
-import l from "./extent.js";
-import u from "./find.js";
-import h, { removeAll as v } from "./remove.js";
-import y from "./root.js";
-import c from "./size.js";
-import x from "./visit.js";
-import A from "./visitAfter.js";
-import N, { defaultX as g } from "./x.js";
-import w, { defaultY as z } from "./y.js";
-function q(r, t, o) {
-  var i = new n(t ?? g, o ?? z, NaN, NaN, NaN, NaN);
-  return r == null ? i : i.addAll(r);
-}
-function n(r, t, o, i, a, m) {
-  this._x = r, this._y = t, this._x0 = o, this._y0 = i, this._x1 = a, this._y1 = m, this._root = void 0;
-}
-function _(r) {
-  for (var t = { data: r.data }, o = t; r = r.next; ) o = o.next = { data: r.data };
-  return t;
-}
-var e = q.prototype = n.prototype;
-e.copy = function() {
-  var r = new n(this._x, this._y, this._x0, this._y0, this._x1, this._y1), t = this._root, o, i;
-  if (!t) return r;
-  if (!t.length) return r._root = _(t), r;
-  for (o = [{ source: t, target: r._root = new Array(4) }]; t = o.pop(); )
-    for (var a = 0; a < 4; ++a)
-      (i = t.source[a]) && (i.length ? o.push({ source: i, target: t.target[a] = new Array(4) }) : t.target[a] = _(i));
-  return r;
-};
-e.add = d;
-e.addAll = f;
-e.cover = s;
-e.data = p;
-e.extent = l;
-e.find = u;
-e.remove = h;
-e.removeAll = v;
-e.root = y;
-e.size = c;
-e.visit = x;
-e.visitAfter = A;
-e.x = N;
-e.y = w;
-export {
-  q as default
-};
-//# sourceMappingURL=quadtree.js.map

package/dist/node_modules/d3-quadtree/src/quadtree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"quadtree.js","sources":["../../../../node_modules/d3-quadtree/src/quadtree.js"],"sourcesContent":["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"],"names":["quadtree","nodes","x","y","tree","Quadtree","defaultX","defaultY","x0","y0","x1","y1","leaf_copy","leaf","copy","next","treeProto","node","child","i","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"],"mappings":";;;;;;;;;;;;AAae,SAASA,EAASC,GAAOC,GAAGC,GAAG;AAC5C,MAAIC,IAAO,IAAIC,EAASH,KAAYI,GAAcH,KAAYI,GAAc,KAAK,KAAK,KAAK,GAAG;AAC9F,SAAON,KAAS,OAAOG,IAAOA,EAAK,OAAOH,CAAK;AACjD;AAEA,SAASI,EAASH,GAAGC,GAAGK,GAAIC,GAAIC,GAAIC,GAAI;AACtC,OAAK,KAAKT,GACV,KAAK,KAAKC,GACV,KAAK,MAAMK,GACX,KAAK,MAAMC,GACX,KAAK,MAAMC,GACX,KAAK,MAAMC,GACX,KAAK,QAAQ;AACf;AAEA,SAASC,EAAUC,GAAM;AAEvB,WADIC,IAAO,EAAC,MAAMD,EAAK,KAAI,GAAGE,IAAOD,GAC9BD,IAAOA,EAAK,OAAM,CAAAE,IAAOA,EAAK,OAAO,EAAC,MAAMF,EAAK,KAAI;AAC5D,SAAOC;AACT;AAEA,IAAIE,IAAYhB,EAAS,YAAYK,EAAS;AAE9CW,EAAU,OAAO,WAAW;AAC1B,MAAIF,IAAO,IAAIT,EAAS,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,GAC5EY,IAAO,KAAK,OACZhB,GACAiB;AAEJ,MAAI,CAACD,EAAM,QAAOH;AAElB,MAAI,CAACG,EAAK,OAAQ,QAAOH,EAAK,QAAQF,EAAUK,CAAI,GAAGH;AAGvD,OADAb,IAAQ,CAAC,EAAC,QAAQgB,GAAM,QAAQH,EAAK,QAAQ,IAAI,MAAM,CAAC,EAAC,CAAC,GACnDG,IAAOhB,EAAM;AAClB,aAASkB,IAAI,GAAGA,IAAI,GAAG,EAAEA;AACvB,OAAID,IAAQD,EAAK,OAAOE,CAAC,OACnBD,EAAM,SAAQjB,EAAM,KAAK,EAAC,QAAQiB,GAAO,QAAQD,EAAK,OAAOE,CAAC,IAAI,IAAI,MAAM,CAAC,EAAC,CAAC,IAC9EF,EAAK,OAAOE,CAAC,IAAIP,EAAUM,CAAK;AAK3C,SAAOJ;AACT;AAEAE,EAAU,MAAMI;AAChBJ,EAAU,SAASK;AACnBL,EAAU,QAAQM;AAClBN,EAAU,OAAOO;AACjBP,EAAU,SAASQ;AACnBR,EAAU,OAAOS;AACjBT,EAAU,SAASU;AACnBV,EAAU,YAAYW;AACtBX,EAAU,OAAOY;AACjBZ,EAAU,OAAOa;AACjBb,EAAU,QAAQc;AAClBd,EAAU,aAAae;AACvBf,EAAU,IAAIgB;AACdhB,EAAU,IAAIiB;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-quadtree/src/remove.js

@@ -1,21 +0,0 @@
-function c(r) {
-  if (isNaN(_ = +this._x.call(null, r)) || isNaN(y = +this._y.call(null, r))) return this;
-  var t, e = this._root, s, h, n, o = this._x0, u = this._y0, x = this._x1, a = this._y1, _, y, l, f, m, v, i, g;
-  if (!e) return this;
-  if (e.length) for (; ; ) {
-    if ((m = _ >= (l = (o + x) / 2)) ? o = l : x = l, (v = y >= (f = (u + a) / 2)) ? u = f : a = f, t = e, !(e = e[i = v << 1 | m])) return this;
-    if (!e.length) break;
-    (t[i + 1 & 3] || t[i + 2 & 3] || t[i + 3 & 3]) && (s = t, g = i);
-  }
-  for (; e.data !== r; ) if (h = e, !(e = e.next)) return this;
-  return (n = e.next) && delete e.next, h ? (n ? h.next = n : delete h.next, this) : t ? (n ? t[i] = n : delete t[i], (e = t[0] || t[1] || t[2] || t[3]) && e === (t[3] || t[2] || t[1] || t[0]) && !e.length && (s ? s[g] = e : this._root = e), this) : (this._root = n, this);
-}
-function N(r) {
-  for (var t = 0, e = r.length; t < e; ++t) this.remove(r[t]);
-  return this;
-}
-export {
-  c as default,
-  N as removeAll
-};
-//# sourceMappingURL=remove.js.map

package/dist/node_modules/d3-quadtree/src/remove.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"remove.js","sources":["../../../../node_modules/d3-quadtree/src/remove.js"],"sourcesContent":["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"],"names":["tree_remove","d","x","parent","node","retainer","previous","next","x0","y0","x1","y1","xm","ym","right","bottom","j","removeAll","data","i","n"],"mappings":"AAAe,SAAAA,EAASC,GAAG;AACzB,MAAI,MAAMC,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMD,CAAC,CAAC,KAAK,MAAM,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMA,CAAC,CAAC,EAAG,QAAO;AAEnF,MAAIE,GACAC,IAAO,KAAK,OACZC,GACAC,GACAC,GACAC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVT,GACA,GACAU,GACAC,GACAC,GACAC,GACA,GACAC;AAGJ,MAAI,CAACZ,EAAM,QAAO;AAIlB,MAAIA,EAAK,OAAQ,YAAa;AAG5B,SAFIU,IAAQZ,MAAMU,KAAMJ,IAAKE,KAAM,MAAIF,IAAKI,IAASF,IAAKE,IACtDG,IAAS,MAAMF,KAAMJ,IAAKE,KAAM,MAAIF,IAAKI,IAASF,IAAKE,GACrDV,IAASC,GAAM,EAAAA,IAAOA,EAAK,IAAIW,KAAU,IAAID,CAAK,GAAI,QAAO;AACnE,QAAI,CAACV,EAAK,OAAQ;AAClB,KAAID,EAAQ,IAAI,IAAK,CAAC,KAAKA,EAAQ,IAAI,IAAK,CAAC,KAAKA,EAAQ,IAAI,IAAK,CAAC,OAAGE,IAAWF,GAAQa,IAAI;AAAA,EAChG;AAGA,SAAOZ,EAAK,SAASH,IAAG,KAAMK,IAAWF,GAAM,EAAAA,IAAOA,EAAK,MAAO,QAAO;AAIzE,UAHIG,IAAOH,EAAK,SAAM,OAAOA,EAAK,MAG9BE,KAAkBC,IAAOD,EAAS,OAAOC,IAAO,OAAOD,EAAS,MAAO,QAGtEH,KAGLI,IAAOJ,EAAO,CAAC,IAAII,IAAO,OAAOJ,EAAO,CAAC,IAGpCC,IAAOD,EAAO,CAAC,KAAKA,EAAO,CAAC,KAAKA,EAAO,CAAC,KAAKA,EAAO,CAAC,MACpDC,OAAUD,EAAO,CAAC,KAAKA,EAAO,CAAC,KAAKA,EAAO,CAAC,KAAKA,EAAO,CAAC,MACzD,CAACC,EAAK,WACPC,IAAUA,EAASW,CAAC,IAAIZ,IACvB,KAAK,QAAQA,IAGb,SAba,KAAK,QAAQG,GAAM;AAczC;AAEO,SAASU,EAAUC,GAAM;AAC9B,WAASC,IAAI,GAAGC,IAAIF,EAAK,QAAQC,IAAIC,GAAG,EAAED,EAAG,MAAK,OAAOD,EAAKC,CAAC,CAAC;AAChE,SAAO;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-quadtree/src/root.js

@@ -1,7 +0,0 @@
-function t() {
-  return this._root;
-}
-export {
-  t as default
-};
-//# sourceMappingURL=root.js.map

package/dist/node_modules/d3-quadtree/src/root.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"root.js","sources":["../../../../node_modules/d3-quadtree/src/root.js"],"sourcesContent":["export default function() {\n  return this._root;\n}\n"],"names":["tree_root"],"mappings":"AAAe,SAAAA,IAAW;AACxB,SAAO,KAAK;AACd;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-quadtree/src/size.js

@@ -1,12 +0,0 @@
-function e() {
-  var i = 0;
-  return this.visit(function(t) {
-    if (!t.length) do
-      ++i;
-    while (t = t.next);
-  }), i;
-}
-export {
-  e as default
-};
-//# sourceMappingURL=size.js.map

package/dist/node_modules/d3-quadtree/src/size.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"size.js","sources":["../../../../node_modules/d3-quadtree/src/size.js"],"sourcesContent":["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"],"names":["tree_size","size","node"],"mappings":"AAAe,SAAAA,IAAW;AACxB,MAAIC,IAAO;AACX,cAAK,MAAM,SAASC,GAAM;AACxB,QAAI,CAACA,EAAK,OAAQ;AAAG,QAAED;AAAA,WAAaC,IAAOA,EAAK;AAAA,EAClD,CAAC,GACMD;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-quadtree/src/visit.js

@@ -1,14 +0,0 @@
-import s from "./quad.js";
-function w(a) {
-  var e = [], h, i = this._root, t, n, u, f, o;
-  for (i && e.push(new s(i, this._x0, this._y0, this._x1, this._y1)); h = e.pop(); )
-    if (!a(i = h.node, n = h.x0, u = h.y0, f = h.x1, o = h.y1) && i.length) {
-      var p = (n + f) / 2, r = (u + o) / 2;
-      (t = i[3]) && e.push(new s(t, p, r, f, o)), (t = i[2]) && e.push(new s(t, n, r, p, o)), (t = i[1]) && e.push(new s(t, p, u, f, r)), (t = i[0]) && e.push(new s(t, n, u, p, r));
-    }
-  return this;
-}
-export {
-  w as default
-};
-//# sourceMappingURL=visit.js.map

package/dist/node_modules/d3-quadtree/src/visit.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"visit.js","sources":["../../../../node_modules/d3-quadtree/src/visit.js"],"sourcesContent":["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"],"names":["tree_visit","callback","quads","q","node","child","x0","y0","x1","y1","Quad","xm","ym"],"mappings":";AAEe,SAAAA,EAASC,GAAU;AAChC,MAAIC,IAAQ,CAAA,GAAIC,GAAGC,IAAO,KAAK,OAAOC,GAAOC,GAAIC,GAAIC,GAAIC;AAEzD,OADIL,KAAMF,EAAM,KAAK,IAAIQ,EAAKN,GAAM,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,CAAC,GACpED,IAAID,EAAM;AACf,QAAI,CAACD,EAASG,IAAOD,EAAE,MAAMG,IAAKH,EAAE,IAAII,IAAKJ,EAAE,IAAIK,IAAKL,EAAE,IAAIM,IAAKN,EAAE,EAAE,KAAKC,EAAK,QAAQ;AACvF,UAAIO,KAAML,IAAKE,KAAM,GAAGI,KAAML,IAAKE,KAAM;AACzC,OAAIJ,IAAQD,EAAK,CAAC,MAAGF,EAAM,KAAK,IAAIQ,EAAKL,GAAOM,GAAIC,GAAIJ,GAAIC,CAAE,CAAC,IAC3DJ,IAAQD,EAAK,CAAC,MAAGF,EAAM,KAAK,IAAIQ,EAAKL,GAAOC,GAAIM,GAAID,GAAIF,CAAE,CAAC,IAC3DJ,IAAQD,EAAK,CAAC,MAAGF,EAAM,KAAK,IAAIQ,EAAKL,GAAOM,GAAIJ,GAAIC,GAAII,CAAE,CAAC,IAC3DP,IAAQD,EAAK,CAAC,MAAGF,EAAM,KAAK,IAAIQ,EAAKL,GAAOC,GAAIC,GAAII,GAAIC,CAAE,CAAC;AAAA,IACjE;AAEF,SAAO;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-quadtree/src/visitAfter.js

@@ -1,19 +0,0 @@
-import p from "./quad.js";
-function v(w) {
-  var e = [], a = [], t;
-  for (this._root && e.push(new p(this._root, this._x0, this._y0, this._x1, this._y1)); t = e.pop(); ) {
-    var i = t.node;
-    if (i.length) {
-      var s, f = t.x0, h = t.y0, n = t.x1, o = t.y1, r = (f + n) / 2, u = (h + o) / 2;
-      (s = i[0]) && e.push(new p(s, f, h, r, u)), (s = i[1]) && e.push(new p(s, r, h, n, u)), (s = i[2]) && e.push(new p(s, f, u, r, o)), (s = i[3]) && e.push(new p(s, r, u, n, o));
-    }
-    a.push(t);
-  }
-  for (; t = a.pop(); )
-    w(t.node, t.x0, t.y0, t.x1, t.y1);
-  return this;
-}
-export {
-  v as default
-};
-//# sourceMappingURL=visitAfter.js.map

package/dist/node_modules/d3-quadtree/src/visitAfter.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"visitAfter.js","sources":["../../../../node_modules/d3-quadtree/src/visitAfter.js"],"sourcesContent":["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"],"names":["tree_visitAfter","callback","quads","next","q","Quad","node","child","x0","y0","x1","y1","xm","ym"],"mappings":";AAEe,SAAAA,EAASC,GAAU;AAChC,MAAIC,IAAQ,CAAA,GAAIC,IAAO,CAAA,GAAIC;AAE3B,OADI,KAAK,SAAOF,EAAM,KAAK,IAAIG,EAAK,KAAK,OAAO,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,CAAC,GAChFD,IAAIF,EAAM,SAAO;AACtB,QAAII,IAAOF,EAAE;AACb,QAAIE,EAAK,QAAQ;AACf,UAAIC,GAAOC,IAAKJ,EAAE,IAAIK,IAAKL,EAAE,IAAIM,IAAKN,EAAE,IAAIO,IAAKP,EAAE,IAAIQ,KAAMJ,IAAKE,KAAM,GAAGG,KAAMJ,IAAKE,KAAM;AAC5F,OAAIJ,IAAQD,EAAK,CAAC,MAAGJ,EAAM,KAAK,IAAIG,EAAKE,GAAOC,GAAIC,GAAIG,GAAIC,CAAE,CAAC,IAC3DN,IAAQD,EAAK,CAAC,MAAGJ,EAAM,KAAK,IAAIG,EAAKE,GAAOK,GAAIH,GAAIC,GAAIG,CAAE,CAAC,IAC3DN,IAAQD,EAAK,CAAC,MAAGJ,EAAM,KAAK,IAAIG,EAAKE,GAAOC,GAAIK,GAAID,GAAID,CAAE,CAAC,IAC3DJ,IAAQD,EAAK,CAAC,MAAGJ,EAAM,KAAK,IAAIG,EAAKE,GAAOK,GAAIC,GAAIH,GAAIC,CAAE,CAAC;AAAA,IACjE;AACA,IAAAR,EAAK,KAAKC,CAAC;AAAA,EACb;AACA,SAAOA,IAAID,EAAK;AACd,IAAAF,EAASG,EAAE,MAAMA,EAAE,IAAIA,EAAE,IAAIA,EAAE,IAAIA,EAAE,EAAE;AAEzC,SAAO;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-quadtree/src/x.js

@@ -1,11 +0,0 @@
-function e(t) {
-  return t[0];
-}
-function n(t) {
-  return arguments.length ? (this._x = t, this) : this._x;
-}
-export {
-  n as default,
-  e as defaultX
-};
-//# sourceMappingURL=x.js.map

package/dist/node_modules/d3-quadtree/src/x.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"x.js","sources":["../../../../node_modules/d3-quadtree/src/x.js"],"sourcesContent":["export function defaultX(d) {\n  return d[0];\n}\n\nexport default function(_) {\n  return arguments.length ? (this._x = _, this) : this._x;\n}\n"],"names":["defaultX","d","tree_x","_"],"mappings":"AAAO,SAASA,EAASC,GAAG;AAC1B,SAAOA,EAAE,CAAC;AACZ;AAEe,SAAAC,EAASC,GAAG;AACzB,SAAO,UAAU,UAAU,KAAK,KAAKA,GAAG,QAAQ,KAAK;AACvD;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-quadtree/src/y.js

@@ -1,11 +0,0 @@
-function e(t) {
-  return t[1];
-}
-function n(t) {
-  return arguments.length ? (this._y = t, this) : this._y;
-}
-export {
-  n as default,
-  e as defaultY
-};
-//# sourceMappingURL=y.js.map

package/dist/node_modules/d3-quadtree/src/y.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"y.js","sources":["../../../../node_modules/d3-quadtree/src/y.js"],"sourcesContent":["export function defaultY(d) {\n  return d[1];\n}\n\nexport default function(_) {\n  return arguments.length ? (this._y = _, this) : this._y;\n}\n"],"names":["defaultY","d","tree_y","_"],"mappings":"AAAO,SAASA,EAASC,GAAG;AAC1B,SAAOA,EAAE,CAAC;AACZ;AAEe,SAAAC,EAASC,GAAG;AACzB,SAAO,UAAU,UAAU,KAAK,KAAKA,GAAG,QAAQ,KAAK;AACvD;","x_google_ignoreList":[0]}

package/dist/utils/TextMeasurer.d.ts

@@ -1,8 +0,0 @@
-export declare class TextMeasurer {
-    ctx: CanvasRenderingContext2D | null;
-    constructor(font?: string);
-    set font(font: string);
-    getTextMetrics(text: string): TextMetrics | null;
-    getTextWidth(text: string): number;
-}
-//# sourceMappingURL=TextMeasurer.d.ts.map

package/dist/utils/TextMeasurer.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"TextMeasurer.d.ts","sourceRoot":"","sources":["../../src/utils/TextMeasurer.tsx"],"names":[],"mappings":"AAGA,qBAAa,YAAY;IACrB,GAAG,EAAE,wBAAwB,GAAG,IAAI,CAAQ;gBAChC,IAAI,SAAiB;IAcjC,IAAI,IAAI,CAAC,IAAI,EAAE,MAAM,EAIpB;IAED,cAAc,CAAC,IAAI,EAAE,MAAM,GAAE,WAAW,GAAG,IAAI;IAO/C,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM;CAMrC"}

package/dist/utils/TextMeasurer.js

@@ -1,27 +0,0 @@
-var r = Object.defineProperty;
-var i = (c, t, e) => t in c ? r(c, t, { enumerable: !0, configurable: !0, writable: !0, value: e }) : c[t] = e;
-var s = (c, t, e) => i(c, typeof t != "symbol" ? t + "" : t, e);
-class h {
-  constructor(t = "14px Manrope") {
-    s(this, "ctx", null);
-    if (document) {
-      const e = document == null ? void 0 : document.createElement("canvas");
-      e.width = 500, e.height = 30;
-      const n = e.getContext("2d");
-      n && (n.font = t, this.ctx = n);
-    }
-  }
-  set font(t) {
-    this.ctx && (this.ctx.font = t);
-  }
-  getTextMetrics(t) {
-    return this.ctx ? this.ctx.measureText(t) : null;
-  }
-  getTextWidth(t) {
-    return this.ctx ? this.ctx.measureText(t).width : 0;
-  }
-}
-export {
-  h as TextMeasurer
-};
-//# sourceMappingURL=TextMeasurer.js.map

package/dist/utils/TextMeasurer.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"TextMeasurer.js","sources":["../../src/utils/TextMeasurer.tsx"],"sourcesContent":["// import type {Canvas, CanvasRenderingContext2D} from 'canvas';\n// import {createCanvas} from 'canvas';\n// node-canvas https://github.com/Automattic/node-canvas has problems with building for windows\nexport class TextMeasurer {\n    ctx: CanvasRenderingContext2D | null = null;\n    constructor(font = '14px Manrope') {\n        // const canvas: Canvas = createCanvas(500, 30);\n        // const ctx = canvas.getContext('2d');\n        if (document) {\n            const canvas = document?.createElement('canvas');//createCanvas(500, 30);\n            canvas.width = 500;\n            canvas.height = 30;\n            const ctx = canvas.getContext('2d');\n            if (ctx) {\n                ctx.font = font;\n                this.ctx = ctx;\n            }\n        }\n    }\n    set font(font: string) {\n        if (this.ctx) {\n            this.ctx.font = font;\n        }\n    }\n\n    getTextMetrics(text: string):TextMetrics | null {\n        if (!this.ctx) {\n            return null;\n        }\n        return this.ctx.measureText(text);\n    }\n\n    getTextWidth(text: string): number {\n        if (!this.ctx) {\n            return 0;\n        }\n        return this.ctx.measureText(text).width;\n    }\n}\n"],"names":["TextMeasurer","font","__publicField","canvas","ctx","text"],"mappings":";;;AAGO,MAAMA,EAAa;AAAA,EAEtB,YAAYC,IAAO,gBAAgB;AADnC,IAAAC,EAAA,aAAuC;AAInC,QAAI,UAAU;AACV,YAAMC,IAAS,qCAAU,cAAc;AACvC,MAAAA,EAAO,QAAQ,KACfA,EAAO,SAAS;AAChB,YAAMC,IAAMD,EAAO,WAAW,IAAI;AAClC,MAAIC,MACAA,EAAI,OAAOH,GACX,KAAK,MAAMG;AAAA,IAEnB;AAAA,EACJ;AAAA,EACA,IAAI,KAAKH,GAAc;AACnB,IAAI,KAAK,QACL,KAAK,IAAI,OAAOA;AAAA,EAExB;AAAA,EAEA,eAAeI,GAAiC;AAC5C,WAAK,KAAK,MAGH,KAAK,IAAI,YAAYA,CAAI,IAFrB;AAAA,EAGf;AAAA,EAEA,aAAaA,GAAsB;AAC/B,WAAK,KAAK,MAGH,KAAK,IAAI,YAAYA,CAAI,EAAE,QAFvB;AAAA,EAGf;AACJ;"}