@milaboratories/graph-maker 1.1.175 → 1.1.177

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-array/src/extent.js

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"extent.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/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;AACdI,WAAS,SACPF,MAAQ,SACNE,KAASA,MAAOF,IAAMC,IAAMC,MAE5BF,IAAME,MAAOF,IAAME,IACnBD,IAAMC,MAAOD,IAAMC;AAAAA,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;AAAAA,EAI/B;AACA,SAAO,CAACF,GAAKC,CAAG;AAClB;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-array/src/identity.js

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"identity.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/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/@milaboratories/miplots4/dist/node_modules/d3-array/src/max.js

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"max.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/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;AACdE,MAAAA,KAAS,SACLH,IAAMG,KAAUH,MAAQ,UAAaG,KAASA,OACpDH,IAAMG;AAAAA,OAGL;AACL,QAAIC,IAAQ;AACZ,aAASD,KAASF;AAChB,OAAKE,IAAQD,EAAQC,GAAO,EAAEC,GAAOH,CAAM,MAAM,SACzCD,IAAMG,KAAUH,MAAQ,UAAaG,KAASA,OACpDH,IAAMG;AAAAA,EAGZ;AACA,SAAOH;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-array/src/mean.js

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"mean.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/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;AACZI,WAAS,SAASA,IAAQ,CAACA,MAAUA,MACvC,EAAEF,GAAOC,KAAOC;AAAAA,OAGf;AACL,QAAIC,IAAQ;AACZ,aAASD,KAASJ;AAChB,OAAKI,IAAQH,EAAQG,GAAO,EAAEC,GAAOL,CAAM,MAAM,SAASI,IAAQ,CAACA,MAAUA,MAC3E,EAAEF,GAAOC,KAAOC;AAAAA,EAGtB;AACA,MAAIF,UAAcC,IAAMD;AAC1B;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-array/src/min.js

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"min.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/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;AACdE,MAAAA,KAAS,SACLH,IAAMG,KAAUH,MAAQ,UAAaG,KAASA,OACpDH,IAAMG;AAAAA,OAGL;AACL,QAAIC,IAAQ;AACZ,aAASD,KAASF;AAChB,OAAKE,IAAQD,EAAQC,GAAO,EAAEC,GAAOH,CAAM,MAAM,SACzCD,IAAMG,KAAUH,MAAQ,UAAaG,KAASA,OACpDH,IAAMG;AAAAA,EAGZ;AACA,SAAOH;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-array/src/nice.js

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"nice.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/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;AACVG,IAAAA,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;AAAAA,EACZ;AACF;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-array/src/number.js

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"number.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/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"],"mappings":"AAAe,SAASA,EAAOC,GAAG;AAChC,SAAOA,MAAM,OAAO,MAAM,CAACA;AAC7B;AAEO,UAAUC,EAAQC,GAAQC,GAAS;AAEtC,WAASC,KAASF;AACZE,IAAAA,KAAS,SAASA,IAAQ,CAACA,MAAUA,MACvC,MAAMA;AAWd;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-array/src/quantile.js

