@hkyhy/marsun-components-core 0.1.113 → 0.1.114

package/dist/node_modules/d3-array/src/bin.js

@@ -0,0 +1,59 @@
+import { slice as F } from "./array.js";
+import { bisectRight as j } from "./bisect.js";
+import b from "./constant.js";
+import w from "./extent.js";
+import I from "./identity.js";
+import R from "./nice.js";
+import S, { tickIncrement as z } from "./ticks.js";
+import q from "./threshold/sturges.js";
+function L() {
+  var A = I, h = w, v = q;
+  function s(i) {
+    Array.isArray(i) || (i = Array.from(i));
+    var r, c = i.length, o, m, u = new Array(c);
+    for (r = 0; r < c; ++r)
+      u[r] = A(i[r], r, i);
+    var k = h(u), e = k[0], t = k[1], n = v(u, e, t);
+    if (!Array.isArray(n)) {
+      const g = t, x = +n;
+      if (h === w && ([e, t] = R(e, t, x)), n = S(e, t, x), n[0] <= e && (m = z(e, t, x)), n[n.length - 1] >= t)
+        if (g >= t && h === w) {
+          const l = z(e, t, x);
+          isFinite(l) && (l > 0 ? t = (Math.floor(t / l) + 1) * l : l < 0 && (t = (Math.ceil(t * -l) + 1) / -l));
+        } else
+          n.pop();
+    }
+    for (var f = n.length, a = 0, p = f; n[a] <= e; ) ++a;
+    for (; n[p - 1] > t; ) --p;
+    (a || p < f) && (n = n.slice(a, p), f = p - a);
+    var y = new Array(f + 1), M;
+    for (r = 0; r <= f; ++r)
+      M = y[r] = [], M.x0 = r > 0 ? n[r - 1] : e, M.x1 = r < f ? n[r] : t;
+    if (isFinite(m)) {
+      if (m > 0)
+        for (r = 0; r < c; ++r)
+          (o = u[r]) != null && e <= o && o <= t && y[Math.min(f, Math.floor((o - e) / m))].push(i[r]);
+      else if (m < 0) {
+        for (r = 0; r < c; ++r)
+          if ((o = u[r]) != null && e <= o && o <= t) {
+            const g = Math.floor((e - o) * m);
+            y[Math.min(f, g + (n[g] <= o))].push(i[r]);
+          }
+      }
+    } else
+      for (r = 0; r < c; ++r)
+        (o = u[r]) != null && e <= o && o <= t && y[j(n, o, 0, f)].push(i[r]);
+    return y;
+  }
+  return s.value = function(i) {
+    return arguments.length ? (A = typeof i == "function" ? i : b(i), s) : A;
+  }, s.domain = function(i) {
+    return arguments.length ? (h = typeof i == "function" ? i : b([i[0], i[1]]), s) : h;
+  }, s.thresholds = function(i) {
+    return arguments.length ? (v = typeof i == "function" ? i : b(Array.isArray(i) ? F.call(i) : i), s) : v;
+  }, s;
+}
+export {
+  L as default
+};
+//# sourceMappingURL=bin.js.map

