@milaboratories/graph-maker 1.1.138 → 1.1.140

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@milaboratories/graph-maker",
-  "version": "1.1.138",
+  "version": "1.1.140",
   "type": "module",
   "main": "dist/lib.js",
   "types": "dist/lib.d.ts",
@@ -37,8 +37,8 @@
   "dependencies": {
     "@ag-grid-community/core": "^32.3.3",
     "@milaboratories/helpers": "^1.6.15",
-    "@milaboratories/miplots4": "^1.0.129",
-    "@milaboratories/pf-plots": "^1.1.25",
+    "@milaboratories/miplots4": "^1.0.133",
+    "@milaboratories/pf-plots": "^1.1.27",
     "@platforma-sdk/model": "^1.39.8",
     "@platforma-sdk/ui-vue": "^1.39.16",
     "@types/d3-hierarchy": "^3.1.7",

package/dist/node_modules/@milaboratories/miplots4/dist/bubble/getCells.js

@@ -1,91 +0,0 @@
-import M from "../node_modules/lodash/lodash.js";
-import j from "../node_modules/d3-array/src/deviation.js";
-import $ from "../node_modules/d3-array/src/mean.js";
-import q from "../node_modules/d3-array/src/extent.js";
-const _ = 1e6;
-function D(s) {
-  const r = j(s), n = $(s);
-  return r === void 0 || n === void 0 || r === 0 ? (u) => u : (u) => (u - n) / r;
-}
-function F(s) {
-  const r = $(s), [n, u] = q(s);
-  return r === void 0 || n === void 0 || u === void 0 ? (y) => y : (y) => (y - r) / (u - n);
-}
-function N(s, r) {
-  return s === "standardScaling" ? D(r) : s === "meanNormalization" ? F(r) : (n) => n;
-}
-function B(s, r, n, u, y, K, z, h, C) {
-  const S = z.map((a) => a.join("_")), e = {
-    meta: {
-      facetKeys: S,
-      xKeys: [],
-      yKeys: [],
-      xLabels: {},
-      yLabels: {},
-      facetKeyValues: S.reduce((a, t, l) => (a[t] = z[l], a), {}),
-      valueExtentSize: [1 / 0, -1 / 0],
-      valueExtentColor: [1 / 0, -1 / 0]
-    },
-    facets: {}
-  }, p = /* @__PURE__ */ new Set(), g = /* @__PURE__ */ new Set(), b = r.valueLabels ?? r.value, L = n.valueLabels ?? n.value;
-  if (s.rows.forEach((a) => {
-    const t = K.length ? K.map((d) => a[d.value]).join("_") : "null", l = a[r.value], o = a[n.value], i = a[u.value] ?? C, m = a[y.value] ?? C;
-    if (!(l === null || o === null || i === null || m === null)) {
-      if (e.facets[t] || (e.facets[t] = {
-        xKeys: [],
-        yKeys: [],
-        cells: {}
-      }), e.facets[t].xKeys.push(l), e.facets[t].yKeys.push(o), p.has(l) || (p.add(l), e.meta.xKeys.push(l)), g.has(o) || (g.add(o), e.meta.yKeys.push(o)), e.facets[t].cells[l] || (e.facets[t].cells[l] = {}), e.meta.valueExtentSize[0] = Math.min(i, e.meta.valueExtentSize[0]), e.meta.valueExtentSize[1] = Math.max(i, e.meta.valueExtentSize[1]), e.meta.valueExtentColor[0] = Math.min(m, e.meta.valueExtentColor[0]), e.meta.valueExtentColor[1] = Math.max(m, e.meta.valueExtentColor[1]), e.facets[t].cells[l][o])
-        throw Error(`More than 1 value for x=${l}, y=${o}`);
-      if (e.meta.xLabels[l] && String(a[b]) !== e.meta.xLabels[l])
-        throw Error(`More than 1 x-label value for x=${l}`);
-      if (e.meta.yLabels[o] && String(a[L]) !== e.meta.yLabels[o])
-        throw Error(`More than 1 y-label value for y=${o}`);
-      e.meta.xLabels[l] = String(a[b]), e.meta.yLabels[o] = String(a[L]), e.meta && (e.facets[t].cells[l][o] = {
-        id: `${l}_${o}`,
-        x: l,
-        y: o,
-        sizeValue: i,
-        normalizedSizeValue: i,
-        colorValue: m,
-        normalizedColorValue: m,
-        data: a
-      });
-    }
-  }), e.meta.facetKeys = e.meta.facetKeys.filter((a) => e.facets[a]), e.meta.facetKeys.forEach((a) => {
-    const t = e.facets[a];
-    if (t.xKeys = M.uniq(t.xKeys), t.yKeys = M.uniq(t.yKeys), t.xKeys.length * t.yKeys.length > _)
-      throw Error(`Too many cells for graph rendering (${t.xKeys.length * t.yKeys.length})`);
-  }), h) {
-    const a = [1 / 0, -1 / 0];
-    e.meta.facetKeys.forEach((t) => {
-      if (!e.facets[t])
-        return;
-      const { xKeys: l, yKeys: o, cells: i } = e.facets[t], m = h.direction === "row" ? l : o, d = h.direction === "row" ? o : l, V = h.direction === "row" ? (v, x) => {
-        var f;
-        return (f = i[v]) == null ? void 0 : f[x];
-      } : (v, x) => {
-        var f;
-        return (f = i[x]) == null ? void 0 : f[v];
-      };
-      d.forEach((v) => {
-        const x = [];
-        m.forEach((E) => {
-          var c;
-          const w = (c = V(E, v)) == null ? void 0 : c.colorValue;
-          w !== void 0 && x.push(w);
-        });
-        const f = N(h.method, x);
-        m.forEach((E) => {
-          const c = V(E, v);
-          c !== void 0 && (c.normalizedColorValue = f(c.colorValue), a[0] = Math.min(c.normalizedColorValue, a[0]), a[1] = Math.max(c.normalizedColorValue, a[1]));
-        });
-      });
-    }), e.meta.valueExtentColor = a;
-  }
-  return e.meta.valueExtentSize[0] === 1 / 0 && (e.meta.valueExtentSize[0] = 0), e.meta.valueExtentSize[1] === -1 / 0 && (e.meta.valueExtentSize[1] = 0), e.meta.valueExtentColor[0] === 1 / 0 && (e.meta.valueExtentColor[0] = 0), e.meta.valueExtentColor[1] === -1 / 0 && (e.meta.valueExtentColor[1] = 0), e;
-}
-export {
-  B as getCells
-};
-//# sourceMappingURL=getCells.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/bubble/getCells.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"getCells.js","sources":["../../../../../../node_modules/@milaboratories/miplots4/src/bubble/getCells.ts"],"sourcesContent":["import type {BubbleSettingsImpl} from './BubbleSettingsImpl';\nimport type {DataFrame} from '../DataFrame';\nimport type {ColumnName, DataValue, NormalizationMethod} from '../types';\nimport {deviation, extent, mean} from 'd3-array';\nimport lodash from 'lodash';\n\nconst MAX_RENDERED_CELLS_COUNT = 1000000;\nfunction normalizeByStd(values: number[]) {\n    const stdValue = deviation(values);\n    const meanValue = mean(values);\n\n    if (stdValue === undefined || meanValue === undefined || stdValue === 0) {\n        return (v: number) => v;\n    }\n    return (v: number) => (v - meanValue) / stdValue;\n}\n\nfunction normalizeByMinMax(values: number[]) {\n    const meanValue = mean(values);\n    const [min, max] = extent(values);\n    if (meanValue === undefined || min === undefined || max === undefined) {\n        return (v: number) => v;\n    }\n    return (v: number) => (v - meanValue) / (max - min);\n}\n\nfunction getNormalizationFn(method: NormalizationMethod, values: number[]) {\n    if (method === 'standardScaling') {\n        return normalizeByStd(values);\n    }\n    if (method === 'meanNormalization') {\n        return normalizeByMinMax(values);\n    }\n    return (v: number) => v;\n}\n\nexport type Cell = {\n    id: string;\n    sizeValue: DataValue;\n    colorValue: DataValue;\n    normalizedSizeValue: DataValue;\n    normalizedColorValue: DataValue;\n    x: DataValue;\n    y: DataValue;\n    data: Record<string, DataValue>;\n};\n\nexport type GroupedCellsData = {\n    meta: {\n        facetKeys: string[];\n        facetKeyValues: Record<string, string[]>;\n        xKeys: string[]; // all the keys from facets\n        yKeys: string[]; // all the keys from facets\n        xLabels: Record<string, string>;\n        yLabels: Record<string, string>;\n        valueExtentSize: [number, number]; // for size scales\n        valueExtentColor: [number, number]; // for color scales\n    };\n    //facet groups\n    facets: Record<\n        string,\n        {\n            // axis keys\n            xKeys: string[];\n            yKeys: string[];\n            // cells grouped by X, then by Y\n            cells: Record<string, Record<string, Cell>>;\n        }\n    >;\n};\n\nexport function getCells(\n    data: DataFrame,\n    xColumn: ColumnName,\n    yColumn: ColumnName,\n    valueColumnSize: ColumnName,\n    valueColumnColor: ColumnName,\n    facetBy: ColumnName[],\n    facetKeysCombinations: string[][],\n    normalization: BubbleSettingsImpl['normalization'],\n    NAValueAs: BubbleSettingsImpl['NAValueAs']\n): GroupedCellsData {\n    const facetKeys = facetKeysCombinations.map(v => v.join('_'));\n    const result: GroupedCellsData = {\n        meta: {\n            facetKeys,\n            xKeys: [],\n            yKeys: [],\n            xLabels: {},\n            yLabels: {},\n            facetKeyValues: facetKeys.reduce((res: Record<string, string[]>, key, index) => {\n                res[key] = facetKeysCombinations[index];\n                return res;\n            }, {}),\n            valueExtentSize: [Infinity, -Infinity],\n            valueExtentColor: [Infinity, -Infinity],\n        },\n        facets: {},\n    };\n    const usedXKeys = new Set();\n    const usedYKeys = new Set();\n\n    const xLabelsSource = xColumn.valueLabels ?? xColumn.value;\n    const yLabelsSource = yColumn.valueLabels ?? yColumn.value;\n    data.rows.forEach(row => {\n        const facetKey = facetBy.length ? facetBy.map(column => row[column.value]).join('_') : 'null';\n        const x = row[xColumn.value] as string;\n        const y = row[yColumn.value] as string;\n        const sizeValue = (row[valueColumnSize.value] ?? NAValueAs) as (null | number);\n        const colorValue = (row[valueColumnColor.value] ?? NAValueAs) as (null | number);\n\n        if (x === null || y === null || sizeValue === null || colorValue === null) {\n            return;\n        }\n        if (!result.facets[facetKey]) {\n            result.facets[facetKey] = {\n                xKeys: [],\n                yKeys: [],\n                cells: {},\n            };\n        }\n        result.facets[facetKey].xKeys.push(x);\n        result.facets[facetKey].yKeys.push(y);\n\n        if (!usedXKeys.has(x)) {\n            usedXKeys.add(x);\n            result.meta.xKeys.push(x);\n        }\n        if (!usedYKeys.has(y)) {\n            usedYKeys.add(y);\n            result.meta.yKeys.push(y);\n        }\n        if (!result.facets[facetKey].cells[x]) {\n            result.facets[facetKey].cells[x] = {};\n        }\n        result.meta.valueExtentSize[0] = Math.min(sizeValue, result.meta.valueExtentSize[0]);\n        result.meta.valueExtentSize[1] = Math.max(sizeValue, result.meta.valueExtentSize[1]);\n        result.meta.valueExtentColor[0] = Math.min(colorValue, result.meta.valueExtentColor[0]);\n        result.meta.valueExtentColor[1] = Math.max(colorValue, result.meta.valueExtentColor[1]);\n\n        if (result.facets[facetKey].cells[x][y]) {\n            throw Error(`More than 1 value for x=${x}, y=${y}`);\n        }\n        if (result.meta.xLabels[x] && String(row[xLabelsSource]) !== result.meta.xLabels[x]) {\n            throw Error(`More than 1 x-label value for x=${x}`);\n        }\n        if (result.meta.yLabels[y] && String(row[yLabelsSource]) !== result.meta.yLabels[y]) {\n            throw Error(`More than 1 y-label value for y=${y}`);\n        }\n        result.meta.xLabels[x] = String(row[xLabelsSource]);\n        result.meta.yLabels[y] = String(row[yLabelsSource]);\n        if (result.meta)\n            result.facets[facetKey].cells[x][y] = {\n                id: `${x}_${y}`,\n                x,\n                y,\n                sizeValue,\n                normalizedSizeValue: sizeValue,\n                colorValue,\n                normalizedColorValue: colorValue,\n                data: row,\n            };\n    });\n    result.meta.facetKeys = result.meta.facetKeys.filter((key) => result.facets[key]); // filter only used;\n\n    // make uniq x, y, x-group and y-group keys\n    result.meta.facetKeys.forEach(facetKey => {\n        const facet = result.facets[facetKey];\n        facet.xKeys = lodash.uniq(facet.xKeys);\n        facet.yKeys = lodash.uniq(facet.yKeys);\n\n        if (facet.xKeys.length * facet.yKeys.length > MAX_RENDERED_CELLS_COUNT) {\n            throw Error(`Too many cells for graph rendering (${facet.xKeys.length * facet.yKeys.length})`);\n        }\n    });\n\n    if (normalization) {\n        //const valueExtentSize = [Infinity, -Infinity] as [number, number];\n        const valueExtentColor = [Infinity, -Infinity] as [number, number];\n        result.meta.facetKeys.forEach(facetKey => {\n            if (!result.facets[facetKey]) {\n                return;\n            }\n            const {xKeys, yKeys, cells} = result.facets[facetKey];\n            const cellKeys = normalization.direction === 'row' ? xKeys : yKeys;\n            const groupKeys = normalization.direction === 'row' ? yKeys : xKeys;\n            const cellGetter =\n                normalization.direction === 'row'\n                    ? (cellKey: string, groupKey: string) => cells[cellKey]?.[groupKey]\n                    : (cellKey: string, groupKey: string) => cells[groupKey]?.[cellKey];\n            groupKeys.forEach(groupKey => {\n                //const sizeValues:number[] = [];\n                const colorValues: number[] = [];\n                cellKeys.forEach(cellKey => {\n                    //const sizeV = cellGetter(cellKey, groupKey)?.sizeValue;\n                    const colorV = cellGetter(cellKey, groupKey)?.colorValue;\n                    // if (sizeV !== undefined) {\n                    //     sizeValues.push(sizeV as number);\n                    // }\n                    if (colorV !== undefined) {\n                        colorValues.push(colorV as number);\n                    }\n                });\n                // const normalizeSize = getNormalizationFn(normalization.method, sizeValues);\n                const normalizeColor = getNormalizationFn(normalization.method, colorValues);\n                cellKeys.forEach(cellKey => {\n                    const cell = cellGetter(cellKey, groupKey);\n                    if (cell !== undefined) {\n                        // cell.normalizedSizeValue = normalizeSize(cell.sizeValue as number);\n                        cell.normalizedColorValue = normalizeColor(cell.colorValue as number);\n                        // valueExtentSize[0] = Math.min(cell.normalizedSizeValue, valueExtentSize[0]);\n                        // valueExtentSize[1] = Math.max(cell.normalizedSizeValue, valueExtentSize[1]);\n                        valueExtentColor[0] = Math.min(cell.normalizedColorValue, valueExtentColor[0]);\n                        valueExtentColor[1] = Math.max(cell.normalizedColorValue, valueExtentColor[1]);\n                    }\n                });\n            });\n        });\n        // result.meta.valueExtentSize = valueExtentSize;\n        result.meta.valueExtentColor = valueExtentColor;\n    }\n\n    // avoid render errors on empty data\n    if (result.meta.valueExtentSize[0] === Infinity) {\n        result.meta.valueExtentSize[0] = 0;\n    }\n    if (result.meta.valueExtentSize[1] === -Infinity) {\n        result.meta.valueExtentSize[1] = 0;\n    }\n    if (result.meta.valueExtentColor[0] === Infinity) {\n        result.meta.valueExtentColor[0] = 0;\n    }\n    if (result.meta.valueExtentColor[1] === -Infinity) {\n        result.meta.valueExtentColor[1] = 0;\n    }\n\n    return result;\n}\n"],"names":["MAX_RENDERED_CELLS_COUNT","normalizeByStd","values","stdValue","deviation","meanValue","mean","v","normalizeByMinMax","min","max","extent","getNormalizationFn","method","getCells","data","xColumn","yColumn","valueColumnSize","valueColumnColor","facetBy","facetKeysCombinations","normalization","NAValueAs","facetKeys","t","result","res","key","index","usedXKeys","usedYKeys","xLabelsSource","yLabelsSource","row","facetKey","column","x","y","sizeValue","colorValue","facet","lodash","valueExtentColor","xKeys","yKeys","cells","cellKeys","groupKeys","cellGetter","cellKey","groupKey","_a","colorValues","colorV","normalizeColor","cell"],"mappings":";;;;AAMA,MAAMA,IAA2B;AACjC,SAASC,EAAeC,GAAkB;AACtC,QAAMC,IAAWC,EAAUF,CAAM,GAC3BG,IAAYC,EAAKJ,CAAM;AAE7B,SAAIC,MAAa,UAAaE,MAAc,UAAaF,MAAa,IAC3D,CAACI,MAAcA,IAEnB,CAACA,OAAeA,IAAIF,KAAaF;AAC5C;AAEA,SAASK,EAAkBN,GAAkB;AACzC,QAAMG,IAAYC,EAAKJ,CAAM,GACvB,CAACO,GAAKC,CAAG,IAAIC,EAAOT,CAAM;AAChC,SAAIG,MAAc,UAAaI,MAAQ,UAAaC,MAAQ,SACjD,CAACH,MAAcA,IAEnB,CAACA,OAAeA,IAAIF,MAAcK,IAAMD;AACnD;AAEA,SAASG,EAAmBC,GAA6BX,GAAkB;AACvE,SAAIW,MAAW,oBACJZ,EAAeC,CAAM,IAE5BW,MAAW,sBACJL,EAAkBN,CAAM,IAE5B,CAACK,MAAcA;AAC1B;AAqCO,SAASO,EACZC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACgB;AAChB,QAAMC,IAAYH,EAAsB,IAAI,CAAAI,MAAKlB,EAAE,KAAK,GAAG,CAAC,GACtDmB,IAA2B;AAAA,IAC7B,MAAM;AAAA,MACF,WAAAF;AAAAA,MACA,OAAO,CAAA;AAAA,MACP,OAAO,CAAA;AAAA,MACP,SAAS,CAAA;AAAA,MACT,SAAS,CAAA;AAAA,MACT,gBAAgBA,EAAU,OAAO,CAACG,GAA+BC,GAAKC,OAClEF,EAAIC,CAAG,IAAIP,EAAsBQ,CAAK,GAC/BF,IACR,CAAA,CAAE;AAAA,MACL,iBAAiB,CAAC,OAAU,MAAS;AAAA,MACrC,kBAAkB,CAAC,OAAU,MAAS;AAAA,IAAA;AAAA,IAE1C,QAAQ,CAAA;AAAA,EAAA,GAENG,IAAAA,oBAAgB,IAAA,GAChBC,wBAAgB,IAAA,GAEhBC,IAAgBhB,EAAQ,eAAeA,EAAQ,OAC/CiB,IAAgBhB,EAAQ,eAAeA,EAAQ;AAyErD,MAxEAF,EAAK,KAAK,QAAQ,CAAAmB,MAAO;AACrB,UAAMC,IAAWf,EAAQ,SAASA,EAAQ,IAAI,CAAAgB,MAAUF,EAAIE,EAAO,KAAK,CAAC,EAAE,KAAK,GAAG,IAAI,QACjFC,IAAIH,EAAIlB,EAAQ,KAAK,GACrBsB,IAAIJ,EAAIjB,EAAQ,KAAK,GACrBsB,IAAaL,EAAIhB,EAAgB,KAAK,KAAKK,GAC3CiB,IAAcN,EAAIf,EAAiB,KAAK,KAAKI;AAEnD,QAAI,EAAAc,MAAM,QAAQC,MAAM,QAAQC,MAAc,QAAQC,MAAe,OA6BrE;AAAA,UA1BKd,EAAO,OAAOS,CAAQ,MACvBT,EAAO,OAAOS,CAAQ,IAAI;AAAA,QACtB,OAAO,CAAA;AAAA,QACP,OAAO,CAAA;AAAA,QACP,OAAO,CAAA;AAAA,MAAA,IAGfT,EAAO,OAAOS,CAAQ,EAAE,MAAM,KAAKE,CAAC,GACpCX,EAAO,OAAOS,CAAQ,EAAE,MAAM,KAAKG,CAAC,GAE/BR,EAAU,IAAIO,CAAC,MAChBP,EAAU,IAAIO,CAAC,GACfX,EAAO,KAAK,MAAM,KAAKW,CAAC,IAEvBN,EAAU,IAAIO,CAAC,MAChBP,EAAU,IAAIO,CAAC,GACfZ,EAAO,KAAK,MAAM,KAAKY,CAAC,IAEvBZ,EAAO,OAAOS,CAAQ,EAAE,MAAME,CAAC,MAChCX,EAAO,OAAOS,CAAQ,EAAE,MAAME,CAAC,IAAI,CAAA,IAEvCX,EAAO,KAAK,gBAAgB,CAAC,IAAI,KAAK,IAAIa,GAAWb,EAAO,KAAK,gBAAgB,CAAC,CAAC,GACnFA,EAAO,KAAK,gBAAgB,CAAC,IAAI,KAAK,IAAIa,GAAWb,EAAO,KAAK,gBAAgB,CAAC,CAAC,GACnFA,EAAO,KAAK,iBAAiB,CAAC,IAAI,KAAK,IAAIc,GAAYd,EAAO,KAAK,iBAAiB,CAAC,CAAC,GACtFA,EAAO,KAAK,iBAAiB,CAAC,IAAI,KAAK,IAAIc,GAAYd,EAAO,KAAK,iBAAiB,CAAC,CAAC,GAElFA,EAAO,OAAOS,CAAQ,EAAE,MAAME,CAAC,EAAEC,CAAC;AAClC,cAAM,MAAM,2BAA2BD,CAAC,OAAOC,CAAC,EAAE;AAEtD,UAAIZ,EAAO,KAAK,QAAQW,CAAC,KAAK,OAAOH,EAAIF,CAAa,CAAC,MAAMN,EAAO,KAAK,QAAQW,CAAC;AAC9E,cAAM,MAAM,mCAAmCA,CAAC,EAAE;AAEtD,UAAIX,EAAO,KAAK,QAAQY,CAAC,KAAK,OAAOJ,EAAID,CAAa,CAAC,MAAMP,EAAO,KAAK,QAAQY,CAAC;AAC9E,cAAM,MAAM,mCAAmCA,CAAC,EAAE;AAEtDZ,QAAO,KAAK,QAAQW,CAAC,IAAI,OAAOH,EAAIF,CAAa,CAAC,GAClDN,EAAO,KAAK,QAAQY,CAAC,IAAI,OAAOJ,EAAID,CAAa,CAAC,GAC9CP,EAAO,SACPA,EAAO,OAAOS,CAAQ,EAAE,MAAME,CAAC,EAAEC,CAAC,IAAI;AAAA,QAClC,IAAI,GAAGD,CAAC,IAAIC,CAAC;AAAA,QACb,GAAAD;AAAAA,QACA,GAAAC;AAAAA,QACA,WAAAC;AAAAA,QACA,qBAAqBA;AAAAA,QACrB,YAAAC;AAAAA,QACA,sBAAsBA;AAAAA,QACtB,MAAMN;AAAAA,MAAA;AAAA,IAAA;AAAA,EAElB,CAAC,GACDR,EAAO,KAAK,YAAYA,EAAO,KAAK,UAAU,OAAO,CAACE,MAAQF,EAAO,OAAOE,CAAG,CAAC,GAGhFF,EAAO,KAAK,UAAU,QAAQ,CAAAS,MAAY;AACtC,UAAMM,IAAQf,EAAO,OAAOS,CAAQ;AAIpC,QAHAM,EAAM,QAAQC,EAAO,KAAKD,EAAM,KAAK,GACrCA,EAAM,QAAQC,EAAO,KAAKD,EAAM,KAAK,GAEjCA,EAAM,MAAM,SAASA,EAAM,MAAM,SAASzC;AAC1C,YAAM,MAAM,uCAAuCyC,EAAM,MAAM,SAASA,EAAM,MAAM,MAAM,GAAG;AAAA,EAErG,CAAC,GAEGnB,GAAe;AAEf,UAAMqB,IAAmB,CAAC,OAAU,MAAS;AAC7CjB,MAAO,KAAK,UAAU,QAAQ,CAAAS,MAAY;AACtC,UAAI,CAACT,EAAO,OAAOS,CAAQ;AACvB;AAEJ,YAAM,EAAC,OAAAS,GAAO,OAAAC,GAAO,OAAAC,EAAAA,IAASpB,EAAO,OAAOS,CAAQ,GAC9CY,IAAWzB,EAAc,cAAc,QAAQsB,IAAQC,GACvDG,IAAY1B,EAAc,cAAc,QAAQuB,IAAQD,GACxDK,IACF3B,EAAc,cAAc,QACtB,CAAC4B,GAAiBC,MAAAA;;AAAqB,gBAAAC,IAAAN,EAAMI,CAAO,MAAb,gBAAAE,EAAiBD,CAAAA;AAAAA,MAAA,IACxD,CAACD,GAAiBC,MAAAA;;AAAqB,gBAAAC,IAAAN,EAAMK,CAAQ,MAAd,gBAAAC,EAAkBF,CAAAA;AAAAA,MAAA;AACnEF,MAAAA,EAAU,QAAQ,CAAAG,MAAY;AAE1B,cAAME,IAAwB,CAAA;AAC9BN,QAAAA,EAAS,QAAQ,CAAAG,MAAW;;AAExB,gBAAMI,KAASF,IAAAH,EAAWC,GAASC,CAAQ,MAA5B,gBAAAC,EAA+B;AAI1CE,UAAAA,MAAW,UACXD,EAAY,KAAKC,CAAgB;AAAA,QAEzC,CAAC;AAED,cAAMC,IAAiB3C,EAAmBU,EAAc,QAAQ+B,CAAW;AAC3EN,QAAAA,EAAS,QAAQ,CAAAG,MAAW;AACxB,gBAAMM,IAAOP,EAAWC,GAASC,CAAQ;AACrCK,UAAAA,MAAS,WAETA,EAAK,uBAAuBD,EAAeC,EAAK,UAAoB,GAGpEb,EAAiB,CAAC,IAAI,KAAK,IAAIa,EAAK,sBAAsBb,EAAiB,CAAC,CAAC,GAC7EA,EAAiB,CAAC,IAAI,KAAK,IAAIa,EAAK,sBAAsBb,EAAiB,CAAC,CAAC;AAAA,QAErF,CAAC;AAAA,MACL,CAAC;AAAA,IACL,CAAC,GAEDjB,EAAO,KAAK,mBAAmBiB;AAAAA,EACnC;AAGA,SAAIjB,EAAO,KAAK,gBAAgB,CAAC,MAAM,UACnCA,EAAO,KAAK,gBAAgB,CAAC,IAAI,IAEjCA,EAAO,KAAK,gBAAgB,CAAC,MAAM,WACnCA,EAAO,KAAK,gBAAgB,CAAC,IAAI,IAEjCA,EAAO,KAAK,iBAAiB,CAAC,MAAM,UACpCA,EAAO,KAAK,iBAAiB,CAAC,IAAI,IAElCA,EAAO,KAAK,iBAAiB,CAAC,MAAM,WACpCA,EAAO,KAAK,iBAAiB,CAAC,IAAI,IAG/BA;AACX;","x_google_ignoreList":[0]}

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

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"add.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-quadtree/src/add.js"],"sourcesContent":["export default function(d) {\n  const x = +this._x.call(null, d),\n      y = +this._y.call(null, d);\n  return add(this.cover(x, y), x, y, d);\n}\n\nfunction add(tree, x, y, d) {\n  if (isNaN(x) || isNaN(y)) return tree; // ignore invalid points\n\n  var parent,\n      node = tree._root,\n      leaf = {data: d},\n      x0 = tree._x0,\n      y0 = tree._y0,\n      x1 = tree._x1,\n      y1 = tree._y1,\n      xm,\n      ym,\n      xp,\n      yp,\n      right,\n      bottom,\n      i,\n      j;\n\n  // If the tree is empty, initialize the root as a leaf.\n  if (!node) return tree._root = leaf, tree;\n\n  // Find the existing leaf for the new point, or add it.\n  while (node.length) {\n    if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n    if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;\n    if (parent = node, !(node = node[i = bottom << 1 | right])) return parent[i] = leaf, tree;\n  }\n\n  // Is the new point is exactly coincident with the existing point?\n  xp = +tree._x.call(null, node.data);\n  yp = +tree._y.call(null, node.data);\n  if (x === xp && y === yp) return leaf.next = node, parent ? parent[i] = leaf : tree._root = leaf, tree;\n\n  // Otherwise, split the leaf node until the old and new point are separated.\n  do {\n    parent = parent ? parent[i] = new Array(4) : tree._root = new Array(4);\n    if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n    if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;\n  } while ((i = bottom << 1 | right) === (j = (yp >= ym) << 1 | (xp >= xm)));\n  return parent[j] = node, parent[i] = leaf, tree;\n}\n\nexport function addAll(data) {\n  var d, i, n = data.length,\n      x,\n      y,\n      xz = new Array(n),\n      yz = new Array(n),\n      x0 = Infinity,\n      y0 = Infinity,\n      x1 = -Infinity,\n      y1 = -Infinity;\n\n  // Compute the points and their extent.\n  for (i = 0; i < n; ++i) {\n    if (isNaN(x = +this._x.call(null, d = data[i])) || isNaN(y = +this._y.call(null, d))) continue;\n    xz[i] = x;\n    yz[i] = y;\n    if (x < x0) x0 = x;\n    if (x > x1) x1 = x;\n    if (y < y0) y0 = y;\n    if (y > y1) y1 = y;\n  }\n\n  // If there were no (valid) points, abort.\n  if (x0 > x1 || y0 > y1) return this;\n\n  // Expand the tree to cover the new points.\n  this.cover(x0, y0).cover(x1, y1);\n\n  // Add the new points.\n  for (i = 0; i < n; ++i) {\n    add(this, xz[i], yz[i], data[i]);\n  }\n\n  return this;\n}\n"],"names":["tree_add","d","x","y","add","tree","parent","node","leaf","x0","y0","x1","y1","xm","ym","xp","yp","right","bottom","i","j","addAll","data","n","xz","yz"],"mappings":"AAAe,SAAAA,EAASC,GAAG;AACzB,QAAMC,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMD,CAAC,GAC3BE,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMF,CAAC;AAC7B,SAAOG,EAAI,KAAK,MAAMF,GAAGC,CAAC,GAAGD,GAAGC,GAAGF,CAAC;AACtC;AAEA,SAASG,EAAIC,GAAMH,GAAGC,GAAGF,GAAG;AAC1B,MAAI,MAAMC,CAAC,KAAK,MAAMC,CAAC,EAAG,QAAOE;AAEjC,MAAIC,GACAC,IAAOF,EAAK,OACZG,IAAO,EAAC,MAAMP,EAAAA,GACdQ,IAAKJ,EAAK,KACVK,IAAKL,EAAK,KACVM,IAAKN,EAAK,KACVO,IAAKP,EAAK,KACVQ,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC;AAGJ,MAAI,CAACb,EAAM,QAAOF,EAAK,QAAQG,GAAMH;AAGrC,SAAOE,EAAK;AAGV,SAFIU,IAAQf,MAAMW,KAAMJ,IAAKE,KAAM,MAAIF,IAAKI,IAASF,IAAKE,IACtDK,IAASf,MAAMW,KAAMJ,IAAKE,KAAM,MAAIF,IAAKI,IAASF,IAAKE,GACvDR,IAASC,GAAM,EAAEA,IAAOA,EAAKY,IAAID,KAAU,IAAID,CAAK,GAAI,QAAOX,EAAOa,CAAC,IAAIX,GAAMH;AAMvF,MAFAU,IAAK,CAACV,EAAK,GAAG,KAAK,MAAME,EAAK,IAAI,GAClCS,IAAK,CAACX,EAAK,GAAG,KAAK,MAAME,EAAK,IAAI,GAC9BL,MAAMa,KAAMZ,MAAMa,UAAWR,EAAK,OAAOD,GAAMD,IAASA,EAAOa,CAAC,IAAIX,IAAOH,EAAK,QAAQG,GAAMH;AAGlG;AACEC,QAASA,IAASA,EAAOa,CAAC,IAAI,IAAI,MAAM,CAAC,IAAId,EAAK,QAAQ,IAAI,MAAM,CAAC,IACjEY,IAAQf,MAAMW,KAAMJ,IAAKE,KAAM,MAAIF,IAAKI,IAASF,IAAKE,IACtDK,IAASf,MAAMW,KAAMJ,IAAKE,KAAM,MAAIF,IAAKI,IAASF,IAAKE;AAAAA,UACnDK,IAAID,KAAU,IAAID,QAAYG,KAAKJ,KAAMF,MAAO,IAAKC,KAAMF;AACrE,SAAOP,EAAOc,CAAC,IAAIb,GAAMD,EAAOa,CAAC,IAAIX,GAAMH;AAC7C;AAEO,SAASgB,EAAOC,GAAM;AAC3B,MAAIrB,GAAGkB,GAAGI,IAAID,EAAK,QACfpB,GACAC,GACAqB,IAAK,IAAI,MAAMD,CAAC,GAChBE,IAAK,IAAI,MAAMF,CAAC,GAChBd,IAAK,OACLC,IAAK,OACLC,IAAK,QACLC,IAAK;AAGT,OAAKO,IAAI,GAAGA,IAAII,GAAG,EAAEJ;AACf,UAAMjB,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMD,IAAIqB,EAAKH,CAAC,CAAC,CAAC,KAAK,MAAMhB,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMF,CAAC,CAAC,MACnFuB,EAAGL,CAAC,IAAIjB,GACRuB,EAAGN,CAAC,IAAIhB,GACJD,IAAIO,MAAIA,IAAKP,IACbA,IAAIS,MAAIA,IAAKT,IACbC,IAAIO,MAAIA,IAAKP,IACbA,IAAIS,MAAIA,IAAKT;AAInB,MAAIM,IAAKE,KAAMD,IAAKE,EAAI,QAAO;AAM/B,OAHA,KAAK,MAAMH,GAAIC,CAAE,EAAE,MAAMC,GAAIC,CAAE,GAG1BO,IAAI,GAAGA,IAAII,GAAG,EAAEJ;AACnBf,IAAAA,EAAI,MAAMoB,EAAGL,CAAC,GAAGM,EAAGN,CAAC,GAAGG,EAAKH,CAAC,CAAC;AAGjC,SAAO;AACT;","x_google_ignoreList":[0]}

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

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"cover.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-quadtree/src/cover.js"],"sourcesContent":["export default function(x, y) {\n  if (isNaN(x = +x) || isNaN(y = +y)) return this; // ignore invalid points\n\n  var x0 = this._x0,\n      y0 = this._y0,\n      x1 = this._x1,\n      y1 = this._y1;\n\n  // If the quadtree has no extent, initialize them.\n  // Integer extent are necessary so that if we later double the extent,\n  // the existing quadrant boundaries don’t change due to floating point error!\n  if (isNaN(x0)) {\n    x1 = (x0 = Math.floor(x)) + 1;\n    y1 = (y0 = Math.floor(y)) + 1;\n  }\n\n  // Otherwise, double repeatedly to cover.\n  else {\n    var z = x1 - x0 || 1,\n        node = this._root,\n        parent,\n        i;\n\n    while (x0 > x || x >= x1 || y0 > y || y >= y1) {\n      i = (y < y0) << 1 | (x < x0);\n      parent = new Array(4), parent[i] = node, node = parent, z *= 2;\n      switch (i) {\n        case 0: x1 = x0 + z, y1 = y0 + z; break;\n        case 1: x0 = x1 - z, y1 = y0 + z; break;\n        case 2: x1 = x0 + z, y0 = y1 - z; break;\n        case 3: x0 = x1 - z, y0 = y1 - z; break;\n      }\n    }\n\n    if (this._root && this._root.length) this._root = node;\n  }\n\n  this._x0 = x0;\n  this._y0 = y0;\n  this._x1 = x1;\n  this._y1 = y1;\n  return this;\n}\n"],"names":["tree_cover","x","y","x0","y0","x1","y1","z","node","parent","i"],"mappings":"AAAe,SAAAA,EAASC,GAAGC,GAAG;AAC5B,MAAI,MAAMD,IAAI,CAACA,CAAC,KAAK,MAAMC,IAAI,CAACA,CAAC,EAAG,QAAO;AAE3C,MAAIC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,IAAK,KAAK;AAKd,MAAI,MAAMH,CAAE;AACVE,SAAMF,IAAK,KAAK,MAAMF,CAAC,KAAK,GAC5BK,KAAMF,IAAK,KAAK,MAAMF,CAAC,KAAK;AAAA,OAIzB;AAMH,aALIK,IAAIF,IAAKF,KAAM,GACfK,IAAO,KAAK,OACZC,GACAC,GAEGP,IAAKF,KAAKA,KAAKI,KAAMD,IAAKF,KAAKA,KAAKI;AAGzC,cAFAI,KAAKR,IAAIE,MAAO,IAAKH,IAAIE,GACzBM,IAAS,IAAI,MAAM,CAAC,GAAGA,EAAOC,CAAC,IAAIF,GAAMA,IAAOC,GAAQF,KAAK,GACrDG,GAAAA;AAAAA,QACN,KAAK;AAAGL,cAAKF,IAAKI,GAAGD,IAAKF,IAAKG;AAAG;AAAA,QAClC,KAAK;AAAGJ,cAAKE,IAAKE,GAAGD,IAAKF,IAAKG;AAAG;AAAA,QAClC,KAAK;AAAGF,cAAKF,IAAKI,GAAGH,IAAKE,IAAKC;AAAG;AAAA,QAClC,KAAK;AAAGJ,cAAKE,IAAKE,GAAGH,IAAKE,IAAKC;AAAG;AAAA,MAAA;AAIlC,SAAK,SAAS,KAAK,MAAM,WAAQ,KAAK,QAAQC;AAAAA,EACpD;AAEA,SAAA,KAAK,MAAML,GACX,KAAK,MAAMC,GACX,KAAK,MAAMC,GACX,KAAK,MAAMC,GACJ;AACT;","x_google_ignoreList":[0]}

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