@@ -1,25 +0,0 @@
-import n from "./max.js";
-import i from "./min.js";
-import m from "./quickselect.js";
-import s, { numbers as p } from "./number.js";
-function y(r, a, e) {
-  if (r = Float64Array.from(p(r)), !(!(f = r.length) || isNaN(a = +a))) {
-    if (a <= 0 || f < 2) return i(r);
-    if (a >= 1) return n(r);
-    var f, t = (f - 1) * a, o = Math.floor(t), u = n(m(r, o).subarray(0, o + 1)), l = i(r.subarray(o + 1));
-    return u + (l - u) * (t - o);
-  }
-}
-function c(r, a, e = s) {
-  if (!(!(f = r.length) || isNaN(a = +a))) {
-    if (a <= 0 || f < 2) return +e(r[0], 0, r);
-    if (a >= 1) return +e(r[f - 1], f - 1, r);
-    var f, t = (f - 1) * a, o = Math.floor(t), u = +e(r[o], o, r), l = +e(r[o + 1], o + 1, r);
-    return u + (l - u) * (t - o);
-  }
-}
-export {
-  y as default,
-  c as quantileSorted
-};
-//# sourceMappingURL=quantile.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"quantile.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/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","n","min","max","i","i0","value0","quickselect","value1","quantileSorted","number"],"mappings":";;;;AASe,SAASA,EAASC,GAAQC,GAAGC,GAAS;AAEnD,MADAF,IAAS,aAAa,KAAKG,EAAQH,CAAe,CAAC,GAC/C,EAAA,EAAEI,IAAIJ,EAAO,WAAW,MAAMC,IAAI,CAACA,CAAC,IACxC;AAAA,QAAIA,KAAK,KAAKG,IAAI,EAAG,QAAOC,EAAIL,CAAM;AACtC,QAAIC,KAAK,EAAG,QAAOK,EAAIN,CAAM;AAC7B,QAAII,GACAG,KAAKH,IAAI,KAAKH,GACdO,IAAK,KAAK,MAAMD,CAAC,GACjBE,IAASH,EAAII,EAAYV,GAAQQ,CAAE,EAAE,SAAS,GAAGA,IAAK,CAAC,CAAC,GACxDG,IAASN,EAAIL,EAAO,SAASQ,IAAK,CAAC,CAAC;AACxC,WAAOC,KAAUE,IAASF,MAAWF,IAAIC;AAAAA,EAAA;AAC3C;AAEO,SAASI,EAAeZ,GAAQC,GAAGC,IAAUW,GAAQ;AAC1D,MAAI,EAAA,EAAET,IAAIJ,EAAO,WAAW,MAAMC,IAAI,CAACA,CAAC,IACxC;AAAA,QAAIA,KAAK,KAAKG,IAAI,EAAG,QAAO,CAACF,EAAQF,EAAO,CAAC,GAAG,GAAGA,CAAM;AACzD,QAAIC,KAAK,EAAG,QAAO,CAACC,EAAQF,EAAOI,IAAI,CAAC,GAAGA,IAAI,GAAGJ,CAAM;AACxD,QAAII,GACAG,KAAKH,IAAI,KAAKH,GACdO,IAAK,KAAK,MAAMD,CAAC,GACjBE,IAAS,CAACP,EAAQF,EAAOQ,CAAE,GAAGA,GAAIR,CAAM,GACxCW,IAAS,CAACT,EAAQF,EAAOQ,IAAK,CAAC,GAAGA,IAAK,GAAGR,CAAM;AACpD,WAAOS,KAAUE,IAASF,MAAWF,IAAIC;AAAAA,EAAA;AAC3C;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-array/src/quickselect.js