package/dist/node_modules/d3-array/src/bin.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bin.js","sources":["../../../../node_modules/d3-array/src/bin.js"],"sourcesContent":["import {slice} from \"./array.js\";\nimport bisect from \"./bisect.js\";\nimport constant from \"./constant.js\";\nimport extent from \"./extent.js\";\nimport identity from \"./identity.js\";\nimport nice from \"./nice.js\";\nimport ticks, {tickIncrement} from \"./ticks.js\";\nimport sturges from \"./threshold/sturges.js\";\n\nexport default function bin() {\n  var value = identity,\n      domain = extent,\n      threshold = sturges;\n\n  function histogram(data) {\n    if (!Array.isArray(data)) data = Array.from(data);\n\n    var i,\n        n = data.length,\n        x,\n        step,\n        values = new Array(n);\n\n    for (i = 0; i < n; ++i) {\n      values[i] = value(data[i], i, data);\n    }\n\n    var xz = domain(values),\n        x0 = xz[0],\n        x1 = xz[1],\n        tz = threshold(values, x0, x1);\n\n    // Convert number of thresholds into uniform thresholds, and nice the\n    // default domain accordingly.\n    if (!Array.isArray(tz)) {\n      const max = x1, tn = +tz;\n      if (domain === extent) [x0, x1] = nice(x0, x1, tn);\n      tz = ticks(x0, x1, tn);\n\n      // If the domain is aligned with the first tick (which it will by\n      // default), then we can use quantization rather than bisection to bin\n      // values, which is substantially faster.\n      if (tz[0] <= x0) step = tickIncrement(x0, x1, tn);\n\n      // If the last threshold is coincident with the domain’s upper bound, the\n      // last bin will be zero-width. If the default domain is used, and this\n      // last threshold is coincident with the maximum input value, we can\n      // extend the niced upper bound by one tick to ensure uniform bin widths;\n      // otherwise, we simply remove the last threshold. Note that we don’t\n      // coerce values or the domain to numbers, and thus must be careful to\n      // compare order (>=) rather than strict equality (===)!\n      if (tz[tz.length - 1] >= x1) {\n        if (max >= x1 && domain === extent) {\n          const step = tickIncrement(x0, x1, tn);\n          if (isFinite(step)) {\n            if (step > 0) {\n              x1 = (Math.floor(x1 / step) + 1) * step;\n            } else if (step < 0) {\n              x1 = (Math.ceil(x1 * -step) + 1) / -step;\n            }\n          }\n        } else {\n          tz.pop();\n        }\n      }\n    }\n\n    // Remove any thresholds outside the domain.\n    // Be careful not to mutate an array owned by the user!\n    var m = tz.length, a = 0, b = m;\n    while (tz[a] <= x0) ++a;\n    while (tz[b - 1] > x1) --b;\n    if (a || b < m) tz = tz.slice(a, b), m = b - a;\n\n    var bins = new Array(m + 1),\n        bin;\n\n    // Initialize bins.\n    for (i = 0; i <= m; ++i) {\n      bin = bins[i] = [];\n      bin.x0 = i > 0 ? tz[i - 1] : x0;\n      bin.x1 = i < m ? tz[i] : x1;\n    }\n\n    // Assign data to bins by value, ignoring any outside the domain.\n    if (isFinite(step)) {\n      if (step > 0) {\n        for (i = 0; i < n; ++i) {\n          if ((x = values[i]) != null && x0 <= x && x <= x1) {\n            bins[Math.min(m, Math.floor((x - x0) / step))].push(data[i]);\n          }\n        }\n      } else if (step < 0) {\n        for (i = 0; i < n; ++i) {\n          if ((x = values[i]) != null && x0 <= x && x <= x1) {\n            const j = Math.floor((x0 - x) * step);\n            bins[Math.min(m, j + (tz[j] <= x))].push(data[i]); // handle off-by-one due to rounding\n          }\n        }\n      }\n    } else {\n      for (i = 0; i < n; ++i) {\n        if ((x = values[i]) != null && x0 <= x && x <= x1) {\n          bins[bisect(tz, x, 0, m)].push(data[i]);\n        }\n      }\n    }\n\n    return bins;\n  }\n\n  histogram.value = function(_) {\n    return arguments.length ? (value = typeof _ === \"function\" ? _ : constant(_), histogram) : value;\n  };\n\n  histogram.domain = function(_) {\n    return arguments.length ? (domain = typeof _ === \"function\" ? _ : constant([_[0], _[1]]), histogram) : domain;\n  };\n\n  histogram.thresholds = function(_) {\n    return arguments.length ? (threshold = typeof _ === \"function\" ? _ : constant(Array.isArray(_) ? slice.call(_) : _), histogram) : threshold;\n  };\n\n  return histogram;\n}\n"],"names":["bin","value","identity","domain","extent","threshold","sturges","histogram","data","i","n","x","step","values","xz","x0","x1","tz","max","tn","nice","ticks","tickIncrement","m","b","bins","j","bisect","_","constant","slice"],"mappings":";;;;;;;;AASe,SAASA,IAAM;AAC5B,MAAIC,IAAQC,GACRC,IAASC,GACTC,IAAYC;AAEhB,WAASC,EAAUC,GAAM;AACvB,IAAK,MAAM,QAAQA,CAAI,MAAGA,IAAO,MAAM,KAAKA,CAAI;AAEhD,QAAIC,GACAC,IAAIF,EAAK,QACTG,GACAC,GACAC,IAAS,IAAI,MAAMH,CAAC;AAExB,SAAKD,IAAI,GAAGA,IAAIC,GAAG,EAAED;AACnB,MAAAI,EAAOJ,CAAC,IAAIR,EAAMO,EAAKC,CAAC,GAAGA,GAAGD,CAAI;AAGpC,QAAIM,IAAKX,EAAOU,CAAM,GAClBE,IAAKD,EAAG,CAAC,GACTE,IAAKF,EAAG,CAAC,GACTG,IAAKZ,EAAUQ,GAAQE,GAAIC,CAAE;AAIjC,QAAI,CAAC,MAAM,QAAQC,CAAE,GAAG;AACtB,YAAMC,IAAMF,GAAIG,IAAK,CAACF;AAgBtB,UAfId,MAAWC,MAAQ,CAACW,GAAIC,CAAE,IAAII,EAAKL,GAAIC,GAAIG,CAAE,IACjDF,IAAKI,EAAMN,GAAIC,GAAIG,CAAE,GAKjBF,EAAG,CAAC,KAAKF,MAAIH,IAAOU,EAAcP,GAAIC,GAAIG,CAAE,IAS5CF,EAAGA,EAAG,SAAS,CAAC,KAAKD;AACvB,YAAIE,KAAOF,KAAMb,MAAWC,GAAQ;AAClC,gBAAMQ,IAAOU,EAAcP,GAAIC,GAAIG,CAAE;AACrC,UAAI,SAASP,CAAI,MACXA,IAAO,IACTI,KAAM,KAAK,MAAMA,IAAKJ,CAAI,IAAI,KAAKA,IAC1BA,IAAO,MAChBI,KAAM,KAAK,KAAKA,IAAK,CAACJ,CAAI,IAAI,KAAK,CAACA;AAAA,QAG1C;AACE,UAAAK,EAAG,IAAG;AAAA,IAGZ;AAKA,aADIM,IAAIN,EAAG,QAAQ,IAAI,GAAGO,IAAID,GACvBN,EAAG,CAAC,KAAKF,IAAI,GAAE;AACtB,WAAOE,EAAGO,IAAI,CAAC,IAAIR,IAAI,GAAEQ;AACzB,KAAI,KAAKA,IAAID,OAAGN,IAAKA,EAAG,MAAM,GAAGO,CAAC,GAAGD,IAAIC,IAAI;AAE7C,QAAIC,IAAO,IAAI,MAAMF,IAAI,CAAC,GACtBvB;AAGJ,SAAKS,IAAI,GAAGA,KAAKc,GAAG,EAAEd;AACpB,MAAAT,IAAMyB,EAAKhB,CAAC,IAAI,CAAA,GAChBT,EAAI,KAAKS,IAAI,IAAIQ,EAAGR,IAAI,CAAC,IAAIM,GAC7Bf,EAAI,KAAKS,IAAIc,IAAIN,EAAGR,CAAC,IAAIO;AAI3B,QAAI,SAASJ,CAAI;AACf,UAAIA,IAAO;AACT,aAAKH,IAAI,GAAGA,IAAIC,GAAG,EAAED;AACnB,WAAKE,IAAIE,EAAOJ,CAAC,MAAM,QAAQM,KAAMJ,KAAKA,KAAKK,KAC7CS,EAAK,KAAK,IAAIF,GAAG,KAAK,OAAOZ,IAAII,KAAMH,CAAI,CAAC,CAAC,EAAE,KAAKJ,EAAKC,CAAC,CAAC;AAAA,eAGtDG,IAAO;AAChB,aAAKH,IAAI,GAAGA,IAAIC,GAAG,EAAED;AACnB,eAAKE,IAAIE,EAAOJ,CAAC,MAAM,QAAQM,KAAMJ,KAAKA,KAAKK,GAAI;AACjD,kBAAMU,IAAI,KAAK,OAAOX,IAAKJ,KAAKC,CAAI;AACpC,YAAAa,EAAK,KAAK,IAAIF,GAAGG,KAAKT,EAAGS,CAAC,KAAKf,EAAE,CAAC,EAAE,KAAKH,EAAKC,CAAC,CAAC;AAAA,UAClD;AAAA;AAAA;AAIJ,WAAKA,IAAI,GAAGA,IAAIC,GAAG,EAAED;AACnB,SAAKE,IAAIE,EAAOJ,CAAC,MAAM,QAAQM,KAAMJ,KAAKA,KAAKK,KAC7CS,EAAKE,EAAOV,GAAIN,GAAG,GAAGY,CAAC,CAAC,EAAE,KAAKf,EAAKC,CAAC,CAAC;AAK5C,WAAOgB;AAAA,EACT;AAEA,SAAAlB,EAAU,QAAQ,SAASqB,GAAG;AAC5B,WAAO,UAAU,UAAU3B,IAAQ,OAAO2B,KAAM,aAAaA,IAAIC,EAASD,CAAC,GAAGrB,KAAaN;AAAA,EAC7F,GAEAM,EAAU,SAAS,SAASqB,GAAG;AAC7B,WAAO,UAAU,UAAUzB,IAAS,OAAOyB,KAAM,aAAaA,IAAIC,EAAS,CAACD,EAAE,CAAC,GAAGA,EAAE,CAAC,CAAC,CAAC,GAAGrB,KAAaJ;AAAA,EACzG,GAEAI,EAAU,aAAa,SAASqB,GAAG;AACjC,WAAO,UAAU,UAAUvB,IAAY,OAAOuB,KAAM,aAAaA,IAAIC,EAAS,MAAM,QAAQD,CAAC,IAAIE,EAAM,KAAKF,CAAC,IAAIA,CAAC,GAAGrB,KAAaF;AAAA,EACpI,GAEOE;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-array/src/bisect.js

@@ -0,0 +1,11 @@
+import c from "./ascending.js";
+import t from "./bisector.js";
+import i from "./number.js";
+const e = t(c), n = e.right, m = e.left, f = t(i).center;
+export {
+  f as bisectCenter,
+  m as bisectLeft,
+  n as bisectRight,
+  n as default
+};
+//# sourceMappingURL=bisect.js.map

package/dist/node_modules/d3-array/src/bisect.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bisect.js","sources":["../../../../node_modules/d3-array/src/bisect.js"],"sourcesContent":["import ascending from \"./ascending.js\";\nimport bisector from \"./bisector.js\";\nimport number from \"./number.js\";\n\nconst ascendingBisect = bisector(ascending);\nexport const bisectRight = ascendingBisect.right;\nexport const bisectLeft = ascendingBisect.left;\nexport const bisectCenter = bisector(number).center;\nexport default bisectRight;\n"],"names":["ascendingBisect","bisector","ascending","bisectRight","bisectLeft","bisectCenter","number"],"mappings":";;;AAIA,MAAMA,IAAkBC,EAASC,CAAS,GAC7BC,IAAcH,EAAgB,OAC9BI,IAAaJ,EAAgB,MAC7BK,IAAeJ,EAASK,CAAM,EAAE;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-array/src/bisector.js

@@ -0,0 +1,38 @@
+import d from "./ascending.js";
+import p from "./descending.js";
+function b(c) {
+  let u, o, s;
+  c.length !== 2 ? (u = d, o = (n, e) => d(c(n), e), s = (n, e) => c(n) - e) : (u = c === d || c === p ? c : l, o = c, s = c);
+  function f(n, e, t = 0, r = n.length) {
+    if (t < r) {
+      if (u(e, e) !== 0) return r;
+      do {
+        const i = t + r >>> 1;
+        o(n[i], e) < 0 ? t = i + 1 : r = i;
+      } while (t < r);
+    }
+    return t;
+  }
+  function m(n, e, t = 0, r = n.length) {
+    if (t < r) {
+      if (u(e, e) !== 0) return r;
+      do {
+        const i = t + r >>> 1;
+        o(n[i], e) <= 0 ? t = i + 1 : r = i;
+      } while (t < r);
+    }
+    return t;
+  }
+  function g(n, e, t = 0, r = n.length) {
+    const i = f(n, e, t, r - 1);
+    return i > t && s(n[i - 1], e) > -s(n[i], e) ? i - 1 : i;
+  }
+  return { left: f, center: g, right: m };
+}
+function l() {
+  return 0;
+}
+export {
+  b as default
+};
+//# sourceMappingURL=bisector.js.map

