@milaboratories/graph-maker 1.1.175 → 1.1.177

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

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

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

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

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

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

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

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

@@ -1 +0,0 @@
-{"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/comlink/dist/esm/comlink.js

@@ -1,259 +0,0 @@
-/**
- * @license
- * Copyright 2019 Google LLC
- * SPDX-License-Identifier: Apache-2.0
- */
-const M = Symbol("Comlink.proxy"), O = Symbol("Comlink.endpoint"), z = Symbol("Comlink.releaseProxy"), v = Symbol("Comlink.finalizer"), h = Symbol("Comlink.thrown"), T = (e) => typeof e == "object" && e !== null || typeof e == "function", C = {
-  canHandle: (e) => T(e) && e[M],
-  serialize(e) {
-    const { port1: t, port2: n } = new MessageChannel();
-    return L(e, t), [n, [n]];
-  },
-  deserialize(e) {
-    return e.start(), D(e);
-  }
-}, j = {
-  canHandle: (e) => T(e) && h in e,
-  serialize({ value: e }) {
-    let t;
-    return e instanceof Error ? t = {
-      isError: !0,
-      value: {
-        message: e.message,
-        name: e.name,
-        stack: e.stack
-      }
-    } : t = { isError: !1, value: e }, [t, []];
-  },
-  deserialize(e) {
-    throw e.isError ? Object.assign(new Error(e.value.message), e.value) : e.value;
-  }
-}, A = /* @__PURE__ */ new Map([
-  ["proxy", C],
-  ["throw", j]
-]);
-function N(e, t) {
-  for (const n of e)
-    if (t === n || n === "*" || n instanceof RegExp && n.test(t))
-      return !0;
-  return !1;
-}
-function L(e, t = globalThis, n = ["*"]) {
-  t.addEventListener("message", function f(r) {
-    if (!r || !r.data)
-      return;
-    if (!N(n, r.origin)) {
-      console.warn(`Invalid origin '${r.origin}' for comlink proxy`);
-      return;
-    }
-    const { id: i, type: g, path: c } = Object.assign({ path: [] }, r.data), u = (r.data.argumentList || []).map(p);
-    let a;
-    try {
-      const s = c.slice(0, -1).reduce((o, y) => o[y], e), l = c.reduce((o, y) => o[y], e);
-      switch (g) {
-        case "GET":
-          a = l;
-          break;
-        case "SET":
-          s[c.slice(-1)[0]] = p(r.data.value), a = !0;
-          break;
-        case "APPLY":
-          a = l.apply(s, u);
-          break;
-        case "CONSTRUCT":
-          {
-            const o = new l(...u);
-            a = U(o);
-          }
-          break;
-        case "ENDPOINT":
-          {
-            const { port1: o, port2: y } = new MessageChannel();
-            L(e, y), a = G(o, [o]);
-          }
-          break;
-        case "RELEASE":
-          a = void 0;
-          break;
-        default:
-          return;
-      }
-    } catch (s) {
-      a = { value: s, [h]: 0 };
-    }
-    Promise.resolve(a).catch((s) => ({ value: s, [h]: 0 })).then((s) => {
-      const [l, o] = w(s);
-      t.postMessage(Object.assign(Object.assign({}, l), { id: i }), o), g === "RELEASE" && (t.removeEventListener("message", f), P(t), v in e && typeof e[v] == "function" && e[v]());
-    }).catch((s) => {
-      const [l, o] = w({
-        value: new TypeError("Unserializable return value"),
-        [h]: 0
-      });
-      t.postMessage(Object.assign(Object.assign({}, l), { id: i }), o);
-    });
-  }), t.start && t.start();
-}
-function H(e) {
-  return e.constructor.name === "MessagePort";
-}
-function P(e) {
-  H(e) && e.close();
-}
-function D(e, t) {
-  const n = /* @__PURE__ */ new Map();
-  return e.addEventListener("message", function(f) {
-    const { data: r } = f;
-    if (!r || !r.id)
-      return;
-    const i = n.get(r.id);
-    if (i)
-      try {
-        i(r);
-      } finally {
-        n.delete(r.id);
-      }
-  }), S(e, n, [], t);
-}
-function d(e) {
-  if (e)
-    throw new Error("Proxy has been released and is not useable");
-}
-function R(e) {
-  return m(e, /* @__PURE__ */ new Map(), {
-    type: "RELEASE"
-  }).then(() => {
-    P(e);
-  });
-}
-const E = /* @__PURE__ */ new WeakMap(), b = "FinalizationRegistry" in globalThis && new FinalizationRegistry((e) => {
-  const t = (E.get(e) || 0) - 1;
-  E.set(e, t), t === 0 && R(e);
-});
-function I(e, t) {
-  const n = (E.get(t) || 0) + 1;
-  E.set(t, n), b && b.register(e, t, e);
-}
-function W(e) {
-  b && b.unregister(e);
-}
-function S(e, t, n = [], f = function() {
-}) {
-  let r = !1;
-  const i = new Proxy(f, {
-    get(g, c) {
-      if (d(r), c === z)
-        return () => {
-          W(i), R(e), t.clear(), r = !0;
-        };
-      if (c === "then") {
-        if (n.length === 0)
-          return { then: () => i };
-        const u = m(e, t, {
-          type: "GET",
-          path: n.map((a) => a.toString())
-        }).then(p);
-        return u.then.bind(u);
-      }
-      return S(e, t, [...n, c]);
-    },
-    set(g, c, u) {
-      d(r);
-      const [a, s] = w(u);
-      return m(e, t, {
-        type: "SET",
-        path: [...n, c].map((l) => l.toString()),
-        value: a
-      }, s).then(p);
-    },
-    apply(g, c, u) {
-      d(r);
-      const a = n[n.length - 1];
-      if (a === O)
-        return m(e, t, {
-          type: "ENDPOINT"
-        }).then(p);
-      if (a === "bind")
-        return S(e, t, n.slice(0, -1));
-      const [s, l] = k(u);
-      return m(e, t, {
-        type: "APPLY",
-        path: n.map((o) => o.toString()),
-        argumentList: s
-      }, l).then(p);
-    },
-    construct(g, c) {
-      d(r);
-      const [u, a] = k(c);
-      return m(e, t, {
-        type: "CONSTRUCT",
-        path: n.map((s) => s.toString()),
-        argumentList: u
-      }, a).then(p);
-    }
-  });
-  return I(i, e), i;
-}
-function F(e) {
-  return Array.prototype.concat.apply([], e);
-}
-function k(e) {
-  const t = e.map(w);
-  return [t.map((n) => n[0]), F(t.map((n) => n[1]))];
-}
-const x = /* @__PURE__ */ new WeakMap();
-function G(e, t) {
-  return x.set(e, t), e;
-}
-function U(e) {
-  return Object.assign(e, { [M]: !0 });
-}
-function w(e) {
-  for (const [t, n] of A)
-    if (n.canHandle(e)) {
-      const [f, r] = n.serialize(e);
-      return [
-        {
-          type: "HANDLER",
-          name: t,
-          value: f
-        },
-        r
-      ];
-    }
-  return [
-    {
-      type: "RAW",
-      value: e
-    },
-    x.get(e) || []
-  ];
-}
-function p(e) {
-  switch (e.type) {
-    case "HANDLER":
-      return A.get(e.name).deserialize(e.value);
-    case "RAW":
-      return e.value;
-  }
-}
-function m(e, t, n, f) {
-  return new Promise((r) => {
-    const i = _();
-    t.set(i, r), e.start && e.start(), e.postMessage(Object.assign({ id: i }, n), f);
-  });
-}
-function _() {
-  return new Array(4).fill(0).map(() => Math.floor(Math.random() * Number.MAX_SAFE_INTEGER).toString(16)).join("-");
-}
-export {
-  O as createEndpoint,
-  L as expose,
-  v as finalizer,
-  U as proxy,
-  M as proxyMarker,
-  z as releaseProxy,
-  G as transfer,
-  A as transferHandlers,
-  D as wrap
-};
-//# sourceMappingURL=comlink.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/comlink/dist/esm/comlink.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"comlink.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/comlink/src/comlink.ts"],"sourcesContent":[null],"names":["proxyMarker","createEndpoint","releaseProxy","finalizer","throwMarker","isObject","val","proxyTransferHandler","obj","port1","port2","expose","port","wrap","throwTransferHandler","value","serialized","transferHandlers","isAllowedOrigin","allowedOrigins","origin","allowedOrigin","ep","callback","ev","id","type","path","argumentList","fromWireValue","returnValue","parent","prop","rawValue","proxy","transfer","wireValue","transferables","toWireValue","closeEndPoint","error","isMessagePort","endpoint","target","pendingListeners","data","resolver","createProxy","throwIfProxyReleased","isReleased","releaseEndpoint","requestResponseMessage","proxyCounter","proxyFinalizers","newCount","registerProxy","unregisterProxy","isProxyReleased","_target","r","p","_thisArg","rawArgumentList","last","processArguments","myFlat","arr","processed","v","transferCache","transfers","name","handler","serializedValue","msg","resolve","generateUUID"],"mappings":"AAAA;AAAA;AAAA;AAAA;AAAA;AAiBa,MAAAA,IAAc,OAAO,eAAe,GACpCC,IAAiB,OAAO,kBAAkB,GAC1CC,IAAe,OAAO,sBAAsB,GAC5CC,IAAY,OAAO,mBAAmB,GAE7CC,IAAc,OAAO,gBAAgB,GAuJrCC,IAAW,CAACC,MACf,OAAOA,KAAQ,YAAYA,MAAQ,QAAS,OAAOA,KAAQ,YAkCxDC,IAA6D;AAAA,EACjE,WAAW,CAACD,MACVD,EAASC,CAAG,KAAMA,EAAoBN,CAAW;AAAA,EACnD,UAAUQ,GAAG;AACX,UAAM,EAAE,OAAAC,GAAO,OAAAC,EAAAA,IAAU,IAAI,eAAA;AAC7B,WAAAC,EAAOH,GAAKC,CAAK,GACV,CAACC,GAAO,CAACA,CAAK,CAAC;AAAA,EACvB;AAAA,EACD,YAAYE,GAAI;AACd,WAAAA,EAAK,SACEC,EAAKD,CAAI;AAAA,EACjB;GAkBGE,IAGF;AAAA,EACF,WAAW,CAACC,MACVV,EAASU,CAAK,KAAKX,KAAeW;AAAAA,EACpC,UAAU,EAAE,OAAAA,KAAO;AACjB,QAAIC;AACJ,WAAID,aAAiB,QACnBC,IAAa;AAAA,MACX,SAAS;AAAA,MACT,OAAO;AAAA,QACL,SAASD,EAAM;AAAA,QACf,MAAMA,EAAM;AAAA,QACZ,OAAOA,EAAM;AAAA,MAAA;AAAA,IACd,IAGHC,IAAa,EAAE,SAAS,IAAO,OAAAD,EAAAA,GAE1B,CAACC,GAAY,EAAE;AAAA,EACvB;AAAA,EACD,YAAYA,GAAU;AACpB,UAAIA,EAAW,UACP,OAAO,OACX,IAAI,MAAMA,EAAW,MAAM,OAAO,GAClCA,EAAW,KAAK,IAGdA,EAAW;AAAA,EAClB;AAMUC,GAAAA,wBAAuB,IAGlC;AAAA,EACA,CAAC,SAASV,CAAoB;AAAA,EAC9B,CAAC,SAASO,CAAoB;AAC/B,CAAA;AAED,SAASI,EACPC,GACAC,GAAc;AAEd,aAAWC,KAAiBF;AAI1B,QAHIC,MAAWC,KAAiBA,MAAkB,OAG9CA,aAAyB,UAAUA,EAAc,KAAKD,CAAM;AAC9D,aAAO;AAGX,SAAO;AACT;AAEM,SAAUT,EACdH,GACAc,IAAe,YACfH,IAAsC,CAAC,GAAG,GAAC;AAE3CG,IAAG,iBAAiB,WAAW,SAASC,EAASC,GAAgB;AAC/D,QAAI,CAACA,KAAM,CAACA,EAAG;AACb;AAEF,QAAI,CAACN,EAAgBC,GAAgBK,EAAG,MAAM,GAAG;AAC/C,cAAQ,KAAK,mBAAmBA,EAAG,MAAM,qBAAqB;AAC9D;AAAA,IACD;AACD,UAAM,EAAE,IAAAC,GAAI,MAAAC,GAAM,MAAAC,MAAM,OAAA,OAAA,EACtB,MAAM,GAAA,GACFH,EAAG,IAAgB,GAEnBI,KAAgBJ,EAAG,KAAK,gBAAgB,CAAA,GAAI,IAAIK,CAAa;AACnE,QAAIC;AACJ,QAAI;AACF,YAAMC,IAASJ,EAAK,MAAM,GAAG,EAAE,EAAE,OAAO,CAACnB,GAAKwB,MAASxB,EAAIwB,CAAI,GAAGxB,CAAG,GAC/DyB,IAAWN,EAAK,OAAO,CAACnB,GAAKwB,MAASxB,EAAIwB,CAAI,GAAGxB,CAAG;AAC1D,cAAQkB,GAAAA;AAAAA,QACN,KAAA;AAEII,UAAAA,IAAcG;AAEhB;AAAA,QACF,KAAA;AAEIF,UAAAA,EAAOJ,EAAK,MAAM,EAAE,EAAE,CAAC,CAAC,IAAIE,EAAcL,EAAG,KAAK,KAAK,GACvDM,IAAc;AAEhB;AAAA,QACF,KAAA;AAEIA,UAAAA,IAAcG,EAAS,MAAMF,GAAQH,CAAY;AAEnD;AAAA,QACF,KAAA;AACE;AACE,kBAAMb,IAAQ,IAAIkB,EAAS,GAAGL,CAAY;AAC1CE,YAAAA,IAAcI,EAAMnB,CAAK;AAAA,UAC1B;AACD;AAAA,QACF,KAAA;AACE;AACE,kBAAM,EAAE,OAAAN,GAAO,OAAAC,EAAAA,IAAU,IAAI,eAAA;AAC7BC,YAAAA,EAAOH,GAAKE,CAAK,GACjBoB,IAAcK,EAAS1B,GAAO,CAACA,CAAK,CAAC;AAAA,UACtC;AACD;AAAA,QACF,KAAA;AAEIqB,UAAAA,IAAc;AAEhB;AAAA,QACF;AACE;AAAA,MAAA;AAAA,IAEL,SAAQf,GAAO;AACde,MAAAA,IAAc,EAAE,OAAAf,GAAO,CAACX,CAAW,GAAG,EAAA;AAAA,IACvC;AACD,YAAQ,QAAQ0B,CAAW,EACxB,MAAM,CAACf,OACC,EAAE,OAAAA,GAAO,CAACX,CAAW,GAAG,EAAA,EAChC,EACA,KAAK,CAAC0B,MAAe;AACpB,YAAM,CAACM,GAAWC,CAAa,IAAIC,EAAYR,CAAW;AAC1DR,QAAG,YAAiB,OAAA,OAAA,OAAA,OAAA,CAAA,GAAAc,CAAS,GAAA,EAAE,IAAAX,EAAAA,CAAE,GAAIY,CAAa,GAC9CX,MAAI,cAENJ,EAAG,oBAAoB,WAAWC,CAAe,GACjDgB,EAAcjB,CAAE,GACZnB,KAAaK,KAAO,OAAOA,EAAIL,CAAS,KAAM,cAChDK,EAAIL,CAAS;IAGnB,CAAC,EACA,MAAM,CAACqC,MAAS;AAEf,YAAM,CAACJ,GAAWC,CAAa,IAAIC,EAAY;AAAA,QAC7C,OAAO,IAAI,UAAU,6BAA6B;AAAA,QAClD,CAAClC,CAAW,GAAG;AAAA,MAAA,CAChB;AACDkB,QAAG,YAAiB,OAAA,OAAA,OAAA,OAAA,IAAAc,CAAS,GAAA,EAAE,IAAAX,EAAAA,CAAE,GAAIY,CAAa;AAAA,IACpD,CAAC;AAAA,EACL,CAAQ,GACJf,EAAG,SACLA,EAAG,MAAA;AAEP;AAEA,SAASmB,EAAcC,GAAkB;AACvC,SAAOA,EAAS,YAAY,SAAS;AACvC;AAEA,SAASH,EAAcG,GAAkB;AACnCD,EAAAA,EAAcC,CAAQ,KAAGA,EAAS,MAAA;AACxC;AAEgB,SAAA7B,EAAQS,GAAcqB,GAAY;AAChD,QAAMC,wBAA6C,IAAA;AAEnD,SAAAtB,EAAG,iBAAiB,WAAW,SAAuBE,GAAS;AAC7D,UAAM,EAAE,MAAAqB,EAAAA,IAASrB;AACjB,QAAI,CAACqB,KAAQ,CAACA,EAAK;AACjB;AAEF,UAAMC,IAAWF,EAAiB,IAAIC,EAAK,EAAE;AAC7C,QAAKC;AAIL,UAAI;AACFA,QAAAA,EAASD,CAAI;AAAA,MACd,UAAA;AACCD,QAAAA,EAAiB,OAAOC,EAAK,EAAE;AAAA,MAChC;AAAA,EACH,CAAC,GAEME,EAAezB,GAAIsB,GAAkB,CAAA,GAAID,CAAM;AACxD;AAEA,SAASK,EAAqBC,GAAmB;AAC/C,MAAIA;AACF,UAAM,IAAI,MAAM,4CAA4C;AAEhE;AAEA,SAASC,EAAgB5B,GAAY;AACnC,SAAO6B,EAAuB7B,GAAI,oBAAI,OAAO;AAAA,IAC3C,MAAyB;AAAA,EAAA,CAC1B,EAAE,KAAK,MAAK;AACXiB,IAAAA,EAAcjB,CAAE;AAAA,EAClB,CAAC;AACH;AAaA,MAAM8B,IAAe,oBAAI,QAAA,GACnBC,IACJ,0BAA0B,cAC1B,IAAI,qBAAqB,CAAC/B,MAAgB;AACxC,QAAMgC,KAAYF,EAAa,IAAI9B,CAAE,KAAK,KAAK;AAC/C8B,IAAa,IAAI9B,GAAIgC,CAAQ,GACzBA,MAAa,KACfJ,EAAgB5B,CAAE;AAEtB,CAAC;AAEH,SAASiC,EAAcrB,GAAeZ,GAAY;AAChD,QAAMgC,KAAYF,EAAa,IAAI9B,CAAE,KAAK,KAAK;AAC/C8B,IAAa,IAAI9B,GAAIgC,CAAQ,GACzBD,KACFA,EAAgB,SAASnB,GAAOZ,GAAIY,CAAK;AAE7C;AAEA,SAASsB,EAAgBtB,GAAa;AAChCmB,OACFA,EAAgB,WAAWnB,CAAK;AAEpC;AAEA,SAASa,EACPzB,GACAsB,GACAjB,IAAqC,CAAA,GACrCgB,IAAiB,WAAA;AAAc,GAAA;AAE/B,MAAIc,IAAkB;AACtB,QAAMvB,IAAQ,IAAI,MAAMS,GAAQ;AAAA,IAC9B,IAAIe,GAAS1B,GAAI;AAEf,UADAgB,EAAqBS,CAAe,GAChCzB,MAAS9B;AACX,eAAO,MAAK;AACVsD,UAAAA,EAAgBtB,CAAK,GACrBgB,EAAgB5B,CAAE,GAClBsB,EAAiB,SACjBa,IAAkB;AAAA,QACpB;AAEF,UAAIzB,MAAS,QAAQ;AACnB,YAAIL,EAAK,WAAW;AAClB,iBAAO,EAAE,MAAM,MAAMO,EAAAA;AAEvB,cAAMyB,IAAIR,EAAuB7B,GAAIsB,GAAkB;AAAA,UACrD,MAAqB;AAAA,UACrB,MAAMjB,EAAK,IAAI,CAACiC,MAAMA,EAAE,SAAA,CAAU;AAAA,QAAA,CACnC,EAAE,KAAK/B,CAAa;AACrB,eAAO8B,EAAE,KAAK,KAAKA,CAAC;AAAA,MACrB;AACD,aAAOZ,EAAYzB,GAAIsB,GAAkB,CAAC,GAAGjB,GAAMK,CAAI,CAAC;AAAA,IACzD;AAAA,IACD,IAAI0B,GAAS1B,GAAMC,GAAQ;AACzBe,MAAAA,EAAqBS,CAAe;AAGpC,YAAM,CAAC1C,GAAOsB,CAAa,IAAIC,EAAYL,CAAQ;AACnD,aAAOkB,EACL7B,GACAsB,GACA;AAAA,QACE,MAAqB;AAAA,QACrB,MAAM,CAAC,GAAGjB,GAAMK,CAAI,EAAE,IAAI,CAAC4B,MAAMA,EAAE,UAAU;AAAA,QAC7C,OAAA7C;AAAAA,MAAA,GAEFsB,CAAa,EACb,KAAKR,CAAa;AAAA,IACrB;AAAA,IACD,MAAM6B,GAASG,GAAUC,GAAe;AACtCd,MAAAA,EAAqBS,CAAe;AACpC,YAAMM,IAAOpC,EAAKA,EAAK,SAAS,CAAC;AACjC,UAAKoC,MAAiB9D;AACpB,eAAOkD,EAAuB7B,GAAIsB,GAAkB;AAAA,UAClD,MAA0B;AAAA,QAAA,CAC3B,EAAE,KAAKf,CAAa;AAGvB,UAAIkC,MAAS;AACX,eAAOhB,EAAYzB,GAAIsB,GAAkBjB,EAAK,MAAM,GAAG,EAAE,CAAC;AAE5D,YAAM,CAACC,GAAcS,CAAa,IAAI2B,EAAiBF,CAAe;AACtE,aAAOX,EACL7B,GACAsB,GACA;AAAA,QACE,MAAuB;AAAA,QACvB,MAAMjB,EAAK,IAAI,CAACiC,MAAMA,EAAE,UAAU;AAAA,QAClC,cAAAhC;AAAAA,MAAA,GAEFS,CAAa,EACb,KAAKR,CAAa;AAAA,IACrB;AAAA,IACD,UAAU6B,GAASI,GAAe;AAChCd,MAAAA,EAAqBS,CAAe;AACpC,YAAM,CAAC7B,GAAcS,CAAa,IAAI2B,EAAiBF,CAAe;AACtE,aAAOX,EACL7B,GACAsB,GACA;AAAA,QACE,MAA2B;AAAA,QAC3B,MAAMjB,EAAK,IAAI,CAACiC,MAAMA,EAAE,UAAU;AAAA,QAClC,cAAAhC;AAAAA,MAAA,GAEFS,CAAa,EACb,KAAKR,CAAa;AAAA,IACrB;AAAA,EAAA,CACF;AACD,SAAA0B,EAAcrB,GAAOZ,CAAE,GAChBY;AACT;AAEA,SAAS+B,EAAUC,GAAgB;AACjC,SAAO,MAAM,UAAU,OAAO,MAAM,CAAA,GAAIA,CAAG;AAC7C;AAEA,SAASF,EAAiBpC,GAAmB;AAC3C,QAAMuC,IAAYvC,EAAa,IAAIU,CAAW;AAC9C,SAAO,CAAC6B,EAAU,IAAI,CAACC,MAAMA,EAAE,CAAC,CAAC,GAAGH,EAAOE,EAAU,IAAI,CAACC,MAAMA,EAAE,CAAC,CAAC,CAAC,CAAC;AACxE;AAEA,MAAMC,wBAAoB,QAAA;AACV,SAAAlC,EAAY3B,GAAQ8D,GAAyB;AAC3D,SAAAD,EAAc,IAAI7D,GAAK8D,CAAS,GACzB9D;AACT;AAEM,SAAU0B,EAAoB1B,GAAM;AACxC,SAAO,OAAO,OAAOA,GAAK,EAAE,CAACR,CAAW,GAAG,IAAM;AACnD;AAeA,SAASsC,EAAYvB,GAAU;AAC7B,aAAW,CAACwD,GAAMC,CAAO,KAAKvD;AAC5B,QAAIuD,EAAQ,UAAUzD,CAAK,GAAG;AAC5B,YAAM,CAAC0D,GAAiBpC,CAAa,IAAImC,EAAQ,UAAUzD,CAAK;AAChE,aAAO;AAAA,QACL;AAAA,UACE,MAA2B;AAAA,UAC3B,MAAAwD;AAAAA,UACA,OAAOE;AAAAA,QAAA;AAAA,QAETpC;AAAAA,MAAA;AAAA,IAEH;AAEH,SAAO;AAAA,IACL;AAAA,MACE,MAAuB;AAAA,MACvB,OAAAtB;AAAAA,IAAA;AAAA,IAEFsD,EAAc,IAAItD,CAAK,KAAK,CAAA;AAAA,EAAA;AAEhC;AAEA,SAASc,EAAcd,GAAgB;AACrC,UAAQA,EAAM,MAAA;AAAA,IACZ,KAAA;AACE,aAAOE,EAAiB,IAAIF,EAAM,IAAI,EAAG,YAAYA,EAAM,KAAK;AAAA,IAClE,KAAA;AACE,aAAOA,EAAM;AAAA,EAAA;AAEnB;AAEA,SAASoC,EACP7B,GACAsB,GACA8B,GACAJ,GAA0B;AAE1B,SAAO,IAAI,QAAQ,CAACK,MAAW;AAC7B,UAAMlD,IAAKmD,EAAAA;AACXhC,MAAiB,IAAInB,GAAIkD,CAAO,GAC5BrD,EAAG,SACLA,EAAG,MAAA,GAELA,EAAG,YAAc,OAAA,OAAA,EAAA,IAAAG,KAAOiD,CAAG,GAAIJ,CAAS;AAAA,EAC5C,CAAC;AACD;AAEA,SAASM,IAAY;AACnB,SAAO,IAAI,MAAM,CAAC,EACf,KAAK,CAAC,EACN,IAAI,MAAM,KAAK,MAAM,KAAK,OAAA,IAAW,OAAO,gBAAgB,EAAE,SAAS,EAAE,CAAC,EAC1E,KAAK,GAAG;AACb;","x_google_ignoreList":[0]}

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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