@@ -1,12 +0,0 @@
-function t() {
-  var n = [];
-  return this.visit(function(i) {
-    if (!i.length) do
-      n.push(i.data);
-    while (i = i.next);
-  }), n;
-}
-export {
-  t as default
-};
-//# sourceMappingURL=data.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"data.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-quadtree/src/data.js"],"sourcesContent":["export default function() {\n  var data = [];\n  this.visit(function(node) {\n    if (!node.length) do data.push(node.data); while (node = node.next)\n  });\n  return data;\n}\n"],"names":["tree_data","data","node"],"mappings":"AAAe,SAAAA,IAAW;AACxB,MAAIC,IAAO,CAAA;AACX,SAAA,KAAK,MAAM,SAASC,GAAM;AACxB,QAAI,CAACA,EAAK,OAAQ;AAAGD,MAAAA,EAAK,KAAKC,EAAK,IAAI;AAAA,WAAUA,IAAOA,EAAK;AAAA,EAChE,CAAC,GACMD;AACT;","x_google_ignoreList":[0]}

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

@@ -1,7 +0,0 @@
-function s(i) {
-  return arguments.length ? this.cover(+i[0][0], +i[0][1]).cover(+i[1][0], +i[1][1]) : isNaN(this._x0) ? void 0 : [[this._x0, this._y0], [this._x1, this._y1]];
-}
-export {
-  s as default
-};
-//# sourceMappingURL=extent.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"extent.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-quadtree/src/extent.js"],"sourcesContent":["export default function(_) {\n  return arguments.length\n      ? this.cover(+_[0][0], +_[0][1]).cover(+_[1][0], +_[1][1])\n      : isNaN(this._x0) ? undefined : [[this._x0, this._y0], [this._x1, this._y1]];\n}\n"],"names":["tree_extent","_"],"mappings":"AAAe,SAAAA,EAASC,GAAG;AACzB,SAAO,UAAU,SACX,KAAK,MAAM,CAACA,EAAE,CAAC,EAAE,CAAC,GAAG,CAACA,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,CAACA,EAAE,CAAC,EAAE,CAAC,GAAG,CAACA,EAAE,CAAC,EAAE,CAAC,CAAC,IACvD,MAAM,KAAK,GAAG,IAAI,SAAY,CAAC,CAAC,KAAK,KAAK,KAAK,GAAG,GAAG,CAAC,KAAK,KAAK,KAAK,GAAG,CAAC;AACjF;","x_google_ignoreList":[0]}

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