package/dist/node_modules/d3-array/src/bisector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bisector.js","sources":["../../../../node_modules/d3-array/src/bisector.js"],"sourcesContent":["import ascending from \"./ascending.js\";\nimport descending from \"./descending.js\";\n\nexport default function bisector(f) {\n  let compare1, compare2, delta;\n\n  // If an accessor is specified, promote it to a comparator. In this case we\n  // can test whether the search value is (self-) comparable. We can’t do this\n  // for a comparator (except for specific, known comparators) because we can’t\n  // tell if the comparator is symmetric, and an asymmetric comparator can’t be\n  // used to test whether a single value is comparable.\n  if (f.length !== 2) {\n    compare1 = ascending;\n    compare2 = (d, x) => ascending(f(d), x);\n    delta = (d, x) => f(d) - x;\n  } else {\n    compare1 = f === ascending || f === descending ? f : zero;\n    compare2 = f;\n    delta = f;\n  }\n\n  function left(a, x, lo = 0, hi = a.length) {\n    if (lo < hi) {\n      if (compare1(x, x) !== 0) return hi;\n      do {\n        const mid = (lo + hi) >>> 1;\n        if (compare2(a[mid], x) < 0) lo = mid + 1;\n        else hi = mid;\n      } while (lo < hi);\n    }\n    return lo;\n  }\n\n  function right(a, x, lo = 0, hi = a.length) {\n    if (lo < hi) {\n      if (compare1(x, x) !== 0) return hi;\n      do {\n        const mid = (lo + hi) >>> 1;\n        if (compare2(a[mid], x) <= 0) lo = mid + 1;\n        else hi = mid;\n      } while (lo < hi);\n    }\n    return lo;\n  }\n\n  function center(a, x, lo = 0, hi = a.length) {\n    const i = left(a, x, lo, hi - 1);\n    return i > lo && delta(a[i - 1], x) > -delta(a[i], x) ? i - 1 : i;\n  }\n\n  return {left, center, right};\n}\n\nfunction zero() {\n  return 0;\n}\n"],"names":["bisector","f","compare1","compare2","delta","ascending","d","x","descending","zero","left","a","lo","hi","mid","right","center"],"mappings":";;AAGe,SAASA,EAASC,GAAG;AAClC,MAAIC,GAAUC,GAAUC;AAOxB,EAAIH,EAAE,WAAW,KACfC,IAAWG,GACXF,IAAW,CAACG,GAAGC,MAAMF,EAAUJ,EAAEK,CAAC,GAAGC,CAAC,GACtCH,IAAQ,CAACE,GAAGC,MAAMN,EAAEK,CAAC,IAAIC,MAEzBL,IAAWD,MAAMI,KAAaJ,MAAMO,IAAaP,IAAIQ,GACrDN,IAAWF,GACXG,IAAQH;AAGV,WAASS,EAAKC,GAAGJ,GAAGK,IAAK,GAAGC,IAAKF,EAAE,QAAQ;AACzC,QAAIC,IAAKC,GAAI;AACX,UAAIX,EAASK,GAAGA,CAAC,MAAM,EAAG,QAAOM;AACjC,SAAG;AACD,cAAMC,IAAOF,IAAKC,MAAQ;AAC1B,QAAIV,EAASQ,EAAEG,CAAG,GAAGP,CAAC,IAAI,IAAGK,IAAKE,IAAM,IACnCD,IAAKC;AAAA,MACZ,SAASF,IAAKC;AAAA,IAChB;AACA,WAAOD;AAAA,EACT;AAEA,WAASG,EAAMJ,GAAGJ,GAAGK,IAAK,GAAGC,IAAKF,EAAE,QAAQ;AAC1C,QAAIC,IAAKC,GAAI;AACX,UAAIX,EAASK,GAAGA,CAAC,MAAM,EAAG,QAAOM;AACjC,SAAG;AACD,cAAMC,IAAOF,IAAKC,MAAQ;AAC1B,QAAIV,EAASQ,EAAEG,CAAG,GAAGP,CAAC,KAAK,IAAGK,IAAKE,IAAM,IACpCD,IAAKC;AAAA,MACZ,SAASF,IAAKC;AAAA,IAChB;AACA,WAAOD;AAAA,EACT;AAEA,WAASI,EAAOL,GAAGJ,GAAGK,IAAK,GAAGC,IAAKF,EAAE,QAAQ;AAC3C,UAAM,IAAID,EAAKC,GAAGJ,GAAGK,GAAIC,IAAK,CAAC;AAC/B,WAAO,IAAID,KAAMR,EAAMO,EAAE,IAAI,CAAC,GAAGJ,CAAC,IAAI,CAACH,EAAMO,EAAE,CAAC,GAAGJ,CAAC,IAAI,IAAI,IAAI;AAAA,EAClE;AAEA,SAAO,EAAC,MAAAG,GAAM,QAAAM,GAAQ,OAAAD,EAAK;AAC7B;AAEA,SAASN,IAAO;AACd,SAAO;AACT;","x_google_ignoreList":[0]}

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"constant.js","sources":["../../../../node_modules/d3-array/src/constant.js"],"sourcesContent":["export default function constant(x) {\n  return () => x;\n}\n"],"names":["constant","x"],"mappings":"AAAe,SAASA,EAASC,GAAG;AAClC,SAAO,MAAMA;AACf;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-array/src/count.js

@@ -0,0 +1,10 @@
+function o(e, l) {
+  let u = 0;
+  for (let t of e)
+    t != null && (t = +t) >= t && ++u;
+  return u;
+}
+export {
+  o as default
+};
+//# sourceMappingURL=count.js.map

package/dist/node_modules/d3-array/src/count.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"count.js","sources":["../../../../node_modules/d3-array/src/count.js"],"sourcesContent":["export default function count(values, valueof) {\n  let count = 0;\n  if (valueof === undefined) {\n    for (let value of values) {\n      if (value != null && (value = +value) >= value) {\n        ++count;\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null && (value = +value) >= value) {\n        ++count;\n      }\n    }\n  }\n  return count;\n}\n"],"names":["count","values","valueof","value"],"mappings":"AAAe,SAASA,EAAMC,GAAQC,GAAS;AAC7C,MAAIF,IAAQ;AAEV,WAASG,KAASF;AAChB,IAAIE,KAAS,SAASA,IAAQ,CAACA,MAAUA,KACvC,EAAEH;AAWR,SAAOA;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-array/src/descending.js

@@ -0,0 +1,7 @@
+function l(n, e) {
+  return n == null || e == null ? NaN : e < n ? -1 : e > n ? 1 : e >= n ? 0 : NaN;
+}
+export {
+  l as default
+};
+//# sourceMappingURL=descending.js.map

package/dist/node_modules/d3-array/src/descending.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"descending.js","sources":["../../../../node_modules/d3-array/src/descending.js"],"sourcesContent":["export default function descending(a, b) {\n  return a == null || b == null ? NaN\n    : b < a ? -1\n    : b > a ? 1\n    : b >= a ? 0\n    : NaN;\n}\n"],"names":["descending","a","b"],"mappings":"AAAe,SAASA,EAAWC,GAAGC,GAAG;AACvC,SAAOD,KAAK,QAAQC,KAAK,OAAO,MAC5BA,IAAID,IAAI,KACRC,IAAID,IAAI,IACRC,KAAKD,IAAI,IACT;AACN;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-array/src/deviation.js

@@ -0,0 +1,9 @@
+import n from "./variance.js";
+function e(r, a) {
+  const t = n(r, a);
+  return t && Math.sqrt(t);
+}
+export {
+  e as default
+};
+//# sourceMappingURL=deviation.js.map

