@hkyhy/marsun-components-core 0.1.113 → 0.1.115

package/dist/node_modules/d3-hierarchy/src/treemap/sliceDice.js

@@ -0,0 +1,9 @@
+import o from "./dice.js";
+import p from "./slice.js";
+function f(e, t, i, m, r) {
+  (e.depth & 1 ? p : o)(e, t, i, m, r);
+}
+export {
+  f as default
+};
+//# sourceMappingURL=sliceDice.js.map

package/dist/node_modules/d3-hierarchy/src/treemap/sliceDice.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sliceDice.js","sources":["../../../../../node_modules/d3-hierarchy/src/treemap/sliceDice.js"],"sourcesContent":["import dice from \"./dice.js\";\nimport slice from \"./slice.js\";\n\nexport default function(parent, x0, y0, x1, y1) {\n  (parent.depth & 1 ? slice : dice)(parent, x0, y0, x1, y1);\n}\n"],"names":["treemapSliceDice","parent","x0","y0","x1","y1","slice","dice"],"mappings":";;AAGe,SAAAA,EAASC,GAAQC,GAAIC,GAAIC,GAAIC,GAAI;AAC9C,GAACJ,EAAO,QAAQ,IAAIK,IAAQC,GAAMN,GAAQC,GAAIC,GAAIC,GAAIC,CAAE;AAC1D;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-hierarchy/src/treemap/squarify.js

@@ -0,0 +1,34 @@
+import S from "./dice.js";
+import g from "./slice.js";
+var k = (1 + Math.sqrt(5)) / 2;
+function D(w, d, i, a, l, f) {
+  for (var p = [], t = d.children, v, u, q = 0, r = 0, M = t.length, m, c, o = d.value, e, h, s, V, R, b, n; q < M; ) {
+    m = l - i, c = f - a;
+    do
+      e = t[r++].value;
+    while (!e && r < M);
+    for (h = s = e, b = Math.max(c / m, m / c) / (o * w), n = e * e * b, R = Math.max(s / n, n / h); r < M; ++r) {
+      if (e += u = t[r].value, u < h && (h = u), u > s && (s = u), n = e * e * b, V = Math.max(s / n, n / h), V > R) {
+        e -= u;
+        break;
+      }
+      R = V;
+    }
+    p.push(v = { value: e, dice: m < c, children: t.slice(q, r) }), v.dice ? S(v, i, a, l, o ? a += c * e / o : f) : g(v, i, a, o ? i += m * e / o : l, f), o -= e, q = r;
+  }
+  return p;
+}
+const A = (function w(d) {
+  function i(a, l, f, p, t) {
+    D(d, a, l, f, p, t);
+  }
+  return i.ratio = function(a) {
+    return w((a = +a) > 1 ? a : 1);
+  }, i;
+})(k);
+export {
+  A as default,
+  k as phi,
+  D as squarifyRatio
+};
+//# sourceMappingURL=squarify.js.map

package/dist/node_modules/d3-hierarchy/src/treemap/squarify.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"squarify.js","sources":["../../../../../node_modules/d3-hierarchy/src/treemap/squarify.js"],"sourcesContent":["import treemapDice from \"./dice.js\";\nimport treemapSlice from \"./slice.js\";\n\nexport var phi = (1 + Math.sqrt(5)) / 2;\n\nexport function squarifyRatio(ratio, parent, x0, y0, x1, y1) {\n  var rows = [],\n      nodes = parent.children,\n      row,\n      nodeValue,\n      i0 = 0,\n      i1 = 0,\n      n = nodes.length,\n      dx, dy,\n      value = parent.value,\n      sumValue,\n      minValue,\n      maxValue,\n      newRatio,\n      minRatio,\n      alpha,\n      beta;\n\n  while (i0 < n) {\n    dx = x1 - x0, dy = y1 - y0;\n\n    // Find the next non-empty node.\n    do sumValue = nodes[i1++].value; while (!sumValue && i1 < n);\n    minValue = maxValue = sumValue;\n    alpha = Math.max(dy / dx, dx / dy) / (value * ratio);\n    beta = sumValue * sumValue * alpha;\n    minRatio = Math.max(maxValue / beta, beta / minValue);\n\n    // Keep adding nodes while the aspect ratio maintains or improves.\n    for (; i1 < n; ++i1) {\n      sumValue += nodeValue = nodes[i1].value;\n      if (nodeValue < minValue) minValue = nodeValue;\n      if (nodeValue > maxValue) maxValue = nodeValue;\n      beta = sumValue * sumValue * alpha;\n      newRatio = Math.max(maxValue / beta, beta / minValue);\n      if (newRatio > minRatio) { sumValue -= nodeValue; break; }\n      minRatio = newRatio;\n    }\n\n    // Position and record the row orientation.\n    rows.push(row = {value: sumValue, dice: dx < dy, children: nodes.slice(i0, i1)});\n    if (row.dice) treemapDice(row, x0, y0, x1, value ? y0 += dy * sumValue / value : y1);\n    else treemapSlice(row, x0, y0, value ? x0 += dx * sumValue / value : x1, y1);\n    value -= sumValue, i0 = i1;\n  }\n\n  return rows;\n}\n\nexport default (function custom(ratio) {\n\n  function squarify(parent, x0, y0, x1, y1) {\n    squarifyRatio(ratio, parent, x0, y0, x1, y1);\n  }\n\n  squarify.ratio = function(x) {\n    return custom((x = +x) > 1 ? x : 1);\n  };\n\n  return squarify;\n})(phi);\n"],"names":["phi","squarifyRatio","ratio","parent","x0","y0","x1","y1","rows","nodes","row","nodeValue","i0","i1","n","dx","dy","value","sumValue","minValue","maxValue","newRatio","minRatio","alpha","beta","treemapDice","treemapSlice","treemapSquarify","custom","squarify","x"],"mappings":";;AAGU,IAACA,KAAO,IAAI,KAAK,KAAK,CAAC,KAAK;AAE/B,SAASC,EAAcC,GAAOC,GAAQC,GAAIC,GAAIC,GAAIC,GAAI;AAkB3D,WAjBIC,IAAO,CAAA,GACPC,IAAQN,EAAO,UACfO,GACAC,GACAC,IAAK,GACLC,IAAK,GACLC,IAAIL,EAAM,QACVM,GAAIC,GACJC,IAAQd,EAAO,OACfe,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GAEGZ,IAAKE,KAAG;AACb,IAAAC,IAAKT,IAAKF,GAAIY,IAAKT,IAAKF;AAGxB;AAAG,MAAAa,IAAWT,EAAMI,GAAI,EAAE;AAAA,WAAc,CAACK,KAAYL,IAAKC;AAO1D,SANAK,IAAWC,IAAWF,GACtBK,IAAQ,KAAK,IAAIP,IAAKD,GAAIA,IAAKC,CAAE,KAAKC,IAAQf,IAC9CsB,IAAON,IAAWA,IAAWK,GAC7BD,IAAW,KAAK,IAAIF,IAAWI,GAAMA,IAAOL,CAAQ,GAG7CN,IAAKC,GAAG,EAAED,GAAI;AAMnB,UALAK,KAAYP,IAAYF,EAAMI,CAAE,EAAE,OAC9BF,IAAYQ,MAAUA,IAAWR,IACjCA,IAAYS,MAAUA,IAAWT,IACrCa,IAAON,IAAWA,IAAWK,GAC7BF,IAAW,KAAK,IAAID,IAAWI,GAAMA,IAAOL,CAAQ,GAChDE,IAAWC,GAAU;AAAE,QAAAJ,KAAYP;AAAW;AAAA,MAAO;AACzD,MAAAW,IAAWD;AAAA,IACb;AAGA,IAAAb,EAAK,KAAKE,IAAM,EAAC,OAAOQ,GAAU,MAAMH,IAAKC,GAAI,UAAUP,EAAM,MAAMG,GAAIC,CAAE,EAAC,CAAC,GAC3EH,EAAI,OAAMe,EAAYf,GAAKN,GAAIC,GAAIC,GAAIW,IAAQZ,KAAMW,IAAKE,IAAWD,IAAQV,CAAE,IAC9EmB,EAAahB,GAAKN,GAAIC,GAAIY,IAAQb,KAAMW,IAAKG,IAAWD,IAAQX,GAAIC,CAAE,GAC3EU,KAASC,GAAUN,IAAKC;AAAA,EAC1B;AAEA,SAAOL;AACT;AAEA,MAAAmB,KAAgB,SAASC,EAAO1B,GAAO;AAErC,WAAS2B,EAAS1B,GAAQC,GAAIC,GAAIC,GAAIC,GAAI;AACxC,IAAAN,EAAcC,GAAOC,GAAQC,GAAIC,GAAIC,GAAIC,CAAE;AAAA,EAC7C;AAEA,SAAAsB,EAAS,QAAQ,SAASC,GAAG;AAC3B,WAAOF,GAAQE,IAAI,CAACA,KAAK,IAAIA,IAAI,CAAC;AAAA,EACpC,GAEOD;AACT,GAAG7B,CAAG;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-interpolate/src/basis.js