@@ -1,26 +0,0 @@
-import u from "./quad.js";
-function I(a, h, e) {
-  var c, n = this._x0, _ = this._y0, i, p, d, g, w = this._x1, x = this._y1, t = [], l = this._root, s, y;
-  for (l && t.push(new u(l, n, _, w, x)), e == null ? e = 1 / 0 : (n = a - e, _ = h - e, w = a + e, x = h + e, e *= e); s = t.pop(); )
-    if (!(!(l = s.node) || (i = s.x0) > w || (p = s.y0) > x || (d = s.x1) < n || (g = s.y1) < _))
-      if (l.length) {
-        var o = (i + d) / 2, r = (p + g) / 2;
-        t.push(
-          new u(l[3], o, r, d, g),
-          new u(l[2], i, r, o, g),
-          new u(l[1], o, p, d, r),
-          new u(l[0], i, p, o, r)
-        ), (y = (h >= r) << 1 | a >= o) && (s = t[t.length - 1], t[t.length - 1] = t[t.length - 1 - y], t[t.length - 1 - y] = s);
-      } else {
-        var f = a - +this._x.call(null, l.data), m = h - +this._y.call(null, l.data), q = f * f + m * m;
-        if (q < e) {
-          var v = Math.sqrt(e = q);
-          n = a - v, _ = h - v, w = a + v, x = h + v, c = l.data;
-        }
-      }
-  return c;
-}
-export {
-  I as default
-};
-//# sourceMappingURL=find.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"find.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-quadtree/src/find.js"],"sourcesContent":["import Quad from \"./quad.js\";\n\nexport default function(x, y, radius) {\n  var data,\n      x0 = this._x0,\n      y0 = this._y0,\n      x1,\n      y1,\n      x2,\n      y2,\n      x3 = this._x1,\n      y3 = this._y1,\n      quads = [],\n      node = this._root,\n      q,\n      i;\n\n  if (node) quads.push(new Quad(node, x0, y0, x3, y3));\n  if (radius == null) radius = Infinity;\n  else {\n    x0 = x - radius, y0 = y - radius;\n    x3 = x + radius, y3 = y + radius;\n    radius *= radius;\n  }\n\n  while (q = quads.pop()) {\n\n    // Stop searching if this quadrant can’t contain a closer node.\n    if (!(node = q.node)\n        || (x1 = q.x0) > x3\n        || (y1 = q.y0) > y3\n        || (x2 = q.x1) < x0\n        || (y2 = q.y1) < y0) continue;\n\n    // Bisect the current quadrant.\n    if (node.length) {\n      var xm = (x1 + x2) / 2,\n          ym = (y1 + y2) / 2;\n\n      quads.push(\n        new Quad(node[3], xm, ym, x2, y2),\n        new Quad(node[2], x1, ym, xm, y2),\n        new Quad(node[1], xm, y1, x2, ym),\n        new Quad(node[0], x1, y1, xm, ym)\n      );\n\n      // Visit the closest quadrant first.\n      if (i = (y >= ym) << 1 | (x >= xm)) {\n        q = quads[quads.length - 1];\n        quads[quads.length - 1] = quads[quads.length - 1 - i];\n        quads[quads.length - 1 - i] = q;\n      }\n    }\n\n    // Visit this point. (Visiting coincident points isn’t necessary!)\n    else {\n      var dx = x - +this._x.call(null, node.data),\n          dy = y - +this._y.call(null, node.data),\n          d2 = dx * dx + dy * dy;\n      if (d2 < radius) {\n        var d = Math.sqrt(radius = d2);\n        x0 = x - d, y0 = y - d;\n        x3 = x + d, y3 = y + d;\n        data = node.data;\n      }\n    }\n  }\n\n  return data;\n}\n"],"names":["tree_find","x","y","radius","data","x0","y0","x1","y1","x2","y2","x3","y3","quads","node","q","i","Quad","xm","ym","dx","dy","d2","d"],"mappings":";AAEe,SAAAA,EAASC,GAAGC,GAAGC,GAAQ;AACpC,MAAIC,GACAC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,GACAC,GACAC,GACAC,GACAC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,IAAQ,CAAA,GACRC,IAAO,KAAK,OACZC,GACAC;AAUJ,OARIF,KAAMD,EAAM,KAAK,IAAII,EAAKH,GAAMT,GAAIC,GAAIK,GAAIC,CAAE,CAAC,GAC/CT,KAAU,OAAMA,IAAS,SAE3BE,IAAKJ,IAAIE,GAAQG,IAAKJ,IAAIC,GAC1BQ,IAAKV,IAAIE,GAAQS,IAAKV,IAAIC,GAC1BA,KAAUA,IAGLY,IAAIF,EAAM,IAAA;AAGf,QAAI,IAAEC,IAAOC,EAAE,UACPR,IAAKQ,EAAE,MAAMJ,MACbH,IAAKO,EAAE,MAAMH,MACbH,IAAKM,EAAE,MAAMV,MACbK,IAAKK,EAAE,MAAMT;AAGrB,UAAIQ,EAAK,QAAQ;AACf,YAAII,KAAMX,IAAKE,KAAM,GACjBU,KAAMX,IAAKE,KAAM;AAErBG,UAAM;AAAA,UACJ,IAAII,EAAKH,EAAK,CAAC,GAAGI,GAAIC,GAAIV,GAAIC,CAAE;AAAA,UAChC,IAAIO,EAAKH,EAAK,CAAC,GAAGP,GAAIY,GAAID,GAAIR,CAAE;AAAA,UAChC,IAAIO,EAAKH,EAAK,CAAC,GAAGI,GAAIV,GAAIC,GAAIU,CAAE;AAAA,UAChC,IAAIF,EAAKH,EAAK,CAAC,GAAGP,GAAIC,GAAIU,GAAIC,CAAE;AAAA,QAAA,IAI9BH,KAAKd,KAAKiB,MAAO,IAAKlB,KAAKiB,OAC7BH,IAAIF,EAAMA,EAAM,SAAS,CAAC,GAC1BA,EAAMA,EAAM,SAAS,CAAC,IAAIA,EAAMA,EAAM,SAAS,IAAIG,CAAC,GACpDH,EAAMA,EAAM,SAAS,IAAIG,CAAC,IAAID;AAAAA,MAElC,OAGK;AACH,YAAIK,IAAKnB,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMa,EAAK,IAAI,GACtCO,IAAKnB,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMY,EAAK,IAAI,GACtCQ,IAAKF,IAAKA,IAAKC,IAAKA;AACxB,YAAIC,IAAKnB,GAAQ;AACf,cAAIoB,IAAI,KAAK,KAAKpB,IAASmB,CAAE;AAC7BjB,UAAAA,IAAKJ,IAAIsB,GAAGjB,IAAKJ,IAAIqB,GACrBZ,IAAKV,IAAIsB,GAAGX,IAAKV,IAAIqB,GACrBnB,IAAOU,EAAK;AAAA,QACd;AAAA,MACF;AAGF,SAAOV;AACT;","x_google_ignoreList":[0]}

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