@@ -1,26 +0,0 @@
-import { ascendingDefined as g, compareDefined as q } from "./sort.js";
-function D(a, r, f = 0, t = 1 / 0, h) {
-  if (r = Math.floor(r), f = Math.floor(Math.max(0, f)), t = Math.floor(Math.min(a.length - 1, t)), !(f <= r && r <= t)) return a;
-  for (h = h === void 0 ? g : q(h); t > f; ) {
-    if (t - f > 600) {
-      const i = t - f + 1, d = r - f + 1, u = Math.log(i), m = 0.5 * Math.exp(2 * u / 3), x = 0.5 * Math.sqrt(u * m * (i - m) / i) * (d - i / 2 < 0 ? -1 : 1), M = Math.max(f, Math.floor(r - d * m / i + x)), p = Math.min(t, Math.floor(r + (i - d) * m / i + x));
-      D(a, r, M, p, h);
-    }
-    const c = a[r];
-    let o = f, e = t;
-    for (l(a, f, r), h(a[t], c) > 0 && l(a, f, t); o < e; ) {
-      for (l(a, o, e), ++o, --e; h(a[o], c) < 0; ) ++o;
-      for (; h(a[e], c) > 0; ) --e;
-    }
-    h(a[f], c) === 0 ? l(a, f, e) : (++e, l(a, e, t)), e <= r && (f = e + 1), r <= e && (t = e - 1);
-  }
-  return a;
-}
-function l(a, r, f) {
-  const t = a[r];
-  a[r] = a[f], a[f] = t;
-}
-export {
-  D as default
-};
-//# sourceMappingURL=quickselect.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-array/src/quickselect.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"quickselect.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-array/src/quickselect.js"],"sourcesContent":["import {ascendingDefined, compareDefined} from \"./sort.js\";\n\n// Based on https://github.com/mourner/quickselect\n// ISC license, Copyright 2018 Vladimir Agafonkin.\nexport default function quickselect(array, k, left = 0, right = Infinity, compare) {\n  k = Math.floor(k);\n  left = Math.floor(Math.max(0, left));\n  right = Math.floor(Math.min(array.length - 1, right));\n\n  if (!(left <= k && k <= right)) return array;\n\n  compare = compare === undefined ? ascendingDefined : compareDefined(compare);\n\n  while (right > left) {\n    if (right - left > 600) {\n      const n = right - left + 1;\n      const m = k - left + 1;\n      const z = Math.log(n);\n      const s = 0.5 * Math.exp(2 * z / 3);\n      const sd = 0.5 * Math.sqrt(z * s * (n - s) / n) * (m - n / 2 < 0 ? -1 : 1);\n      const newLeft = Math.max(left, Math.floor(k - m * s / n + sd));\n      const newRight = Math.min(right, Math.floor(k + (n - m) * s / n + sd));\n      quickselect(array, k, newLeft, newRight, compare);\n    }\n\n    const t = array[k];\n    let i = left;\n    let j = right;\n\n    swap(array, left, k);\n    if (compare(array[right], t) > 0) swap(array, left, right);\n\n    while (i < j) {\n      swap(array, i, j), ++i, --j;\n      while (compare(array[i], t) < 0) ++i;\n      while (compare(array[j], t) > 0) --j;\n    }\n\n    if (compare(array[left], t) === 0) swap(array, left, j);\n    else ++j, swap(array, j, right);\n\n    if (j <= k) left = j + 1;\n    if (k <= j) right = j - 1;\n  }\n\n  return array;\n}\n\nfunction swap(array, i, j) {\n  const t = array[i];\n  array[i] = array[j];\n  array[j] = t;\n}\n"],"names":["quickselect","array","k","left","right","compare","ascendingDefined","compareDefined","n","m","z","s","sd","newLeft","newRight","t","i","j","swap"],"mappings":";AAIe,SAASA,EAAYC,GAAOC,GAAGC,IAAO,GAAGC,IAAQ,OAAUC,GAAS;AAKjF,MAJAH,IAAI,KAAK,MAAMA,CAAC,GAChBC,IAAO,KAAK,MAAM,KAAK,IAAI,GAAGA,CAAI,CAAC,GACnCC,IAAQ,KAAK,MAAM,KAAK,IAAIH,EAAM,SAAS,GAAGG,CAAK,CAAC,GAEhD,EAAED,KAAQD,KAAKA,KAAKE,GAAQ,QAAOH;AAIvC,OAFAI,IAAUA,MAAY,SAAYC,IAAmBC,EAAeF,CAAO,GAEpED,IAAQD,KAAM;AACnB,QAAIC,IAAQD,IAAO,KAAK;AACtB,YAAMK,IAAIJ,IAAQD,IAAO,GACnBM,IAAIP,IAAIC,IAAO,GACfO,IAAI,KAAK,IAAIF,CAAC,GACdG,IAAI,MAAM,KAAK,IAAI,IAAID,IAAI,CAAC,GAC5BE,IAAK,MAAM,KAAK,KAAKF,IAAIC,KAAKH,IAAIG,KAAKH,CAAC,KAAKC,IAAID,IAAI,IAAI,IAAI,KAAK,IAClEK,IAAU,KAAK,IAAIV,GAAM,KAAK,MAAMD,IAAIO,IAAIE,IAAIH,IAAII,CAAE,CAAC,GACvDE,IAAW,KAAK,IAAIV,GAAO,KAAK,MAAMF,KAAKM,IAAIC,KAAKE,IAAIH,IAAII,CAAE,CAAC;AACrEZ,MAAAA,EAAYC,GAAOC,GAAGW,GAASC,GAAUT,CAAO;AAAA,IAClD;AAEA,UAAMU,IAAId,EAAMC,CAAC;AACjB,QAAIc,IAAIb,GACJc,IAAIb;AAKR,SAHAc,EAAKjB,GAAOE,GAAMD,CAAC,GACfG,EAAQJ,EAAMG,CAAK,GAAGW,CAAC,IAAI,KAAGG,EAAKjB,GAAOE,GAAMC,CAAK,GAElDY,IAAIC,KAAG;AAEZ,WADAC,EAAKjB,GAAOe,GAAGC,CAAC,GAAG,EAAED,GAAG,EAAEC,GACnBZ,EAAQJ,EAAMe,CAAC,GAAGD,CAAC,IAAI,IAAG,GAAEC;AACnC,aAAOX,EAAQJ,EAAMgB,CAAC,GAAGF,CAAC,IAAI,IAAG,GAAEE;AAAAA,IACrC;AAEIZ,IAAAA,EAAQJ,EAAME,CAAI,GAAGY,CAAC,MAAM,IAAGG,EAAKjB,GAAOE,GAAMc,CAAC,KACjD,EAAEA,GAAGC,EAAKjB,GAAOgB,GAAGb,CAAK,IAE1Ba,KAAKf,MAAGC,IAAOc,IAAI,IACnBf,KAAKe,MAAGb,IAAQa,IAAI;AAAA,EAC1B;AAEA,SAAOhB;AACT;AAEA,SAASiB,EAAKjB,GAAOe,GAAGC,GAAG;AACzB,QAAM,IAAIhB,EAAMe,CAAC;AACjBf,EAAAA,EAAMe,CAAC,IAAIf,EAAMgB,CAAC,GAClBhB,EAAMgB,CAAC,IAAI;AACb;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-array/src/range.js