package/dist/node_modules/d3-array/src/deviation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"deviation.js","sources":["../../../../node_modules/d3-array/src/deviation.js"],"sourcesContent":["import variance from \"./variance.js\";\n\nexport default function deviation(values, valueof) {\n  const v = variance(values, valueof);\n  return v ? Math.sqrt(v) : v;\n}\n"],"names":["deviation","values","valueof","v","variance"],"mappings":";AAEe,SAASA,EAAUC,GAAQC,GAAS;AACjD,QAAMC,IAAIC,EAASH,GAAQC,CAAO;AAClC,SAAOC,KAAI,KAAK,KAAKA,CAAC;AACxB;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,16 @@
+function d(l, t) {
+  let f, n;
+  if (t === void 0)
+    for (const e of l)
+      e != null && (f === void 0 ? e >= e && (f = n = e) : (f > e && (f = e), n < e && (n = e)));
+  else {
+    let e = -1;
+    for (let i of l)
+      (i = t(i, ++e, l)) != null && (f === void 0 ? i >= i && (f = n = i) : (f > i && (f = i), n < i && (n = i)));
+  }
+  return [f, n];
+}
+export {
+  d as default
+};
+//# sourceMappingURL=extent.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"extent.js","sources":["../../../../node_modules/d3-array/src/extent.js"],"sourcesContent":["export default function extent(values, valueof) {\n  let min;\n  let max;\n  if (valueof === undefined) {\n    for (const value of values) {\n      if (value != null) {\n        if (min === undefined) {\n          if (value >= value) min = max = value;\n        } else {\n          if (min > value) min = value;\n          if (max < value) max = value;\n        }\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null) {\n        if (min === undefined) {\n          if (value >= value) min = max = value;\n        } else {\n          if (min > value) min = value;\n          if (max < value) max = value;\n        }\n      }\n    }\n  }\n  return [min, max];\n}\n"],"names":["extent","values","valueof","min","max","value","index"],"mappings":"AAAe,SAASA,EAAOC,GAAQC,GAAS;AAC9C,MAAIC,GACAC;AACJ,MAAIF,MAAY;AACd,eAAWG,KAASJ;AAClB,MAAII,KAAS,SACPF,MAAQ,SACNE,KAASA,MAAOF,IAAMC,IAAMC,MAE5BF,IAAME,MAAOF,IAAME,IACnBD,IAAMC,MAAOD,IAAMC;AAAA,OAIxB;AACL,QAAIC,IAAQ;AACZ,aAASD,KAASJ;AAChB,OAAKI,IAAQH,EAAQG,GAAO,EAAEC,GAAOL,CAAM,MAAM,SAC3CE,MAAQ,SACNE,KAASA,MAAOF,IAAMC,IAAMC,MAE5BF,IAAME,MAAOF,IAAME,IACnBD,IAAMC,MAAOD,IAAMC;AAAA,EAI/B;AACA,SAAO,CAACF,GAAKC,CAAG;AAClB;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-array/src/fsum.js

@@ -0,0 +1,28 @@
+class e {
+  constructor() {
+    this._partials = new Float64Array(32), this._n = 0;
+  }
+  add(i) {
+    const s = this._partials;
+    let r = 0;
+    for (let a = 0; a < this._n && a < 32; a++) {
+      const h = s[a], t = i + h, l = Math.abs(i) < Math.abs(h) ? i - (t - h) : h - (t - i);
+      l && (s[r++] = l), i = t;
+    }
+    return s[r] = i, this._n = r + 1, this;
+  }
+  valueOf() {
+    const i = this._partials;
+    let s = this._n, r, a, h, t = 0;
+    if (s > 0) {
+      for (t = i[--s]; s > 0 && (r = t, a = i[--s], t = r + a, h = a - (t - r), !h); )
+        ;
+      s > 0 && (h < 0 && i[s - 1] < 0 || h > 0 && i[s - 1] > 0) && (a = h * 2, r = t + a, a == r - t && (t = r));
+    }
+    return t;
+  }
+}
+export {
+  e as Adder
+};
+//# sourceMappingURL=fsum.js.map

package/dist/node_modules/d3-array/src/fsum.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fsum.js","sources":["../../../../node_modules/d3-array/src/fsum.js"],"sourcesContent":["// https://github.com/python/cpython/blob/a74eea238f5baba15797e2e8b570d153bc8690a7/Modules/mathmodule.c#L1423\nexport class Adder {\n  constructor() {\n    this._partials = new Float64Array(32);\n    this._n = 0;\n  }\n  add(x) {\n    const p = this._partials;\n    let i = 0;\n    for (let j = 0; j < this._n && j < 32; j++) {\n      const y = p[j],\n        hi = x + y,\n        lo = Math.abs(x) < Math.abs(y) ? x - (hi - y) : y - (hi - x);\n      if (lo) p[i++] = lo;\n      x = hi;\n    }\n    p[i] = x;\n    this._n = i + 1;\n    return this;\n  }\n  valueOf() {\n    const p = this._partials;\n    let n = this._n, x, y, lo, hi = 0;\n    if (n > 0) {\n      hi = p[--n];\n      while (n > 0) {\n        x = hi;\n        y = p[--n];\n        hi = x + y;\n        lo = y - (hi - x);\n        if (lo) break;\n      }\n      if (n > 0 && ((lo < 0 && p[n - 1] < 0) || (lo > 0 && p[n - 1] > 0))) {\n        y = lo * 2;\n        x = hi + y;\n        if (y == x - hi) hi = x;\n      }\n    }\n    return hi;\n  }\n}\n\nexport function fsum(values, valueof) {\n  const adder = new Adder();\n  if (valueof === undefined) {\n    for (let value of values) {\n      if (value = +value) {\n        adder.add(value);\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if (value = +valueof(value, ++index, values)) {\n        adder.add(value);\n      }\n    }\n  }\n  return +adder;\n}\n\nexport function fcumsum(values, valueof) {\n  const adder = new Adder();\n  let index = -1;\n  return Float64Array.from(values, valueof === undefined\n      ? v => adder.add(+v || 0)\n      : v => adder.add(+valueof(v, ++index, values) || 0)\n  );\n}\n"],"names":["Adder","x","p","i","j","y","hi","lo","n"],"mappings":"AACO,MAAMA,EAAM;AAAA,EACjB,cAAc;AACZ,SAAK,YAAY,IAAI,aAAa,EAAE,GACpC,KAAK,KAAK;AAAA,EACZ;AAAA,EACA,IAAIC,GAAG;AACL,UAAMC,IAAI,KAAK;AACf,QAAIC,IAAI;AACR,aAASC,IAAI,GAAGA,IAAI,KAAK,MAAMA,IAAI,IAAIA,KAAK;AAC1C,YAAMC,IAAIH,EAAEE,CAAC,GACXE,IAAKL,IAAII,GACTE,IAAK,KAAK,IAAIN,CAAC,IAAI,KAAK,IAAII,CAAC,IAAIJ,KAAKK,IAAKD,KAAKA,KAAKC,IAAKL;AAC5D,MAAIM,MAAIL,EAAEC,GAAG,IAAII,IACjBN,IAAIK;AAAA,IACN;AACA,WAAAJ,EAAEC,CAAC,IAAIF,GACP,KAAK,KAAKE,IAAI,GACP;AAAA,EACT;AAAA,EACA,UAAU;AACR,UAAMD,IAAI,KAAK;AACf,QAAIM,IAAI,KAAK,IAAIP,GAAGI,GAAGE,GAAID,IAAK;AAChC,QAAIE,IAAI,GAAG;AAET,WADAF,IAAKJ,EAAE,EAAEM,CAAC,GACHA,IAAI,MACTP,IAAIK,GACJD,IAAIH,EAAE,EAAEM,CAAC,GACTF,IAAKL,IAAII,GACTE,IAAKF,KAAKC,IAAKL,IACX,CAAAM;AAAJ;AAEF,MAAIC,IAAI,MAAOD,IAAK,KAAKL,EAAEM,IAAI,CAAC,IAAI,KAAOD,IAAK,KAAKL,EAAEM,IAAI,CAAC,IAAI,OAC9DH,IAAIE,IAAK,GACTN,IAAIK,IAAKD,GACLA,KAAKJ,IAAIK,MAAIA,IAAKL;AAAA,IAE1B;AACA,WAAOK;AAAA,EACT;AACF;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-array/src/greatest.js

@@ -0,0 +1,18 @@
+import o from "./ascending.js";
+function u(i, t = o) {
+  let f, n = !1;
+  if (t.length === 1) {
+    let e;
+    for (const r of i) {
+      const l = t(r);
+      (n ? o(l, e) > 0 : o(l, l) === 0) && (f = r, e = l, n = !0);
+    }
+  } else
+    for (const e of i)
+      (n ? t(e, f) > 0 : t(e, e) === 0) && (f = e, n = !0);
+  return f;
+}
+export {
+  u as default
+};
+//# sourceMappingURL=greatest.js.map

