@milaboratories/graph-maker 1.1.131 → 1.1.133

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/utils-type-of/lib/fixtures/typedarray.js

@@ -0,0 +1,22 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2018 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+var r = Int8Array, a = r;
+export {
+  a as t
+};
+//# sourceMappingURL=typedarray.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/utils-type-of/lib/fixtures/typedarray.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"typedarray.js","sources":["../../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/@stdlib/utils-type-of/lib/fixtures/typedarray.js"],"sourcesContent":["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\nvar typedarray = Int8Array; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = typedarray;\n"],"names":["typedarray","typedarray_1"],"mappings":";;;;;;;;;;;;;;;;;AAoBA,IAAIA,IAAa,WAKjBC,IAAiBD;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/utils-type-of/lib/index.js

@@ -0,0 +1,25 @@
+import { c as m } from "./check.js";
+import { m as o } from "./main.js";
+import { p as r } from "./polyfill.js";
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2018 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+var p = m, a = o, s = r, f = p() ? s : a, v = f;
+export {
+  v as l
+};
+//# sourceMappingURL=index.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/utils-type-of/lib/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/@stdlib/utils-type-of/lib/index.js"],"sourcesContent":["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Determine a value's type.\n*\n* @module @stdlib/utils-type-of\n*\n* @example\n* var typeOf = require( '@stdlib/utils-type-of' );\n*\n* var str = typeOf( 'a' );\n* // returns 'string'\n*\n* str = typeOf( 5 );\n* // returns 'number'\n*/\n\n// MODULES //\n\nvar usePolyfill = require( './check.js' );\nvar builtin = require( './main.js' );\nvar polyfill = require( './polyfill.js' );\n\n\n// MAIN //\n\nvar main = ( usePolyfill() ) ? polyfill : builtin;\n\n\n// EXPORTS //\n\nmodule.exports = main;\n"],"names":["usePolyfill","require$$0","builtin","require$$1","polyfill","require$$2","main","lib"],"mappings":";;;;;;;;;;;;;;;;;;;;AAqCA,IAAIA,IAAcC,GACdC,IAAUC,GACVC,IAAWC,GAKXC,IAASN,EAAAA,IAAkBI,IAAWF,GAK1CK,IAAiBD;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/utils-type-of/lib/main.js

@@ -0,0 +1,28 @@
+import { l as a } from "../../utils-constructor-name/lib/index.js";
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2018 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+var r = a;
+function e(o) {
+  var t;
+  return o === null ? "null" : (t = typeof o, t === "object" ? r(o).toLowerCase() : t);
+}
+var n = e;
+export {
+  n as m
+};
+//# sourceMappingURL=main.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/utils-type-of/lib/main.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"main.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/@stdlib/utils-type-of/lib/main.js"],"sourcesContent":["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar ctorName = require( '@stdlib/utils-constructor-name' );\n\n\n// NOTES //\n\n/*\n* Built-in `typeof` operator behavior:\n*\n* ```text\n* typeof null => 'object'\n* typeof undefined => 'undefined'\n* typeof 'a' => 'string'\n* typeof 5 => 'number'\n* typeof NaN => 'number'\n* typeof true => 'boolean'\n* typeof false => 'boolean'\n* typeof {} => 'object'\n* typeof [] => 'object'\n* typeof function foo(){} => 'function'\n* typeof function* foo(){} => 'object'\n* typeof Symbol() => 'symbol'\n* ```\n*\n*/\n\n\n// MAIN //\n\n/**\n* Determines a value's type.\n*\n* @param {*} v - input value\n* @returns {string} string indicating the value's type\n*/\nfunction typeOf( v ) {\n\tvar type;\n\n\t// Address `typeof null` => `object` (see http://wiki.ecmascript.org/doku.php?id=harmony:typeof_null):\n\tif ( v === null ) {\n\t\treturn 'null';\n\t}\n\ttype = typeof v;\n\n\t// If the `typeof` operator returned something other than `object`, we are done. Otherwise, we need to check for an internal class name or search for a constructor.\n\tif ( type === 'object' ) {\n\t\treturn ctorName( v ).toLowerCase();\n\t}\n\treturn type;\n}\n\n\n// EXPORTS //\n\nmodule.exports = typeOf;\n"],"names":["ctorName","require$$0","typeOf","v","type","main"],"mappings":";;;;;;;;;;;;;;;;;;AAsBA,IAAIA,IAAWC;AAkCf,SAASC,EAAQC,GAAI;AACpB,MAAIC;AAGJ,SAAKD,MAAM,OACH,UAERC,IAAO,OAAOD,GAGTC,MAAS,WACNJ,EAAUG,CAAC,EAAG,YAAA,IAEfC;AACR;AAKA,IAAAC,IAAiBH;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/utils-type-of/lib/polyfill.js