@@ -1,10 +0,0 @@
-function f(r, t, a) {
-  r = +r, t = +t, a = (e = arguments.length) < 2 ? (t = r, r = 0, 1) : e < 3 ? 1 : +a;
-  for (var l = -1, e = Math.max(0, Math.ceil((t - r) / a)) | 0, u = new Array(e); ++l < e; )
-    u[l] = r + l * a;
-  return u;
-}
-export {
-  f as default
-};
-//# sourceMappingURL=range.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-array/src/range.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"range.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-array/src/range.js"],"sourcesContent":["export default function range(start, stop, step) {\n  start = +start, stop = +stop, step = (n = arguments.length) < 2 ? (stop = start, start = 0, 1) : n < 3 ? 1 : +step;\n\n  var i = -1,\n      n = Math.max(0, Math.ceil((stop - start) / step)) | 0,\n      range = new Array(n);\n\n  while (++i < n) {\n    range[i] = start + i * step;\n  }\n\n  return range;\n}\n"],"names":["range","start","stop","step","n","i"],"mappings":"AAAe,SAASA,EAAMC,GAAOC,GAAMC,GAAM;AAC/CF,EAAAA,IAAQ,CAACA,GAAOC,IAAO,CAACA,GAAMC,KAAQC,IAAI,UAAU,UAAU,KAAKF,IAAOD,GAAOA,IAAQ,GAAG,KAAKG,IAAI,IAAI,IAAI,CAACD;AAM9G,WAJIE,IAAI,IACJD,IAAI,KAAK,IAAI,GAAG,KAAK,MAAMF,IAAOD,KAASE,CAAI,CAAC,IAAI,GACpDH,IAAQ,IAAI,MAAMI,CAAC,GAEhB,EAAEC,IAAID;AACXJ,IAAAA,EAAMK,CAAC,IAAIJ,IAAQI,IAAIF;AAGzB,SAAOH;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-array/src/sort.js