package/dist/node_modules/d3-array/src/greatest.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"greatest.js","sources":["../../../../node_modules/d3-array/src/greatest.js"],"sourcesContent":["import ascending from \"./ascending.js\";\n\nexport default function greatest(values, compare = ascending) {\n  let max;\n  let defined = false;\n  if (compare.length === 1) {\n    let maxValue;\n    for (const element of values) {\n      const value = compare(element);\n      if (defined\n          ? ascending(value, maxValue) > 0\n          : ascending(value, value) === 0) {\n        max = element;\n        maxValue = value;\n        defined = true;\n      }\n    }\n  } else {\n    for (const value of values) {\n      if (defined\n          ? compare(value, max) > 0\n          : compare(value, value) === 0) {\n        max = value;\n        defined = true;\n      }\n    }\n  }\n  return max;\n}\n"],"names":["greatest","values","compare","ascending","max","defined","maxValue","element","value"],"mappings":";AAEe,SAASA,EAASC,GAAQC,IAAUC,GAAW;AAC5D,MAAIC,GACAC,IAAU;AACd,MAAIH,EAAQ,WAAW,GAAG;AACxB,QAAII;AACJ,eAAWC,KAAWN,GAAQ;AAC5B,YAAMO,IAAQN,EAAQK,CAAO;AAC7B,OAAIF,IACEF,EAAUK,GAAOF,CAAQ,IAAI,IAC7BH,EAAUK,GAAOA,CAAK,MAAM,OAChCJ,IAAMG,GACND,IAAWE,GACXH,IAAU;AAAA,IAEd;AAAA,EACF;AACE,eAAWG,KAASP;AAClB,OAAII,IACEH,EAAQM,GAAOJ,CAAG,IAAI,IACtBF,EAAQM,GAAOA,CAAK,MAAM,OAC9BJ,IAAMI,GACNH,IAAU;AAIhB,SAAOD;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-array/src/group.js

@@ -0,0 +1,35 @@
+import { InternMap as y } from "../../internmap/src/index.js";
+import f from "./identity.js";
+function k(r, ...n) {
+  return s(r, f, f, n);
+}
+function x(r, ...n) {
+  return s(r, Array.from, f, n);
+}
+function A(r, n, ...t) {
+  return s(r, f, n, t);
+}
+function w(r, n, ...t) {
+  return s(r, Array.from, n, t);
+}
+function s(r, n, t, i) {
+  return (function g(c, p) {
+    if (p >= i.length) return t(c);
+    const o = new y(), m = i[p++];
+    let a = -1;
+    for (const e of c) {
+      const u = m(e, ++a, c), l = o.get(u);
+      l ? l.push(e) : o.set(u, [e]);
+    }
+    for (const [e, u] of o)
+      o.set(e, g(u, p));
+    return n(o);
+  })(r, 0);
+}
+export {
+  k as default,
+  x as groups,
+  A as rollup,
+  w as rollups
+};
+//# sourceMappingURL=group.js.map

package/dist/node_modules/d3-array/src/group.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"group.js","sources":["../../../../node_modules/d3-array/src/group.js"],"sourcesContent":["import {InternMap} from \"internmap\";\nimport identity from \"./identity.js\";\n\nexport default function group(values, ...keys) {\n  return nest(values, identity, identity, keys);\n}\n\nexport function groups(values, ...keys) {\n  return nest(values, Array.from, identity, keys);\n}\n\nfunction flatten(groups, keys) {\n  for (let i = 1, n = keys.length; i < n; ++i) {\n    groups = groups.flatMap(g => g.pop().map(([key, value]) => [...g, key, value]));\n  }\n  return groups;\n}\n\nexport function flatGroup(values, ...keys) {\n  return flatten(groups(values, ...keys), keys);\n}\n\nexport function flatRollup(values, reduce, ...keys) {\n  return flatten(rollups(values, reduce, ...keys), keys);\n}\n\nexport function rollup(values, reduce, ...keys) {\n  return nest(values, identity, reduce, keys);\n}\n\nexport function rollups(values, reduce, ...keys) {\n  return nest(values, Array.from, reduce, keys);\n}\n\nexport function index(values, ...keys) {\n  return nest(values, identity, unique, keys);\n}\n\nexport function indexes(values, ...keys) {\n  return nest(values, Array.from, unique, keys);\n}\n\nfunction unique(values) {\n  if (values.length !== 1) throw new Error(\"duplicate key\");\n  return values[0];\n}\n\nfunction nest(values, map, reduce, keys) {\n  return (function regroup(values, i) {\n    if (i >= keys.length) return reduce(values);\n    const groups = new InternMap();\n    const keyof = keys[i++];\n    let index = -1;\n    for (const value of values) {\n      const key = keyof(value, ++index, values);\n      const group = groups.get(key);\n      if (group) group.push(value);\n      else groups.set(key, [value]);\n    }\n    for (const [key, values] of groups) {\n      groups.set(key, regroup(values, i));\n    }\n    return map(groups);\n  })(values, 0);\n}\n"],"names":["group","values","keys","nest","identity","groups","rollup","reduce","rollups","map","regroup","i","InternMap","keyof","index","value","key"],"mappings":";;AAGe,SAASA,EAAMC,MAAWC,GAAM;AAC7C,SAAOC,EAAKF,GAAQG,GAAUA,GAAUF,CAAI;AAC9C;AAEO,SAASG,EAAOJ,MAAWC,GAAM;AACtC,SAAOC,EAAKF,GAAQ,MAAM,MAAMG,GAAUF,CAAI;AAChD;AAiBO,SAASI,EAAOL,GAAQM,MAAWL,GAAM;AAC9C,SAAOC,EAAKF,GAAQG,GAAUG,GAAQL,CAAI;AAC5C;AAEO,SAASM,EAAQP,GAAQM,MAAWL,GAAM;AAC/C,SAAOC,EAAKF,GAAQ,MAAM,MAAMM,GAAQL,CAAI;AAC9C;AAeA,SAASC,EAAKF,GAAQQ,GAAKF,GAAQL,GAAM;AACvC,UAAQ,SAASQ,EAAQT,GAAQU,GAAG;AAClC,QAAIA,KAAKT,EAAK,OAAQ,QAAOK,EAAON,CAAM;AAC1C,UAAMI,IAAS,IAAIO,EAAS,GACtBC,IAAQX,EAAKS,GAAG;AACtB,QAAIG,IAAQ;AACZ,eAAWC,KAASd,GAAQ;AAC1B,YAAMe,IAAMH,EAAME,GAAO,EAAED,GAAOb,CAAM,GAClCD,IAAQK,EAAO,IAAIW,CAAG;AAC5B,MAAIhB,IAAOA,EAAM,KAAKe,CAAK,IACtBV,EAAO,IAAIW,GAAK,CAACD,CAAK,CAAC;AAAA,IAC9B;AACA,eAAW,CAACC,GAAKf,CAAM,KAAKI;AAC1B,MAAAA,EAAO,IAAIW,GAAKN,EAAQT,GAAQU,CAAC,CAAC;AAEpC,WAAOF,EAAIJ,CAAM;AAAA,EACnB,GAAGJ,GAAQ,CAAC;AACd;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-array/src/groupSort.js

@@ -0,0 +1,10 @@
+import n from "./ascending.js";
+import a, { rollup as l } from "./group.js";
+import g from "./sort.js";
+function x(f, r, i) {
+  return (r.length !== 2 ? g(l(f, r, i), (([o, t], [p, m]) => n(t, m) || n(o, p))) : g(a(f, i), (([o, t], [p, m]) => r(t, m) || n(o, p)))).map(([o]) => o);
+}
+export {
+  x as default
+};
+//# sourceMappingURL=groupSort.js.map