@@ -0,0 +1,27 @@
+import { l as a } from "../../utils-constructor-name/lib/index.js";
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2018 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+var o = a;
+function t(r) {
+  return o(r).toLowerCase();
+}
+var i = t;
+export {
+  i as p
+};
+//# sourceMappingURL=polyfill.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/utils-type-of/lib/polyfill.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"polyfill.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/@stdlib/utils-type-of/lib/polyfill.js"],"sourcesContent":["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar ctorName = require( '@stdlib/utils-constructor-name' );\n\n\n// MAIN //\n\n/**\n* Determines a value's type.\n*\n* @param {*} v - input value\n* @returns {string} string indicating the value's type\n*/\nfunction typeOf( v ) {\n\treturn ctorName( v ).toLowerCase();\n}\n\n\n// EXPORTS //\n\nmodule.exports = typeOf;\n"],"names":["ctorName","require$$0","typeOf","v","polyfill"],"mappings":";;;;;;;;;;;;;;;;;;AAsBA,IAAIA,IAAWC;AAWf,SAASC,EAAQC,GAAI;AACpB,SAAOH,EAAUG,CAAC,EAAG,YAAA;AACtB;AAKA,IAAAC,IAAiBF;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,5 @@
+var r = Array.prototype, a = r.slice;
+export {
+  a as slice
+};
+//# sourceMappingURL=array.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"array.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-array/src/array.js"],"sourcesContent":["var array = Array.prototype;\n\nexport var slice = array.slice;\nexport var map = array.map;\n"],"names":["array","slice"],"mappings":"AAAA,IAAIA,IAAQ,MAAM,WAEPC,IAAQD,EAAM;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,7 @@
+function t(u, a) {
+  return u == null || a == null ? NaN : u < a ? -1 : u > a ? 1 : u >= a ? 0 : NaN;
+}
+export {
+  t as default
+};
+//# sourceMappingURL=ascending.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"ascending.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-array/src/ascending.js"],"sourcesContent":["export default function ascending(a, b) {\n  return a == null || b == null ? NaN : a < b ? -1 : a > b ? 1 : a >= b ? 0 : NaN;\n}\n"],"names":["ascending","a","b"],"mappings":"AAAe,SAASA,EAAUC,GAAGC,GAAG;AACtC,SAAOD,KAAK,QAAQC,KAAK,OAAO,MAAMD,IAAIC,IAAI,KAAKD,IAAIC,IAAI,IAAID,KAAKC,IAAI,IAAI;AAC9E;","x_google_ignoreList":[0]}

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"bin.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/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","a","b","bins","j","bisect","_","constant","slice"],"mappings":";;;;;;;;AASe,SAASA,IAAM;AAC5B,MAAIC,IAAQC,GACRC,IAASC,GACTC,IAAYC;AAEhB,WAASC,EAAUC,GAAM;AAClB,UAAM,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;AACnBI,MAAAA,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;AACjC,mBAASP,CAAI,MACXA,IAAO,IACTI,KAAM,KAAK,MAAMA,IAAKJ,CAAI,IAAI,KAAKA,IAC1BA,IAAO,MAChBI,KAAM,KAAK,KAAKA,IAAK,CAACJ,CAAI,IAAI,KAAK,CAACA;AAAAA,QAG1C;AACEK,YAAG,IAAA;AAAA,IAGT;AAKA,aADIM,IAAIN,EAAG,QAAQO,IAAI,GAAGC,IAAIF,GACvBN,EAAGO,CAAC,KAAKT,IAAI,GAAES;AACtB,WAAOP,EAAGQ,IAAI,CAAC,IAAIT,IAAI,GAAES;AACzB,KAAID,KAAKC,IAAIF,OAAGN,IAAKA,EAAG,MAAMO,GAAGC,CAAC,GAAGF,IAAIE,IAAID;AAE7C,QAAIE,IAAO,IAAI,MAAMH,IAAI,CAAC,GACtBvB;AAGJ,SAAKS,IAAI,GAAGA,KAAKc,GAAG,EAAEd;AACpBT,MAAAA,IAAM0B,EAAKjB,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,KAC7CU,EAAK,KAAK,IAAIH,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,kBAAMW,IAAI,KAAK,OAAOZ,IAAKJ,KAAKC,CAAI;AACpCc,cAAK,KAAK,IAAIH,GAAGI,KAAKV,EAAGU,CAAC,KAAKhB,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,KAC7CU,EAAKE,EAAOX,GAAIN,GAAG,GAAGY,CAAC,CAAC,EAAE,KAAKf,EAAKC,CAAC,CAAC;AAK5C,WAAOiB;AAAAA,EACT;AAEA,SAAAnB,EAAU,QAAQ,SAASsB,GAAG;AAC5B,WAAO,UAAU,UAAU5B,IAAQ,OAAO4B,KAAM,aAAaA,IAAIC,EAASD,CAAC,GAAGtB,KAAaN;AAAAA,EAC7F,GAEAM,EAAU,SAAS,SAASsB,GAAG;AAC7B,WAAO,UAAU,UAAU1B,IAAS,OAAO0B,KAAM,aAAaA,IAAIC,EAAS,CAACD,EAAE,CAAC,GAAGA,EAAE,CAAC,CAAC,CAAC,GAAGtB,KAAaJ;AAAAA,EACzG,GAEAI,EAAU,aAAa,SAASsB,GAAG;AACjC,WAAO,UAAU,UAAUxB,IAAY,OAAOwB,KAAM,aAAaA,IAAIC,EAAS,MAAM,QAAQD,CAAC,IAAIE,EAAM,KAAKF,CAAC,IAAIA,CAAC,GAAGtB,KAAaF;AAAAA,EACpI,GAEOE;AACT;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,10 @@
+import r from "./ascending.js";
+import t from "./bisector.js";
+import o from "./number.js";
+const i = t(r), f = i.right;
+t(o).center;
+export {
+  f as bisectRight,
+  f as default
+};
+//# sourceMappingURL=bisect.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"bisect.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/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","number"],"mappings":";;;AAIA,MAAMA,IAAkBC,EAASC,CAAS,GAC7BC,IAAcH,EAAgB;AAEfC,EAASG,CAAM,EAAE;","x_google_ignoreList":[0]}

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"bisector.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/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","i"],"mappings":";;AAGe,SAASA,EAASC,GAAG;AAClC,MAAIC,GAAUC,GAAUC;AAOpBH,EAAAA,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;AACtBV,QAAAA,EAASQ,EAAEG,CAAG,GAAGP,CAAC,IAAI,IAAGK,IAAKE,IAAM,IACnCD,IAAKC;AAAAA,MACZ,SAASF,IAAKC;AAAAA,IAChB;AACA,WAAOD;AAAAA,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;AACtBV,QAAAA,EAASQ,EAAEG,CAAG,GAAGP,CAAC,KAAK,IAAGK,IAAKE,IAAM,IACpCD,IAAKC;AAAAA,MACZ,SAASF,IAAKC;AAAAA,IAChB;AACA,WAAOD;AAAAA,EACT;AAEA,WAASI,EAAOL,GAAGJ,GAAGK,IAAK,GAAGC,IAAKF,EAAE,QAAQ;AAC3C,UAAMM,IAAIP,EAAKC,GAAGJ,GAAGK,GAAIC,IAAK,CAAC;AAC/B,WAAOI,IAAIL,KAAMR,EAAMO,EAAEM,IAAI,CAAC,GAAGV,CAAC,IAAI,CAACH,EAAMO,EAAEM,CAAC,GAAGV,CAAC,IAAIU,IAAI,IAAIA;AAAA,EAClE;AAEA,SAAO,EAAC,MAAAP,GAAM,QAAAM,GAAQ,OAAAD,EAAAA;AACxB;AAEA,SAASN,IAAO;AACd,SAAO;AACT;","x_google_ignoreList":[0]}

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

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

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

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"count.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/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;AACZE,SAAS,SAASA,IAAQ,CAACA,MAAUA,KACvC,EAAEH;AAWR,SAAOA;AACT;","x_google_ignoreList":[0]}

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

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

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

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"deviation.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/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,CAAe;AAClC,SAAOE,KAAI,KAAK,KAAKA,CAAC;AACxB;","x_google_ignoreList":[0]}

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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