@@ -1,17 +0,0 @@
-import f from "./ascending.js";
-function u(e = f) {
-  if (e === f) return i;
-  if (typeof e != "function") throw new TypeError("compare is not a function");
-  return (o, n) => {
-    const t = e(o, n);
-    return t || t === 0 ? t : (e(n, n) === 0) - (e(o, o) === 0);
-  };
-}
-function i(e, o) {
-  return (e == null || !(e >= e)) - (o == null || !(o >= o)) || (e < o ? -1 : e > o ? 1 : 0);
-}
-export {
-  i as ascendingDefined,
-  u as compareDefined
-};
-//# sourceMappingURL=sort.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-array/src/sort.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sort.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-array/src/sort.js"],"sourcesContent":["import ascending from \"./ascending.js\";\nimport permute from \"./permute.js\";\n\nexport default function sort(values, ...F) {\n  if (typeof values[Symbol.iterator] !== \"function\") throw new TypeError(\"values is not iterable\");\n  values = Array.from(values);\n  let [f] = F;\n  if ((f && f.length !== 2) || F.length > 1) {\n    const index = Uint32Array.from(values, (d, i) => i);\n    if (F.length > 1) {\n      F = F.map(f => values.map(f));\n      index.sort((i, j) => {\n        for (const f of F) {\n          const c = ascendingDefined(f[i], f[j]);\n          if (c) return c;\n        }\n      });\n    } else {\n      f = values.map(f);\n      index.sort((i, j) => ascendingDefined(f[i], f[j]));\n    }\n    return permute(values, index);\n  }\n  return values.sort(compareDefined(f));\n}\n\nexport function compareDefined(compare = ascending) {\n  if (compare === ascending) return ascendingDefined;\n  if (typeof compare !== \"function\") throw new TypeError(\"compare is not a function\");\n  return (a, b) => {\n    const x = compare(a, b);\n    if (x || x === 0) return x;\n    return (compare(b, b) === 0) - (compare(a, a) === 0);\n  };\n}\n\nexport function ascendingDefined(a, b) {\n  return (a == null || !(a >= a)) - (b == null || !(b >= b)) || (a < b ? -1 : a > b ? 1 : 0);\n}\n"],"names":["compareDefined","compare","ascending","ascendingDefined","a","b","x"],"mappings":";AA0BO,SAASA,EAAeC,IAAUC,GAAW;AAClD,MAAID,MAAYC,EAAW,QAAOC;AAClC,MAAI,OAAOF,KAAY,WAAY,OAAM,IAAI,UAAU,2BAA2B;AAClF,SAAO,CAACG,GAAGC,MAAM;AACf,UAAMC,IAAIL,EAAQG,GAAGC,CAAC;AACtB,WAAIC,KAAKA,MAAM,IAAUA,KACjBL,EAAQI,GAAGA,CAAC,MAAM,MAAMJ,EAAQG,GAAGA,CAAC,MAAM;AAAA,EACpD;AACF;AAEO,SAASD,EAAiBC,GAAGC,GAAG;AACrC,UAAQD,KAAK,QAAQ,EAAEA,KAAKA,OAAOC,KAAK,QAAQ,EAAEA,KAAKA,QAAQD,IAAIC,IAAI,KAAKD,IAAIC,IAAI,IAAI;AAC1F;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-array/src/sum.js

@@ -1,16 +0,0 @@
-function r(t, f) {
-  let l = 0;
-  if (f === void 0)
-    for (let e of t)
-      (e = +e) && (l += e);
-  else {
-    let e = -1;
-    for (let o of t)
-      (o = +f(o, ++e, t)) && (l += o);
-  }
-  return l;
-}
-export {
-  r as default
-};
-//# sourceMappingURL=sum.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-array/src/sum.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sum.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-array/src/sum.js"],"sourcesContent":["export default function sum(values, valueof) {\n  let sum = 0;\n  if (valueof === undefined) {\n    for (let value of values) {\n      if (value = +value) {\n        sum += value;\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if (value = +valueof(value, ++index, values)) {\n        sum += value;\n      }\n    }\n  }\n  return sum;\n}\n"],"names":["sum","values","valueof","value","index"],"mappings":"AAAe,SAASA,EAAIC,GAAQC,GAAS;AAC3C,MAAIF,IAAM;AACV,MAAIE,MAAY;AACd,aAASC,KAASF;AAChB,OAAIE,IAAQ,CAACA,OACXH,KAAOG;AAAAA,OAGN;AACL,QAAIC,IAAQ;AACZ,aAASD,KAASF;AAChB,OAAIE,IAAQ,CAACD,EAAQC,GAAO,EAAEC,GAAOH,CAAM,OACzCD,KAAOG;AAAAA,EAGb;AACA,SAAOH;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-array/src/threshold/sturges.js