package/dist/node_modules/d3-array/src/groupSort.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"groupSort.js","sources":["../../../../node_modules/d3-array/src/groupSort.js"],"sourcesContent":["import ascending from \"./ascending.js\";\nimport group, {rollup} from \"./group.js\";\nimport sort from \"./sort.js\";\n\nexport default function groupSort(values, reduce, key) {\n  return (reduce.length !== 2\n    ? sort(rollup(values, reduce, key), (([ak, av], [bk, bv]) => ascending(av, bv) || ascending(ak, bk)))\n    : sort(group(values, key), (([ak, av], [bk, bv]) => reduce(av, bv) || ascending(ak, bk))))\n    .map(([key]) => key);\n}\n"],"names":["groupSort","values","reduce","key","sort","rollup","ak","av","bk","bv","ascending","group"],"mappings":";;;AAIe,SAASA,EAAUC,GAAQC,GAAQC,GAAK;AACrD,UAAQD,EAAO,WAAW,IACtBE,EAAKC,EAAOJ,GAAQC,GAAQC,CAAG,IAAI,CAAC,CAACG,GAAIC,CAAE,GAAG,CAACC,GAAIC,CAAE,MAAMC,EAAUH,GAAIE,CAAE,KAAKC,EAAUJ,GAAIE,CAAE,EAAC,IACjGJ,EAAKO,EAAMV,GAAQE,CAAG,IAAI,CAAC,CAACG,GAAIC,CAAE,GAAG,CAACC,GAAIC,CAAE,MAAMP,EAAOK,GAAIE,CAAE,KAAKC,EAAUJ,GAAIE,CAAE,EAAC,GACtF,IAAI,CAAC,CAACL,CAAG,MAAMA,CAAG;AACvB;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-array/src/identity.js

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

package/dist/node_modules/d3-array/src/identity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"identity.js","sources":["../../../../node_modules/d3-array/src/identity.js"],"sourcesContent":["export default function identity(x) {\n  return x;\n}\n"],"names":["identity","x"],"mappings":"AAAe,SAASA,EAASC,GAAG;AAClC,SAAOA;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-array/src/max.js

@@ -0,0 +1,16 @@
+function l(d, i) {
+  let e;
+  if (i === void 0)
+    for (const n of d)
+      n != null && (e < n || e === void 0 && n >= n) && (e = n);
+  else {
+    let n = -1;
+    for (let f of d)
+      (f = i(f, ++n, d)) != null && (e < f || e === void 0 && f >= f) && (e = f);
+  }
+  return e;
+}
+export {
+  l as default
+};
+//# sourceMappingURL=max.js.map

package/dist/node_modules/d3-array/src/max.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"max.js","sources":["../../../../node_modules/d3-array/src/max.js"],"sourcesContent":["export default function max(values, valueof) {\n  let max;\n  if (valueof === undefined) {\n    for (const value of values) {\n      if (value != null\n          && (max < value || (max === undefined && value >= value))) {\n        max = value;\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null\n          && (max < value || (max === undefined && value >= value))) {\n        max = value;\n      }\n    }\n  }\n  return max;\n}\n"],"names":["max","values","valueof","value","index"],"mappings":"AAAe,SAASA,EAAIC,GAAQC,GAAS;AAC3C,MAAIF;AACJ,MAAIE,MAAY;AACd,eAAWC,KAASF;AAClB,MAAIE,KAAS,SACLH,IAAMG,KAAUH,MAAQ,UAAaG,KAASA,OACpDH,IAAMG;AAAA,OAGL;AACL,QAAIC,IAAQ;AACZ,aAASD,KAASF;AAChB,OAAKE,IAAQD,EAAQC,GAAO,EAAEC,GAAOH,CAAM,MAAM,SACzCD,IAAMG,KAAUH,MAAQ,UAAaG,KAASA,OACpDH,IAAMG;AAAA,EAGZ;AACA,SAAOH;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-array/src/maxIndex.js

@@ -0,0 +1,14 @@
+function i(d, t) {
+  let n, l = -1, f = -1;
+  if (t === void 0)
+    for (const e of d)
+      ++f, e != null && (n < e || n === void 0 && e >= e) && (n = e, l = f);
+  else
+    for (let e of d)
+      (e = t(e, ++f, d)) != null && (n < e || n === void 0 && e >= e) && (n = e, l = f);
+  return l;
+}
+export {
+  i as default
+};
+//# sourceMappingURL=maxIndex.js.map

package/dist/node_modules/d3-array/src/maxIndex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"maxIndex.js","sources":["../../../../node_modules/d3-array/src/maxIndex.js"],"sourcesContent":["export default function maxIndex(values, valueof) {\n  let max;\n  let maxIndex = -1;\n  let index = -1;\n  if (valueof === undefined) {\n    for (const value of values) {\n      ++index;\n      if (value != null\n          && (max < value || (max === undefined && value >= value))) {\n        max = value, maxIndex = index;\n      }\n    }\n  } else {\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null\n          && (max < value || (max === undefined && value >= value))) {\n        max = value, maxIndex = index;\n      }\n    }\n  }\n  return maxIndex;\n}\n"],"names":["maxIndex","values","valueof","max","index","value"],"mappings":"AAAe,SAASA,EAASC,GAAQC,GAAS;AAChD,MAAIC,GACAH,IAAW,IACXI,IAAQ;AACZ,MAAIF,MAAY;AACd,eAAWG,KAASJ;AAClB,QAAEG,GACEC,KAAS,SACLF,IAAME,KAAUF,MAAQ,UAAaE,KAASA,OACpDF,IAAME,GAAOL,IAAWI;AAAA;AAI5B,aAASC,KAASJ;AAChB,OAAKI,IAAQH,EAAQG,GAAO,EAAED,GAAOH,CAAM,MAAM,SACzCE,IAAME,KAAUF,MAAQ,UAAaE,KAASA,OACpDF,IAAME,GAAOL,IAAWI;AAI9B,SAAOJ;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-array/src/mean.js

@@ -0,0 +1,16 @@
+function u(n, i) {
+  let l = 0, t = 0;
+  if (i === void 0)
+    for (let e of n)
+      e != null && (e = +e) >= e && (++l, t += e);
+  else {
+    let e = -1;
+    for (let f of n)
+      (f = i(f, ++e, n)) != null && (f = +f) >= f && (++l, t += f);
+  }
+  if (l) return t / l;
+}
+export {
+  u as default
+};
+//# sourceMappingURL=mean.js.map

package/dist/node_modules/d3-array/src/mean.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mean.js","sources":["../../../../node_modules/d3-array/src/mean.js"],"sourcesContent":["export default function mean(values, valueof) {\n  let count = 0;\n  let sum = 0;\n  if (valueof === undefined) {\n    for (let value of values) {\n      if (value != null && (value = +value) >= value) {\n        ++count, sum += value;\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null && (value = +value) >= value) {\n        ++count, sum += value;\n      }\n    }\n  }\n  if (count) return sum / count;\n}\n"],"names":["mean","values","valueof","count","sum","value","index"],"mappings":"AAAe,SAASA,EAAKC,GAAQC,GAAS;AAC5C,MAAIC,IAAQ,GACRC,IAAM;AACV,MAAIF,MAAY;AACd,aAASG,KAASJ;AAChB,MAAII,KAAS,SAASA,IAAQ,CAACA,MAAUA,MACvC,EAAEF,GAAOC,KAAOC;AAAA,OAGf;AACL,QAAIC,IAAQ;AACZ,aAASD,KAASJ;AAChB,OAAKI,IAAQH,EAAQG,GAAO,EAAEC,GAAOL,CAAM,MAAM,SAASI,IAAQ,CAACA,MAAUA,MAC3E,EAAEF,GAAOC,KAAOC;AAAA,EAGtB;AACA,MAAIF,EAAO,QAAOC,IAAMD;AAC1B;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-array/src/median.js

@@ -0,0 +1,12 @@
+import t, { quantileIndex as i } from "./quantile.js";
+function u(n, e) {
+  return t(n, 0.5, e);
+}
+function a(n, e) {
+  return i(n, 0.5, e);
+}
+export {
+  u as default,
+  a as medianIndex
+};
+//# sourceMappingURL=median.js.map

package/dist/node_modules/d3-array/src/median.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"median.js","sources":["../../../../node_modules/d3-array/src/median.js"],"sourcesContent":["import quantile, {quantileIndex} from \"./quantile.js\";\n\nexport default function median(values, valueof) {\n  return quantile(values, 0.5, valueof);\n}\n\nexport function medianIndex(values, valueof) {\n  return quantileIndex(values, 0.5, valueof);\n}\n"],"names":["median","values","valueof","quantile","medianIndex","quantileIndex"],"mappings":";AAEe,SAASA,EAAOC,GAAQC,GAAS;AAC9C,SAAOC,EAASF,GAAQ,KAAKC,CAAO;AACtC;AAEO,SAASE,EAAYH,GAAQC,GAAS;AAC3C,SAAOG,EAAcJ,GAAQ,KAAKC,CAAO;AAC3C;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-array/src/merge.js