@@ -0,0 +1,16 @@
+function u(n, f, i, r, c) {
+  var o = n * n, a = o * n;
+  return ((1 - 3 * n + 3 * o - a) * f + (4 - 6 * o + 3 * a) * i + (1 + 3 * n + 3 * o - 3 * a) * r + a * c) / 6;
+}
+function v(n) {
+  var f = n.length - 1;
+  return function(i) {
+    var r = i <= 0 ? i = 0 : i >= 1 ? (i = 1, f - 1) : Math.floor(i * f), c = n[r], o = n[r + 1], a = r > 0 ? n[r - 1] : 2 * c - o, t = r < f - 1 ? n[r + 2] : 2 * o - c;
+    return u((i - r / f) * f, a, c, o, t);
+  };
+}
+export {
+  u as basis,
+  v as default
+};
+//# sourceMappingURL=basis.js.map

package/dist/node_modules/d3-interpolate/src/basis.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"basis.js","sources":["../../../../node_modules/d3-interpolate/src/basis.js"],"sourcesContent":["export function basis(t1, v0, v1, v2, v3) {\n  var t2 = t1 * t1, t3 = t2 * t1;\n  return ((1 - 3 * t1 + 3 * t2 - t3) * v0\n      + (4 - 6 * t2 + 3 * t3) * v1\n      + (1 + 3 * t1 + 3 * t2 - 3 * t3) * v2\n      + t3 * v3) / 6;\n}\n\nexport default function(values) {\n  var n = values.length - 1;\n  return function(t) {\n    var i = t <= 0 ? (t = 0) : t >= 1 ? (t = 1, n - 1) : Math.floor(t * n),\n        v1 = values[i],\n        v2 = values[i + 1],\n        v0 = i > 0 ? values[i - 1] : 2 * v1 - v2,\n        v3 = i < n - 1 ? values[i + 2] : 2 * v2 - v1;\n    return basis((t - i / n) * n, v0, v1, v2, v3);\n  };\n}\n"],"names":["basis","t1","v0","v1","v2","v3","t2","t3","basis$1","values","n","t","i"],"mappings":"AAAO,SAASA,EAAMC,GAAIC,GAAIC,GAAIC,GAAIC,GAAI;AACxC,MAAIC,IAAKL,IAAKA,GAAIM,IAAKD,IAAKL;AAC5B,WAAS,IAAI,IAAIA,IAAK,IAAIK,IAAKC,KAAML,KAC9B,IAAI,IAAII,IAAK,IAAIC,KAAMJ,KACvB,IAAI,IAAIF,IAAK,IAAIK,IAAK,IAAIC,KAAMH,IACjCG,IAAKF,KAAM;AACnB;AAEe,SAAAG,EAASC,GAAQ;AAC9B,MAAIC,IAAID,EAAO,SAAS;AACxB,SAAO,SAASE,GAAG;AACjB,QAAIC,IAAID,KAAK,IAAKA,IAAI,IAAKA,KAAK,KAAKA,IAAI,GAAGD,IAAI,KAAK,KAAK,MAAMC,IAAID,CAAC,GACjEP,IAAKM,EAAOG,CAAC,GACbR,IAAKK,EAAOG,IAAI,CAAC,GACjBV,IAAKU,IAAI,IAAIH,EAAOG,IAAI,CAAC,IAAI,IAAIT,IAAKC,GACtCC,IAAKO,IAAIF,IAAI,IAAID,EAAOG,IAAI,CAAC,IAAI,IAAIR,IAAKD;AAC9C,WAAOH,GAAOW,IAAIC,IAAIF,KAAKA,GAAGR,GAAIC,GAAIC,GAAIC,CAAE;AAAA,EAC9C;AACF;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-interpolate/src/color.js

@@ -0,0 +1,30 @@
+import u from "./constant.js";
+function o(t, r) {
+  return function(n) {
+    return t + n * r;
+  };
+}
+function i(t, r, n) {
+  return t = Math.pow(t, n), r = Math.pow(r, n) - t, n = 1 / n, function(e) {
+    return Math.pow(t + e * r, n);
+  };
+}
+function a(t, r) {
+  var n = r - t;
+  return n ? o(t, n > 180 || n < -180 ? n - 360 * Math.round(n / 360) : n) : u(isNaN(t) ? r : t);
+}
+function m(t) {
+  return (t = +t) == 1 ? f : function(r, n) {
+    return n - r ? i(r, n, t) : u(isNaN(r) ? n : r);
+  };
+}
+function f(t, r) {
+  var n = r - t;
+  return n ? o(t, n) : u(isNaN(t) ? r : t);
+}
+export {
+  f as default,
+  m as gamma,
+  a as hue
+};
+//# sourceMappingURL=color.js.map