@@ -1,7 +0,0 @@
-function e(t, i, s, h, d) {
-  this.node = t, this.x0 = i, this.y0 = s, this.x1 = h, this.y1 = d;
-}
-export {
-  e as default
-};
-//# sourceMappingURL=quad.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"quad.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-quadtree/src/quad.js"],"sourcesContent":["export default function(node, x0, y0, x1, y1) {\n  this.node = node;\n  this.x0 = x0;\n  this.y0 = y0;\n  this.x1 = x1;\n  this.y1 = y1;\n}\n"],"names":["Quad","node","x0","y0","x1","y1"],"mappings":"AAAe,SAAAA,EAASC,GAAMC,GAAIC,GAAIC,GAAIC,GAAI;AAC5C,OAAK,OAAOJ,GACZ,KAAK,KAAKC,GACV,KAAK,KAAKC,GACV,KAAK,KAAKC,GACV,KAAK,KAAKC;AACZ;","x_google_ignoreList":[0]}

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

@@ -1,51 +0,0 @@
-import s, { addAll as p } from "./add.js";
-import d from "./cover.js";
-import h from "./data.js";
-import l from "./extent.js";
-import u from "./find.js";
-import _, { removeAll as v } from "./remove.js";
-import y from "./root.js";
-import x from "./size.js";
-import c from "./visit.js";
-import A from "./visitAfter.js";
-import N, { defaultX as g } from "./x.js";
-import $, { defaultY as w } from "./y.js";
-function k(t, r, e) {
-  var i = new f(r ?? g, e ?? w, NaN, NaN, NaN, NaN);
-  return t == null ? i : i.addAll(t);
-}
-function f(t, r, e, i, a, n) {
-  this._x = t, this._y = r, this._x0 = e, this._y0 = i, this._x1 = a, this._y1 = n, this._root = void 0;
-}
-function m(t) {
-  for (var r = { data: t.data }, e = r; t = t.next; ) e = e.next = { data: t.data };
-  return r;
-}
-var o = k.prototype = f.prototype;
-o.copy = function() {
-  var t = new f(this._x, this._y, this._x0, this._y0, this._x1, this._y1), r = this._root, e, i;
-  if (!r) return t;
-  if (!r.length) return t._root = m(r), t;
-  for (e = [{ source: r, target: t._root = new Array(4) }]; r = e.pop(); )
-    for (var a = 0; a < 4; ++a)
-      (i = r.source[a]) && (i.length ? e.push({ source: i, target: r.target[a] = new Array(4) }) : r.target[a] = m(i));
-  return t;
-};
-o.add = s;
-o.addAll = p;
-o.cover = d;
-o.data = h;
-o.extent = l;
-o.find = u;
-o.remove = _;
-o.removeAll = v;
-o.root = y;
-o.size = x;
-o.visit = c;
-o.visitAfter = A;
-o.x = N;
-o.y = $;
-export {
-  k as default
-};
-//# sourceMappingURL=quadtree.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"quadtree.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-quadtree/src/quadtree.js"],"sourcesContent":["import tree_add, {addAll as tree_addAll} from \"./add.js\";\nimport tree_cover from \"./cover.js\";\nimport tree_data from \"./data.js\";\nimport tree_extent from \"./extent.js\";\nimport tree_find from \"./find.js\";\nimport tree_remove, {removeAll as tree_removeAll} from \"./remove.js\";\nimport tree_root from \"./root.js\";\nimport tree_size from \"./size.js\";\nimport tree_visit from \"./visit.js\";\nimport tree_visitAfter from \"./visitAfter.js\";\nimport tree_x, {defaultX} from \"./x.js\";\nimport tree_y, {defaultY} from \"./y.js\";\n\nexport default function quadtree(nodes, x, y) {\n  var tree = new Quadtree(x == null ? defaultX : x, y == null ? defaultY : y, NaN, NaN, NaN, NaN);\n  return nodes == null ? tree : tree.addAll(nodes);\n}\n\nfunction Quadtree(x, y, x0, y0, x1, y1) {\n  this._x = x;\n  this._y = y;\n  this._x0 = x0;\n  this._y0 = y0;\n  this._x1 = x1;\n  this._y1 = y1;\n  this._root = undefined;\n}\n\nfunction leaf_copy(leaf) {\n  var copy = {data: leaf.data}, next = copy;\n  while (leaf = leaf.next) next = next.next = {data: leaf.data};\n  return copy;\n}\n\nvar treeProto = quadtree.prototype = Quadtree.prototype;\n\ntreeProto.copy = function() {\n  var copy = new Quadtree(this._x, this._y, this._x0, this._y0, this._x1, this._y1),\n      node = this._root,\n      nodes,\n      child;\n\n  if (!node) return copy;\n\n  if (!node.length) return copy._root = leaf_copy(node), copy;\n\n  nodes = [{source: node, target: copy._root = new Array(4)}];\n  while (node = nodes.pop()) {\n    for (var i = 0; i < 4; ++i) {\n      if (child = node.source[i]) {\n        if (child.length) nodes.push({source: child, target: node.target[i] = new Array(4)});\n        else node.target[i] = leaf_copy(child);\n      }\n    }\n  }\n\n  return copy;\n};\n\ntreeProto.add = tree_add;\ntreeProto.addAll = tree_addAll;\ntreeProto.cover = tree_cover;\ntreeProto.data = tree_data;\ntreeProto.extent = tree_extent;\ntreeProto.find = tree_find;\ntreeProto.remove = tree_remove;\ntreeProto.removeAll = tree_removeAll;\ntreeProto.root = tree_root;\ntreeProto.size = tree_size;\ntreeProto.visit = tree_visit;\ntreeProto.visitAfter = tree_visitAfter;\ntreeProto.x = tree_x;\ntreeProto.y = tree_y;\n"],"names":["quadtree","nodes","x","y","tree","Quadtree","defaultX","defaultY","x0","y0","x1","y1","leaf_copy","leaf","copy","next","treeProto","node","child","i","tree_add","tree_addAll","tree_cover","tree_data","tree_extent","tree_find","tree_remove","tree_removeAll","tree_root","tree_size","tree_visit","tree_visitAfter","tree_x","tree_y"],"mappings":";;;;;;;;;;;;AAae,SAASA,EAASC,GAAOC,GAAGC,GAAG;AAC5C,MAAIC,IAAO,IAAIC,EAASH,KAAYI,GAAcH,KAAYI,GAAc,KAAK,KAAK,KAAK,GAAG;AAC9F,SAAON,KAAS,OAAOG,IAAOA,EAAK,OAAOH,CAAK;AACjD;AAEA,SAASI,EAASH,GAAGC,GAAGK,GAAIC,GAAIC,GAAIC,GAAI;AACtC,OAAK,KAAKT,GACV,KAAK,KAAKC,GACV,KAAK,MAAMK,GACX,KAAK,MAAMC,GACX,KAAK,MAAMC,GACX,KAAK,MAAMC,GACX,KAAK,QAAQ;AACf;AAEA,SAASC,EAAUC,GAAM;AAEvB,WADIC,IAAO,EAAC,MAAMD,EAAK,KAAA,GAAOE,IAAOD,GAC9BD,IAAOA,EAAK,OAAME,CAAAA,IAAOA,EAAK,OAAO,EAAC,MAAMF,EAAK,KAAA;AACxD,SAAOC;AACT;AAEA,IAAIE,IAAYhB,EAAS,YAAYK,EAAS;AAE9CW,EAAU,OAAO,WAAW;AAC1B,MAAIF,IAAO,IAAIT,EAAS,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,GAC5EY,IAAO,KAAK,OACZhB,GACAiB;AAEJ,MAAI,CAACD,EAAM,QAAOH;AAElB,MAAI,CAACG,EAAK,OAAQ,QAAOH,EAAK,QAAQF,EAAUK,CAAI,GAAGH;AAGvD,OADAb,IAAQ,CAAC,EAAC,QAAQgB,GAAM,QAAQH,EAAK,QAAQ,IAAI,MAAM,CAAC,EAAA,CAAE,GACnDG,IAAOhB,EAAM,IAAA;AAClB,aAASkB,IAAI,GAAGA,IAAI,GAAG,EAAEA;AACvB,OAAID,IAAQD,EAAK,OAAOE,CAAC,OACnBD,EAAM,SAAQjB,EAAM,KAAK,EAAC,QAAQiB,GAAO,QAAQD,EAAK,OAAOE,CAAC,IAAI,IAAI,MAAM,CAAC,EAAA,CAAE,IAC9EF,EAAK,OAAOE,CAAC,IAAIP,EAAUM,CAAK;AAK3C,SAAOJ;AACT;AAEAE,EAAU,MAAMI;AAChBJ,EAAU,SAASK;AACnBL,EAAU,QAAQM;AAClBN,EAAU,OAAOO;AACjBP,EAAU,SAASQ;AACnBR,EAAU,OAAOS;AACjBT,EAAU,SAASU;AACnBV,EAAU,YAAYW;AACtBX,EAAU,OAAOY;AACjBZ,EAAU,OAAOa;AACjBb,EAAU,QAAQc;AAClBd,EAAU,aAAae;AACvBf,EAAU,IAAIgB;AACdhB,EAAU,IAAIiB;","x_google_ignoreList":[0]}

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