@@ -0,0 +1,11 @@
+function* e(r) {
+  for (const t of r)
+    yield* t;
+}
+function f(r) {
+  return Array.from(e(r));
+}
+export {
+  f as default
+};
+//# sourceMappingURL=merge.js.map

package/dist/node_modules/d3-array/src/merge.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"merge.js","sources":["../../../../node_modules/d3-array/src/merge.js"],"sourcesContent":["function* flatten(arrays) {\n  for (const array of arrays) {\n    yield* array;\n  }\n}\n\nexport default function merge(arrays) {\n  return Array.from(flatten(arrays));\n}\n"],"names":["flatten","arrays","array","merge"],"mappings":"AAAA,UAAUA,EAAQC,GAAQ;AACxB,aAAWC,KAASD;AAClB,WAAOC;AAEX;AAEe,SAASC,EAAMF,GAAQ;AACpC,SAAO,MAAM,KAAKD,EAAQC,CAAM,CAAC;AACnC;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-array/src/min.js

@@ -0,0 +1,16 @@
+function l(i, d) {
+  let n;
+  if (d === void 0)
+    for (const e of i)
+      e != null && (n > e || n === void 0 && e >= e) && (n = e);
+  else {
+    let e = -1;
+    for (let f of i)
+      (f = d(f, ++e, i)) != null && (n > f || n === void 0 && f >= f) && (n = f);
+  }
+  return n;
+}
+export {
+  l as default
+};
+//# sourceMappingURL=min.js.map

package/dist/node_modules/d3-array/src/min.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"min.js","sources":["../../../../node_modules/d3-array/src/min.js"],"sourcesContent":["export default function min(values, valueof) {\n  let min;\n  if (valueof === undefined) {\n    for (const value of values) {\n      if (value != null\n          && (min > value || (min === undefined && value >= value))) {\n        min = value;\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null\n          && (min > value || (min === undefined && value >= value))) {\n        min = value;\n      }\n    }\n  }\n  return min;\n}\n"],"names":["min","values","valueof","value","index"],"mappings":"AAAe,SAASA,EAAIC,GAAQC,GAAS;AAC3C,MAAIF;AACJ,MAAIE,MAAY;AACd,eAAWC,KAASF;AAClB,MAAIE,KAAS,SACLH,IAAMG,KAAUH,MAAQ,UAAaG,KAASA,OACpDH,IAAMG;AAAA,OAGL;AACL,QAAIC,IAAQ;AACZ,aAASD,KAASF;AAChB,OAAKE,IAAQD,EAAQC,GAAO,EAAEC,GAAOH,CAAM,MAAM,SACzCD,IAAMG,KAAUH,MAAQ,UAAaG,KAASA,OACpDH,IAAMG;AAAA,EAGZ;AACA,SAAOH;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-array/src/minIndex.js

@@ -0,0 +1,14 @@
+function t(i, l) {
+  let e, d = -1, f = -1;
+  if (l === void 0)
+    for (const n of i)
+      ++f, n != null && (e > n || e === void 0 && n >= n) && (e = n, d = f);
+  else
+    for (let n of i)
+      (n = l(n, ++f, i)) != null && (e > n || e === void 0 && n >= n) && (e = n, d = f);
+  return d;
+}
+export {
+  t as default
+};
+//# sourceMappingURL=minIndex.js.map

package/dist/node_modules/d3-array/src/minIndex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"minIndex.js","sources":["../../../../node_modules/d3-array/src/minIndex.js"],"sourcesContent":["export default function minIndex(values, valueof) {\n  let min;\n  let minIndex = -1;\n  let index = -1;\n  if (valueof === undefined) {\n    for (const value of values) {\n      ++index;\n      if (value != null\n          && (min > value || (min === undefined && value >= value))) {\n        min = value, minIndex = index;\n      }\n    }\n  } else {\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null\n          && (min > value || (min === undefined && value >= value))) {\n        min = value, minIndex = index;\n      }\n    }\n  }\n  return minIndex;\n}\n"],"names":["minIndex","values","valueof","min","index","value"],"mappings":"AAAe,SAASA,EAASC,GAAQC,GAAS;AAChD,MAAIC,GACAH,IAAW,IACXI,IAAQ;AACZ,MAAIF,MAAY;AACd,eAAWG,KAASJ;AAClB,QAAEG,GACEC,KAAS,SACLF,IAAME,KAAUF,MAAQ,UAAaE,KAASA,OACpDF,IAAME,GAAOL,IAAWI;AAAA;AAI5B,aAASC,KAASJ;AAChB,OAAKI,IAAQH,EAAQG,GAAO,EAAED,GAAOH,CAAM,MAAM,SACzCE,IAAME,KAAUF,MAAQ,UAAaE,KAASA,OACpDF,IAAME,GAAOL,IAAWI;AAI9B,SAAOJ;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-array/src/nice.js

@@ -0,0 +1,14 @@
+import { tickIncrement as c } from "./ticks.js";
+function r(i, l, n) {
+  let f;
+  for (; ; ) {
+    const e = c(i, l, n);
+    if (e === f || e === 0 || !isFinite(e))
+      return [i, l];
+    e > 0 ? (i = Math.floor(i / e) * e, l = Math.ceil(l / e) * e) : e < 0 && (i = Math.ceil(i * e) / e, l = Math.floor(l * e) / e), f = e;
+  }
+}
+export {
+  r as default
+};
+//# sourceMappingURL=nice.js.map

package/dist/node_modules/d3-array/src/nice.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"nice.js","sources":["../../../../node_modules/d3-array/src/nice.js"],"sourcesContent":["import {tickIncrement} from \"./ticks.js\";\n\nexport default function nice(start, stop, count) {\n  let prestep;\n  while (true) {\n    const step = tickIncrement(start, stop, count);\n    if (step === prestep || step === 0 || !isFinite(step)) {\n      return [start, stop];\n    } else if (step > 0) {\n      start = Math.floor(start / step) * step;\n      stop = Math.ceil(stop / step) * step;\n    } else if (step < 0) {\n      start = Math.ceil(start * step) / step;\n      stop = Math.floor(stop * step) / step;\n    }\n    prestep = step;\n  }\n}\n"],"names":["nice","start","stop","count","prestep","step","tickIncrement"],"mappings":";AAEe,SAASA,EAAKC,GAAOC,GAAMC,GAAO;AAC/C,MAAIC;AACJ,aAAa;AACX,UAAMC,IAAOC,EAAcL,GAAOC,GAAMC,CAAK;AAC7C,QAAIE,MAASD,KAAWC,MAAS,KAAK,CAAC,SAASA,CAAI;AAClD,aAAO,CAACJ,GAAOC,CAAI;AACd,IAAIG,IAAO,KAChBJ,IAAQ,KAAK,MAAMA,IAAQI,CAAI,IAAIA,GACnCH,IAAO,KAAK,KAAKA,IAAOG,CAAI,IAAIA,KACvBA,IAAO,MAChBJ,IAAQ,KAAK,KAAKA,IAAQI,CAAI,IAAIA,GAClCH,IAAO,KAAK,MAAMA,IAAOG,CAAI,IAAIA,IAEnCD,IAAUC;AAAA,EACZ;AACF;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-array/src/number.js

@@ -0,0 +1,18 @@
+function i(n) {
+  return n === null ? NaN : +n;
+}
+function* u(n, f) {
+  if (f === void 0)
+    for (let e of n)
+      e != null && (e = +e) >= e && (yield e);
+  else {
+    let e = -1;
+    for (let l of n)
+      (l = f(l, ++e, n)) != null && (l = +l) >= l && (yield l);
+  }
+}
+export {
+  i as default,
+  u as numbers
+};
+//# sourceMappingURL=number.js.map