package/dist/node_modules/d3-interpolate/src/color.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"color.js","sources":["../../../../node_modules/d3-interpolate/src/color.js"],"sourcesContent":["import constant from \"./constant.js\";\n\nfunction linear(a, d) {\n  return function(t) {\n    return a + t * d;\n  };\n}\n\nfunction exponential(a, b, y) {\n  return a = Math.pow(a, y), b = Math.pow(b, y) - a, y = 1 / y, function(t) {\n    return Math.pow(a + t * b, y);\n  };\n}\n\nexport function hue(a, b) {\n  var d = b - a;\n  return d ? linear(a, d > 180 || d < -180 ? d - 360 * Math.round(d / 360) : d) : constant(isNaN(a) ? b : a);\n}\n\nexport function gamma(y) {\n  return (y = +y) === 1 ? nogamma : function(a, b) {\n    return b - a ? exponential(a, b, y) : constant(isNaN(a) ? b : a);\n  };\n}\n\nexport default function nogamma(a, b) {\n  var d = b - a;\n  return d ? linear(a, d) : constant(isNaN(a) ? b : a);\n}\n"],"names":["linear","a","d","t","exponential","b","y","hue","constant","gamma","nogamma"],"mappings":";AAEA,SAASA,EAAOC,GAAGC,GAAG;AACpB,SAAO,SAASC,GAAG;AACjB,WAAOF,IAAIE,IAAID;AAAA,EACjB;AACF;AAEA,SAASE,EAAYH,GAAGI,GAAGC,GAAG;AAC5B,SAAOL,IAAI,KAAK,IAAIA,GAAGK,CAAC,GAAGD,IAAI,KAAK,IAAIA,GAAGC,CAAC,IAAIL,GAAGK,IAAI,IAAIA,GAAG,SAASH,GAAG;AACxE,WAAO,KAAK,IAAIF,IAAIE,IAAIE,GAAGC,CAAC;AAAA,EAC9B;AACF;AAEO,SAASC,EAAIN,GAAGI,GAAG;AACxB,MAAIH,IAAIG,IAAIJ;AACZ,SAAOC,IAAIF,EAAOC,GAAGC,IAAI,OAAOA,IAAI,OAAOA,IAAI,MAAM,KAAK,MAAMA,IAAI,GAAG,IAAIA,CAAC,IAAIM,EAAS,MAAMP,CAAC,IAAII,IAAIJ,CAAC;AAC3G;AAEO,SAASQ,EAAMH,GAAG;AACvB,UAAQA,IAAI,CAACA,MAAO,IAAII,IAAU,SAAST,GAAGI,GAAG;AAC/C,WAAOA,IAAIJ,IAAIG,EAAYH,GAAGI,GAAGC,CAAC,IAAIE,EAAS,MAAMP,CAAC,IAAII,IAAIJ,CAAC;AAAA,EACjE;AACF;AAEe,SAASS,EAAQT,GAAGI,GAAG;AACpC,MAAIH,IAAIG,IAAIJ;AACZ,SAAOC,IAAIF,EAAOC,GAAGC,CAAC,IAAIM,EAAS,MAAMP,CAAC,IAAII,IAAIJ,CAAC;AACrD;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-interpolate/src/constant.js

@@ -0,0 +1,5 @@
+const a = (t) => () => t;
+export {
+  a as default
+};
+//# sourceMappingURL=constant.js.map

package/dist/node_modules/d3-interpolate/src/constant.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"constant.js","sources":["../../../../node_modules/d3-interpolate/src/constant.js"],"sourcesContent":["export default x => () => x;\n"],"names":["constant","x"],"mappings":"AAAA,MAAAA,IAAe,CAAAC,MAAK,MAAMA;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-interpolate/src/cubehelix.js

@@ -0,0 +1,20 @@
+import c, { hue as a } from "./color.js";
+import m from "../../d3-color/src/cubehelix.js";
+function n(l) {
+  return (function p(e) {
+    e = +e;
+    function h(o, i) {
+      var f = l((o = m(o)).h, (i = m(i)).h), r = c(o.s, i.s), x = c(o.l, i.l), b = c(o.opacity, i.opacity);
+      return function(u) {
+        return o.h = f(u), o.s = r(u), o.l = x(Math.pow(u, e)), o.opacity = b(u), o + "";
+      };
+    }
+    return h.gamma = p, h;
+  })(1);
+}
+n(a);
+var y = n(c);
+export {
+  y as cubehelixLong
+};
+//# sourceMappingURL=cubehelix.js.map

package/dist/node_modules/d3-interpolate/src/cubehelix.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cubehelix.js","sources":["../../../../node_modules/d3-interpolate/src/cubehelix.js"],"sourcesContent":["import {cubehelix as colorCubehelix} from \"d3-color\";\nimport color, {hue} from \"./color.js\";\n\nfunction cubehelix(hue) {\n  return (function cubehelixGamma(y) {\n    y = +y;\n\n    function cubehelix(start, end) {\n      var h = hue((start = colorCubehelix(start)).h, (end = colorCubehelix(end)).h),\n          s = color(start.s, end.s),\n          l = color(start.l, end.l),\n          opacity = color(start.opacity, end.opacity);\n      return function(t) {\n        start.h = h(t);\n        start.s = s(t);\n        start.l = l(Math.pow(t, y));\n        start.opacity = opacity(t);\n        return start + \"\";\n      };\n    }\n\n    cubehelix.gamma = cubehelixGamma;\n\n    return cubehelix;\n  })(1);\n}\n\nexport default cubehelix(hue);\nexport var cubehelixLong = cubehelix(color);\n"],"names":["cubehelix","hue","cubehelixGamma","y","start","end","h","colorCubehelix","s","color","l","opacity","t","cubehelixLong"],"mappings":";;AAGA,SAASA,EAAUC,GAAK;AACtB,UAAQ,SAASC,EAAeC,GAAG;AACjC,IAAAA,IAAI,CAACA;AAEL,aAASH,EAAUI,GAAOC,GAAK;AAC7B,UAAIC,IAAIL,GAAKG,IAAQG,EAAeH,CAAK,GAAG,IAAIC,IAAME,EAAeF,CAAG,GAAG,CAAC,GACxEG,IAAIC,EAAML,EAAM,GAAGC,EAAI,CAAC,GACxBK,IAAID,EAAML,EAAM,GAAGC,EAAI,CAAC,GACxBM,IAAUF,EAAML,EAAM,SAASC,EAAI,OAAO;AAC9C,aAAO,SAASO,GAAG;AACjB,eAAAR,EAAM,IAAIE,EAAEM,CAAC,GACbR,EAAM,IAAII,EAAEI,CAAC,GACbR,EAAM,IAAIM,EAAE,KAAK,IAAIE,GAAGT,CAAC,CAAC,GAC1BC,EAAM,UAAUO,EAAQC,CAAC,GAClBR,IAAQ;AAAA,MACjB;AAAA,IACF;AAEA,WAAAJ,EAAU,QAAQE,GAEXF;AAAA,EACT,GAAG,CAAC;AACN;AAEeA,EAAUC,CAAG;AAClB,IAACY,IAAgBb,EAAUS,CAAK;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-interpolate/src/rgb.js