@@ -1,21 +0,0 @@
-function N(h) {
-  if (isNaN(_ = +this._x.call(null, h)) || isNaN(c = +this._y.call(null, h))) return this;
-  var t, e = this._root, r, n, s, a = this._x0, f = this._y0, u = this._x1, x = this._y1, _, c, l, o, d, g, i, v;
-  if (!e) return this;
-  if (e.length) for (; ; ) {
-    if ((d = _ >= (l = (a + u) / 2)) ? a = l : u = l, (g = c >= (o = (f + x) / 2)) ? f = o : x = o, t = e, !(e = e[i = g << 1 | d])) return this;
-    if (!e.length) break;
-    (t[i + 1 & 3] || t[i + 2 & 3] || t[i + 3 & 3]) && (r = t, v = i);
-  }
-  for (; e.data !== h; ) if (n = e, !(e = e.next)) return this;
-  return (s = e.next) && delete e.next, n ? (s ? n.next = s : delete n.next, this) : t ? (s ? t[i] = s : delete t[i], (e = t[0] || t[1] || t[2] || t[3]) && e === (t[3] || t[2] || t[1] || t[0]) && !e.length && (r ? r[v] = e : this._root = e), this) : (this._root = s, this);
-}
-function y(h) {
-  for (var t = 0, e = h.length; t < e; ++t) this.remove(h[t]);
-  return this;
-}
-export {
-  N as default,
-  y as removeAll
-};
-//# sourceMappingURL=remove.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"remove.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-quadtree/src/remove.js"],"sourcesContent":["export default function(d) {\n  if (isNaN(x = +this._x.call(null, d)) || isNaN(y = +this._y.call(null, d))) return this; // ignore invalid points\n\n  var parent,\n      node = this._root,\n      retainer,\n      previous,\n      next,\n      x0 = this._x0,\n      y0 = this._y0,\n      x1 = this._x1,\n      y1 = this._y1,\n      x,\n      y,\n      xm,\n      ym,\n      right,\n      bottom,\n      i,\n      j;\n\n  // If the tree is empty, initialize the root as a leaf.\n  if (!node) return this;\n\n  // Find the leaf node for the point.\n  // While descending, also retain the deepest parent with a non-removed sibling.\n  if (node.length) while (true) {\n    if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n    if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;\n    if (!(parent = node, node = node[i = bottom << 1 | right])) return this;\n    if (!node.length) break;\n    if (parent[(i + 1) & 3] || parent[(i + 2) & 3] || parent[(i + 3) & 3]) retainer = parent, j = i;\n  }\n\n  // Find the point to remove.\n  while (node.data !== d) if (!(previous = node, node = node.next)) return this;\n  if (next = node.next) delete node.next;\n\n  // If there are multiple coincident points, remove just the point.\n  if (previous) return (next ? previous.next = next : delete previous.next), this;\n\n  // If this is the root point, remove it.\n  if (!parent) return this._root = next, this;\n\n  // Remove this leaf.\n  next ? parent[i] = next : delete parent[i];\n\n  // If the parent now contains exactly one leaf, collapse superfluous parents.\n  if ((node = parent[0] || parent[1] || parent[2] || parent[3])\n      && node === (parent[3] || parent[2] || parent[1] || parent[0])\n      && !node.length) {\n    if (retainer) retainer[j] = node;\n    else this._root = node;\n  }\n\n  return this;\n}\n\nexport function removeAll(data) {\n  for (var i = 0, n = data.length; i < n; ++i) this.remove(data[i]);\n  return this;\n}\n"],"names":["tree_remove","d","x","y","parent","node","retainer","previous","next","x0","y0","x1","y1","xm","ym","right","bottom","j","removeAll","data","i","n"],"mappings":"AAAe,SAAAA,EAASC,GAAG;AACzB,MAAI,MAAMC,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMD,CAAC,CAAC,KAAK,MAAME,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMF,CAAC,CAAC,EAAG,QAAO;AAEnF,MAAIG,GACAC,IAAO,KAAK,OACZC,GACAC,GACAC,GACAC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVV,GACAC,GACAU,GACAC,GACAC,GACAC,GACA,GACAC;AAGJ,MAAI,CAACZ,EAAM,QAAO;AAIlB,MAAIA,EAAK,OAAQ,YAAa;AAG5B,SAFIU,IAAQb,MAAMW,KAAMJ,IAAKE,KAAM,MAAIF,IAAKI,IAASF,IAAKE,IACtDG,IAASb,MAAMW,KAAMJ,IAAKE,KAAM,MAAIF,IAAKI,IAASF,IAAKE,GACrDV,IAASC,GAAM,EAAAA,IAAOA,EAAK,IAAIW,KAAU,IAAID,CAAK,GAAI,QAAO;AACnE,QAAI,CAACV,EAAK,OAAQ;AAClB,KAAID,EAAQ,IAAI,IAAK,CAAC,KAAKA,EAAQ,IAAI,IAAK,CAAC,KAAKA,EAAQ,IAAI,IAAK,CAAC,OAAGE,IAAWF,GAAQa,IAAI;AAAA,EAChG;AAGA,SAAOZ,EAAK,SAASJ,IAAG,KAAMM,IAAWF,GAAM,EAAAA,IAAOA,EAAK,MAAO,QAAO;AAIzE,UAHIG,IAAOH,EAAK,SAAM,OAAOA,EAAK,MAG9BE,KAAkBC,IAAOD,EAAS,OAAOC,IAAO,OAAOD,EAAS,MAAO,QAGtEH,KAGLI,IAAOJ,EAAO,CAAC,IAAII,IAAO,OAAOJ,EAAO,CAAC,IAGpCC,IAAOD,EAAO,CAAC,KAAKA,EAAO,CAAC,KAAKA,EAAO,CAAC,KAAKA,EAAO,CAAC,MACpDC,OAAUD,EAAO,CAAC,KAAKA,EAAO,CAAC,KAAKA,EAAO,CAAC,KAAKA,EAAO,CAAC,MACzD,CAACC,EAAK,WACPC,IAAUA,EAASW,CAAC,IAAIZ,IACvB,KAAK,QAAQA,IAGb,SAba,KAAK,QAAQG,GAAM;AAczC;AAEO,SAASU,EAAUC,GAAM;AAC9B,WAASC,IAAI,GAAGC,IAAIF,EAAK,QAAQC,IAAIC,GAAG,EAAED,EAAG,MAAK,OAAOD,EAAKC,CAAC,CAAC;AAChE,SAAO;AACT;","x_google_ignoreList":[0]}

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

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"root.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-quadtree/src/root.js"],"sourcesContent":["export default function() {\n  return this._root;\n}\n"],"names":["tree_root"],"mappings":"AAAe,SAAAA,IAAW;AACxB,SAAO,KAAK;AACd;","x_google_ignoreList":[0]}

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