@@ -1,8 +0,0 @@
-import a from "../count.js";
-function r(t) {
-  return Math.max(1, Math.ceil(Math.log(a(t)) / Math.LN2) + 1);
-}
-export {
-  r as default
-};
-//# sourceMappingURL=sturges.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-array/src/threshold/sturges.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sturges.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-array/src/threshold/sturges.js"],"sourcesContent":["import count from \"../count.js\";\n\nexport default function thresholdSturges(values) {\n  return Math.max(1, Math.ceil(Math.log(count(values)) / Math.LN2) + 1);\n}\n"],"names":["thresholdSturges","values","count"],"mappings":";AAEe,SAASA,EAAiBC,GAAQ;AAC/C,SAAO,KAAK,IAAI,GAAG,KAAK,KAAK,KAAK,IAAIC,EAAMD,CAAM,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC;AACtE;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-array/src/ticks.js

@@ -1,33 +0,0 @@
-const d = Math.sqrt(50), p = Math.sqrt(10), w = Math.sqrt(2);
-function s(e, n, o) {
-  const h = (n - e) / Math.max(0, o), M = Math.floor(Math.log10(h)), r = h / Math.pow(10, M), c = r >= d ? 10 : r >= p ? 5 : r >= w ? 2 : 1;
-  let a, u, t;
-  return M < 0 ? (t = Math.pow(10, -M) / c, a = Math.round(e * t), u = Math.round(n * t), a / t < e && ++a, u / t > n && --u, t = -t) : (t = Math.pow(10, M) * c, a = Math.round(e / t), u = Math.round(n / t), a * t < e && ++a, u * t > n && --u), u < a && 0.5 <= o && o < 2 ? s(e, n, o * 2) : [a, u, t];
-}
-function f(e, n, o) {
-  if (n = +n, e = +e, o = +o, !(o > 0)) return [];
-  if (e === n) return [e];
-  const h = n < e, [M, r, c] = h ? s(n, e, o) : s(e, n, o);
-  if (!(r >= M)) return [];
-  const a = r - M + 1, u = new Array(a);
-  if (h)
-    if (c < 0) for (let t = 0; t < a; ++t) u[t] = (r - t) / -c;
-    else for (let t = 0; t < a; ++t) u[t] = (r - t) * c;
-  else if (c < 0) for (let t = 0; t < a; ++t) u[t] = (M + t) / -c;
-  else for (let t = 0; t < a; ++t) u[t] = (M + t) * c;
-  return u;
-}
-function l(e, n, o) {
-  return n = +n, e = +e, o = +o, s(e, n, o)[2];
-}
-function q(e, n, o) {
-  n = +n, e = +e, o = +o;
-  const h = n < e, M = h ? l(n, e, o) : l(e, n, o);
-  return (h ? -1 : 1) * (M < 0 ? 1 / -M : M);
-}
-export {
-  f as default,
-  l as tickIncrement,
-  q as tickStep
-};
-//# sourceMappingURL=ticks.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-array/src/ticks.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"ticks.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-array/src/ticks.js"],"sourcesContent":["const e10 = Math.sqrt(50),\n    e5 = Math.sqrt(10),\n    e2 = Math.sqrt(2);\n\nfunction tickSpec(start, stop, count) {\n  const step = (stop - start) / Math.max(0, count),\n      power = Math.floor(Math.log10(step)),\n      error = step / Math.pow(10, power),\n      factor = error >= e10 ? 10 : error >= e5 ? 5 : error >= e2 ? 2 : 1;\n  let i1, i2, inc;\n  if (power < 0) {\n    inc = Math.pow(10, -power) / factor;\n    i1 = Math.round(start * inc);\n    i2 = Math.round(stop * inc);\n    if (i1 / inc < start) ++i1;\n    if (i2 / inc > stop) --i2;\n    inc = -inc;\n  } else {\n    inc = Math.pow(10, power) * factor;\n    i1 = Math.round(start / inc);\n    i2 = Math.round(stop / inc);\n    if (i1 * inc < start) ++i1;\n    if (i2 * inc > stop) --i2;\n  }\n  if (i2 < i1 && 0.5 <= count && count < 2) return tickSpec(start, stop, count * 2);\n  return [i1, i2, inc];\n}\n\nexport default function ticks(start, stop, count) {\n  stop = +stop, start = +start, count = +count;\n  if (!(count > 0)) return [];\n  if (start === stop) return [start];\n  const reverse = stop < start, [i1, i2, inc] = reverse ? tickSpec(stop, start, count) : tickSpec(start, stop, count);\n  if (!(i2 >= i1)) return [];\n  const n = i2 - i1 + 1, ticks = new Array(n);\n  if (reverse) {\n    if (inc < 0) for (let i = 0; i < n; ++i) ticks[i] = (i2 - i) / -inc;\n    else for (let i = 0; i < n; ++i) ticks[i] = (i2 - i) * inc;\n  } else {\n    if (inc < 0) for (let i = 0; i < n; ++i) ticks[i] = (i1 + i) / -inc;\n    else for (let i = 0; i < n; ++i) ticks[i] = (i1 + i) * inc;\n  }\n  return ticks;\n}\n\nexport function tickIncrement(start, stop, count) {\n  stop = +stop, start = +start, count = +count;\n  return tickSpec(start, stop, count)[2];\n}\n\nexport function tickStep(start, stop, count) {\n  stop = +stop, start = +start, count = +count;\n  const reverse = stop < start, inc = reverse ? tickIncrement(stop, start, count) : tickIncrement(start, stop, count);\n  return (reverse ? -1 : 1) * (inc < 0 ? 1 / -inc : inc);\n}\n"],"names":["e10","e5","e2","tickSpec","start","stop","count","step","power","error","factor","i1","i2","inc","ticks","reverse","n","i","tickIncrement","tickStep"],"mappings":"AAAA,MAAMA,IAAM,KAAK,KAAK,EAAE,GACpBC,IAAK,KAAK,KAAK,EAAE,GACjBC,IAAK,KAAK,KAAK,CAAC;AAEpB,SAASC,EAASC,GAAOC,GAAMC,GAAO;AACpC,QAAMC,KAAQF,IAAOD,KAAS,KAAK,IAAI,GAAGE,CAAK,GAC3CE,IAAQ,KAAK,MAAM,KAAK,MAAMD,CAAI,CAAC,GACnCE,IAAQF,IAAO,KAAK,IAAI,IAAIC,CAAK,GACjCE,IAASD,KAAST,IAAM,KAAKS,KAASR,IAAK,IAAIQ,KAASP,IAAK,IAAI;AACrE,MAAIS,GAAIC,GAAIC;AAeZ,SAdIL,IAAQ,KACVK,IAAM,KAAK,IAAI,IAAI,CAACL,CAAK,IAAIE,GAC7BC,IAAK,KAAK,MAAMP,IAAQS,CAAG,GAC3BD,IAAK,KAAK,MAAMP,IAAOQ,CAAG,GACtBF,IAAKE,IAAMT,KAAO,EAAEO,GACpBC,IAAKC,IAAMR,KAAM,EAAEO,GACvBC,IAAM,CAACA,MAEPA,IAAM,KAAK,IAAI,IAAIL,CAAK,IAAIE,GAC5BC,IAAK,KAAK,MAAMP,IAAQS,CAAG,GAC3BD,IAAK,KAAK,MAAMP,IAAOQ,CAAG,GACtBF,IAAKE,IAAMT,KAAO,EAAEO,GACpBC,IAAKC,IAAMR,KAAM,EAAEO,IAErBA,IAAKD,KAAM,OAAOL,KAASA,IAAQ,IAAUH,EAASC,GAAOC,GAAMC,IAAQ,CAAC,IACzE,CAACK,GAAIC,GAAIC,CAAG;AACrB;AAEe,SAASC,EAAMV,GAAOC,GAAMC,GAAO;AAEhD,MADAD,IAAO,CAACA,GAAMD,IAAQ,CAACA,GAAOE,IAAQ,CAACA,GACnC,EAAEA,IAAQ,WAAW,CAAA;AACzB,MAAIF,MAAUC,EAAM,QAAO,CAACD,CAAK;AACjC,QAAMW,IAAUV,IAAOD,GAAO,CAACO,GAAIC,GAAIC,CAAG,IAAIE,IAAUZ,EAASE,GAAMD,GAAOE,CAAK,IAAIH,EAASC,GAAOC,GAAMC,CAAK;AAClH,MAAI,EAAEM,KAAMD,GAAK,QAAO,CAAA;AACxB,QAAMK,IAAIJ,IAAKD,IAAK,GAAGG,IAAQ,IAAI,MAAME,CAAC;AAC1C,MAAID;AACF,QAAIF,IAAM,EAAG,UAASI,IAAI,GAAGA,IAAID,GAAG,EAAEC,EAAGH,CAAAA,EAAMG,CAAC,KAAKL,IAAKK,KAAK,CAACJ;AAAAA,QAC3D,UAASI,IAAI,GAAGA,IAAID,GAAG,EAAEC,EAAGH,CAAAA,EAAMG,CAAC,KAAKL,IAAKK,KAAKJ;AAAAA,WAEnDA,IAAM,EAAG,UAASI,IAAI,GAAGA,IAAID,GAAG,EAAEC,EAAGH,CAAAA,EAAMG,CAAC,KAAKN,IAAKM,KAAK,CAACJ;AAAAA,MAC3D,UAASI,IAAI,GAAGA,IAAID,GAAG,EAAEC,EAAGH,CAAAA,EAAMG,CAAC,KAAKN,IAAKM,KAAKJ;AAEzD,SAAOC;AACT;AAEO,SAASI,EAAcd,GAAOC,GAAMC,GAAO;AAChD,SAAAD,IAAO,CAACA,GAAMD,IAAQ,CAACA,GAAOE,IAAQ,CAACA,GAChCH,EAASC,GAAOC,GAAMC,CAAK,EAAE,CAAC;AACvC;AAEO,SAASa,EAASf,GAAOC,GAAMC,GAAO;AAC3CD,EAAAA,IAAO,CAACA,GAAMD,IAAQ,CAACA,GAAOE,IAAQ,CAACA;AACvC,QAAMS,IAAUV,IAAOD,GAAOS,IAAME,IAAUG,EAAcb,GAAMD,GAAOE,CAAK,IAAIY,EAAcd,GAAOC,GAAMC,CAAK;AAClH,UAAQS,IAAU,KAAK,MAAMF,IAAM,IAAI,IAAI,CAACA,IAAMA;AACpD;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-array/src/variance.js

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

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/d3-array/src/variance.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"variance.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-array/src/variance.js"],"sourcesContent":["export default function variance(values, valueof) {\n  let count = 0;\n  let delta;\n  let mean = 0;\n  let sum = 0;\n  if (valueof === undefined) {\n    for (let value of values) {\n      if (value != null && (value = +value) >= value) {\n        delta = value - mean;\n        mean += delta / ++count;\n        sum += delta * (value - mean);\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        delta = value - mean;\n        mean += delta / ++count;\n        sum += delta * (value - mean);\n      }\n    }\n  }\n  if (count > 1) return sum / (count - 1);\n}\n"],"names":["variance","values","valueof","count","delta","mean","sum","value"],"mappings":"AAAe,SAASA,EAASC,GAAQC,GAAS;AAChD,MAAIC,IAAQ,GACRC,GACAC,IAAO,GACPC,IAAM;AAER,WAASC,KAASN;AACZM,IAAAA,KAAS,SAASA,IAAQ,CAACA,MAAUA,MACvCH,IAAQG,IAAQF,GAChBA,KAAQD,IAAQ,EAAED,GAClBG,KAAOF,KAASG,IAAQF;AAa9B,MAAIF,IAAQ,EAAG,QAAOG,KAAOH,IAAQ;AACvC;","x_google_ignoreList":[0]}