@@ -0,0 +1,28 @@
+import y from "./basis.js";
+import e, { gamma as v } from "./color.js";
+import { rgb as f } from "../../d3-color/src/color.js";
+(function a(c) {
+  var i = v(c);
+  function m(r, n) {
+    var g = i((r = f(r)).r, (n = f(n)).r), o = i(r.g, n.g), b = i(r.b, n.b), p = e(r.opacity, n.opacity);
+    return function(u) {
+      return r.r = g(u), r.g = o(u), r.b = b(u), r.opacity = p(u), r + "";
+    };
+  }
+  return m.gamma = a, m;
+})(1);
+function w(a) {
+  return function(c) {
+    var i = c.length, m = new Array(i), r = new Array(i), n = new Array(i), g, o;
+    for (g = 0; g < i; ++g)
+      o = f(c[g]), m[g] = o.r || 0, r[g] = o.g || 0, n[g] = o.b || 0;
+    return m = a(m), r = a(r), n = a(n), o.opacity = 1, function(b) {
+      return o.r = m(b), o.g = r(b), o.b = n(b), o + "";
+    };
+  };
+}
+var x = w(y);
+export {
+  x as rgbBasis
+};
+//# sourceMappingURL=rgb.js.map

package/dist/node_modules/d3-interpolate/src/rgb.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rgb.js","sources":["../../../../node_modules/d3-interpolate/src/rgb.js"],"sourcesContent":["import {rgb as colorRgb} from \"d3-color\";\nimport basis from \"./basis.js\";\nimport basisClosed from \"./basisClosed.js\";\nimport nogamma, {gamma} from \"./color.js\";\n\nexport default (function rgbGamma(y) {\n  var color = gamma(y);\n\n  function rgb(start, end) {\n    var r = color((start = colorRgb(start)).r, (end = colorRgb(end)).r),\n        g = color(start.g, end.g),\n        b = color(start.b, end.b),\n        opacity = nogamma(start.opacity, end.opacity);\n    return function(t) {\n      start.r = r(t);\n      start.g = g(t);\n      start.b = b(t);\n      start.opacity = opacity(t);\n      return start + \"\";\n    };\n  }\n\n  rgb.gamma = rgbGamma;\n\n  return rgb;\n})(1);\n\nfunction rgbSpline(spline) {\n  return function(colors) {\n    var n = colors.length,\n        r = new Array(n),\n        g = new Array(n),\n        b = new Array(n),\n        i, color;\n    for (i = 0; i < n; ++i) {\n      color = colorRgb(colors[i]);\n      r[i] = color.r || 0;\n      g[i] = color.g || 0;\n      b[i] = color.b || 0;\n    }\n    r = spline(r);\n    g = spline(g);\n    b = spline(b);\n    color.opacity = 1;\n    return function(t) {\n      color.r = r(t);\n      color.g = g(t);\n      color.b = b(t);\n      return color + \"\";\n    };\n  };\n}\n\nexport var rgbBasis = rgbSpline(basis);\nexport var rgbBasisClosed = rgbSpline(basisClosed);\n"],"names":["rgbGamma","y","color","gamma","rgb","start","end","r","colorRgb","g","opacity","nogamma","t","rgbSpline","spline","colors","n","b","i","rgbBasis","basis"],"mappings":";;;CAKgB,SAASA,EAASC,GAAG;AACnC,MAAIC,IAAQC,EAAMF,CAAC;AAEnB,WAASG,EAAIC,GAAOC,GAAK;AACvB,QAAIC,IAAIL,GAAOG,IAAQG,EAASH,CAAK,GAAG,IAAIC,IAAME,EAASF,CAAG,GAAG,CAAC,GAC9DG,IAAIP,EAAMG,EAAM,GAAGC,EAAI,CAAC,GACxB,IAAIJ,EAAMG,EAAM,GAAGC,EAAI,CAAC,GACxBI,IAAUC,EAAQN,EAAM,SAASC,EAAI,OAAO;AAChD,WAAO,SAASM,GAAG;AACjB,aAAAP,EAAM,IAAIE,EAAEK,CAAC,GACbP,EAAM,IAAII,EAAEG,CAAC,GACbP,EAAM,IAAI,EAAEO,CAAC,GACbP,EAAM,UAAUK,EAAQE,CAAC,GAClBP,IAAQ;AAAA,IACjB;AAAA,EACF;AAEAD,SAAAA,EAAI,QAAQJ,GAELI;AACT,GAAG,CAAC;AAEJ,SAASS,EAAUC,GAAQ;AACzB,SAAO,SAASC,GAAQ;AACtB,QAAIC,IAAID,EAAO,QACXR,IAAI,IAAI,MAAMS,CAAC,GACfP,IAAI,IAAI,MAAMO,CAAC,GACfC,IAAI,IAAI,MAAMD,CAAC,GACfE,GAAGhB;AACP,SAAKgB,IAAI,GAAGA,IAAIF,GAAG,EAAEE;AACnB,MAAAhB,IAAQM,EAASO,EAAOG,CAAC,CAAC,GAC1BX,EAAEW,CAAC,IAAIhB,EAAM,KAAK,GAClBO,EAAES,CAAC,IAAIhB,EAAM,KAAK,GAClBe,EAAEC,CAAC,IAAIhB,EAAM,KAAK;AAEpB,WAAAK,IAAIO,EAAOP,CAAC,GACZE,IAAIK,EAAOL,CAAC,GACZQ,IAAIH,EAAOG,CAAC,GACZf,EAAM,UAAU,GACT,SAASU,GAAG;AACjB,aAAAV,EAAM,IAAIK,EAAEK,CAAC,GACbV,EAAM,IAAIO,EAAEG,CAAC,GACbV,EAAM,IAAIe,EAAEL,CAAC,GACNV,IAAQ;AAAA,IACjB;AAAA,EACF;AACF;AAEU,IAACiB,IAAWN,EAAUO,CAAK;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,70 @@
+const x = Math.PI, c = 2 * x, d = 1e-6, q = c - d;
+function E(o) {
+  this._ += o[0];
+  for (let t = 1, h = o.length; t < h; ++t)
+    this._ += arguments[t] + o[t];
+}
+function w(o) {
+  let t = Math.floor(o);
+  if (!(t >= 0)) throw new Error(`invalid digits: ${o}`);
+  if (t > 15) return E;
+  const h = 10 ** t;
+  return function(i) {
+    this._ += i[0];
+    for (let s = 1, e = i.length; s < e; ++s)
+      this._ += Math.round(arguments[s] * h) / h + i[s];
+  };
+}
+class L {
+  constructor(t) {
+    this._x0 = this._y0 = // start of current subpath
+    this._x1 = this._y1 = null, this._ = "", this._append = t == null ? E : w(t);
+  }
+  moveTo(t, h) {
+    this._append`M${this._x0 = this._x1 = +t},${this._y0 = this._y1 = +h}`;
+  }
+  closePath() {
+    this._x1 !== null && (this._x1 = this._x0, this._y1 = this._y0, this._append`Z`);
+  }
+  lineTo(t, h) {
+    this._append`L${this._x1 = +t},${this._y1 = +h}`;
+  }
+  quadraticCurveTo(t, h, i, s) {
+    this._append`Q${+t},${+h},${this._x1 = +i},${this._y1 = +s}`;
+  }
+  bezierCurveTo(t, h, i, s, e, $) {
+    this._append`C${+t},${+h},${+i},${+s},${this._x1 = +e},${this._y1 = +$}`;
+  }
+  arcTo(t, h, i, s, e) {
+    if (t = +t, h = +h, i = +i, s = +s, e = +e, e < 0) throw new Error(`negative radius: ${e}`);
+    let $ = this._x1, u = this._y1, l = i - t, a = s - h, _ = $ - t, p = u - h, n = _ * _ + p * p;
+    if (this._x1 === null)
+      this._append`M${this._x1 = t},${this._y1 = h}`;
+    else if (n > d) if (!(Math.abs(p * l - a * _) > d) || !e)
+      this._append`L${this._x1 = t},${this._y1 = h}`;
+    else {
+      let f = i - $, r = s - u, y = l * l + a * a, m = f * f + r * r, v = Math.sqrt(y), b = Math.sqrt(n), T = e * Math.tan((x - Math.acos((y + n - m) / (2 * v * b))) / 2), M = T / b, A = T / v;
+      Math.abs(M - 1) > d && this._append`L${t + M * _},${h + M * p}`, this._append`A${e},${e},0,0,${+(p * f > _ * r)},${this._x1 = t + A * l},${this._y1 = h + A * a}`;
+    }
+  }
+  arc(t, h, i, s, e, $) {
+    if (t = +t, h = +h, i = +i, $ = !!$, i < 0) throw new Error(`negative radius: ${i}`);
+    let u = i * Math.cos(s), l = i * Math.sin(s), a = t + u, _ = h + l, p = 1 ^ $, n = $ ? s - e : e - s;
+    this._x1 === null ? this._append`M${a},${_}` : (Math.abs(this._x1 - a) > d || Math.abs(this._y1 - _) > d) && this._append`L${a},${_}`, i && (n < 0 && (n = n % c + c), n > q ? this._append`A${i},${i},0,1,${p},${t - u},${h - l}A${i},${i},0,1,${p},${this._x1 = a},${this._y1 = _}` : n > d && this._append`A${i},${i},0,${+(n >= x)},${p},${this._x1 = t + i * Math.cos(e)},${this._y1 = h + i * Math.sin(e)}`);
+  }
+  rect(t, h, i, s) {
+    this._append`M${this._x0 = this._x1 = +t},${this._y0 = this._y1 = +h}h${i = +i}v${+s}h${-i}Z`;
+  }
+  toString() {
+    return this._;
+  }
+}
+function C() {
+  return new L();
+}
+C.prototype = L.prototype;
+export {
+  L as Path,
+  C as path
+};
+//# sourceMappingURL=path.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"path.js","sources":["../../../../node_modules/d3-path/src/path.js"],"sourcesContent":["const pi = Math.PI,\n    tau = 2 * pi,\n    epsilon = 1e-6,\n    tauEpsilon = tau - epsilon;\n\nfunction append(strings) {\n  this._ += strings[0];\n  for (let i = 1, n = strings.length; i < n; ++i) {\n    this._ += arguments[i] + strings[i];\n  }\n}\n\nfunction appendRound(digits) {\n  let d = Math.floor(digits);\n  if (!(d >= 0)) throw new Error(`invalid digits: ${digits}`);\n  if (d > 15) return append;\n  const k = 10 ** d;\n  return function(strings) {\n    this._ += strings[0];\n    for (let i = 1, n = strings.length; i < n; ++i) {\n      this._ += Math.round(arguments[i] * k) / k + strings[i];\n    }\n  };\n}\n\nexport class Path {\n  constructor(digits) {\n    this._x0 = this._y0 = // start of current subpath\n    this._x1 = this._y1 = null; // end of current subpath\n    this._ = \"\";\n    this._append = digits == null ? append : appendRound(digits);\n  }\n  moveTo(x, y) {\n    this._append`M${this._x0 = this._x1 = +x},${this._y0 = this._y1 = +y}`;\n  }\n  closePath() {\n    if (this._x1 !== null) {\n      this._x1 = this._x0, this._y1 = this._y0;\n      this._append`Z`;\n    }\n  }\n  lineTo(x, y) {\n    this._append`L${this._x1 = +x},${this._y1 = +y}`;\n  }\n  quadraticCurveTo(x1, y1, x, y) {\n    this._append`Q${+x1},${+y1},${this._x1 = +x},${this._y1 = +y}`;\n  }\n  bezierCurveTo(x1, y1, x2, y2, x, y) {\n    this._append`C${+x1},${+y1},${+x2},${+y2},${this._x1 = +x},${this._y1 = +y}`;\n  }\n  arcTo(x1, y1, x2, y2, r) {\n    x1 = +x1, y1 = +y1, x2 = +x2, y2 = +y2, r = +r;\n\n    // Is the radius negative? Error.\n    if (r < 0) throw new Error(`negative radius: ${r}`);\n\n    let x0 = this._x1,\n        y0 = this._y1,\n        x21 = x2 - x1,\n        y21 = y2 - y1,\n        x01 = x0 - x1,\n        y01 = y0 - y1,\n        l01_2 = x01 * x01 + y01 * y01;\n\n    // Is this path empty? Move to (x1,y1).\n    if (this._x1 === null) {\n      this._append`M${this._x1 = x1},${this._y1 = y1}`;\n    }\n\n    // Or, is (x1,y1) coincident with (x0,y0)? Do nothing.\n    else if (!(l01_2 > epsilon));\n\n    // Or, are (x0,y0), (x1,y1) and (x2,y2) collinear?\n    // Equivalently, is (x1,y1) coincident with (x2,y2)?\n    // Or, is the radius zero? Line to (x1,y1).\n    else if (!(Math.abs(y01 * x21 - y21 * x01) > epsilon) || !r) {\n      this._append`L${this._x1 = x1},${this._y1 = y1}`;\n    }\n\n    // Otherwise, draw an arc!\n    else {\n      let x20 = x2 - x0,\n          y20 = y2 - y0,\n          l21_2 = x21 * x21 + y21 * y21,\n          l20_2 = x20 * x20 + y20 * y20,\n          l21 = Math.sqrt(l21_2),\n          l01 = Math.sqrt(l01_2),\n          l = r * Math.tan((pi - Math.acos((l21_2 + l01_2 - l20_2) / (2 * l21 * l01))) / 2),\n          t01 = l / l01,\n          t21 = l / l21;\n\n      // If the start tangent is not coincident with (x0,y0), line to.\n      if (Math.abs(t01 - 1) > epsilon) {\n        this._append`L${x1 + t01 * x01},${y1 + t01 * y01}`;\n      }\n\n      this._append`A${r},${r},0,0,${+(y01 * x20 > x01 * y20)},${this._x1 = x1 + t21 * x21},${this._y1 = y1 + t21 * y21}`;\n    }\n  }\n  arc(x, y, r, a0, a1, ccw) {\n    x = +x, y = +y, r = +r, ccw = !!ccw;\n\n    // Is the radius negative? Error.\n    if (r < 0) throw new Error(`negative radius: ${r}`);\n\n    let dx = r * Math.cos(a0),\n        dy = r * Math.sin(a0),\n        x0 = x + dx,\n        y0 = y + dy,\n        cw = 1 ^ ccw,\n        da = ccw ? a0 - a1 : a1 - a0;\n\n    // Is this path empty? Move to (x0,y0).\n    if (this._x1 === null) {\n      this._append`M${x0},${y0}`;\n    }\n\n    // Or, is (x0,y0) not coincident with the previous point? Line to (x0,y0).\n    else if (Math.abs(this._x1 - x0) > epsilon || Math.abs(this._y1 - y0) > epsilon) {\n      this._append`L${x0},${y0}`;\n    }\n\n    // Is this arc empty? We’re done.\n    if (!r) return;\n\n    // Does the angle go the wrong way? Flip the direction.\n    if (da < 0) da = da % tau + tau;\n\n    // Is this a complete circle? Draw two arcs to complete the circle.\n    if (da > tauEpsilon) {\n      this._append`A${r},${r},0,1,${cw},${x - dx},${y - dy}A${r},${r},0,1,${cw},${this._x1 = x0},${this._y1 = y0}`;\n    }\n\n    // Is this arc non-empty? Draw an arc!\n    else if (da > epsilon) {\n      this._append`A${r},${r},0,${+(da >= pi)},${cw},${this._x1 = x + r * Math.cos(a1)},${this._y1 = y + r * Math.sin(a1)}`;\n    }\n  }\n  rect(x, y, w, h) {\n    this._append`M${this._x0 = this._x1 = +x},${this._y0 = this._y1 = +y}h${w = +w}v${+h}h${-w}Z`;\n  }\n  toString() {\n    return this._;\n  }\n}\n\nexport function path() {\n  return new Path;\n}\n\n// Allow instanceof d3.path\npath.prototype = Path.prototype;\n\nexport function pathRound(digits = 3) {\n  return new Path(+digits);\n}\n"],"names":["pi","tau","epsilon","tauEpsilon","append","strings","i","n","appendRound","digits","d","k","Path","x","y","x1","y1","x2","y2","r","x0","y0","x21","y21","x01","y01","l01_2","x20","y20","l21_2","l20_2","l21","l01","l","t01","t21","a0","a1","ccw","dx","dy","cw","da","w","h","path"],"mappings":"AAAA,MAAMA,IAAK,KAAK,IACZC,IAAM,IAAID,GACVE,IAAU,MACVC,IAAaF,IAAMC;AAEvB,SAASE,EAAOC,GAAS;AACvB,OAAK,KAAKA,EAAQ,CAAC;AACnB,WAASC,IAAI,GAAGC,IAAIF,EAAQ,QAAQC,IAAIC,GAAG,EAAED;AAC3C,SAAK,KAAK,UAAUA,CAAC,IAAID,EAAQC,CAAC;AAEtC;AAEA,SAASE,EAAYC,GAAQ;AAC3B,MAAIC,IAAI,KAAK,MAAMD,CAAM;AACzB,MAAI,EAAEC,KAAK,GAAI,OAAM,IAAI,MAAM,mBAAmBD,CAAM,EAAE;AAC1D,MAAIC,IAAI,GAAI,QAAON;AACnB,QAAMO,IAAI,MAAMD;AAChB,SAAO,SAASL,GAAS;AACvB,SAAK,KAAKA,EAAQ,CAAC;AACnB,aAASC,IAAI,GAAGC,IAAIF,EAAQ,QAAQC,IAAIC,GAAG,EAAED;AAC3C,WAAK,KAAK,KAAK,MAAM,UAAUA,CAAC,IAAIK,CAAC,IAAIA,IAAIN,EAAQC,CAAC;AAAA,EAE1D;AACF;AAEO,MAAMM,EAAK;AAAA,EAChB,YAAYH,GAAQ;AAClB,SAAK,MAAM,KAAK;AAAA,IAChB,KAAK,MAAM,KAAK,MAAM,MACtB,KAAK,IAAI,IACT,KAAK,UAAUA,KAAU,OAAOL,IAASI,EAAYC,CAAM;AAAA,EAC7D;AAAA,EACA,OAAOI,GAAGC,GAAG;AACX,SAAK,WAAW,KAAK,MAAM,KAAK,MAAM,CAACD,CAAC,IAAI,KAAK,MAAM,KAAK,MAAM,CAACC,CAAC;AAAA,EACtE;AAAA,EACA,YAAY;AACV,IAAI,KAAK,QAAQ,SACf,KAAK,MAAM,KAAK,KAAK,KAAK,MAAM,KAAK,KACrC,KAAK;AAAA,EAET;AAAA,EACA,OAAOD,GAAGC,GAAG;AACX,SAAK,WAAW,KAAK,MAAM,CAACD,CAAC,IAAI,KAAK,MAAM,CAACC,CAAC;AAAA,EAChD;AAAA,EACA,iBAAiBC,GAAIC,GAAIH,GAAGC,GAAG;AAC7B,SAAK,WAAW,CAACC,CAAE,IAAI,CAACC,CAAE,IAAI,KAAK,MAAM,CAACH,CAAC,IAAI,KAAK,MAAM,CAACC,CAAC;AAAA,EAC9D;AAAA,EACA,cAAcC,GAAIC,GAAIC,GAAIC,GAAIL,GAAGC,GAAG;AAClC,SAAK,WAAW,CAACC,CAAE,IAAI,CAACC,CAAE,IAAI,CAACC,CAAE,IAAI,CAACC,CAAE,IAAI,KAAK,MAAM,CAACL,CAAC,IAAI,KAAK,MAAM,CAACC,CAAC;AAAA,EAC5E;AAAA,EACA,MAAMC,GAAIC,GAAIC,GAAIC,GAAIC,GAAG;AAIvB,QAHAJ,IAAK,CAACA,GAAIC,IAAK,CAACA,GAAIC,IAAK,CAACA,GAAIC,IAAK,CAACA,GAAIC,IAAI,CAACA,GAGzCA,IAAI,EAAG,OAAM,IAAI,MAAM,oBAAoBA,CAAC,EAAE;AAElD,QAAIC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,IAAML,IAAKF,GACXQ,IAAML,IAAKF,GACXQ,IAAMJ,IAAKL,GACXU,IAAMJ,IAAKL,GACXU,IAAQF,IAAMA,IAAMC,IAAMA;AAG9B,QAAI,KAAK,QAAQ;AACf,WAAK,WAAW,KAAK,MAAMV,CAAE,IAAI,KAAK,MAAMC,CAAE;AAAA,aAIrCU,IAAQxB,EAKd,KAAI,EAAE,KAAK,IAAIuB,IAAMH,IAAMC,IAAMC,CAAG,IAAItB,MAAY,CAACiB;AACxD,WAAK,WAAW,KAAK,MAAMJ,CAAE,IAAI,KAAK,MAAMC,CAAE;AAAA,SAI3C;AACH,UAAIW,IAAMV,IAAKG,GACXQ,IAAMV,IAAKG,GACXQ,IAAQP,IAAMA,IAAMC,IAAMA,GAC1BO,IAAQH,IAAMA,IAAMC,IAAMA,GAC1BG,IAAM,KAAK,KAAKF,CAAK,GACrBG,IAAM,KAAK,KAAKN,CAAK,GACrBO,IAAId,IAAI,KAAK,KAAKnB,IAAK,KAAK,MAAM6B,IAAQH,IAAQI,MAAU,IAAIC,IAAMC,EAAI,KAAK,CAAC,GAChFE,IAAMD,IAAID,GACVG,IAAMF,IAAIF;AAGd,MAAI,KAAK,IAAIG,IAAM,CAAC,IAAIhC,KACtB,KAAK,WAAWa,IAAKmB,IAAMV,CAAG,IAAIR,IAAKkB,IAAMT,CAAG,IAGlD,KAAK,WAAWN,CAAC,IAAIA,CAAC,QAAQ,EAAEM,IAAME,IAAMH,IAAMI,EAAI,IAAI,KAAK,MAAMb,IAAKoB,IAAMb,CAAG,IAAI,KAAK,MAAMN,IAAKmB,IAAMZ,CAAG;AAAA,IAClH;AAAA,EACF;AAAA,EACA,IAAIV,GAAGC,GAAGK,GAAGiB,GAAIC,GAAIC,GAAK;AAIxB,QAHAzB,IAAI,CAACA,GAAGC,IAAI,CAACA,GAAGK,IAAI,CAACA,GAAGmB,IAAM,CAAC,CAACA,GAG5BnB,IAAI,EAAG,OAAM,IAAI,MAAM,oBAAoBA,CAAC,EAAE;AAElD,QAAIoB,IAAKpB,IAAI,KAAK,IAAIiB,CAAE,GACpBI,IAAKrB,IAAI,KAAK,IAAIiB,CAAE,GACpBhB,IAAKP,IAAI0B,GACTlB,IAAKP,IAAI0B,GACTC,IAAK,IAAIH,GACTI,IAAKJ,IAAMF,IAAKC,IAAKA,IAAKD;AAa9B,IAVI,KAAK,QAAQ,OACf,KAAK,WAAWhB,CAAE,IAAIC,CAAE,MAIjB,KAAK,IAAI,KAAK,MAAMD,CAAE,IAAIlB,KAAW,KAAK,IAAI,KAAK,MAAMmB,CAAE,IAAInB,MACtE,KAAK,WAAWkB,CAAE,IAAIC,CAAE,IAIrBF,MAGDuB,IAAK,MAAGA,IAAKA,IAAKzC,IAAMA,IAGxByC,IAAKvC,IACP,KAAK,WAAWgB,CAAC,IAAIA,CAAC,QAAQsB,CAAE,IAAI5B,IAAI0B,CAAE,IAAIzB,IAAI0B,CAAE,IAAIrB,CAAC,IAAIA,CAAC,QAAQsB,CAAE,IAAI,KAAK,MAAMrB,CAAE,IAAI,KAAK,MAAMC,CAAE,KAInGqB,IAAKxC,KACZ,KAAK,WAAWiB,CAAC,IAAIA,CAAC,MAAM,EAAEuB,KAAM1C,EAAG,IAAIyC,CAAE,IAAI,KAAK,MAAM5B,IAAIM,IAAI,KAAK,IAAIkB,CAAE,CAAC,IAAI,KAAK,MAAMvB,IAAIK,IAAI,KAAK,IAAIkB,CAAE,CAAC;AAAA,EAEvH;AAAA,EACA,KAAKxB,GAAGC,GAAG6B,GAAGC,GAAG;AACf,SAAK,WAAW,KAAK,MAAM,KAAK,MAAM,CAAC/B,CAAC,IAAI,KAAK,MAAM,KAAK,MAAM,CAACC,CAAC,IAAI6B,IAAI,CAACA,CAAC,IAAI,CAACC,CAAC,IAAI,CAACD,CAAC;AAAA,EAC5F;AAAA,EACA,WAAW;AACT,WAAO,KAAK;AAAA,EACd;AACF;AAEO,SAASE,IAAO;AACrB,SAAO,IAAIjC;AACb;AAGAiC,EAAK,YAAYjC,EAAK;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,30 @@
+function A(i) {
+  const f = +this._x.call(null, i), n = +this._y.call(null, i);
+  return v(this.cover(f, n), f, n, i);
+}
+function v(i, f, n, c) {
+  if (isNaN(f) || isNaN(n)) return i;
+  var l, t = i._root, r = { data: c }, y = i._x0, o = i._y0, s = i._x1, u = i._y1, a, _, e, N, x, d, h, w;
+  if (!t) return i._root = r, i;
+  for (; t.length; )
+    if ((x = f >= (a = (y + s) / 2)) ? y = a : s = a, (d = n >= (_ = (o + u) / 2)) ? o = _ : u = _, l = t, !(t = t[h = d << 1 | x])) return l[h] = r, i;
+  if (e = +i._x.call(null, t.data), N = +i._y.call(null, t.data), f === e && n === N) return r.next = t, l ? l[h] = r : i._root = r, i;
+  do
+    l = l ? l[h] = new Array(4) : i._root = new Array(4), (x = f >= (a = (y + s) / 2)) ? y = a : s = a, (d = n >= (_ = (o + u) / 2)) ? o = _ : u = _;
+  while ((h = d << 1 | x) === (w = (N >= _) << 1 | e >= a));
+  return l[w] = t, l[h] = r, i;
+}
+function p(i) {
+  var f, n, c = i.length, l, t, r = new Array(c), y = new Array(c), o = 1 / 0, s = 1 / 0, u = -1 / 0, a = -1 / 0;
+  for (n = 0; n < c; ++n)
+    isNaN(l = +this._x.call(null, f = i[n])) || isNaN(t = +this._y.call(null, f)) || (r[n] = l, y[n] = t, l < o && (o = l), l > u && (u = l), t < s && (s = t), t > a && (a = t));
+  if (o > u || s > a) return this;
+  for (this.cover(o, s).cover(u, a), n = 0; n < c; ++n)
+    v(this, r[n], y[n], i[n]);
+  return this;
+}
+export {
+  p as addAll,
+  A as default
+};
+//# sourceMappingURL=add.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"add.js","sources":["../../../../node_modules/d3-quadtree/src/add.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"],"names":["tree_add","d","x","y","add","tree","parent","node","leaf","x0","y0","x1","y1","xm","ym","xp","yp","right","bottom","i","j","addAll","data","n","xz","yz"],"mappings":"AAAe,SAAAA,EAASC,GAAG;AACzB,QAAMC,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMD,CAAC,GAC3BE,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMF,CAAC;AAC7B,SAAOG,EAAI,KAAK,MAAMF,GAAGC,CAAC,GAAGD,GAAGC,GAAGF,CAAC;AACtC;AAEA,SAASG,EAAIC,GAAMH,GAAGC,GAAGF,GAAG;AAC1B,MAAI,MAAMC,CAAC,KAAK,MAAMC,CAAC,EAAG,QAAOE;AAEjC,MAAIC,GACAC,IAAOF,EAAK,OACZG,IAAO,EAAC,MAAMP,EAAC,GACfQ,IAAKJ,EAAK,KACVK,IAAKL,EAAK,KACVM,IAAKN,EAAK,KACVO,IAAKP,EAAK,KACVQ,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC;AAGJ,MAAI,CAACb,EAAM,QAAOF,EAAK,QAAQG,GAAMH;AAGrC,SAAOE,EAAK;AAGV,SAFIU,IAAQf,MAAMW,KAAMJ,IAAKE,KAAM,MAAIF,IAAKI,IAASF,IAAKE,IACtDK,IAASf,MAAMW,KAAMJ,IAAKE,KAAM,MAAIF,IAAKI,IAASF,IAAKE,GACvDR,IAASC,GAAM,EAAEA,IAAOA,EAAKY,IAAID,KAAU,IAAID,CAAK,GAAI,QAAOX,EAAOa,CAAC,IAAIX,GAAMH;AAMvF,MAFAU,IAAK,CAACV,EAAK,GAAG,KAAK,MAAME,EAAK,IAAI,GAClCS,IAAK,CAACX,EAAK,GAAG,KAAK,MAAME,EAAK,IAAI,GAC9BL,MAAMa,KAAMZ,MAAMa,EAAI,QAAOR,EAAK,OAAOD,GAAMD,IAASA,EAAOa,CAAC,IAAIX,IAAOH,EAAK,QAAQG,GAAMH;AAGlG;AACE,IAAAC,IAASA,IAASA,EAAOa,CAAC,IAAI,IAAI,MAAM,CAAC,IAAId,EAAK,QAAQ,IAAI,MAAM,CAAC,IACjEY,IAAQf,MAAMW,KAAMJ,IAAKE,KAAM,MAAIF,IAAKI,IAASF,IAAKE,IACtDK,IAASf,MAAMW,KAAMJ,IAAKE,KAAM,MAAIF,IAAKI,IAASF,IAAKE;AAAA,UACnDK,IAAID,KAAU,IAAID,QAAYG,KAAKJ,KAAMF,MAAO,IAAKC,KAAMF;AACrE,SAAOP,EAAOc,CAAC,IAAIb,GAAMD,EAAOa,CAAC,IAAIX,GAAMH;AAC7C;AAEO,SAASgB,EAAOC,GAAM;AAC3B,MAAIrB,GAAGkB,GAAGI,IAAID,EAAK,QACfpB,GACAC,GACAqB,IAAK,IAAI,MAAMD,CAAC,GAChBE,IAAK,IAAI,MAAMF,CAAC,GAChBd,IAAK,OACLC,IAAK,OACLC,IAAK,QACLC,IAAK;AAGT,OAAKO,IAAI,GAAGA,IAAII,GAAG,EAAEJ;AACnB,IAAI,MAAMjB,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMD,IAAIqB,EAAKH,CAAC,CAAC,CAAC,KAAK,MAAMhB,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMF,CAAC,CAAC,MACnFuB,EAAGL,CAAC,IAAIjB,GACRuB,EAAGN,CAAC,IAAIhB,GACJD,IAAIO,MAAIA,IAAKP,IACbA,IAAIS,MAAIA,IAAKT,IACbC,IAAIO,MAAIA,IAAKP,IACbA,IAAIS,MAAIA,IAAKT;AAInB,MAAIM,IAAKE,KAAMD,IAAKE,EAAI,QAAO;AAM/B,OAHA,KAAK,MAAMH,GAAIC,CAAE,EAAE,MAAMC,GAAIC,CAAE,GAG1BO,IAAI,GAAGA,IAAII,GAAG,EAAEJ;AACnB,IAAAf,EAAI,MAAMoB,EAAGL,CAAC,GAAGM,EAAGN,CAAC,GAAGG,EAAKH,CAAC,CAAC;AAGjC,SAAO;AACT;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,29 @@
+function f(a, e) {
+  if (isNaN(a = +a) || isNaN(e = +e)) return this;
+  var t = this._x0, i = this._y0, h = this._x1, r = this._y1;
+  if (isNaN(t))
+    h = (t = Math.floor(a)) + 1, r = (i = Math.floor(e)) + 1;
+  else {
+    for (var s = h - t || 1, o = this._root, _, c; t > a || a >= h || i > e || e >= r; )
+      switch (c = (e < i) << 1 | a < t, _ = new Array(4), _[c] = o, o = _, s *= 2, c) {
+        case 0:
+          h = t + s, r = i + s;
+          break;
+        case 1:
+          t = h - s, r = i + s;
+          break;
+        case 2:
+          h = t + s, i = r - s;
+          break;
+        case 3:
+          t = h - s, i = r - s;
+          break;
+      }
+    this._root && this._root.length && (this._root = o);
+  }
+  return this._x0 = t, this._y0 = i, this._x1 = h, this._y1 = r, this;
+}
+export {
+  f as default
+};
+//# sourceMappingURL=cover.js.map

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

@@ -0,0 +1 @@
+{"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

@@ -0,0 +1,12 @@
+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

@@ -0,0 +1 @@
+{"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

@@ -0,0 +1,7 @@
+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

@@ -0,0 +1 @@
+{"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

@@ -0,0 +1,26 @@
+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

@@ -0,0 +1 @@
+{"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

@@ -0,0 +1,7 @@
+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

@@ -0,0 +1 @@
+{"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

@@ -0,0 +1,51 @@
+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

@@ -0,0 +1 @@
+{"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

@@ -0,0 +1,21 @@
+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

@@ -0,0 +1 @@
+{"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

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

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

@@ -0,0 +1 @@
+{"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

@@ -0,0 +1,12 @@
+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

@@ -0,0 +1 @@
+{"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

@@ -0,0 +1,14 @@
+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

@@ -0,0 +1 @@
+{"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]}