@@ -1,12 +0,0 @@
-function n() {
-  var e = 0;
-  return this.visit(function(i) {
-    if (!i.length) do
-      ++e;
-    while (i = i.next);
-  }), e;
-}
-export {
-  n as default
-};
-//# sourceMappingURL=size.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"size.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-quadtree/src/size.js"],"sourcesContent":["export default function() {\n  var size = 0;\n  this.visit(function(node) {\n    if (!node.length) do ++size; while (node = node.next)\n  });\n  return size;\n}\n"],"names":["tree_size","size","node"],"mappings":"AAAe,SAAAA,IAAW;AACxB,MAAIC,IAAO;AACX,SAAA,KAAK,MAAM,SAASC,GAAM;AACxB,QAAI,CAACA,EAAK,OAAQ;AAAG,QAAED;AAAAA,WAAaC,IAAOA,EAAK;AAAA,EAClD,CAAC,GACMD;AACT;","x_google_ignoreList":[0]}

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

@@ -1,14 +0,0 @@
-import n from "./quad.js";
-function _(w) {
-  var s = [], e, t = this._root, h, i, o, u, f;
-  for (t && s.push(new n(t, this._x0, this._y0, this._x1, this._y1)); e = s.pop(); )
-    if (!w(t = e.node, i = e.x0, o = e.y0, u = e.x1, f = e.y1) && t.length) {
-      var p = (i + u) / 2, r = (o + f) / 2;
-      (h = t[3]) && s.push(new n(h, p, r, u, f)), (h = t[2]) && s.push(new n(h, i, r, p, f)), (h = t[1]) && s.push(new n(h, p, o, u, r)), (h = t[0]) && s.push(new n(h, i, o, p, r));
-    }
-  return this;
-}
-export {
-  _ as default
-};
-//# sourceMappingURL=visit.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"visit.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-quadtree/src/visit.js"],"sourcesContent":["import Quad from \"./quad.js\";\n\nexport default function(callback) {\n  var quads = [], q, node = this._root, child, x0, y0, x1, y1;\n  if (node) quads.push(new Quad(node, this._x0, this._y0, this._x1, this._y1));\n  while (q = quads.pop()) {\n    if (!callback(node = q.node, x0 = q.x0, y0 = q.y0, x1 = q.x1, y1 = q.y1) && node.length) {\n      var xm = (x0 + x1) / 2, ym = (y0 + y1) / 2;\n      if (child = node[3]) quads.push(new Quad(child, xm, ym, x1, y1));\n      if (child = node[2]) quads.push(new Quad(child, x0, ym, xm, y1));\n      if (child = node[1]) quads.push(new Quad(child, xm, y0, x1, ym));\n      if (child = node[0]) quads.push(new Quad(child, x0, y0, xm, ym));\n    }\n  }\n  return this;\n}\n"],"names":["tree_visit","callback","quads","q","node","child","x0","y0","x1","y1","Quad","xm","ym"],"mappings":";AAEe,SAAAA,EAASC,GAAU;AAChC,MAAIC,IAAQ,CAAA,GAAIC,GAAGC,IAAO,KAAK,OAAOC,GAAOC,GAAIC,GAAIC,GAAIC;AAEzD,OADIL,KAAMF,EAAM,KAAK,IAAIQ,EAAKN,GAAM,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,CAAC,GACpED,IAAID,EAAM,IAAA;AACf,QAAI,CAACD,EAASG,IAAOD,EAAE,MAAMG,IAAKH,EAAE,IAAII,IAAKJ,EAAE,IAAIK,IAAKL,EAAE,IAAIM,IAAKN,EAAE,EAAE,KAAKC,EAAK,QAAQ;AACvF,UAAIO,KAAML,IAAKE,KAAM,GAAGI,KAAML,IAAKE,KAAM;AACzC,OAAIJ,IAAQD,EAAK,CAAC,MAAGF,EAAM,KAAK,IAAIQ,EAAKL,GAAOM,GAAIC,GAAIJ,GAAIC,CAAE,CAAC,IAC3DJ,IAAQD,EAAK,CAAC,MAAGF,EAAM,KAAK,IAAIQ,EAAKL,GAAOC,GAAIM,GAAID,GAAIF,CAAE,CAAC,IAC3DJ,IAAQD,EAAK,CAAC,MAAGF,EAAM,KAAK,IAAIQ,EAAKL,GAAOM,GAAIJ,GAAIC,GAAII,CAAE,CAAC,IAC3DP,IAAQD,EAAK,CAAC,MAAGF,EAAM,KAAK,IAAIQ,EAAKL,GAAOC,GAAIC,GAAII,GAAIC,CAAE,CAAC;AAAA,IACjE;AAEF,SAAO;AACT;","x_google_ignoreList":[0]}

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