package/dist/node_modules/d3-array/src/number.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"number.js","sources":["../../../../node_modules/d3-array/src/number.js"],"sourcesContent":["export default function number(x) {\n  return x === null ? NaN : +x;\n}\n\nexport function* numbers(values, valueof) {\n  if (valueof === undefined) {\n    for (let value of values) {\n      if (value != null && (value = +value) >= value) {\n        yield value;\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null && (value = +value) >= value) {\n        yield value;\n      }\n    }\n  }\n}\n"],"names":["number","x","numbers","values","valueof","value","index"],"mappings":"AAAe,SAASA,EAAOC,GAAG;AAChC,SAAOA,MAAM,OAAO,MAAM,CAACA;AAC7B;AAEO,UAAUC,EAAQC,GAAQC,GAAS;AACxC,MAAIA,MAAY;AACd,aAASC,KAASF;AAChB,MAAIE,KAAS,SAASA,IAAQ,CAACA,MAAUA,MACvC,MAAMA;AAAA,OAGL;AACL,QAAIC,IAAQ;AACZ,aAASD,KAASF;AAChB,OAAKE,IAAQD,EAAQC,GAAO,EAAEC,GAAOH,CAAM,MAAM,SAASE,IAAQ,CAACA,MAAUA,MAC3E,MAAMA;AAAA,EAGZ;AACF;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-array/src/permute.js

@@ -0,0 +1,7 @@
+function u(r, e) {
+  return Array.from(e, (t) => r[t]);
+}
+export {
+  u as default
+};
+//# sourceMappingURL=permute.js.map

package/dist/node_modules/d3-array/src/permute.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"permute.js","sources":["../../../../node_modules/d3-array/src/permute.js"],"sourcesContent":["export default function permute(source, keys) {\n  return Array.from(keys, key => source[key]);\n}\n"],"names":["permute","source","keys","key"],"mappings":"AAAe,SAASA,EAAQC,GAAQC,GAAM;AAC5C,SAAO,MAAM,KAAKA,GAAM,CAAAC,MAAOF,EAAOE,CAAG,CAAC;AAC5C;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-array/src/quantile.js

@@ -0,0 +1,29 @@
+import u from "./max.js";
+import y from "./maxIndex.js";
+import d from "./min.js";
+import c from "./minIndex.js";
+import b from "./quickselect.js";
+import x, { numbers as g } from "./number.js";
+import { ascendingDefined as h } from "./sort.js";
+import N from "./greatest.js";
+function j(r, t, a) {
+  if (r = Float64Array.from(g(r, a)), !(!(n = r.length) || isNaN(t = +t))) {
+    if (t <= 0 || n < 2) return d(r);
+    if (t >= 1) return u(r);
+    var n, e = (n - 1) * t, o = Math.floor(e), i = u(b(r, o).subarray(0, o + 1)), m = d(r.subarray(o + 1));
+    return i + (m - i) * (e - o);
+  }
+}
+function k(r, t, a = x) {
+  if (!isNaN(t = +t)) {
+    if (n = Float64Array.from(r, (m, f) => x(a(r[f], f, r))), t <= 0) return c(n);
+    if (t >= 1) return y(n);
+    var n, e = Uint32Array.from(r, (m, f) => f), o = n.length - 1, i = Math.floor(o * t);
+    return b(e, i, 0, o, (m, f) => h(n[m], n[f])), i = N(e.subarray(0, i + 1), (m) => n[m]), i >= 0 ? i : -1;
+  }
+}
+export {
+  j as default,
+  k as quantileIndex
+};
+//# sourceMappingURL=quantile.js.map

package/dist/node_modules/d3-array/src/quantile.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"quantile.js","sources":["../../../../node_modules/d3-array/src/quantile.js"],"sourcesContent":["import max from \"./max.js\";\nimport maxIndex from \"./maxIndex.js\";\nimport min from \"./min.js\";\nimport minIndex from \"./minIndex.js\";\nimport quickselect from \"./quickselect.js\";\nimport number, {numbers} from \"./number.js\";\nimport {ascendingDefined} from \"./sort.js\";\nimport greatest from \"./greatest.js\";\n\nexport default function quantile(values, p, valueof) {\n  values = Float64Array.from(numbers(values, valueof));\n  if (!(n = values.length) || isNaN(p = +p)) return;\n  if (p <= 0 || n < 2) return min(values);\n  if (p >= 1) return max(values);\n  var n,\n      i = (n - 1) * p,\n      i0 = Math.floor(i),\n      value0 = max(quickselect(values, i0).subarray(0, i0 + 1)),\n      value1 = min(values.subarray(i0 + 1));\n  return value0 + (value1 - value0) * (i - i0);\n}\n\nexport function quantileSorted(values, p, valueof = number) {\n  if (!(n = values.length) || isNaN(p = +p)) return;\n  if (p <= 0 || n < 2) return +valueof(values[0], 0, values);\n  if (p >= 1) return +valueof(values[n - 1], n - 1, values);\n  var n,\n      i = (n - 1) * p,\n      i0 = Math.floor(i),\n      value0 = +valueof(values[i0], i0, values),\n      value1 = +valueof(values[i0 + 1], i0 + 1, values);\n  return value0 + (value1 - value0) * (i - i0);\n}\n\nexport function quantileIndex(values, p, valueof = number) {\n  if (isNaN(p = +p)) return;\n  numbers = Float64Array.from(values, (_, i) => number(valueof(values[i], i, values)));\n  if (p <= 0) return minIndex(numbers);\n  if (p >= 1) return maxIndex(numbers);\n  var numbers,\n      index = Uint32Array.from(values, (_, i) => i),\n      j = numbers.length - 1,\n      i = Math.floor(j * p);\n  quickselect(index, i, 0, j, (i, j) => ascendingDefined(numbers[i], numbers[j]));\n  i = greatest(index.subarray(0, i + 1), (i) => numbers[i]);\n  return i >= 0 ? i : -1;\n}\n"],"names":["quantile","values","p","valueof","numbers","min","max","i","i0","value0","quickselect","value1","quantileIndex","number","_","minIndex","maxIndex","index","j","ascendingDefined","greatest"],"mappings":";;;;;;;;AASe,SAASA,EAASC,GAAQC,GAAGC,GAAS;AAEnD,MADAF,IAAS,aAAa,KAAKG,EAAQH,GAAQE,CAAO,CAAC,GAC/C,IAAE,IAAIF,EAAO,WAAW,MAAMC,IAAI,CAACA,CAAC,IACxC;AAAA,QAAIA,KAAK,KAAK,IAAI,EAAG,QAAOG,EAAIJ,CAAM;AACtC,QAAIC,KAAK,EAAG,QAAOI,EAAIL,CAAM;AAC7B,QAAI,GACAM,KAAK,IAAI,KAAKL,GACdM,IAAK,KAAK,MAAMD,CAAC,GACjBE,IAASH,EAAII,EAAYT,GAAQO,CAAE,EAAE,SAAS,GAAGA,IAAK,CAAC,CAAC,GACxDG,IAASN,EAAIJ,EAAO,SAASO,IAAK,CAAC,CAAC;AACxC,WAAOC,KAAUE,IAASF,MAAWF,IAAIC;AAAA;AAC3C;AAcO,SAASI,EAAcX,GAAQC,GAAGC,IAAUU,GAAQ;AACzD,MAAI,OAAMX,IAAI,CAACA,CAAC,GAEhB;AAAA,QADAE,IAAU,aAAa,KAAKH,GAAQ,CAACa,GAAGP,MAAMM,EAAOV,EAAQF,EAAOM,CAAC,GAAGA,GAAGN,CAAM,CAAC,CAAC,GAC/EC,KAAK,EAAG,QAAOa,EAASX,CAAO;AACnC,QAAIF,KAAK,EAAG,QAAOc,EAASZ,CAAO;AACnC,QAAIA,GACAa,IAAQ,YAAY,KAAKhB,GAAQ,CAACa,GAAGP,MAAMA,CAAC,GAC5CW,IAAId,EAAQ,SAAS,GACrB,IAAI,KAAK,MAAMc,IAAIhB,CAAC;AACxB,WAAAQ,EAAYO,GAAO,GAAG,GAAGC,GAAG,CAACX,GAAGW,MAAMC,EAAiBf,EAAQG,CAAC,GAAGH,EAAQc,CAAC,CAAC,CAAC,GAC9E,IAAIE,EAASH,EAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAACV,MAAMH,EAAQG,CAAC,CAAC,GACjD,KAAK,IAAI,IAAI;AAAA;AACtB;","x_google_ignoreList":[0]}