@milaboratories/graph-maker 1.1.137 → 1.1.139

package/dist/node_modules/@milaboratories/miplots4/dist/histogram/index.js

@@ -1,80 +1,83 @@
+import { l as y } from "../node_modules/lodash/lodash.js";
+import { renderToString as C } from "../node_modules/react-dom/server.browser.js";
 import { AbstractChart as f } from "../AbstractChart.js";
-import { createHistogramDataByFacets as C } from "./getHistogramData.js";
-import m from "../node_modules/lodash/lodash.js";
-import { renderToString as D } from "../node_modules/react-dom/server.browser.js";
-import S from "./ChartRenderer.js";
-import { HistogramSettingsImpl as p } from "./HistogramSettingsImpl.js";
-import { getKeysCombinations as b } from "../utils/getKeysCombination.js";
-var _ = Object.defineProperty, B = (u, t, a) => t in u ? _(u, t, { enumerable: !0, configurable: !0, writable: !0, value: a }) : u[t] = a, h = (u, t, a) => B(u, typeof t != "symbol" ? t + "" : t, a);
-function A(u, t, a) {
-  return t.reduce((r, n) => {
-    const o = m.uniqBy(u.rows, (e) => e[n.value]), l = (e) => String(e[n.value]), i = (e) => n.valueLabels ? String(e[n.valueLabels]) : l(e), s = o.reduce((e, d) => (e[l(d)] = i(d), e), {});
-    return r[n.value] = {
-      values: o.map(l).filter((e) => e !== "null").sort((e, d) => s[e].localeCompare(s[d], "en", { numeric: !0 })),
-      aesMap: a[n.value],
-      labels: s
-    }, r;
+import { getKeysCombinations as D } from "../utils/getKeysCombination.js";
+import b from "./ChartRenderer.js";
+import { createHistogramDataByFacets as S } from "./getHistogramData.js";
+import { HistogramSettingsImpl as g } from "./HistogramSettingsImpl.js";
+var _ = Object.defineProperty, w = (u, e, t) => e in u ? _(u, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : u[e] = t, c = (u, e, t) => w(u, typeof e != "symbol" ? e + "" : e, t);
+function x(u, e, t) {
+  return e.reduce((a, n) => {
+    const o = u.getColumnCategories(n.value, !1), l = (r) => n.valueLabels ? String(u.getColumnValue(
+      n.valueLabels,
+      u.getColumnCategoryRowIndex(n.value, r)
+    )) : r, i = o.reduce((r, s) => (r[s] = l(s), r), {});
+    return a[n.value] = {
+      values: o.sort((r, s) => i[r].localeCompare(i[s], "en", { numeric: !0 })),
+      aesMap: t[n.value],
+      labels: i
+    }, a;
   }, {});
 }
 class T extends f {
-  constructor(t, a, r) {
-    super(t, a), h(this, "settings"), h(this, "chartRenderer", new S()), h(this, "onTooltipHintSwitch", () => {
-    }), h(this, "calculatedData", null), this.settings = new p(a), r && (this.onTooltipHintSwitch = r[0]);
+  constructor(e, t, a) {
+    super(e, t), c(this, "settings"), c(this, "chartRenderer", new b()), c(this, "onTooltipHintSwitch", () => {
+    }), c(this, "calculatedData", null), this.settings = new g(t), a && (this.onTooltipHintSwitch = a[0]);
   }
-  mount(t) {
+  mount(e) {
     try {
-      this.chartRenderer.init(t), this._updateData(), this._updateChart();
-    } catch (a) {
-      a instanceof Error && this.chartRenderer.renderError(a.message);
+      this.chartRenderer.init(e), this._updateData(), this._updateChart();
+    } catch (t) {
+      t instanceof Error && (this.chartRenderer.renderError(t.message), console.error(t));
     }
   }
   unmount() {
     this.chartRenderer.clear();
   }
-  updateSettingsAndData(t, a) {
+  updateSettingsAndData(e, t) {
     try {
-      const r = this.settings, n = this.data;
-      this.settings = new p(a), this.data = t, this._needUpdateCalculatedDataBySettings(r, this.settings) || this._needUpdateCalculatedDataByData(n, this.data) ? this._updateData() : this._updateAesInData(), this._updateChart();
-    } catch (r) {
-      r instanceof Error && this.chartRenderer.renderError(r.message);
+      const a = this.settings, n = this.data;
+      this.settings = new g(t), this.data = e, this._needUpdateCalculatedDataBySettings(a, this.settings) || this._needUpdateCalculatedDataByData(n, this.data) ? this._updateData() : this._updateAesInData(), this._updateChart();
+    } catch (a) {
+      a instanceof Error && (this.chartRenderer.renderError(a.message), console.error(a));
     }
   }
-  updateChartState(t, a) {
+  updateChartState(e, t) {
     console.warn("no chart state for histogram");
   }
   export() {
-    return this._updateChart(), D(this.chartRenderer.component);
+    return this._updateChart(), C(this.chartRenderer.component);
   }
-  _needUpdateCalculatedDataBySettings(t, a) {
-    var r, n, o, l;
-    return t.valueColumn.value !== a.valueColumn.value || t.facetBy.some((i, s) => {
-      var e;
-      return i.value !== ((e = a.facetBy[s]) == null ? void 0 : e.value);
-    }) || ((r = t.grouping) == null ? void 0 : r.value) !== ((n = a.grouping) == null ? void 0 : n.value) || t.layers.length !== a.layers.length || t.layers.some((i, s) => i.type !== a.layers[s].type) || t.binsCount !== a.binsCount || t.chartSettings.xAxis.scale !== a.chartSettings.xAxis.scale || ((o = t.groupingOrder) == null ? void 0 : o.some((i, s) => {
-      var e;
-      return i !== ((e = a.groupingOrder) == null ? void 0 : e[s]);
-    })) || ((l = a.groupingOrder) == null ? void 0 : l.some((i, s) => {
-      var e;
-      return i !== ((e = t.groupingOrder) == null ? void 0 : e[s]);
+  _needUpdateCalculatedDataBySettings(e, t) {
+    var a, n, o, l;
+    return e.valueColumn.value !== t.valueColumn.value || e.facetBy.some((i, r) => {
+      var s;
+      return i.value !== ((s = t.facetBy[r]) == null ? void 0 : s.value);
+    }) || ((a = e.grouping) == null ? void 0 : a.value) !== ((n = t.grouping) == null ? void 0 : n.value) || e.layers.length !== t.layers.length || e.layers.some((i, r) => i.type !== t.layers[r].type) || e.binsCount !== t.binsCount || e.chartSettings.xAxis.scale !== t.chartSettings.xAxis.scale || ((o = e.groupingOrder) == null ? void 0 : o.some((i, r) => {
+      var s;
+      return i !== ((s = t.groupingOrder) == null ? void 0 : s[r]);
+    })) || ((l = t.groupingOrder) == null ? void 0 : l.some((i, r) => {
+      var s;
+      return i !== ((s = e.groupingOrder) == null ? void 0 : s[r]);
     }));
   }
-  _needUpdateCalculatedDataByData(t, a) {
-    const r = Object.keys(t.data), n = Object.keys(a.data);
-    return t.id !== a.id || r.length !== n.length || r.some((o) => {
+  _needUpdateCalculatedDataByData(e, t) {
+    const a = Object.keys(e.data), n = Object.keys(t.data);
+    return e.id !== t.id || a.length !== n.length || a.some((o) => {
       var l;
-      return t.data[o].length !== ((l = a.data[o]) == null ? void 0 : l.length);
+      return e.data[o].length !== ((l = t.data[o]) == null ? void 0 : l.length);
     });
   }
   _updateData() {
-    const { valueColumn: t, facetBy: a, grouping: r, binsCount: n, chartSettings: o, inheritedAes: l, groupingOrder: i } = this.settings, s = a.map((c) => this.data.getColumnCategories(c.value)), e = s.length ? b([...s]) : [["null"]], d = a.map((c) => c.value) ?? null, v = r ? [r.value] : [];
-    let g = r ? this.data.getColumnCategories(r.value) : ["null"];
-    i && (g = m.intersection(i, g)), this.data.setGrouping([...d, ...v]);
-    const y = C(this.data, e, g, t, n, o.xAxis.scale);
+    const { valueColumn: e, facetBy: t, grouping: a, binsCount: n, chartSettings: o, inheritedAes: l, groupingOrder: i } = this.settings, r = t.map((d) => this.data.getColumnCategories(d.value)), s = r.length ? D([...r]) : [["null"]], p = t.map((d) => d.value) ?? null, m = a ? [a.value] : [];
+    let h = a ? this.data.getColumnCategories(a.value) : ["null"];
+    i && (h = y.intersection(i, h)), this.data.setGrouping([...p, ...m]);
+    const v = S(this.data, s, h, e, n, o.xAxis.scale);
     this.calculatedData = {
-      facetKeys: e.map((c) => c.join(", ")),
-      facetKeysCombinations: e,
-      histogramDataByFacets: y,
-      legendInfo: A(this.data, r ? [r] : [], l)
+      facetKeys: s.map((d) => d.join(", ")),
+      facetKeysCombinations: s,
+      histogramDataByFacets: v,
+      legendInfo: x(this.data, a ? [a] : [], l)
     };
   }
   _updateAesInData() {
@@ -83,11 +86,12 @@ class T extends f {
   _updateChart() {
     if (!this.calculatedData)
       return;
-    const { id: t, chartSettings: a, facetSettings: r, inheritedAes: n, layers: o, grouping: l, groupingDirection: i, groupingStack: s } = this.settings;
+    const { id: e, chartSettings: t, facetSettings: a, inheritedAes: n, layers: o, grouping: l, groupingDirection: i, groupingStack: r } = this.settings;
     this.chartRenderer.render(
+      this.data,
+      e,
       t,
       a,
-      r,
       this.calculatedData.facetKeys,
       this.calculatedData.facetKeysCombinations,
       //for titles, if facet by more than 1 column
@@ -96,7 +100,7 @@ class T extends f {
       o,
       n,
       l,
-      s,
+      r,
       i,
       this.onTooltipHintSwitch
     );

package/dist/node_modules/@milaboratories/miplots4/dist/histogram/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sources":["../../../../../../node_modules/@milaboratories/miplots4/src/histogram/index.ts"],"sourcesContent":["import {AbstractChart} from '../AbstractChart';\nimport type {HistogramLegendInfo} from './components/types';\nimport type {GroupedHistogramData} from './getHistogramData';\nimport {createHistogramDataByFacets} from './getHistogramData';\nimport type {ColumnName, HistogramEventHandlers, Row} from '../types';\nimport type {HistogramSettings} from '../types';\nimport lodash from 'lodash';\nimport {renderToString} from 'react-dom/server';\nimport ChartRenderer from './ChartRenderer';\nimport {HistogramSettingsImpl} from './HistogramSettingsImpl';\nimport type {DataFrame} from '../DataFrame';\nimport {getKeysCombinations} from '../utils/getKeysCombination';\n\nfunction getLegendInfo(\n    data: DataFrame,\n    grouping: ColumnName[],\n    inheritedAes: HistogramSettingsImpl['inheritedAes']\n): HistogramLegendInfo {\n    return grouping.reduce((res: HistogramLegendInfo, column) => {\n        const uniqRowsByGrouping = lodash.uniqBy(data.rows, row => row[column.value]);\n        const getValue = (row: Row) => String(row[column.value]);\n        const getValueLabel = (row: Row) => (column.valueLabels ? String(row[column.valueLabels]) : getValue(row));\n        const labels = uniqRowsByGrouping.reduce((res: Record<string, string>, row) => {\n            res[getValue(row)] = getValueLabel(row);\n            return res;\n        }, {});\n        res[column.value] = {\n            values: uniqRowsByGrouping.map(getValue).filter((v) => v !== 'null').sort((a, b) => labels[a].localeCompare(labels[b], 'en', {numeric: true})),\n            aesMap: inheritedAes[column.value],\n            labels,\n        };\n        return res;\n    }, {});\n}\nexport class ChartHistogram extends AbstractChart {\n    settings: HistogramSettingsImpl;\n    chartRenderer = new ChartRenderer();\n\n    onTooltipHintSwitch: (v:boolean) => void = () => undefined;\n    calculatedData: {\n        facetKeys: string[];\n        facetKeysCombinations: string[][];\n        histogramDataByFacets: Record<string, GroupedHistogramData>\n        legendInfo: HistogramLegendInfo\n    } | null = null;\n\n    constructor(data: DataFrame, settings: HistogramSettings, eventHandlers?: HistogramEventHandlers) {\n        super(data, settings);\n\n        this.settings = new HistogramSettingsImpl(settings);\n        if (eventHandlers) {\n            this.onTooltipHintSwitch = eventHandlers[0];\n        }\n    }\n\n    mount(node: HTMLElement) {\n        try {\n            this.chartRenderer.init(node);\n            this._updateData();\n            this._updateChart();\n        } catch (err) {\n            if (err instanceof Error) {\n                this.chartRenderer.renderError(err.message as string);\n            }\n        }\n    }\n\n    unmount() {\n        this.chartRenderer.clear();\n    }\n\n    updateSettingsAndData(data: DataFrame, settings: HistogramSettings) {\n        try {\n            const previousSettings = this.settings;\n            const previousData = this.data;\n            this.settings = new HistogramSettingsImpl(settings);\n            this.data = data;\n            if (\n                this._needUpdateCalculatedDataBySettings(previousSettings, this.settings) ||\n                this._needUpdateCalculatedDataByData(previousData, this.data)\n            ) {\n                this._updateData();\n            } else {\n                this._updateAesInData();\n            }\n            this._updateChart();\n        } catch (err) {\n            if (err instanceof Error) {\n                this.chartRenderer.renderError(err.message as string);\n            }\n        }\n    }\n\n    updateChartState(_field: string, _value: unknown) {\n        console.warn('no chart state for histogram');\n    }\n\n    export(): string {\n        this._updateChart();\n        return renderToString(this.chartRenderer.component);\n    }\n\n    _needUpdateCalculatedDataBySettings(prevSettings: HistogramSettingsImpl, settings: HistogramSettingsImpl) {\n        return (\n            prevSettings.valueColumn.value !== settings.valueColumn.value ||\n            prevSettings.facetBy.some((el, idx) => el.value !== settings.facetBy[idx]?.value) ||\n            prevSettings.grouping?.value !== settings.grouping?.value ||\n            prevSettings.layers.length !== settings.layers.length ||\n            prevSettings.layers.some((l, idx) => l.type !== settings.layers[idx].type) ||\n            prevSettings.binsCount !== settings.binsCount ||\n            prevSettings.chartSettings.xAxis.scale !== settings.chartSettings.xAxis.scale ||\n            prevSettings.groupingOrder?.some((key, idx) => key !== settings.groupingOrder?.[idx]) ||\n            settings.groupingOrder?.some((key, idx) => key !== prevSettings.groupingOrder?.[idx])\n        );\n    }\n\n    _needUpdateCalculatedDataByData(prevData: DataFrame, data: DataFrame) {\n        const prevKeys = Object.keys(prevData.data);\n        const keys = Object.keys(data.data);\n        return (\n            prevData.id !== data.id ||\n            prevKeys.length !== keys.length ||\n            prevKeys.some(key => prevData.data[key].length !== data.data[key]?.length)\n        );\n    }\n\n    _updateData() {\n        const {valueColumn, facetBy, grouping, binsCount, chartSettings, inheritedAes, groupingOrder} = this.settings;\n\n        const facetKeysLists = facetBy.map(column => this.data.getColumnCategories(column.value));\n        const facetKeysCombinations = facetKeysLists.length ? getKeysCombinations([...facetKeysLists]) : [['null']];\n        const facetGroupingValues = facetBy.map(column => column.value) ?? null;\n        const groupingValues = grouping ? [grouping.value] : [];\n        let groupingKeys = grouping ? this.data.getColumnCategories(grouping.value) : ['null'];\n        if (groupingOrder) {\n            groupingKeys = lodash.intersection(groupingOrder, groupingKeys);\n        }\n\n        this.data.setGrouping([...facetGroupingValues, ...groupingValues]);\n        const histogramDataByFacets = createHistogramDataByFacets(this.data, facetKeysCombinations, groupingKeys, valueColumn, binsCount, chartSettings.xAxis.scale);\n\n        this.calculatedData = {\n            facetKeys: facetKeysCombinations.map(v => v.join(', ')),\n            facetKeysCombinations,\n            histogramDataByFacets,\n            legendInfo: getLegendInfo(this.data, grouping ? [grouping] : [], inheritedAes)\n        };\n    }\n\n    _updateAesInData() {\n        const calculated = this.calculatedData;\n        if (!calculated) {\n            return;\n        }\n    }\n\n    _updateChart() {\n        if (!this.calculatedData) {\n            return;\n        }\n        const {id, chartSettings, facetSettings, inheritedAes, layers, grouping, groupingDirection, groupingStack} = this.settings;\n        this.chartRenderer.render(\n            id,\n            chartSettings,\n            facetSettings,\n            this.calculatedData.facetKeys,\n            this.calculatedData.facetKeysCombinations, //for titles, if facet by more than 1 column\n            this.calculatedData.histogramDataByFacets,\n            this.calculatedData.legendInfo,\n            layers,\n            inheritedAes,\n            grouping,\n            groupingStack,\n            groupingDirection,\n            this.onTooltipHintSwitch\n        );\n    }\n}\n"],"names":["getLegendInfo","data","grouping","inheritedAes","res","column","uniqRowsByGrouping","lodash","row","getValue","getValueLabel","labels","v","a","b","ChartHistogram","AbstractChart","settings","eventHandlers","__publicField","ChartRenderer","HistogramSettingsImpl","node","err","previousSettings","previousData","_field","_value","renderToString","prevSettings","el","idx","_a","_b","l","_c","key","_d","prevData","prevKeys","keys","valueColumn","facetBy","binsCount","chartSettings","groupingOrder","facetKeysLists","facetKeysCombinations","getKeysCombinations","facetGroupingValues","groupingValues","groupingKeys","histogramDataByFacets","createHistogramDataByFacets","id","facetSettings","layers","groupingDirection","groupingStack"],"mappings":";;;;;;;;AAaA,SAASA,EACLC,GACAC,GACAC,GACmB;AACnB,SAAOD,EAAS,OAAO,CAACE,GAA0BC,MAAW;AACzD,UAAMC,IAAqBC,EAAO,OAAON,EAAK,MAAM,CAAAO,MAAOA,EAAIH,EAAO,KAAK,CAAC,GACtEI,IAAW,CAACD,MAAa,OAAOA,EAAIH,EAAO,KAAK,CAAC,GACjDK,IAAgB,CAACF,MAAcH,EAAO,cAAc,OAAOG,EAAIH,EAAO,WAAW,CAAC,IAAII,EAASD,CAAG,GAClGG,IAASL,EAAmB,OAAO,CAACF,GAA6BI,OACnEJ,EAAIK,EAASD,CAAG,CAAC,IAAIE,EAAcF,CAAG,GAC/BJ,IACR,EAAE;AACL,WAAAA,EAAIC,EAAO,KAAK,IAAI;AAAA,MAChB,QAAQC,EAAmB,IAAIG,CAAQ,EAAE,OAAO,CAACG,MAAMA,MAAM,MAAM,EAAE,KAAK,CAACC,GAAGC,MAAMH,EAAOE,CAAC,EAAE,cAAcF,EAAOG,CAAC,GAAG,MAAM,EAAC,SAAS,GAAA,CAAK,CAAC;AAAA,MAC7I,QAAQX,EAAaE,EAAO,KAAK;AAAA,MACjC,QAAAM;AAAAA,IAAA,GAEGP;AAAAA,EACX,GAAG,CAAA,CAAE;AACT;AACO,MAAMW,UAAuBC,EAAc;AAAA,EAY9C,YAAYf,GAAiBgB,GAA6BC,GAAwC;AAC9F,UAAMjB,GAAMgB,CAAQ,GAZxBE,EAAA,MAAA,UAAA,GACAA,EAAA,MAAA,iBAAgB,IAAIC,EAAAA,CAAA,GAEpBD,EAAA,6BAA2C,MAAA;AAAA,IAAA,CAAA,GAC3CA,EAAA,MAAA,kBAKW,IAAA,GAKP,KAAK,WAAW,IAAIE,EAAsBJ,CAAQ,GAC9CC,MACA,KAAK,sBAAsBA,EAAc,CAAC;AAAA,EAElD;AAAA,EAEA,MAAMI,GAAmB;AACrB,QAAI;AACA,WAAK,cAAc,KAAKA,CAAI,GAC5B,KAAK,YAAA,GACL,KAAK,aAAA;AAAA,IACT,SAASC,GAAK;AACNA,MAAAA,aAAe,SACf,KAAK,cAAc,YAAYA,EAAI,OAAiB;AAAA,IAE5D;AAAA,EACJ;AAAA,EAEA,UAAU;AACN,SAAK,cAAc,MAAA;AAAA,EACvB;AAAA,EAEA,sBAAsBtB,GAAiBgB,GAA6B;AAChE,QAAI;AACA,YAAMO,IAAmB,KAAK,UACxBC,IAAe,KAAK;AAC1B,WAAK,WAAW,IAAIJ,EAAsBJ,CAAQ,GAClD,KAAK,OAAOhB,GAER,KAAK,oCAAoCuB,GAAkB,KAAK,QAAQ,KACxE,KAAK,gCAAgCC,GAAc,KAAK,IAAI,IAE5D,KAAK,YAAA,IAEL,KAAK,oBAET,KAAK,aAAA;AAAA,IACT,SAASF,GAAK;AACNA,MAAAA,aAAe,SACf,KAAK,cAAc,YAAYA,EAAI,OAAiB;AAAA,IAE5D;AAAA,EACJ;AAAA,EAEA,iBAAiBG,GAAgBC,GAAiB;AAC9C,YAAQ,KAAK,8BAA8B;AAAA,EAC/C;AAAA,EAEA,SAAiB;AACb,WAAA,KAAK,aAAA,GACEC,EAAe,KAAK,cAAc,SAAS;AAAA,EACtD;AAAA,EAEA,oCAAoCC,GAAqCZ,GAAiC;;AACtG,WACIY,EAAa,YAAY,UAAUZ,EAAS,YAAY,SACxDY,EAAa,QAAQ,KAAK,CAACC,GAAIC,MAAAA;;AAAQ,aAAAD,EAAG,YAAUE,IAAAf,EAAS,QAAQc,CAAG,MAApB,gBAAAC,EAAuB;AAAA,IAAA,CAAK,OAChFA,IAAAH,EAAa,aAAb,OAAA,SAAAG,EAAuB,aAAUC,IAAAhB,EAAS,aAAT,OAAA,SAAAgB,EAAmB,UACpDJ,EAAa,OAAO,WAAWZ,EAAS,OAAO,UAC/CY,EAAa,OAAO,KAAK,CAACK,GAAGH,MAAQG,EAAE,SAASjB,EAAS,OAAOc,CAAG,EAAE,IAAI,KACzEF,EAAa,cAAcZ,EAAS,aACpCY,EAAa,cAAc,MAAM,UAAUZ,EAAS,cAAc,MAAM,WACxEkB,IAAAN,EAAa,kBAAb,OAAA,SAAAM,EAA4B,KAAK,CAACC,GAAKL,MAAAA;;AAAQ,aAAAK,QAAQJ,IAAAf,EAAS,kBAAT,gBAAAe,EAAyBD,CAAAA;AAAAA,IAAA,CAAA,QAChFM,IAAApB,EAAS,kBAAT,OAAA,SAAAoB,EAAwB,KAAK,CAACD,GAAKL,MAAA;;AAAQ,aAAAK,QAAQJ,IAAAH,EAAa,kBAAb,gBAAAG,EAA6BD,CAAAA;AAAAA,IAAA,CAAA;AAAA,EAExF;AAAA,EAEA,gCAAgCO,GAAqBrC,GAAiB;AAClE,UAAMsC,IAAW,OAAO,KAAKD,EAAS,IAAI,GACpCE,IAAO,OAAO,KAAKvC,EAAK,IAAI;AAClC,WACIqC,EAAS,OAAOrC,EAAK,MACrBsC,EAAS,WAAWC,EAAK,UACzBD,EAAS,KAAK,CAAA,MAAA;;AAAO,aAAAD,EAAS,KAAKF,CAAG,EAAE,aAAWJ,IAAA/B,EAAK,KAAKmC,CAAG,MAAb,OAAA,SAAAJ,EAAgB;AAAA,IAAA,CAAM;AAAA,EAEjF;AAAA,EAEA,cAAc;AACV,UAAM,EAAC,aAAAS,GAAa,SAAAC,GAAS,UAAAxC,GAAU,WAAAyC,GAAW,eAAAC,GAAe,cAAAzC,GAAc,eAAA0C,EAAAA,IAAiB,KAAK,UAE/FC,IAAiBJ,EAAQ,IAAI,CAAArC,MAAU,KAAK,KAAK,oBAAoBA,EAAO,KAAK,CAAC,GAClF0C,IAAwBD,EAAe,SAASE,EAAoB,CAAC,GAAGF,CAAc,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,GACpGG,IAAsBP,EAAQ,IAAI,CAAArC,MAAUA,EAAO,KAAK,KAAK,MAC7D6C,IAAiBhD,IAAW,CAACA,EAAS,KAAK,IAAI,CAAA;AACrD,QAAIiD,IAAejD,IAAW,KAAK,KAAK,oBAAoBA,EAAS,KAAK,IAAI,CAAC,MAAM;AACjF2C,IAAAA,MACAM,IAAe5C,EAAO,aAAasC,GAAeM,CAAY,IAGlE,KAAK,KAAK,YAAY,CAAC,GAAGF,GAAqB,GAAGC,CAAc,CAAC;AACjE,UAAME,IAAwBC,EAA4B,KAAK,MAAMN,GAAuBI,GAAcV,GAAaE,GAAWC,EAAc,MAAM,KAAK;AAE3J,SAAK,iBAAiB;AAAA,MAClB,WAAWG,EAAsB,IAAI,OAAKnC,EAAE,KAAK,IAAI,CAAC;AAAA,MACtD,uBAAAmC;AAAAA,MACA,uBAAAK;AAAAA,MACA,YAAYpD,EAAc,KAAK,MAAME,IAAW,CAACA,CAAQ,IAAI,CAAA,GAAIC,CAAY;AAAA,IAAA;AAAA,EAErF;AAAA,EAEA,mBAAmB;AACI,SAAK;AAAA,EAI5B;AAAA,EAEA,eAAe;AACX,QAAI,CAAC,KAAK;AACN;AAEJ,UAAM,EAAC,IAAAmD,GAAI,eAAAV,GAAe,eAAAW,GAAe,cAAApD,GAAc,QAAAqD,GAAQ,UAAAtD,GAAU,mBAAAuD,GAAmB,eAAAC,MAAiB,KAAK;AAClH,SAAK,cAAc;AAAA,MACfJ;AAAAA,MACAV;AAAAA,MACAW;AAAAA,MACA,KAAK,eAAe;AAAA,MACpB,KAAK,eAAe;AAAA;AAAA,MACpB,KAAK,eAAe;AAAA,MACpB,KAAK,eAAe;AAAA,MACpBC;AAAAA,MACArD;AAAAA,MACAD;AAAAA,MACAwD;AAAAA,MACAD;AAAAA,MACA,KAAK;AAAA,IAAA;AAAA,EAEb;AACJ;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.js","sources":["../../../../../../node_modules/@milaboratories/miplots4/src/histogram/index.ts"],"sourcesContent":["import {\n    intersection\n} from 'lodash';\nimport { renderToString } from 'react-dom/server';\nimport { AbstractChart } from '../AbstractChart';\nimport type { DataFrame } from '../DataFrame';\nimport type { Category, ColumnName, HistogramEventHandlers, HistogramSettings } from '../types';\nimport { getKeysCombinations } from '../utils/getKeysCombination';\nimport ChartRenderer from './ChartRenderer';\nimport type { HistogramLegendInfo } from './components/types';\nimport type { GroupedHistogramData } from './getHistogramData';\nimport { createHistogramDataByFacets } from './getHistogramData';\nimport { HistogramSettingsImpl } from './HistogramSettingsImpl';\n\nfunction getLegendInfo(\n    data: DataFrame,\n    grouping: ColumnName[],\n    inheritedAes: HistogramSettingsImpl['inheritedAes']\n): HistogramLegendInfo {\n    return grouping.reduce((res: HistogramLegendInfo, column) => {\n        const categories = data.getColumnCategories(column.value, false);\n        const getValueLabel = (category: Category) => (column.valueLabels\n            ? String(data.getColumnValue(\n                column.valueLabels,\n                data.getColumnCategoryRowIndex(column.value, category)\n            ))\n            : category\n        );\n        const labels = categories.reduce((res: Record<string, string>, category) => {\n            res[category] = getValueLabel(category);\n            return res;\n        }, {});\n        res[column.value] = {\n            values: categories.sort((a, b) => labels[a].localeCompare(labels[b], 'en', {numeric: true})),\n            aesMap: inheritedAes[column.value],\n            labels,\n        };\n        return res;\n    }, {});\n}\n\nexport class ChartHistogram extends AbstractChart {\n    settings: HistogramSettingsImpl;\n    chartRenderer = new ChartRenderer();\n\n    onTooltipHintSwitch: (v:boolean) => void = () => undefined;\n    calculatedData: {\n        facetKeys: string[];\n        facetKeysCombinations: string[][];\n        histogramDataByFacets: Record<string, GroupedHistogramData>\n        legendInfo: HistogramLegendInfo\n    } | null = null;\n\n    constructor(data: DataFrame, settings: HistogramSettings, eventHandlers?: HistogramEventHandlers) {\n        super(data, settings);\n\n        this.settings = new HistogramSettingsImpl(settings);\n        if (eventHandlers) {\n            this.onTooltipHintSwitch = eventHandlers[0];\n        }\n    }\n\n    mount(node: HTMLElement) {\n        try {\n            this.chartRenderer.init(node);\n            this._updateData();\n            this._updateChart();\n        } catch (err) {\n            if (err instanceof Error) {\n                this.chartRenderer.renderError(err.message as string);\n                console.error(err);\n            }\n        }\n    }\n\n    unmount() {\n        this.chartRenderer.clear();\n    }\n\n    updateSettingsAndData(data: DataFrame, settings: HistogramSettings) {\n        try {\n            const previousSettings = this.settings;\n            const previousData = this.data;\n            this.settings = new HistogramSettingsImpl(settings);\n            this.data = data;\n            if (\n                this._needUpdateCalculatedDataBySettings(previousSettings, this.settings) ||\n                this._needUpdateCalculatedDataByData(previousData, this.data)\n            ) {\n                this._updateData();\n            } else {\n                this._updateAesInData();\n            }\n            this._updateChart();\n        } catch (err) {\n            if (err instanceof Error) {\n                this.chartRenderer.renderError(err.message as string);\n                console.error(err);\n            }\n        }\n    }\n\n    updateChartState(_field: string, _value: unknown) {\n        console.warn('no chart state for histogram');\n    }\n\n    export(): string {\n        this._updateChart();\n        return renderToString(this.chartRenderer.component);\n    }\n\n    _needUpdateCalculatedDataBySettings(prevSettings: HistogramSettingsImpl, settings: HistogramSettingsImpl) {\n        return (\n            prevSettings.valueColumn.value !== settings.valueColumn.value ||\n            prevSettings.facetBy.some((el, idx) => el.value !== settings.facetBy[idx]?.value) ||\n            prevSettings.grouping?.value !== settings.grouping?.value ||\n            prevSettings.layers.length !== settings.layers.length ||\n            prevSettings.layers.some((l, idx) => l.type !== settings.layers[idx].type) ||\n            prevSettings.binsCount !== settings.binsCount ||\n            prevSettings.chartSettings.xAxis.scale !== settings.chartSettings.xAxis.scale ||\n            prevSettings.groupingOrder?.some((key, idx) => key !== settings.groupingOrder?.[idx]) ||\n            settings.groupingOrder?.some((key, idx) => key !== prevSettings.groupingOrder?.[idx])\n        );\n    }\n\n    _needUpdateCalculatedDataByData(prevData: DataFrame, data: DataFrame) {\n        const prevKeys = Object.keys(prevData.data);\n        const keys = Object.keys(data.data);\n        return (\n            prevData.id !== data.id ||\n            prevKeys.length !== keys.length ||\n            prevKeys.some(key => prevData.data[key].length !== data.data[key]?.length)\n        );\n    }\n\n    _updateData() {\n        const {valueColumn, facetBy, grouping, binsCount, chartSettings, inheritedAes, groupingOrder} = this.settings;\n\n        const facetKeysLists = facetBy.map(column => this.data.getColumnCategories(column.value));\n        const facetKeysCombinations = facetKeysLists.length ? getKeysCombinations([...facetKeysLists]) : [['null']];\n        const facetGroupingValues = facetBy.map(column => column.value) ?? null;\n        const groupingValues = grouping ? [grouping.value] : [];\n        let groupingKeys = grouping ? this.data.getColumnCategories(grouping.value) : ['null'];\n        if (groupingOrder) {\n            groupingKeys = intersection(groupingOrder, groupingKeys);\n        }\n\n        this.data.setGrouping([...facetGroupingValues, ...groupingValues]);\n        const histogramDataByFacets = createHistogramDataByFacets(this.data, facetKeysCombinations, groupingKeys, valueColumn, binsCount, chartSettings.xAxis.scale);\n\n        this.calculatedData = {\n            facetKeys: facetKeysCombinations.map(v => v.join(', ')),\n            facetKeysCombinations,\n            histogramDataByFacets,\n            legendInfo: getLegendInfo(this.data, grouping ? [grouping] : [], inheritedAes)\n        };\n    }\n\n    _updateAesInData() {\n        const calculated = this.calculatedData;\n        if (!calculated) {\n            return;\n        }\n    }\n\n    _updateChart() {\n        if (!this.calculatedData) {\n            return;\n        }\n        const {id, chartSettings, facetSettings, inheritedAes, layers, grouping, groupingDirection, groupingStack} = this.settings;\n        this.chartRenderer.render(\n            this.data,\n            id,\n            chartSettings,\n            facetSettings,\n            this.calculatedData.facetKeys,\n            this.calculatedData.facetKeysCombinations, //for titles, if facet by more than 1 column\n            this.calculatedData.histogramDataByFacets,\n            this.calculatedData.legendInfo,\n            layers,\n            inheritedAes,\n            grouping,\n            groupingStack,\n            groupingDirection,\n            this.onTooltipHintSwitch\n        );\n    }\n}\n"],"names":["getLegendInfo","data","grouping","inheritedAes","res","column","categories","getValueLabel","category","labels","a","b","ChartHistogram","AbstractChart","settings","eventHandlers","__publicField","ChartRenderer","HistogramSettingsImpl","node","err","previousSettings","previousData","_field","_value","renderToString","prevSettings","el","idx","_a","_b","l","_c","key","_d","prevData","prevKeys","keys","valueColumn","facetBy","binsCount","chartSettings","groupingOrder","facetKeysLists","facetKeysCombinations","getKeysCombinations","facetGroupingValues","groupingValues","groupingKeys","intersection","histogramDataByFacets","createHistogramDataByFacets","v","id","facetSettings","layers","groupingDirection","groupingStack"],"mappings":";;;;;;;;AAcA,SAASA,EACLC,GACAC,GACAC,GACmB;AACnB,SAAOD,EAAS,OAAO,CAACE,GAA0BC,MAAW;AACzD,UAAMC,IAAaL,EAAK,oBAAoBI,EAAO,OAAO,EAAK,GACzDE,IAAgB,CAACC,MAAwBH,EAAO,cAChD,OAAOJ,EAAK;AAAA,MACVI,EAAO;AAAA,MACPJ,EAAK,0BAA0BI,EAAO,OAAOG,CAAQ;AAAA,IAAA,CACxD,IACCA,GAEAC,IAASH,EAAW,OAAO,CAACF,GAA6BI,OAC3DJ,EAAII,CAAQ,IAAID,EAAcC,CAAQ,GAC/BJ,IACR,EAAE;AACL,WAAAA,EAAIC,EAAO,KAAK,IAAI;AAAA,MAChB,QAAQC,EAAW,KAAK,CAACI,GAAGC,MAAMF,EAAOC,CAAC,EAAE,cAAcD,EAAOE,CAAC,GAAG,MAAM,EAAC,SAAS,GAAA,CAAK,CAAC;AAAA,MAC3F,QAAQR,EAAaE,EAAO,KAAK;AAAA,MACjC,QAAAI;AAAAA,IAAA,GAEGL;AAAAA,EACX,GAAG,CAAA,CAAE;AACT;AAEO,MAAMQ,UAAuBC,EAAc;AAAA,EAY9C,YAAYZ,GAAiBa,GAA6BC,GAAwC;AAC9F,UAAMd,GAAMa,CAAQ,GAZxBE,EAAA,MAAA,UAAA,GACAA,EAAA,MAAA,iBAAgB,IAAIC,EAAAA,CAAA,GAEpBD,EAAA,6BAA2C,MAAA;AAAA,IAAA,CAAA,GAC3CA,EAAA,MAAA,kBAKW,IAAA,GAKP,KAAK,WAAW,IAAIE,EAAsBJ,CAAQ,GAC9CC,MACA,KAAK,sBAAsBA,EAAc,CAAC;AAAA,EAElD;AAAA,EAEA,MAAMI,GAAmB;AACrB,QAAI;AACA,WAAK,cAAc,KAAKA,CAAI,GAC5B,KAAK,YAAA,GACL,KAAK,aAAA;AAAA,IACT,SAASC,GAAK;AACNA,MAAAA,aAAe,UACf,KAAK,cAAc,YAAYA,EAAI,OAAiB,GACpD,QAAQ,MAAMA,CAAG;AAAA,IAEzB;AAAA,EACJ;AAAA,EAEA,UAAU;AACN,SAAK,cAAc,MAAA;AAAA,EACvB;AAAA,EAEA,sBAAsBnB,GAAiBa,GAA6B;AAChE,QAAI;AACA,YAAMO,IAAmB,KAAK,UACxBC,IAAe,KAAK;AAC1B,WAAK,WAAW,IAAIJ,EAAsBJ,CAAQ,GAClD,KAAK,OAAOb,GAER,KAAK,oCAAoCoB,GAAkB,KAAK,QAAQ,KACxE,KAAK,gCAAgCC,GAAc,KAAK,IAAI,IAE5D,KAAK,YAAA,IAEL,KAAK,oBAET,KAAK,aAAA;AAAA,IACT,SAASF,GAAK;AACNA,mBAAe,UACf,KAAK,cAAc,YAAYA,EAAI,OAAiB,GACpD,QAAQ,MAAMA,CAAG;AAAA,IAEzB;AAAA,EACJ;AAAA,EAEA,iBAAiBG,GAAgBC,GAAiB;AAC9C,YAAQ,KAAK,8BAA8B;AAAA,EAC/C;AAAA,EAEA,SAAiB;AACb,WAAA,KAAK,aAAA,GACEC,EAAe,KAAK,cAAc,SAAS;AAAA,EACtD;AAAA,EAEA,oCAAoCC,GAAqCZ,GAAiC;;AACtG,WACIY,EAAa,YAAY,UAAUZ,EAAS,YAAY,SACxDY,EAAa,QAAQ,KAAK,CAACC,GAAIC,MAAAA;;AAAQ,aAAAD,EAAG,YAAUE,IAAAf,EAAS,QAAQc,CAAG,MAApB,gBAAAC,EAAuB;AAAA,IAAA,CAAK,OAChFA,IAAAH,EAAa,aAAb,OAAA,SAAAG,EAAuB,aAAUC,IAAAhB,EAAS,aAAT,OAAA,SAAAgB,EAAmB,UACpDJ,EAAa,OAAO,WAAWZ,EAAS,OAAO,UAC/CY,EAAa,OAAO,KAAK,CAACK,GAAGH,MAAQG,EAAE,SAASjB,EAAS,OAAOc,CAAG,EAAE,IAAI,KACzEF,EAAa,cAAcZ,EAAS,aACpCY,EAAa,cAAc,MAAM,UAAUZ,EAAS,cAAc,MAAM,WACxEkB,IAAAN,EAAa,kBAAb,OAAA,SAAAM,EAA4B,KAAK,CAACC,GAAKL,MAAAA;;AAAQ,aAAAK,QAAQJ,IAAAf,EAAS,kBAAT,gBAAAe,EAAyBD,CAAAA;AAAAA,IAAA,CAAA,QAChFM,IAAApB,EAAS,kBAAT,OAAA,SAAAoB,EAAwB,KAAK,CAACD,GAAKL,MAAA;;AAAQ,aAAAK,QAAQJ,IAAAH,EAAa,kBAAb,gBAAAG,EAA6BD,CAAAA;AAAAA,IAAA,CAAA;AAAA,EAExF;AAAA,EAEA,gCAAgCO,GAAqBlC,GAAiB;AAClE,UAAMmC,IAAW,OAAO,KAAKD,EAAS,IAAI,GACpCE,IAAO,OAAO,KAAKpC,EAAK,IAAI;AAClC,WACIkC,EAAS,OAAOlC,EAAK,MACrBmC,EAAS,WAAWC,EAAK,UACzBD,EAAS,KAAK,CAAAL,MAAA;;AAAO,aAAAI,EAAS,KAAKF,CAAG,EAAE,aAAWJ,IAAA5B,EAAK,KAAKgC,CAAG,MAAb,OAAA,SAAAJ,EAAgB;AAAA,IAAA,CAAM;AAAA,EAEjF;AAAA,EAEA,cAAc;AACV,UAAM,EAAC,aAAAS,GAAa,SAAAC,GAAS,UAAArC,GAAU,WAAAsC,GAAW,eAAAC,GAAe,cAAAtC,GAAc,eAAAuC,EAAAA,IAAiB,KAAK,UAE/FC,IAAiBJ,EAAQ,IAAI,CAAAlC,MAAU,KAAK,KAAK,oBAAoBA,EAAO,KAAK,CAAC,GAClFuC,IAAwBD,EAAe,SAASE,EAAoB,CAAC,GAAGF,CAAc,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,GACpGG,IAAsBP,EAAQ,IAAI,CAAAlC,MAAUA,EAAO,KAAK,KAAK,MAC7D0C,IAAiB7C,IAAW,CAACA,EAAS,KAAK,IAAI,CAAA;AACrD,QAAI8C,IAAe9C,IAAW,KAAK,KAAK,oBAAoBA,EAAS,KAAK,IAAI,CAAC,MAAM;AACjFwC,IAAAA,MACAM,IAAeC,EAAAA,aAAaP,GAAeM,CAAY,IAG3D,KAAK,KAAK,YAAY,CAAC,GAAGF,GAAqB,GAAGC,CAAc,CAAC;AACjE,UAAMG,IAAwBC,EAA4B,KAAK,MAAMP,GAAuBI,GAAcV,GAAaE,GAAWC,EAAc,MAAM,KAAK;AAE3J,SAAK,iBAAiB;AAAA,MAClB,WAAWG,EAAsB,IAAI,OAAKQ,EAAE,KAAK,IAAI,CAAC;AAAA,MACtD,uBAAAR;AAAAA,MACA,uBAAAM;AAAAA,MACA,YAAYlD,EAAc,KAAK,MAAME,IAAW,CAACA,CAAQ,IAAI,CAAA,GAAIC,CAAY;AAAA,IAAA;AAAA,EAErF;AAAA,EAEA,mBAAmB;AACI,SAAK;AAAA,EAI5B;AAAA,EAEA,eAAe;AACX,QAAI,CAAC,KAAK;AACN;AAEJ,UAAM,EAAC,IAAAkD,GAAI,eAAAZ,GAAe,eAAAa,GAAe,cAAAnD,GAAc,QAAAoD,GAAQ,UAAArD,GAAU,mBAAAsD,GAAmB,eAAAC,MAAiB,KAAK;AAClH,SAAK,cAAc;AAAA,MACf,KAAK;AAAA,MACLJ;AAAAA,MACAZ;AAAAA,MACAa;AAAAA,MACA,KAAK,eAAe;AAAA,MACpB,KAAK,eAAe;AAAA;AAAA,MACpB,KAAK,eAAe;AAAA,MACpB,KAAK,eAAe;AAAA,MACpBC;AAAAA,MACApD;AAAAA,MACAD;AAAAA,MACAuD;AAAAA,MACAD;AAAAA,MACA,KAAK;AAAA,IAAA;AAAA,EAEb;AACJ;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@d3fc/d3fc-axis/src/axisBase.js

@@ -5,27 +5,27 @@ import H from "../../../d3-selection/src/select.js";
 const K = (a) => a, X = (a, i, N = {}) => {
   let f = [10], g = null, k = () => {
   }, S = null, c = 6, m = 6, _ = 3;
-  const w = G(), A = I("g", "tick").key(K), O = I("path", "domain"), M = () => ({ offset: [0, m + _] }), T = () => ({ path: [[0, 0], [0, m]] }), V = N.labelOffset || M, q = N.tickPath || T, b = (t, l) => {
+  const w = G(), F = I("g", "tick").key(K), O = I("path", "domain"), M = () => ({ offset: [0, m + _] }), T = () => ({ path: [[0, 0], [0, m]] }), V = N.labelOffset || M, q = N.tickPath || T, b = (t, l) => {
     let s = 0;
     return t.bandwidth && (s = t.bandwidth() / 2, t.round() && (s = Math.round(s))), (y) => l(t(y) + s, 0);
   }, h = (t, l) => x() ? `translate(${l}, ${t})` : `translate(${t}, ${l})`, P = (t) => x() ? t.map((l) => [l[1], l[0]]) : t, x = () => a === "left" || a === "right", r = (t) => {
-    Y(t) && (A.transition(t), O.transition(t)), t.each((l, s, y) => {
+    Y(t) && (F.transition(t), O.transition(t)), t.each((l, s, y) => {
       const p = y[s], $ = H(p);
       p.__scale__ || $.attr("fill", "none").attr("font-size", 10).attr("font-family", "sans-serif").attr("text-anchor", a === "right" ? "start" : a === "left" ? "end" : "middle");
       const D = p.__scale__ || i;
       p.__scale__ = i.copy();
-      const d = C(r), J = E(r), z = a === "bottom" || a === "right" ? 1 : -1, F = ([n, e]) => [n, z * e], u = i.range(), Q = P([
+      const d = C(r), J = E(r), z = a === "bottom" || a === "right" ? 1 : -1, A = ([n, e]) => [n, z * e], u = i.range(), Q = P([
         [u[0], z * c],
         [u[0], 0],
         [u[1], 0],
         [u[1], z * c]
       ]), j = O($, [l]);
       j.enter().attr("stroke", "#000"), j.attr("d", w(Q));
-      const o = A($, d), v = d.map((n, e) => V(n, e, d)), B = d.map((n, e) => q(n, e, d));
-      o.enter().attr("transform", b(D, h)).append("path").attr("stroke", "#000"), o.enter().append("text").attr("transform", (n, e) => h(...F(v[e].offset))).attr("fill", "#000"), o.exit().attr("transform", b(i, h)), o.select("path").attr("visibility", (n, e) => B[e].hidden && "hidden").attr(
+      const o = F($, d), v = d.map((n, e) => V(n, e, d)), B = d.map((n, e) => q(n, e, d));
+      o.enter().attr("transform", b(D, h)).append("path").attr("stroke", "#000"), o.enter().append("text").attr("transform", (n, e) => h(...A(v[e].offset))).attr("fill", "#000"), o.exit().attr("transform", b(i, h)), o.select("path").attr("visibility", (n, e) => B[e].hidden && "hidden").attr(
         "d",
-        (n, e) => w(P(B[e].path.map(F)))
-      ), o.select("text").attr("visibility", (n, e) => v[e].hidden && "hidden").attr("transform", (n, e) => h(...F(v[e].offset))).attr("dy", () => {
+        (n, e) => w(P(B[e].path.map(A)))
+      ), o.select("text").attr("visibility", (n, e) => v[e].hidden && "hidden").attr("transform", (n, e) => h(...A(v[e].offset))).attr("dy", () => {
         let n = "0em";
         return x() ? n = "0.32em" : a === "bottom" && (n = "0.71em"), n;
       }).text(J), o.attr("transform", b(i, h)), k(o, l, s);

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

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

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

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

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

@@ -1 +1 @@
-{"version":3,"file":"line.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-shape/src/line.js"],"sourcesContent":["import array from \"./array.js\";\nimport constant from \"./constant.js\";\nimport curveLinear from \"./curve/linear.js\";\nimport {withPath} from \"./path.js\";\nimport {x as pointX, y as pointY} from \"./point.js\";\n\nexport default function(x, y) {\n  var defined = constant(true),\n      context = null,\n      curve = curveLinear,\n      output = null,\n      path = withPath(line);\n\n  x = typeof x === \"function\" ? x : (x === undefined) ? pointX : constant(x);\n  y = typeof y === \"function\" ? y : (y === undefined) ? pointY : constant(y);\n\n  function line(data) {\n    var i,\n        n = (data = array(data)).length,\n        d,\n        defined0 = false,\n        buffer;\n\n    if (context == null) output = curve(buffer = path());\n\n    for (i = 0; i <= n; ++i) {\n      if (!(i < n && defined(d = data[i], i, data)) === defined0) {\n        if (defined0 = !defined0) output.lineStart();\n        else output.lineEnd();\n      }\n      if (defined0) output.point(+x(d, i, data), +y(d, i, data));\n    }\n\n    if (buffer) return output = null, buffer + \"\" || null;\n  }\n\n  line.x = function(_) {\n    return arguments.length ? (x = typeof _ === \"function\" ? _ : constant(+_), line) : x;\n  };\n\n  line.y = function(_) {\n    return arguments.length ? (y = typeof _ === \"function\" ? _ : constant(+_), line) : y;\n  };\n\n  line.defined = function(_) {\n    return arguments.length ? (defined = typeof _ === \"function\" ? _ : constant(!!_), line) : defined;\n  };\n\n  line.curve = function(_) {\n    return arguments.length ? (curve = _, context != null && (output = curve(context)), line) : curve;\n  };\n\n  line.context = function(_) {\n    return arguments.length ? (_ == null ? context = output = null : output = curve(context = _), line) : context;\n  };\n\n  return line;\n}\n"],"names":["lineShape","x","y","defined","constant","context","curve","curveLinear","output","path","withPath","line","pointX","pointY","data","i","n","array","d","defined0","buffer","_"],"mappings":";;;;;AAMe,SAAAA,EAASC,GAAGC,GAAG;AAC5B,MAAIC,IAAUC,EAAS,EAAI,GACvBC,IAAU,MACVC,IAAQC,GACRC,IAAS,MACTC,IAAOC,EAASC,CAAI;AAExBV,EAAAA,IAAI,OAAOA,KAAM,aAAaA,IAAKA,MAAM,SAAaW,IAASR,EAASH,CAAC,GACzEC,IAAI,OAAOA,KAAM,aAAaA,IAAKA,MAAM,SAAaW,IAAST,EAASF,CAAC;AAEzE,WAASS,EAAKG,GAAM;AAClB,QAAIC,GACAC,KAAKF,IAAOG,EAAMH,CAAI,GAAG,QACzBI,GACAC,IAAW,IACXC;AAIJ,SAFIf,KAAW,SAAMG,IAASF,EAAMc,IAASX,GAAM,IAE9CM,IAAI,GAAGA,KAAKC,GAAG,EAAED;AAChB,QAAEA,IAAIC,KAAKb,EAAQe,IAAIJ,EAAKC,CAAC,GAAGA,GAAGD,CAAI,OAAOK,OAC5CA,IAAW,CAACA,KAAUX,EAAO,UAAA,IAC5BA,EAAO,YAEVW,KAAUX,EAAO,MAAM,CAACP,EAAEiB,GAAGH,GAAGD,CAAI,GAAG,CAACZ,EAAEgB,GAAGH,GAAGD,CAAI,CAAC;AAG3D,QAAIM,EAAQ,QAAOZ,IAAS,MAAMY,IAAS,MAAM;AAAA,EACnD;AAEA,SAAAT,EAAK,IAAI,SAASU,GAAG;AACnB,WAAO,UAAU,UAAUpB,IAAI,OAAOoB,KAAM,aAAaA,IAAIjB,EAAS,CAACiB,CAAC,GAAGV,KAAQV;AAAAA,EACrF,GAEAU,EAAK,IAAI,SAASU,GAAG;AACnB,WAAO,UAAU,UAAUnB,IAAI,OAAOmB,KAAM,aAAaA,IAAIjB,EAAS,CAACiB,CAAC,GAAGV,KAAQT;AAAAA,EACrF,GAEAS,EAAK,UAAU,SAASU,GAAG;AACzB,WAAO,UAAU,UAAUlB,IAAU,OAAOkB,KAAM,aAAaA,IAAIjB,EAAS,CAAC,CAACiB,CAAC,GAAGV,KAAQR;AAAAA,EAC5F,GAEAQ,EAAK,QAAQ,SAASU,GAAG;AACvB,WAAO,UAAU,UAAUf,IAAQe,GAAGhB,KAAW,SAASG,IAASF,EAAMD,CAAO,IAAIM,KAAQL;AAAAA,EAC9F,GAEAK,EAAK,UAAU,SAASU,GAAG;AACzB,WAAO,UAAU,UAAUA,KAAK,OAAOhB,IAAUG,IAAS,OAAOA,IAASF,EAAMD,IAAUgB,CAAC,GAAGV,KAAQN;AAAAA,EACxG,GAEOM;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"line.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/d3-shape/src/line.js"],"sourcesContent":["import array from \"./array.js\";\nimport constant from \"./constant.js\";\nimport curveLinear from \"./curve/linear.js\";\nimport {withPath} from \"./path.js\";\nimport {x as pointX, y as pointY} from \"./point.js\";\n\nexport default function(x, y) {\n  var defined = constant(true),\n      context = null,\n      curve = curveLinear,\n      output = null,\n      path = withPath(line);\n\n  x = typeof x === \"function\" ? x : (x === undefined) ? pointX : constant(x);\n  y = typeof y === \"function\" ? y : (y === undefined) ? pointY : constant(y);\n\n  function line(data) {\n    var i,\n        n = (data = array(data)).length,\n        d,\n        defined0 = false,\n        buffer;\n\n    if (context == null) output = curve(buffer = path());\n\n    for (i = 0; i <= n; ++i) {\n      if (!(i < n && defined(d = data[i], i, data)) === defined0) {\n        if (defined0 = !defined0) output.lineStart();\n        else output.lineEnd();\n      }\n      if (defined0) output.point(+x(d, i, data), +y(d, i, data));\n    }\n\n    if (buffer) return output = null, buffer + \"\" || null;\n  }\n\n  line.x = function(_) {\n    return arguments.length ? (x = typeof _ === \"function\" ? _ : constant(+_), line) : x;\n  };\n\n  line.y = function(_) {\n    return arguments.length ? (y = typeof _ === \"function\" ? _ : constant(+_), line) : y;\n  };\n\n  line.defined = function(_) {\n    return arguments.length ? (defined = typeof _ === \"function\" ? _ : constant(!!_), line) : defined;\n  };\n\n  line.curve = function(_) {\n    return arguments.length ? (curve = _, context != null && (output = curve(context)), line) : curve;\n  };\n\n  line.context = function(_) {\n    return arguments.length ? (_ == null ? context = output = null : output = curve(context = _), line) : context;\n  };\n\n  return line;\n}\n"],"names":["line","x","y","defined","constant","context","curve","curveLinear","output","path","withPath","pointX","pointY","data","i","n","array","d","defined0","buffer","_"],"mappings":";;;;;AAMe,SAAAA,EAASC,GAAGC,GAAG;AAC5B,MAAIC,IAAUC,EAAS,EAAI,GACvBC,IAAU,MACVC,IAAQC,GACRC,IAAS,MACTC,IAAOC,EAASV,CAAI;AAExBC,EAAAA,IAAI,OAAOA,KAAM,aAAaA,IAAKA,MAAM,SAAaU,IAASP,EAASH,CAAC,GACzEC,IAAI,OAAOA,KAAM,aAAaA,IAAKA,MAAM,SAAaU,IAASR,EAASF,CAAC;AAEzE,WAASF,EAAKa,GAAM;AAClB,QAAIC,GACAC,KAAKF,IAAOG,EAAMH,CAAI,GAAG,QACzBI,GACAC,IAAW,IACXC;AAIJ,SAFId,KAAW,SAAMG,IAASF,EAAMa,IAASV,GAAM,IAE9CK,IAAI,GAAGA,KAAKC,GAAG,EAAED;AAChB,QAAEA,IAAIC,KAAKZ,EAAQc,IAAIJ,EAAKC,CAAC,GAAGA,GAAGD,CAAI,OAAOK,OAC5CA,IAAW,CAACA,KAAUV,EAAO,UAAA,IAC5BA,EAAO,YAEVU,KAAUV,EAAO,MAAM,CAACP,EAAEgB,GAAGH,GAAGD,CAAI,GAAG,CAACX,EAAEe,GAAGH,GAAGD,CAAI,CAAC;AAG3D,QAAIM,EAAQ,QAAOX,IAAS,MAAMW,IAAS,MAAM;AAAA,EACnD;AAEA,SAAAnB,EAAK,IAAI,SAASoB,GAAG;AACnB,WAAO,UAAU,UAAUnB,IAAI,OAAOmB,KAAM,aAAaA,IAAIhB,EAAS,CAACgB,CAAC,GAAGpB,KAAQC;AAAAA,EACrF,GAEAD,EAAK,IAAI,SAASoB,GAAG;AACnB,WAAO,UAAU,UAAUlB,IAAI,OAAOkB,KAAM,aAAaA,IAAIhB,EAAS,CAACgB,CAAC,GAAGpB,KAAQE;AAAAA,EACrF,GAEAF,EAAK,UAAU,SAASoB,GAAG;AACzB,WAAO,UAAU,UAAUjB,IAAU,OAAOiB,KAAM,aAAaA,IAAIhB,EAAS,CAAC,CAACgB,CAAC,GAAGpB,KAAQG;AAAAA,EAC5F,GAEAH,EAAK,QAAQ,SAASoB,GAAG;AACvB,WAAO,UAAU,UAAUd,IAAQc,GAAGf,KAAW,SAASG,IAASF,EAAMD,CAAO,IAAIL,KAAQM;AAAAA,EAC9F,GAEAN,EAAK,UAAU,SAASoB,GAAG;AACzB,WAAO,UAAU,UAAUA,KAAK,OAAOf,IAAUG,IAAS,OAAOA,IAASF,EAAMD,IAAUe,CAAC,GAAGpB,KAAQK;AAAAA,EACxG,GAEOL;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/kdbush/index.js

@@ -0,0 +1,148 @@
+const I = [
+  Int8Array,
+  Uint8Array,
+  Uint8ClampedArray,
+  Int16Array,
+  Uint16Array,
+  Int32Array,
+  Uint32Array,
+  Float32Array,
+  Float64Array
+], m = 1, l = 8;
+class B {
+  /**
+   * Creates an index from raw `ArrayBuffer` data.
+   * @param {ArrayBuffer} data
+   */
+  static from(r) {
+    if (!(r instanceof ArrayBuffer))
+      throw new Error("Data must be an instance of ArrayBuffer.");
+    const [e, t] = new Uint8Array(r, 0, 2);
+    if (e !== 219)
+      throw new Error("Data does not appear to be in a KDBush format.");
+    const s = t >> 4;
+    if (s !== m)
+      throw new Error(`Got v${s} data when expected v${m}.`);
+    const i = I[t & 15];
+    if (!i)
+      throw new Error("Unrecognized array type.");
+    const [h] = new Uint16Array(r, 2, 1), [n] = new Uint32Array(r, 4, 1);
+    return new B(n, h, i, r);
+  }
+  /**
+   * Creates an index that will hold a given number of items.
+   * @param {number} numItems
+   * @param {number} [nodeSize=64] Size of the KD-tree node (64 by default).
+   * @param {TypedArrayConstructor} [ArrayType=Float64Array] The array type used for coordinates storage (`Float64Array` by default).
+   * @param {ArrayBuffer} [data] (For internal use only)
+   */
+  constructor(r, e = 64, t = Float64Array, s) {
+    if (isNaN(r) || r < 0) throw new Error(`Unpexpected numItems value: ${r}.`);
+    this.numItems = +r, this.nodeSize = Math.min(Math.max(+e, 2), 65535), this.ArrayType = t, this.IndexArrayType = r < 65536 ? Uint16Array : Uint32Array;
+    const i = I.indexOf(this.ArrayType), h = r * 2 * this.ArrayType.BYTES_PER_ELEMENT, n = r * this.IndexArrayType.BYTES_PER_ELEMENT, o = (8 - n % 8) % 8;
+    if (i < 0)
+      throw new Error(`Unexpected typed array class: ${t}.`);
+    s && s instanceof ArrayBuffer ? (this.data = s, this.ids = new this.IndexArrayType(this.data, l, r), this.coords = new this.ArrayType(this.data, l + n + o, r * 2), this._pos = r * 2, this._finished = !0) : (this.data = new ArrayBuffer(l + h + n + o), this.ids = new this.IndexArrayType(this.data, l, r), this.coords = new this.ArrayType(this.data, l + n + o, r * 2), this._pos = 0, this._finished = !1, new Uint8Array(this.data, 0, 2).set([219, (m << 4) + i]), new Uint16Array(this.data, 2, 1)[0] = e, new Uint32Array(this.data, 4, 1)[0] = r);
+  }
+  /**
+   * Add a point to the index.
+   * @param {number} x
+   * @param {number} y
+   * @returns {number} An incremental index associated with the added item (starting from `0`).
+   */
+  add(r, e) {
+    const t = this._pos >> 1;
+    return this.ids[t] = t, this.coords[this._pos++] = r, this.coords[this._pos++] = e, t;
+  }
+  /**
+   * Perform indexing of the added points.
+   */
+  finish() {
+    const r = this._pos >> 1;
+    if (r !== this.numItems)
+      throw new Error(`Added ${r} items when expected ${this.numItems}.`);
+    return U(this.ids, this.coords, this.nodeSize, 0, this.numItems - 1, 0), this._finished = !0, this;
+  }
+  /**
+   * Search the index for items within a given bounding box.
+   * @param {number} minX
+   * @param {number} minY
+   * @param {number} maxX
+   * @param {number} maxY
+   * @returns {number[]} An array of indices correponding to the found items.
+   */
+  range(r, e, t, s) {
+    if (!this._finished) throw new Error("Data not yet indexed - call index.finish().");
+    const { ids: i, coords: h, nodeSize: n } = this, o = [0, i.length - 1, 0], d = [];
+    for (; o.length; ) {
+      const c = o.pop() || 0, u = o.pop() || 0, p = o.pop() || 0;
+      if (u - p <= n) {
+        for (let y = p; y <= u; y++) {
+          const _ = h[2 * y], T = h[2 * y + 1];
+          _ >= r && _ <= t && T >= e && T <= s && d.push(i[y]);
+        }
+        continue;
+      }
+      const f = p + u >> 1, w = h[2 * f], A = h[2 * f + 1];
+      w >= r && w <= t && A >= e && A <= s && d.push(i[f]), (c === 0 ? r <= w : e <= A) && (o.push(p), o.push(f - 1), o.push(1 - c)), (c === 0 ? t >= w : s >= A) && (o.push(f + 1), o.push(u), o.push(1 - c));
+    }
+    return d;
+  }
+  /**
+   * Search the index for items within a given radius.
+   * @param {number} qx
+   * @param {number} qy
+   * @param {number} r Query radius.
+   * @returns {number[]} An array of indices correponding to the found items.
+   */
+  within(r, e, t) {
+    if (!this._finished) throw new Error("Data not yet indexed - call index.finish().");
+    const { ids: s, coords: i, nodeSize: h } = this, n = [0, s.length - 1, 0], o = [], d = t * t;
+    for (; n.length; ) {
+      const c = n.pop() || 0, u = n.pop() || 0, p = n.pop() || 0;
+      if (u - p <= h) {
+        for (let y = p; y <= u; y++)
+          M(i[2 * y], i[2 * y + 1], r, e) <= d && o.push(s[y]);
+        continue;
+      }
+      const f = p + u >> 1, w = i[2 * f], A = i[2 * f + 1];
+      M(w, A, r, e) <= d && o.push(s[f]), (c === 0 ? r - t <= w : e - t <= A) && (n.push(p), n.push(f - 1), n.push(1 - c)), (c === 0 ? r + t >= w : e + t >= A) && (n.push(f + 1), n.push(u), n.push(1 - c));
+    }
+    return o;
+  }
+}
+function U(a, r, e, t, s, i) {
+  if (s - t <= e) return;
+  const h = t + s >> 1;
+  g(a, r, h, t, s, i), U(a, r, e, t, h - 1, 1 - i), U(a, r, e, h + 1, s, 1 - i);
+}
+function g(a, r, e, t, s, i) {
+  for (; s > t; ) {
+    if (s - t > 600) {
+      const d = s - t + 1, c = e - t + 1, u = Math.log(d), p = 0.5 * Math.exp(2 * u / 3), f = 0.5 * Math.sqrt(u * p * (d - p) / d) * (c - d / 2 < 0 ? -1 : 1), w = Math.max(t, Math.floor(e - c * p / d + f)), A = Math.min(s, Math.floor(e + (d - c) * p / d + f));
+      g(a, r, e, w, A, i);
+    }
+    const h = r[2 * e + i];
+    let n = t, o = s;
+    for (E(a, r, t, e), r[2 * s + i] > h && E(a, r, t, s); n < o; ) {
+      for (E(a, r, n, o), n++, o--; r[2 * n + i] < h; ) n++;
+      for (; r[2 * o + i] > h; ) o--;
+    }
+    r[2 * t + i] === h ? E(a, r, t, o) : (o++, E(a, r, o, s)), o <= e && (t = o + 1), e <= o && (s = o - 1);
+  }
+}
+function E(a, r, e, t) {
+  x(a, e, t), x(r, 2 * e, 2 * t), x(r, 2 * e + 1, 2 * t + 1);
+}
+function x(a, r, e) {
+  const t = a[r];
+  a[r] = a[e], a[e] = t;
+}
+function M(a, r, e, t) {
+  const s = a - e, i = r - t;
+  return s * s + i * i;
+}
+export {
+  B as default
+};
+//# sourceMappingURL=index.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/kdbush/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../node_modules/@milaboratories/miplots4/node_modules/kdbush/index.js"],"sourcesContent":["\nconst ARRAY_TYPES = [\n    Int8Array, Uint8Array, Uint8ClampedArray, Int16Array, Uint16Array,\n    Int32Array, Uint32Array, Float32Array, Float64Array\n];\n\n/** @typedef {Int8ArrayConstructor | Uint8ArrayConstructor | Uint8ClampedArrayConstructor | Int16ArrayConstructor | Uint16ArrayConstructor | Int32ArrayConstructor | Uint32ArrayConstructor | Float32ArrayConstructor | Float64ArrayConstructor} TypedArrayConstructor */\n\nconst VERSION = 1; // serialized format version\nconst HEADER_SIZE = 8;\n\nexport default class KDBush {\n\n    /**\n     * Creates an index from raw `ArrayBuffer` data.\n     * @param {ArrayBuffer} data\n     */\n    static from(data) {\n        if (!(data instanceof ArrayBuffer)) {\n            throw new Error('Data must be an instance of ArrayBuffer.');\n        }\n        const [magic, versionAndType] = new Uint8Array(data, 0, 2);\n        if (magic !== 0xdb) {\n            throw new Error('Data does not appear to be in a KDBush format.');\n        }\n        const version = versionAndType >> 4;\n        if (version !== VERSION) {\n            throw new Error(`Got v${version} data when expected v${VERSION}.`);\n        }\n        const ArrayType = ARRAY_TYPES[versionAndType & 0x0f];\n        if (!ArrayType) {\n            throw new Error('Unrecognized array type.');\n        }\n        const [nodeSize] = new Uint16Array(data, 2, 1);\n        const [numItems] = new Uint32Array(data, 4, 1);\n\n        return new KDBush(numItems, nodeSize, ArrayType, data);\n    }\n\n    /**\n     * Creates an index that will hold a given number of items.\n     * @param {number} numItems\n     * @param {number} [nodeSize=64] Size of the KD-tree node (64 by default).\n     * @param {TypedArrayConstructor} [ArrayType=Float64Array] The array type used for coordinates storage (`Float64Array` by default).\n     * @param {ArrayBuffer} [data] (For internal use only)\n     */\n    constructor(numItems, nodeSize = 64, ArrayType = Float64Array, data) {\n        if (isNaN(numItems) || numItems < 0) throw new Error(`Unpexpected numItems value: ${numItems}.`);\n\n        this.numItems = +numItems;\n        this.nodeSize = Math.min(Math.max(+nodeSize, 2), 65535);\n        this.ArrayType = ArrayType;\n        this.IndexArrayType = numItems < 65536 ? Uint16Array : Uint32Array;\n\n        const arrayTypeIndex = ARRAY_TYPES.indexOf(this.ArrayType);\n        const coordsByteSize = numItems * 2 * this.ArrayType.BYTES_PER_ELEMENT;\n        const idsByteSize = numItems * this.IndexArrayType.BYTES_PER_ELEMENT;\n        const padCoords = (8 - idsByteSize % 8) % 8;\n\n        if (arrayTypeIndex < 0) {\n            throw new Error(`Unexpected typed array class: ${ArrayType}.`);\n        }\n\n        if (data && (data instanceof ArrayBuffer)) { // reconstruct an index from a buffer\n            this.data = data;\n            this.ids = new this.IndexArrayType(this.data, HEADER_SIZE, numItems);\n            this.coords = new this.ArrayType(this.data, HEADER_SIZE + idsByteSize + padCoords, numItems * 2);\n            this._pos = numItems * 2;\n            this._finished = true;\n        } else { // initialize a new index\n            this.data = new ArrayBuffer(HEADER_SIZE + coordsByteSize + idsByteSize + padCoords);\n            this.ids = new this.IndexArrayType(this.data, HEADER_SIZE, numItems);\n            this.coords = new this.ArrayType(this.data, HEADER_SIZE + idsByteSize + padCoords, numItems * 2);\n            this._pos = 0;\n            this._finished = false;\n\n            // set header\n            new Uint8Array(this.data, 0, 2).set([0xdb, (VERSION << 4) + arrayTypeIndex]);\n            new Uint16Array(this.data, 2, 1)[0] = nodeSize;\n            new Uint32Array(this.data, 4, 1)[0] = numItems;\n        }\n    }\n\n    /**\n     * Add a point to the index.\n     * @param {number} x\n     * @param {number} y\n     * @returns {number} An incremental index associated with the added item (starting from `0`).\n     */\n    add(x, y) {\n        const index = this._pos >> 1;\n        this.ids[index] = index;\n        this.coords[this._pos++] = x;\n        this.coords[this._pos++] = y;\n        return index;\n    }\n\n    /**\n     * Perform indexing of the added points.\n     */\n    finish() {\n        const numAdded = this._pos >> 1;\n        if (numAdded !== this.numItems) {\n            throw new Error(`Added ${numAdded} items when expected ${this.numItems}.`);\n        }\n        // kd-sort both arrays for efficient search\n        sort(this.ids, this.coords, this.nodeSize, 0, this.numItems - 1, 0);\n\n        this._finished = true;\n        return this;\n    }\n\n    /**\n     * Search the index for items within a given bounding box.\n     * @param {number} minX\n     * @param {number} minY\n     * @param {number} maxX\n     * @param {number} maxY\n     * @returns {number[]} An array of indices correponding to the found items.\n     */\n    range(minX, minY, maxX, maxY) {\n        if (!this._finished) throw new Error('Data not yet indexed - call index.finish().');\n\n        const {ids, coords, nodeSize} = this;\n        const stack = [0, ids.length - 1, 0];\n        const result = [];\n\n        // recursively search for items in range in the kd-sorted arrays\n        while (stack.length) {\n            const axis = stack.pop() || 0;\n            const right = stack.pop() || 0;\n            const left = stack.pop() || 0;\n\n            // if we reached \"tree node\", search linearly\n            if (right - left <= nodeSize) {\n                for (let i = left; i <= right; i++) {\n                    const x = coords[2 * i];\n                    const y = coords[2 * i + 1];\n                    if (x >= minX && x <= maxX && y >= minY && y <= maxY) result.push(ids[i]);\n                }\n                continue;\n            }\n\n            // otherwise find the middle index\n            const m = (left + right) >> 1;\n\n            // include the middle item if it's in range\n            const x = coords[2 * m];\n            const y = coords[2 * m + 1];\n            if (x >= minX && x <= maxX && y >= minY && y <= maxY) result.push(ids[m]);\n\n            // queue search in halves that intersect the query\n            if (axis === 0 ? minX <= x : minY <= y) {\n                stack.push(left);\n                stack.push(m - 1);\n                stack.push(1 - axis);\n            }\n            if (axis === 0 ? maxX >= x : maxY >= y) {\n                stack.push(m + 1);\n                stack.push(right);\n                stack.push(1 - axis);\n            }\n        }\n\n        return result;\n    }\n\n    /**\n     * Search the index for items within a given radius.\n     * @param {number} qx\n     * @param {number} qy\n     * @param {number} r Query radius.\n     * @returns {number[]} An array of indices correponding to the found items.\n     */\n    within(qx, qy, r) {\n        if (!this._finished) throw new Error('Data not yet indexed - call index.finish().');\n\n        const {ids, coords, nodeSize} = this;\n        const stack = [0, ids.length - 1, 0];\n        const result = [];\n        const r2 = r * r;\n\n        // recursively search for items within radius in the kd-sorted arrays\n        while (stack.length) {\n            const axis = stack.pop() || 0;\n            const right = stack.pop() || 0;\n            const left = stack.pop() || 0;\n\n            // if we reached \"tree node\", search linearly\n            if (right - left <= nodeSize) {\n                for (let i = left; i <= right; i++) {\n                    if (sqDist(coords[2 * i], coords[2 * i + 1], qx, qy) <= r2) result.push(ids[i]);\n                }\n                continue;\n            }\n\n            // otherwise find the middle index\n            const m = (left + right) >> 1;\n\n            // include the middle item if it's in range\n            const x = coords[2 * m];\n            const y = coords[2 * m + 1];\n            if (sqDist(x, y, qx, qy) <= r2) result.push(ids[m]);\n\n            // queue search in halves that intersect the query\n            if (axis === 0 ? qx - r <= x : qy - r <= y) {\n                stack.push(left);\n                stack.push(m - 1);\n                stack.push(1 - axis);\n            }\n            if (axis === 0 ? qx + r >= x : qy + r >= y) {\n                stack.push(m + 1);\n                stack.push(right);\n                stack.push(1 - axis);\n            }\n        }\n\n        return result;\n    }\n}\n\n/**\n * @param {Uint16Array | Uint32Array} ids\n * @param {InstanceType<TypedArrayConstructor>} coords\n * @param {number} nodeSize\n * @param {number} left\n * @param {number} right\n * @param {number} axis\n */\nfunction sort(ids, coords, nodeSize, left, right, axis) {\n    if (right - left <= nodeSize) return;\n\n    const m = (left + right) >> 1; // middle index\n\n    // sort ids and coords around the middle index so that the halves lie\n    // either left/right or top/bottom correspondingly (taking turns)\n    select(ids, coords, m, left, right, axis);\n\n    // recursively kd-sort first half and second half on the opposite axis\n    sort(ids, coords, nodeSize, left, m - 1, 1 - axis);\n    sort(ids, coords, nodeSize, m + 1, right, 1 - axis);\n}\n\n/**\n * Custom Floyd-Rivest selection algorithm: sort ids and coords so that\n * [left..k-1] items are smaller than k-th item (on either x or y axis)\n * @param {Uint16Array | Uint32Array} ids\n * @param {InstanceType<TypedArrayConstructor>} coords\n * @param {number} k\n * @param {number} left\n * @param {number} right\n * @param {number} axis\n */\nfunction select(ids, coords, k, left, right, axis) {\n\n    while (right > left) {\n        if (right - left > 600) {\n            const n = right - left + 1;\n            const m = k - left + 1;\n            const z = Math.log(n);\n            const s = 0.5 * Math.exp(2 * z / 3);\n            const sd = 0.5 * Math.sqrt(z * s * (n - s) / n) * (m - n / 2 < 0 ? -1 : 1);\n            const newLeft = Math.max(left, Math.floor(k - m * s / n + sd));\n            const newRight = Math.min(right, Math.floor(k + (n - m) * s / n + sd));\n            select(ids, coords, k, newLeft, newRight, axis);\n        }\n\n        const t = coords[2 * k + axis];\n        let i = left;\n        let j = right;\n\n        swapItem(ids, coords, left, k);\n        if (coords[2 * right + axis] > t) swapItem(ids, coords, left, right);\n\n        while (i < j) {\n            swapItem(ids, coords, i, j);\n            i++;\n            j--;\n            while (coords[2 * i + axis] < t) i++;\n            while (coords[2 * j + axis] > t) j--;\n        }\n\n        if (coords[2 * left + axis] === t) swapItem(ids, coords, left, j);\n        else {\n            j++;\n            swapItem(ids, coords, j, right);\n        }\n\n        if (j <= k) left = j + 1;\n        if (k <= j) right = j - 1;\n    }\n}\n\n/**\n * @param {Uint16Array | Uint32Array} ids\n * @param {InstanceType<TypedArrayConstructor>} coords\n * @param {number} i\n * @param {number} j\n */\nfunction swapItem(ids, coords, i, j) {\n    swap(ids, i, j);\n    swap(coords, 2 * i, 2 * j);\n    swap(coords, 2 * i + 1, 2 * j + 1);\n}\n\n/**\n * @param {InstanceType<TypedArrayConstructor>} arr\n * @param {number} i\n * @param {number} j\n */\nfunction swap(arr, i, j) {\n    const tmp = arr[i];\n    arr[i] = arr[j];\n    arr[j] = tmp;\n}\n\n/**\n * @param {number} ax\n * @param {number} ay\n * @param {number} bx\n * @param {number} by\n */\nfunction sqDist(ax, ay, bx, by) {\n    const dx = ax - bx;\n    const dy = ay - by;\n    return dx * dx + dy * dy;\n}\n"],"names":["ARRAY_TYPES","VERSION","HEADER_SIZE","KDBush","data","magic","versionAndType","version","ArrayType","nodeSize","numItems","arrayTypeIndex","coordsByteSize","idsByteSize","padCoords","x","y","index","numAdded","sort","minX","minY","maxX","maxY","ids","coords","stack","result","axis","right","left","i","m","qx","qy","r","r2","sqDist","select","k","n","z","s","sd","newLeft","newRight","t","j","swapItem","swap","arr","tmp","ax","ay","bx","by","dx","dy"],"mappings":"AACA,MAAMA,IAAc;AAAA,EAChB;AAAA,EAAW;AAAA,EAAY;AAAA,EAAmB;AAAA,EAAY;AAAA,EACtD;AAAA,EAAY;AAAA,EAAa;AAAA,EAAc;AAC3C,GAIMC,IAAU,GACVC,IAAc;AAEL,MAAMC,EAAO;AAAA;AAAA;AAAA;AAAA;AAAA,EAMxB,OAAO,KAAKC,GAAM;AACd,QAAI,EAAEA,aAAgB;AAClB,YAAM,IAAI,MAAM,0CAA0C;AAE9D,UAAM,CAACC,GAAOC,CAAc,IAAI,IAAI,WAAWF,GAAM,GAAG,CAAC;AACzD,QAAIC,MAAU;AACV,YAAM,IAAI,MAAM,gDAAgD;AAEpE,UAAME,IAAUD,KAAkB;AAClC,QAAIC,MAAYN;AACZ,YAAM,IAAI,MAAM,QAAQM,CAAO,wBAAwBN,CAAO,GAAG;AAErE,UAAMO,IAAYR,EAAYM,IAAiB,EAAI;AACnD,QAAI,CAACE;AACD,YAAM,IAAI,MAAM,0BAA0B;AAE9C,UAAM,CAACC,CAAQ,IAAI,IAAI,YAAYL,GAAM,GAAG,CAAC,GACvC,CAACM,CAAQ,IAAI,IAAI,YAAYN,GAAM,GAAG,CAAC;AAE7C,WAAO,IAAID,EAAOO,GAAUD,GAAUD,GAAWJ,CAAI;AAAA,EACzD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,YAAYM,GAAUD,IAAW,IAAID,IAAY,cAAcJ,GAAM;AACjE,QAAI,MAAMM,CAAQ,KAAKA,IAAW,SAAS,IAAI,MAAM,+BAA+BA,CAAQ,GAAG;AAE/F,SAAK,WAAW,CAACA,GACjB,KAAK,WAAW,KAAK,IAAI,KAAK,IAAI,CAACD,GAAU,CAAC,GAAG,KAAK,GACtD,KAAK,YAAYD,GACjB,KAAK,iBAAiBE,IAAW,QAAQ,cAAc;AAEvD,UAAMC,IAAiBX,EAAY,QAAQ,KAAK,SAAS,GACnDY,IAAiBF,IAAW,IAAI,KAAK,UAAU,mBAC/CG,IAAcH,IAAW,KAAK,eAAe,mBAC7CI,KAAa,IAAID,IAAc,KAAK;AAE1C,QAAIF,IAAiB;AACjB,YAAM,IAAI,MAAM,iCAAiCH,CAAS,GAAG;AAG7DJ,IAAAA,KAASA,aAAgB,eACzB,KAAK,OAAOA,GACZ,KAAK,MAAM,IAAI,KAAK,eAAe,KAAK,MAAMF,GAAaQ,CAAQ,GACnE,KAAK,SAAS,IAAI,KAAK,UAAU,KAAK,MAAMR,IAAcW,IAAcC,GAAWJ,IAAW,CAAC,GAC/F,KAAK,OAAOA,IAAW,GACvB,KAAK,YAAY,OAEjB,KAAK,OAAO,IAAI,YAAYR,IAAcU,IAAiBC,IAAcC,CAAS,GAClF,KAAK,MAAM,IAAI,KAAK,eAAe,KAAK,MAAMZ,GAAaQ,CAAQ,GACnE,KAAK,SAAS,IAAI,KAAK,UAAU,KAAK,MAAMR,IAAcW,IAAcC,GAAWJ,IAAW,CAAC,GAC/F,KAAK,OAAO,GACZ,KAAK,YAAY,IAGjB,IAAI,WAAW,KAAK,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,MAAOT,KAAW,KAAKU,CAAc,CAAC,GAC3E,IAAI,YAAY,KAAK,MAAM,GAAG,CAAC,EAAE,CAAC,IAAIF,GACtC,IAAI,YAAY,KAAK,MAAM,GAAG,CAAC,EAAE,CAAC,IAAIC;AAAAA,EAE9C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,IAAIK,GAAGC,GAAG;AACN,UAAMC,IAAQ,KAAK,QAAQ;AAC3B,WAAA,KAAK,IAAIA,CAAK,IAAIA,GAClB,KAAK,OAAO,KAAK,MAAM,IAAIF,GAC3B,KAAK,OAAO,KAAK,MAAM,IAAIC,GACpBC;AAAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAKA,SAAS;AACL,UAAMC,IAAW,KAAK,QAAQ;AAC9B,QAAIA,MAAa,KAAK;AAClB,YAAM,IAAI,MAAM,SAASA,CAAQ,wBAAwB,KAAK,QAAQ,GAAG;AAG7E,WAAAC,EAAK,KAAK,KAAK,KAAK,QAAQ,KAAK,UAAU,GAAG,KAAK,WAAW,GAAG,CAAC,GAElE,KAAK,YAAY,IACV;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAMC,GAAMC,GAAMC,GAAMC,GAAM;AAC1B,QAAI,CAAC,KAAK,UAAW,OAAM,IAAI,MAAM,6CAA6C;AAElF,UAAM,EAAC,KAAAC,GAAK,QAAAC,GAAQ,UAAAhB,MAAY,MAC1BiB,IAAQ,CAAC,GAAGF,EAAI,SAAS,GAAG,CAAC,GAC7BG,IAAS,CAAA;AAGf,WAAOD,EAAM,UAAQ;AACjB,YAAME,IAAOF,EAAM,IAAA,KAAS,GACtBG,IAAQH,EAAM,IAAA,KAAS,GACvBI,IAAOJ,EAAM,SAAS;AAG5B,UAAIG,IAAQC,KAAQrB,GAAU;AAC1B,iBAASsB,IAAID,GAAMC,KAAKF,GAAOE,KAAK;AAChC,gBAAMhB,IAAIU,EAAO,IAAIM,CAAC,GAChBf,IAAIS,EAAO,IAAIM,IAAI,CAAC;AACtB,UAAAhB,KAAKK,KAAQL,KAAKO,KAAQN,KAAKK,KAAQL,KAAKO,KAAMI,EAAO,KAAKH,EAAIO,CAAC,CAAC;AAAA,QAC5E;AACA;AAAA,MACJ;AAGA,YAAMC,IAAKF,IAAOD,KAAU,GAGtBd,IAAIU,EAAO,IAAIO,CAAC,GAChBhB,IAAIS,EAAO,IAAIO,IAAI,CAAC;AACtBjB,MAAAA,KAAKK,KAAQL,KAAKO,KAAQN,KAAKK,KAAQL,KAAKO,KAAMI,EAAO,KAAKH,EAAIQ,CAAC,CAAC,IAGpEJ,MAAS,IAAIR,KAAQL,IAAIM,KAAQL,OACjCU,EAAM,KAAKI,CAAI,GACfJ,EAAM,KAAKM,IAAI,CAAC,GAChBN,EAAM,KAAK,IAAIE,CAAI,KAEnBA,MAAS,IAAIN,KAAQP,IAAIQ,KAAQP,OACjCU,EAAM,KAAKM,IAAI,CAAC,GAChBN,EAAM,KAAKG,CAAK,GAChBH,EAAM,KAAK,IAAIE,CAAI;AAAA,IAE3B;AAEA,WAAOD;AAAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,OAAOM,GAAIC,GAAIC,GAAG;AACd,QAAI,CAAC,KAAK,UAAW,OAAM,IAAI,MAAM,6CAA6C;AAElF,UAAM,EAAC,KAAAX,GAAK,QAAAC,GAAQ,UAAAhB,MAAY,MAC1BiB,IAAQ,CAAC,GAAGF,EAAI,SAAS,GAAG,CAAC,GAC7BG,IAAS,CAAA,GACTS,IAAKD,IAAIA;AAGf,WAAOT,EAAM,UAAQ;AACjB,YAAME,IAAOF,EAAM,IAAA,KAAS,GACtBG,IAAQH,EAAM,IAAA,KAAS,GACvBI,IAAOJ,EAAM,SAAS;AAG5B,UAAIG,IAAQC,KAAQrB,GAAU;AAC1B,iBAASsB,IAAID,GAAMC,KAAKF,GAAOE;AACvBM,UAAAA,EAAOZ,EAAO,IAAIM,CAAC,GAAGN,EAAO,IAAIM,IAAI,CAAC,GAAGE,GAAIC,CAAE,KAAKE,KAAIT,EAAO,KAAKH,EAAIO,CAAC,CAAC;AAElF;AAAA,MACJ;AAGA,YAAMC,IAAKF,IAAOD,KAAU,GAGtBd,IAAIU,EAAO,IAAIO,CAAC,GAChBhB,IAAIS,EAAO,IAAIO,IAAI,CAAC;AACtBK,MAAAA,EAAOtB,GAAGC,GAAGiB,GAAIC,CAAE,KAAKE,KAAIT,EAAO,KAAKH,EAAIQ,CAAC,CAAC,IAG9CJ,MAAS,IAAIK,IAAKE,KAAKpB,IAAImB,IAAKC,KAAKnB,OACrCU,EAAM,KAAKI,CAAI,GACfJ,EAAM,KAAKM,IAAI,CAAC,GAChBN,EAAM,KAAK,IAAIE,CAAI,KAEnBA,MAAS,IAAIK,IAAKE,KAAKpB,IAAImB,IAAKC,KAAKnB,OACrCU,EAAM,KAAKM,IAAI,CAAC,GAChBN,EAAM,KAAKG,CAAK,GAChBH,EAAM,KAAK,IAAIE,CAAI;AAAA,IAE3B;AAEA,WAAOD;AAAAA,EACX;AACJ;AAUA,SAASR,EAAKK,GAAKC,GAAQhB,GAAUqB,GAAMD,GAAOD,GAAM;AACpD,MAAIC,IAAQC,KAAQrB,EAAU;AAE9B,QAAMuB,IAAKF,IAAOD,KAAU;AAI5BS,EAAAA,EAAOd,GAAKC,GAAQO,GAAGF,GAAMD,GAAOD,CAAI,GAGxCT,EAAKK,GAAKC,GAAQhB,GAAUqB,GAAME,IAAI,GAAG,IAAIJ,CAAI,GACjDT,EAAKK,GAAKC,GAAQhB,GAAUuB,IAAI,GAAGH,GAAO,IAAID,CAAI;AACtD;AAYA,SAASU,EAAOd,GAAKC,GAAQc,GAAGT,GAAMD,GAAOD,GAAM;AAE/C,SAAOC,IAAQC,KAAM;AACjB,QAAID,IAAQC,IAAO,KAAK;AACpB,YAAMU,IAAIX,IAAQC,IAAO,GACnBE,IAAIO,IAAIT,IAAO,GACfW,IAAI,KAAK,IAAID,CAAC,GACdE,IAAI,MAAM,KAAK,IAAI,IAAID,IAAI,CAAC,GAC5BE,IAAK,MAAM,KAAK,KAAKF,IAAIC,KAAKF,IAAIE,KAAKF,CAAC,KAAKR,IAAIQ,IAAI,IAAI,IAAI,KAAK,IAClEI,IAAU,KAAK,IAAId,GAAM,KAAK,MAAMS,IAAIP,IAAIU,IAAIF,IAAIG,CAAE,CAAC,GACvDE,IAAW,KAAK,IAAIhB,GAAO,KAAK,MAAMU,KAAKC,IAAIR,KAAKU,IAAIF,IAAIG,CAAE,CAAC;AACrEL,MAAAA,EAAOd,GAAKC,GAAQc,GAAGK,GAASC,GAAUjB,CAAI;AAAA,IAClD;AAEA,UAAMkB,IAAIrB,EAAO,IAAIc,IAAIX,CAAI;AAC7B,QAAIG,IAAID,GACJiB,IAAIlB;AAKR,SAHAmB,EAASxB,GAAKC,GAAQK,GAAMS,CAAC,GACzBd,EAAO,IAAII,IAAQD,CAAI,IAAIkB,KAAGE,EAASxB,GAAKC,GAAQK,GAAMD,CAAK,GAE5DE,IAAIgB,KAAG;AAIV,WAHAC,EAASxB,GAAKC,GAAQM,GAAGgB,CAAC,GAC1BhB,KACAgB,KACOtB,EAAO,IAAIM,IAAIH,CAAI,IAAIkB,IAAGf,CAAAA;AACjC,aAAON,EAAO,IAAIsB,IAAInB,CAAI,IAAIkB,IAAGC,CAAAA;AAAAA,IACrC;AAEItB,IAAAA,EAAO,IAAIK,IAAOF,CAAI,MAAMkB,IAAGE,EAASxB,GAAKC,GAAQK,GAAMiB,CAAC,KAE5DA,KACAC,EAASxB,GAAKC,GAAQsB,GAAGlB,CAAK,IAG9BkB,KAAKR,MAAGT,IAAOiB,IAAI,IACnBR,KAAKQ,MAAGlB,IAAQkB,IAAI;AAAA,EAC5B;AACJ;AAQA,SAASC,EAASxB,GAAKC,GAAQM,GAAGgB,GAAG;AACjCE,EAAAA,EAAKzB,GAAKO,GAAGgB,CAAC,GACdE,EAAKxB,GAAQ,IAAIM,GAAG,IAAIgB,CAAC,GACzBE,EAAKxB,GAAQ,IAAIM,IAAI,GAAG,IAAIgB,IAAI,CAAC;AACrC;AAOA,SAASE,EAAKC,GAAKnB,GAAGgB,GAAG;AACrB,QAAMI,IAAMD,EAAInB,CAAC;AACjBmB,EAAAA,EAAInB,CAAC,IAAImB,EAAIH,CAAC,GACdG,EAAIH,CAAC,IAAII;AACb;AAQA,SAASd,EAAOe,GAAIC,GAAIC,GAAIC,GAAI;AAC5B,QAAMC,IAAKJ,IAAKE,GACVG,IAAKJ,IAAKE;AAChB,SAAOC,IAAKA,IAAKC,IAAKA;AAC1B;","x_google_ignoreList":[0]}