@@ -1,19 +0,0 @@
-import p from "./quad.js";
-function w(y) {
-  var h = [], u = [], t;
-  for (this._root && h.push(new p(this._root, this._x0, this._y0, this._x1, this._y1)); t = h.pop(); ) {
-    var o = t.node;
-    if (o.length) {
-      var e, s = t.x0, x = t.y0, a = t.x1, i = t.y1, n = (s + a) / 2, r = (x + i) / 2;
-      (e = o[0]) && h.push(new p(e, s, x, n, r)), (e = o[1]) && h.push(new p(e, n, x, a, r)), (e = o[2]) && h.push(new p(e, s, r, n, i)), (e = o[3]) && h.push(new p(e, n, r, a, i));
-    }
-    u.push(t);
-  }
-  for (; t = u.pop(); )
-    y(t.node, t.x0, t.y0, t.x1, t.y1);
-  return this;
-}
-export {
-  w as default
-};
-//# sourceMappingURL=visitAfter.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"visitAfter.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-quadtree/src/visitAfter.js"],"sourcesContent":["import Quad from \"./quad.js\";\n\nexport default function(callback) {\n  var quads = [], next = [], q;\n  if (this._root) quads.push(new Quad(this._root, this._x0, this._y0, this._x1, this._y1));\n  while (q = quads.pop()) {\n    var node = q.node;\n    if (node.length) {\n      var child, x0 = q.x0, y0 = q.y0, x1 = q.x1, y1 = q.y1, xm = (x0 + x1) / 2, ym = (y0 + y1) / 2;\n      if (child = node[0]) quads.push(new Quad(child, x0, y0, xm, ym));\n      if (child = node[1]) quads.push(new Quad(child, xm, y0, x1, ym));\n      if (child = node[2]) quads.push(new Quad(child, x0, ym, xm, y1));\n      if (child = node[3]) quads.push(new Quad(child, xm, ym, x1, y1));\n    }\n    next.push(q);\n  }\n  while (q = next.pop()) {\n    callback(q.node, q.x0, q.y0, q.x1, q.y1);\n  }\n  return this;\n}\n"],"names":["tree_visitAfter","callback","quads","next","q","Quad","node","child","x0","y0","x1","y1","xm","ym"],"mappings":";AAEe,SAAAA,EAASC,GAAU;AAChC,MAAIC,IAAQ,CAAA,GAAIC,IAAO,CAAA,GAAIC;AAE3B,OADI,KAAK,SAAOF,EAAM,KAAK,IAAIG,EAAK,KAAK,OAAO,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,CAAC,GAChFD,IAAIF,EAAM,SAAO;AACtB,QAAII,IAAOF,EAAE;AACb,QAAIE,EAAK,QAAQ;AACf,UAAIC,GAAOC,IAAKJ,EAAE,IAAIK,IAAKL,EAAE,IAAIM,IAAKN,EAAE,IAAIO,IAAKP,EAAE,IAAIQ,KAAMJ,IAAKE,KAAM,GAAGG,KAAMJ,IAAKE,KAAM;AAC5F,OAAIJ,IAAQD,EAAK,CAAC,MAAGJ,EAAM,KAAK,IAAIG,EAAKE,GAAOC,GAAIC,GAAIG,GAAIC,CAAE,CAAC,IAC3DN,IAAQD,EAAK,CAAC,MAAGJ,EAAM,KAAK,IAAIG,EAAKE,GAAOK,GAAIH,GAAIC,GAAIG,CAAE,CAAC,IAC3DN,IAAQD,EAAK,CAAC,MAAGJ,EAAM,KAAK,IAAIG,EAAKE,GAAOC,GAAIK,GAAID,GAAID,CAAE,CAAC,IAC3DJ,IAAQD,EAAK,CAAC,MAAGJ,EAAM,KAAK,IAAIG,EAAKE,GAAOK,GAAIC,GAAIH,GAAIC,CAAE,CAAC;AAAA,IACjE;AACAR,IAAAA,EAAK,KAAKC,CAAC;AAAA,EACb;AACA,SAAOA,IAAID,EAAK,IAAA;AACdF,IAAAA,EAASG,EAAE,MAAMA,EAAE,IAAIA,EAAE,IAAIA,EAAE,IAAIA,EAAE,EAAE;AAEzC,SAAO;AACT;","x_google_ignoreList":[0]}

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

@@ -1,11 +0,0 @@
-function n(t) {
-  return t[0];
-}
-function e(t) {
-  return arguments.length ? (this._x = t, this) : this._x;
-}
-export {
-  e as default,
-  n as defaultX
-};
-//# sourceMappingURL=x.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"x.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-quadtree/src/x.js"],"sourcesContent":["export function defaultX(d) {\n  return d[0];\n}\n\nexport default function(_) {\n  return arguments.length ? (this._x = _, this) : this._x;\n}\n"],"names":["defaultX","d","tree_x","_"],"mappings":"AAAO,SAASA,EAASC,GAAG;AAC1B,SAAOA,EAAE,CAAC;AACZ;AAEe,SAAAC,EAASC,GAAG;AACzB,SAAO,UAAU,UAAU,KAAK,KAAKA,GAAG,QAAQ,KAAK;AACvD;","x_google_ignoreList":[0]}

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

@@ -1,11 +0,0 @@
-function n(t) {
-  return t[1];
-}
-function e(t) {
-  return arguments.length ? (this._y = t, this) : this._y;
-}
-export {
-  e as default,
-  n as defaultY
-};
-//# sourceMappingURL=y.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"y.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-quadtree/src/y.js"],"sourcesContent":["export function defaultY(d) {\n  return d[1];\n}\n\nexport default function(_) {\n  return arguments.length ? (this._y = _, this) : this._y;\n}\n"],"names":["defaultY","d","tree_y","_"],"mappings":"AAAO,SAASA,EAASC,GAAG;AAC1B,SAAOA,EAAE,CAAC;AACZ;AAEe,SAAAC,EAASC,GAAG;AACzB,SAAO,UAAU,UAAU,KAAK,KAAKA,GAAG,QAAQ,KAAK;AACvD;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/utils/TextMeasurer.js

@@ -1,24 +0,0 @@
-var s = Object.defineProperty, i = (r, t, e) => t in r ? s(r, t, { enumerable: !0, configurable: !0, writable: !0, value: e }) : r[t] = e, c = (r, t, e) => i(r, t + "", e);
-class u {
-  constructor(t = "14px Manrope") {
-    if (c(this, "ctx", null), document) {
-      const e = document == null ? void 0 : document.createElement("canvas");
-      e.width = 500, e.height = 30;
-      const n = e.getContext("2d");
-      n && (n.font = t, this.ctx = n);
-    }
-  }
-  set font(t) {
-    this.ctx && (this.ctx.font = t);
-  }
-  getTextMetrics(t) {
-    return this.ctx ? this.ctx.measureText(t) : null;
-  }
-  getTextWidth(t) {
-    return this.ctx ? this.ctx.measureText(t).width : 0;
-  }
-}
-export {
-  u as TextMeasurer
-};
-//# sourceMappingURL=TextMeasurer.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/utils/TextMeasurer.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"TextMeasurer.js","sources":["../../../../../../node_modules/@milaboratories/miplots4/src/utils/TextMeasurer.tsx"],"sourcesContent":["// import type {Canvas, CanvasRenderingContext2D} from 'canvas';\n// import {createCanvas} from 'canvas';\n// node-canvas https://github.com/Automattic/node-canvas has problems with building for windows\nexport class TextMeasurer {\n    ctx: CanvasRenderingContext2D | null = null;\n    constructor(font = '14px Manrope') {\n        // const canvas: Canvas = createCanvas(500, 30);\n        // const ctx = canvas.getContext('2d');\n        if (document) {\n            const canvas = document?.createElement('canvas');//createCanvas(500, 30);\n            canvas.width = 500;\n            canvas.height = 30;\n            const ctx = canvas.getContext('2d');\n            if (ctx) {\n                ctx.font = font;\n                this.ctx = ctx;\n            }\n        }\n    }\n    set font(font: string) {\n        if (this.ctx) {\n            this.ctx.font = font;\n        }\n    }\n\n    getTextMetrics(text: string):TextMetrics | null {\n        if (!this.ctx) {\n            return null;\n        }\n        return this.ctx.measureText(text);\n    }\n\n    getTextWidth(text: string): number {\n        if (!this.ctx) {\n            return 0;\n        }\n        return this.ctx.measureText(text).width;\n    }\n}\n"],"names":["TextMeasurer","font","__publicField","canvas","ctx","text"],"mappings":";AAGO,MAAMA,EAAa;AAAA,EAEtB,YAAYC,IAAO,gBAAgB;AAG/B,QAJJC,EAAA,MAAA,OAAuC,IAAA,GAI/B,UAAU;AACV,YAAMC,IAAS,qCAAU,cAAc,QAAA;AACvCA,QAAO,QAAQ,KACfA,EAAO,SAAS;AAChB,YAAMC,IAAMD,EAAO,WAAW,IAAI;AAC9BC,YACAA,EAAI,OAAOH,GACX,KAAK,MAAMG;AAAAA,IAEnB;AAAA,EACJ;AAAA,EACA,IAAI,KAAKH,GAAc;AACf,SAAK,QACL,KAAK,IAAI,OAAOA;AAAAA,EAExB;AAAA,EAEA,eAAeI,GAAiC;AAC5C,WAAK,KAAK,MAGH,KAAK,IAAI,YAAYA,CAAI,IAFrB;AAAA,EAGf;AAAA,EAEA,aAAaA,GAAsB;AAC/B,WAAK,KAAK,MAGH,KAAK,IAAI,YAAYA,CAAI,EAAE,QAFvB;AAAA,EAGf;AACJ;","x_google_ignoreList":[0]}