@milaboratories/miplots4 1.0.156 → 1.0.158

package/dist/AbstractChart.d.ts

@@ -1,7 +1,8 @@
 import { DataFrame, DataSet } from './DataFrame';
-import { Settings, SettingsInterface } from './types';
+import { ErrorInfo, Settings, SettingsInterface } from './types';
 export interface ChartInterface {
     hasError: boolean;
+    errorInfo: ErrorInfo | null;
     calculatedData: Record<string, unknown> | null;
     mount: (node: HTMLElement) => void;
     unmount: () => void;
@@ -13,6 +14,7 @@ export declare abstract class AbstractChart implements ChartInterface {
     data: DataFrame;
     settings: SettingsInterface;
     hasError: boolean;
+    errorInfo: ErrorInfo | null;
     calculatedData: Record<string, unknown> | null;
     protected constructor(data: DataFrame, settings: SettingsInterface);
     abstract mount(node: HTMLElement): void;
@@ -21,4 +23,3 @@ export declare abstract class AbstractChart implements ChartInterface {
     abstract updateChartState(field: string, value: unknown): void;
     abstract export(): string;
 }
-//# sourceMappingURL=AbstractChart.d.ts.map

package/dist/AbstractChart.js

@@ -1,14 +1,15 @@
-var c = Object.defineProperty;
-var l = (a, t, s) => t in a ? c(a, t, { enumerable: !0, configurable: !0, writable: !0, value: s }) : a[t] = s;
-var r = (a, t, s) => l(a, typeof t != "symbol" ? t + "" : t, s);
-class h {
-  constructor(t, s) {
-    r(this, "hasError", !1);
-    r(this, "calculatedData", null);
-    this.data = t, this.settings = s;
+var l = Object.defineProperty;
+var c = (a, t, r) => t in a ? l(a, t, { enumerable: !0, configurable: !0, writable: !0, value: r }) : a[t] = r;
+var s = (a, t, r) => c(a, typeof t != "symbol" ? t + "" : t, r);
+class e {
+  constructor(t, r) {
+    s(this, "hasError", !1);
+    s(this, "errorInfo", null);
+    s(this, "calculatedData", null);
+    this.data = t, this.settings = r;
   }
 }
 export {
-  h as AbstractChart
+  e as AbstractChart
 };
 //# sourceMappingURL=AbstractChart.js.map

package/dist/AbstractChart.js.map

@@ -1 +1 @@
-{"version":3,"file":"AbstractChart.js","sources":["../src/AbstractChart.ts"],"sourcesContent":["import type {DataFrame, DataSet} from './DataFrame';\nimport type {Settings, SettingsInterface} from './types';\n\nexport interface ChartInterface {\n    hasError: boolean,\n    calculatedData: Record<string, unknown> | null,\n    mount: (node: HTMLElement) => void,\n    unmount: () => void,\n    updateSettingsAndData: (data: DataSet, settings: Settings) => void,\n    updateChartState: (field: string, value: unknown) => void,\n    export: () => string\n}\n\nexport abstract class AbstractChart implements ChartInterface {\n    hasError = false;\n    calculatedData = null as Record<string, unknown> | null;\n\n    protected constructor(public data: DataFrame, public settings:SettingsInterface) {\n    }\n\n    abstract mount(node: HTMLElement): void;\n\n    abstract unmount(): void;\n\n    abstract updateSettingsAndData(data: DataSet, settings: Settings): void;\n\n    abstract updateChartState(field: string, value: unknown): void;\n\n    abstract export():string;\n}\n"],"names":["AbstractChart","data","settings","__publicField"],"mappings":";;;AAaO,MAAeA,EAAwC;AAAA,EAIhD,YAAmBC,GAAwBC,GAA4B;AAHjF,IAAAC,EAAA,kBAAW;AACX,IAAAA,EAAA,wBAAiB;AAEY,SAAA,OAAAF,GAAwB,KAAA,WAAAC;AAAA,EACrD;AAWJ;"}
+{"version":3,"file":"AbstractChart.js","sources":["../src/AbstractChart.ts"],"sourcesContent":["import type {DataFrame, DataSet} from './DataFrame';\nimport type {ErrorInfo, Settings, SettingsInterface} from './types';\n\nexport interface ChartInterface {\n    hasError: boolean,\n    errorInfo: ErrorInfo | null,\n    calculatedData: Record<string, unknown> | null,\n    mount: (node: HTMLElement) => void,\n    unmount: () => void,\n    updateSettingsAndData: (data: DataSet, settings: Settings) => void,\n    updateChartState: (field: string, value: unknown) => void,\n    export: () => string\n}\n\nexport abstract class AbstractChart implements ChartInterface {\n    hasError = false;\n    errorInfo: ErrorInfo | null = null;\n    calculatedData = null as Record<string, unknown> | null;\n\n    protected constructor(public data: DataFrame, public settings:SettingsInterface) {\n    }\n\n    abstract mount(node: HTMLElement): void;\n\n    abstract unmount(): void;\n\n    abstract updateSettingsAndData(data: DataSet, settings: Settings): void;\n\n    abstract updateChartState(field: string, value: unknown): void;\n\n    abstract export():string;\n}\n"],"names":["AbstractChart","data","settings","__publicField"],"mappings":";;;AAcO,MAAeA,EAAwC;AAAA,EAKhD,YAAmBC,GAAwBC,GAA4B;AAJjF,IAAAC,EAAA,kBAAW;AACX,IAAAA,EAAA,mBAA8B;AAC9B,IAAAA,EAAA,wBAAiB;AAEY,SAAA,OAAAF,GAAwB,KAAA,WAAAC;AAAA,EACrD;AAWJ;"}

package/dist/DataFrame.d.ts

@@ -36,4 +36,3 @@ export declare class DataFrame {
     getRowsByGrouping(groupingKeys: GroupKey[]): Uint16Array;
 }
 export {};
-//# sourceMappingURL=DataFrame.d.ts.map

package/dist/DataFrame.js

@@ -1,7 +1,7 @@
 var w = Object.defineProperty;
 var C = (u, e, t) => e in u ? w(u, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : u[e] = t;
 var s = (u, e, t) => C(u, typeof e != "symbol" ? e + "" : e, t);
-import { l as f } from "./node_modules/lodash/lodash.js";
+import { l as f } from "./_virtual/lodash.js";
 import { exhaustive as x } from "./utils/index.js";
 const d = Symbol("noGrouped");
 function I(u) {

package/dist/MiPlots.d.ts

@@ -9,10 +9,10 @@ export declare class MiPlots implements ChartInterface {
     constructor(chart: AbstractChart);
     get calculatedData(): Record<string, unknown> | null;
     get hasError(): boolean;
+    get errorInfo(): import('./types').ErrorInfo | null;
     mount(node: HTMLElement): void;
     unmount(): void;
     updateSettingsAndData(data: DataSet, settings: Settings): void;
     updateChartState(field: string, value: unknown): void;
     export(): string;
 }
-//# sourceMappingURL=MiPlots.d.ts.map

package/dist/MiPlots.js

@@ -1,8 +1,8 @@
 var m = Object.defineProperty;
 var u = (e, t, r) => t in e ? m(e, t, { enumerable: !0, configurable: !0, writable: !0, value: r }) : e[t] = r;
 var o = (e, t, r) => u(e, typeof t != "symbol" ? t + "" : t, r);
-import { ChartDendro as p } from "./dendro/index.js";
-import { ChartDiscrete as n } from "./discrete/index.js";
+import { ChartDendro as n } from "./dendro/index.js";
+import { ChartDiscrete as p } from "./discrete/index.js";
 import { ChartHeatmap as f } from "./heatmap/index.js";
 import { ChartHistogram as s } from "./histogram/index.js";
 import { ChartScatterplot as C } from "./scatterplot/index.js";
@@ -19,9 +19,9 @@ class c {
   static createChart(t, r, a) {
     const { type: h } = r;
     if (h === "discrete")
-      return new n(t, r, a);
-    if (h === "dendro")
       return new p(t, r, a);
+    if (h === "dendro")
+      return new n(t, r, a);
     if (h === "scatterplot")
       return new C(t, r, a);
     if (h === "scatterplot-umap")
@@ -44,6 +44,9 @@ class c {
   get hasError() {
     return this.chart.hasError;
   }
+  get errorInfo() {
+    return this.chart.errorInfo;
+  }
   mount(t) {
     this.node = t, this.chart.mount(t);
   }

package/dist/MiPlots.js.map

@@ -1 +1 @@
-{"version":3,"file":"MiPlots.js","sources":["../src/MiPlots.ts"],"sourcesContent":["import type {AbstractChart, ChartInterface} from './AbstractChart';\nimport {ChartDendro} from './dendro';\nimport {ChartDiscrete} from './discrete';\nimport {ChartHeatmap} from './heatmap';\nimport {ChartHistogram} from './histogram';\nimport {ChartScatterplot} from './scatterplot';\nimport {ChartScatterplotUmap} from './scatterplot-umap';\nimport {ChartBubble} from './bubble';\nimport {DataFrame} from './DataFrame';\nimport type {\n    BubbleEventHandlers,\n    ChartEventHandlers,\n    DendroEventHandlers,\n    DiscreteEventHandlers,\n    HeatmapEventHandlers,\n    HistogramEventHandlers,\n    ScatterplotEventHandlers,\n    Settings,\n} from './types';\nimport {exhaustive} from './utils';\nimport type {DataSet} from './DataFrame';\n\nexport class MiPlots implements ChartInterface {\n    node?: HTMLElement;\n    chart: AbstractChart;\n\n    private static createChart(\n        data: DataFrame,\n        settings: Settings,\n        eventHandlers?: ChartEventHandlers<unknown>\n    ): AbstractChart {\n        const {type} = settings;\n\n        if (type === 'discrete') {\n            return new ChartDiscrete(data, settings, eventHandlers as DiscreteEventHandlers);\n        }\n\n        if (type === 'dendro') {\n            return new ChartDendro(data, settings, eventHandlers as DendroEventHandlers);\n        }\n\n        if (type === 'scatterplot') {\n            return new ChartScatterplot(data, settings, eventHandlers as ScatterplotEventHandlers);\n        }\n\n        if (type === 'scatterplot-umap') {\n            return new ChartScatterplotUmap(data, settings, eventHandlers as ScatterplotEventHandlers);\n        }\n\n        if (type === 'heatmap') {\n            return new ChartHeatmap(data, settings, eventHandlers as HeatmapEventHandlers);\n        }\n\n        if (type === 'histogram') {\n            return new ChartHistogram(data, settings, eventHandlers as HistogramEventHandlers);\n        }\n\n        if (type === 'bubble') {\n            return new ChartBubble(data, settings, eventHandlers as BubbleEventHandlers);\n        }\n\n        exhaustive(type, `Unknown chart type: ${type}`);\n    }\n\n    static newPlot(data: DataSet, settings: Settings, eventHandlers?: ChartEventHandlers<unknown>): MiPlots {\n        const dataFrame = DataFrame.from(data);\n        return new this(MiPlots.createChart(dataFrame, settings, eventHandlers));\n    }\n\n    constructor(chart: AbstractChart) {\n        this.chart = chart;\n    }\n\n    get calculatedData() {\n        return this.chart.calculatedData;\n    }\n\n    get hasError() {\n        return this.chart.hasError;\n    }\n\n    mount(node: HTMLElement) {\n        this.node = node;\n        this.chart.mount(node);\n    }\n\n    unmount() {\n        delete this.node;\n        this.chart.unmount();\n    }\n\n    updateSettingsAndData(data: DataSet, settings: Settings) {\n        if (settings.type !== this.chart.settings.type) {\n            const newChart = MiPlots.createChart(this.chart.data, settings);\n\n            if (this.node) {\n                this.chart.unmount();\n                this.chart = newChart;\n                this.chart.mount(this.node);\n            } else {\n                this.chart = newChart;\n            }\n        } else {\n            this.chart.updateSettingsAndData(DataFrame.from(data), settings);\n        }\n    }\n\n    updateChartState(field: string, value: unknown) {\n        this.chart.updateChartState(field, value);\n    }\n\n    export() {\n        return this.chart.export();\n    }\n}\n"],"names":["MiPlots","chart","__publicField","data","settings","eventHandlers","type","ChartDiscrete","ChartDendro","ChartScatterplot","ChartScatterplotUmap","ChartHeatmap","ChartHistogram","ChartBubble","exhaustive","dataFrame","DataFrame","node","newChart","field","value"],"mappings":";;;;;;;;;;;;AAsBO,MAAMA,EAAkC;AAAA,EA+C3C,YAAYC,GAAsB;AA9ClC,IAAAC,EAAA;AACA,IAAAA,EAAA;AA8CI,SAAK,QAAQD;AAAA,EACjB;AAAA,EA7CA,OAAe,YACXE,GACAC,GACAC,GACa;AACb,UAAM,EAAC,MAAAC,MAAQF;AAEf,QAAIE,MAAS;AACT,aAAO,IAAIC,EAAcJ,GAAMC,GAAUC,CAAsC;AAGnF,QAAIC,MAAS;AACT,aAAO,IAAIE,EAAYL,GAAMC,GAAUC,CAAoC;AAG/E,QAAIC,MAAS;AACT,aAAO,IAAIG,EAAiBN,GAAMC,GAAUC,CAAyC;AAGzF,QAAIC,MAAS;AACT,aAAO,IAAII,EAAqBP,GAAMC,GAAUC,CAAyC;AAG7F,QAAIC,MAAS;AACT,aAAO,IAAIK,EAAaR,GAAMC,GAAUC,CAAqC;AAGjF,QAAIC,MAAS;AACT,aAAO,IAAIM,EAAeT,GAAMC,GAAUC,CAAuC;AAGrF,QAAIC,MAAS;AACT,aAAO,IAAIO,EAAYV,GAAMC,GAAUC,CAAoC;AAG/E,IAAAS,EAAWR,GAAM,uBAAuBA,CAAI,EAAE;AAAA,EAClD;AAAA,EAEA,OAAO,QAAQH,GAAeC,GAAoBC,GAAsD;AACpG,UAAMU,IAAYC,EAAU,KAAKb,CAAI;AACrC,WAAO,IAAI,KAAKH,EAAQ,YAAYe,GAAWX,GAAUC,CAAa,CAAC;AAAA,EAC3E;AAAA,EAMA,IAAI,iBAAiB;AACjB,WAAO,KAAK,MAAM;AAAA,EACtB;AAAA,EAEA,IAAI,WAAW;AACX,WAAO,KAAK,MAAM;AAAA,EACtB;AAAA,EAEA,MAAMY,GAAmB;AACrB,SAAK,OAAOA,GACZ,KAAK,MAAM,MAAMA,CAAI;AAAA,EACzB;AAAA,EAEA,UAAU;AACN,WAAO,KAAK,MACZ,KAAK,MAAM,QAAA;AAAA,EACf;AAAA,EAEA,sBAAsBd,GAAeC,GAAoB;AACrD,QAAIA,EAAS,SAAS,KAAK,MAAM,SAAS,MAAM;AAC5C,YAAMc,IAAWlB,EAAQ,YAAY,KAAK,MAAM,MAAMI,CAAQ;AAE9D,MAAI,KAAK,QACL,KAAK,MAAM,QAAA,GACX,KAAK,QAAQc,GACb,KAAK,MAAM,MAAM,KAAK,IAAI,KAE1B,KAAK,QAAQA;AAAA,IAErB;AACI,WAAK,MAAM,sBAAsBF,EAAU,KAAKb,CAAI,GAAGC,CAAQ;AAAA,EAEvE;AAAA,EAEA,iBAAiBe,GAAeC,GAAgB;AAC5C,SAAK,MAAM,iBAAiBD,GAAOC,CAAK;AAAA,EAC5C;AAAA,EAEA,SAAS;AACL,WAAO,KAAK,MAAM,OAAA;AAAA,EACtB;AACJ;"}
+{"version":3,"file":"MiPlots.js","sources":["../src/MiPlots.ts"],"sourcesContent":["import type {AbstractChart, ChartInterface} from './AbstractChart';\nimport {ChartDendro} from './dendro';\nimport {ChartDiscrete} from './discrete';\nimport {ChartHeatmap} from './heatmap';\nimport {ChartHistogram} from './histogram';\nimport {ChartScatterplot} from './scatterplot';\nimport {ChartScatterplotUmap} from './scatterplot-umap';\nimport {ChartBubble} from './bubble';\nimport {DataFrame} from './DataFrame';\nimport type {\n    BubbleEventHandlers,\n    ChartEventHandlers,\n    DendroEventHandlers,\n    DiscreteEventHandlers,\n    HeatmapEventHandlers,\n    HistogramEventHandlers,\n    ScatterplotEventHandlers,\n    Settings,\n} from './types';\nimport {exhaustive} from './utils';\nimport type {DataSet} from './DataFrame';\n\nexport class MiPlots implements ChartInterface {\n    node?: HTMLElement;\n    chart: AbstractChart;\n\n    private static createChart(\n        data: DataFrame,\n        settings: Settings,\n        eventHandlers?: ChartEventHandlers<unknown>\n    ): AbstractChart {\n        const {type} = settings;\n\n        if (type === 'discrete') {\n            return new ChartDiscrete(data, settings, eventHandlers as DiscreteEventHandlers);\n        }\n\n        if (type === 'dendro') {\n            return new ChartDendro(data, settings, eventHandlers as DendroEventHandlers);\n        }\n\n        if (type === 'scatterplot') {\n            return new ChartScatterplot(data, settings, eventHandlers as ScatterplotEventHandlers);\n        }\n\n        if (type === 'scatterplot-umap') {\n            return new ChartScatterplotUmap(data, settings, eventHandlers as ScatterplotEventHandlers);\n        }\n\n        if (type === 'heatmap') {\n            return new ChartHeatmap(data, settings, eventHandlers as HeatmapEventHandlers);\n        }\n\n        if (type === 'histogram') {\n            return new ChartHistogram(data, settings, eventHandlers as HistogramEventHandlers);\n        }\n\n        if (type === 'bubble') {\n            return new ChartBubble(data, settings, eventHandlers as BubbleEventHandlers);\n        }\n\n        exhaustive(type, `Unknown chart type: ${type}`);\n    }\n\n    static newPlot(data: DataSet, settings: Settings, eventHandlers?: ChartEventHandlers<unknown>): MiPlots {\n        const dataFrame = DataFrame.from(data);\n        return new this(MiPlots.createChart(dataFrame, settings, eventHandlers));\n    }\n\n    constructor(chart: AbstractChart) {\n        this.chart = chart;\n    }\n\n    get calculatedData() {\n        return this.chart.calculatedData;\n    }\n\n    get hasError() {\n        return this.chart.hasError;\n    }\n\n    get errorInfo() {\n        return this.chart.errorInfo;\n    }\n\n    mount(node: HTMLElement) {\n        this.node = node;\n        this.chart.mount(node);\n    }\n\n    unmount() {\n        delete this.node;\n        this.chart.unmount();\n    }\n\n    updateSettingsAndData(data: DataSet, settings: Settings) {\n        if (settings.type !== this.chart.settings.type) {\n            const newChart = MiPlots.createChart(this.chart.data, settings);\n\n            if (this.node) {\n                this.chart.unmount();\n                this.chart = newChart;\n                this.chart.mount(this.node);\n            } else {\n                this.chart = newChart;\n            }\n        } else {\n            this.chart.updateSettingsAndData(DataFrame.from(data), settings);\n        }\n    }\n\n    updateChartState(field: string, value: unknown) {\n        this.chart.updateChartState(field, value);\n    }\n\n    export() {\n        return this.chart.export();\n    }\n}\n"],"names":["MiPlots","chart","__publicField","data","settings","eventHandlers","type","ChartDiscrete","ChartDendro","ChartScatterplot","ChartScatterplotUmap","ChartHeatmap","ChartHistogram","ChartBubble","exhaustive","dataFrame","DataFrame","node","newChart","field","value"],"mappings":";;;;;;;;;;;;AAsBO,MAAMA,EAAkC;AAAA,EA+C3C,YAAYC,GAAsB;AA9ClC,IAAAC,EAAA;AACA,IAAAA,EAAA;AA8CI,SAAK,QAAQD;AAAA,EACjB;AAAA,EA7CA,OAAe,YACXE,GACAC,GACAC,GACa;AACb,UAAM,EAAC,MAAAC,MAAQF;AAEf,QAAIE,MAAS;AACT,aAAO,IAAIC,EAAcJ,GAAMC,GAAUC,CAAsC;AAGnF,QAAIC,MAAS;AACT,aAAO,IAAIE,EAAYL,GAAMC,GAAUC,CAAoC;AAG/E,QAAIC,MAAS;AACT,aAAO,IAAIG,EAAiBN,GAAMC,GAAUC,CAAyC;AAGzF,QAAIC,MAAS;AACT,aAAO,IAAII,EAAqBP,GAAMC,GAAUC,CAAyC;AAG7F,QAAIC,MAAS;AACT,aAAO,IAAIK,EAAaR,GAAMC,GAAUC,CAAqC;AAGjF,QAAIC,MAAS;AACT,aAAO,IAAIM,EAAeT,GAAMC,GAAUC,CAAuC;AAGrF,QAAIC,MAAS;AACT,aAAO,IAAIO,EAAYV,GAAMC,GAAUC,CAAoC;AAG/E,IAAAS,EAAWR,GAAM,uBAAuBA,CAAI,EAAE;AAAA,EAClD;AAAA,EAEA,OAAO,QAAQH,GAAeC,GAAoBC,GAAsD;AACpG,UAAMU,IAAYC,EAAU,KAAKb,CAAI;AACrC,WAAO,IAAI,KAAKH,EAAQ,YAAYe,GAAWX,GAAUC,CAAa,CAAC;AAAA,EAC3E;AAAA,EAMA,IAAI,iBAAiB;AACjB,WAAO,KAAK,MAAM;AAAA,EACtB;AAAA,EAEA,IAAI,WAAW;AACX,WAAO,KAAK,MAAM;AAAA,EACtB;AAAA,EAEA,IAAI,YAAY;AACZ,WAAO,KAAK,MAAM;AAAA,EACtB;AAAA,EAEA,MAAMY,GAAmB;AACrB,SAAK,OAAOA,GACZ,KAAK,MAAM,MAAMA,CAAI;AAAA,EACzB;AAAA,EAEA,UAAU;AACN,WAAO,KAAK,MACZ,KAAK,MAAM,QAAA;AAAA,EACf;AAAA,EAEA,sBAAsBd,GAAeC,GAAoB;AACrD,QAAIA,EAAS,SAAS,KAAK,MAAM,SAAS,MAAM;AAC5C,YAAMc,IAAWlB,EAAQ,YAAY,KAAK,MAAM,MAAMI,CAAQ;AAE9D,MAAI,KAAK,QACL,KAAK,MAAM,QAAA,GACX,KAAK,QAAQc,GACb,KAAK,MAAM,MAAM,KAAK,IAAI,KAE1B,KAAK,QAAQA;AAAA,IAErB;AACI,WAAK,MAAM,sBAAsBF,EAAU,KAAKb,CAAI,GAAGC,CAAQ;AAAA,EAEvE;AAAA,EAEA,iBAAiBe,GAAeC,GAAgB;AAC5C,SAAK,MAAM,iBAAiBD,GAAOC,CAAK;AAAA,EAC5C;AAAA,EAEA,SAAS;AACL,WAAO,KAAK,MAAM,OAAA;AAAA,EACtB;AACJ;"}

package/dist/_virtual/client.js

@@ -0,0 +1,6 @@
+import { __require as r } from "../node_modules/.pnpm/react-dom@18.3.1_react@18.3.1/node_modules/react-dom/client.js";
+var i = r();
+export {
+  i as c
+};
+//# sourceMappingURL=client.js.map

package/dist/_virtual/client.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"client.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;"}

package/dist/_virtual/client2.js

@@ -0,0 +1,5 @@
+var e = {};
+export {
+  e as __exports
+};
+//# sourceMappingURL=client2.js.map

package/dist/_virtual/client2.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"client2.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/_virtual/index.js

@@ -1,5 +1,5 @@
 import { getDefaultExportFromCjs as r } from "./_commonjsHelpers.js";
-import { __require as t } from "../node_modules/react/index.js";
+import { __require as t } from "../node_modules/.pnpm/react@18.3.1/node_modules/react/index.js";
 var e = t();
 const s = /* @__PURE__ */ r(e);
 export {

package/dist/_virtual/index10.js

@@ -0,0 +1,8 @@
+import { getDefaultExportFromCjs as r } from "./_commonjsHelpers.js";
+import { __require as o } from "../node_modules/.pnpm/@stdlib_stats-wilcoxon@0.2.2/node_modules/@stdlib/stats-wilcoxon/lib/index.js";
+var t = o();
+const a = /* @__PURE__ */ r(t);
+export {
+  a as default
+};
+//# sourceMappingURL=index10.js.map

package/dist/_virtual/index10.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index10.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;"}

package/dist/_virtual/index2.js

@@ -1,5 +1,6 @@
-var e = { exports: {} };
+import { __require as r } from "../node_modules/.pnpm/react-dom@18.3.1_react@18.3.1/node_modules/react-dom/index.js";
+var o = r();
 export {
-  e as __module
+  o as r
 };
 //# sourceMappingURL=index2.js.map

package/dist/_virtual/index2.js.map

@@ -1 +1 @@
-{"version":3,"file":"index2.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}
+{"version":3,"file":"index2.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;"}

package/dist/_virtual/index5.js

@@ -0,0 +1,5 @@
+var e = { exports: {} };
+export {
+  e as __module
+};
+//# sourceMappingURL=index5.js.map

package/dist/_virtual/index5.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index5.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/_virtual/index6.js

@@ -0,0 +1,8 @@
+import { getDefaultExportFromCjs as r } from "./_commonjsHelpers.js";
+import { __require as o } from "../node_modules/.pnpm/@stdlib_stats-anova1@0.2.2/node_modules/@stdlib/stats-anova1/lib/index.js";
+var t = o();
+const i = /* @__PURE__ */ r(t);
+export {
+  i as default
+};
+//# sourceMappingURL=index6.js.map

package/dist/_virtual/index6.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index6.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;"}

package/dist/_virtual/index7.js

@@ -0,0 +1,8 @@
+import { getDefaultExportFromCjs as r } from "./_commonjsHelpers.js";
+import { __require as t } from "../node_modules/.pnpm/@stdlib_stats-ttest@0.2.2/node_modules/@stdlib/stats-ttest/lib/index.js";
+var e = t();
+const s = /* @__PURE__ */ r(e);
+export {
+  s as default
+};
+//# sourceMappingURL=index7.js.map

package/dist/_virtual/index7.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index7.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;"}

package/dist/_virtual/index8.js

@@ -0,0 +1,8 @@
+import { getDefaultExportFromCjs as r } from "./_commonjsHelpers.js";
+import { __require as t } from "../node_modules/.pnpm/@stdlib_stats-ttest2@0.2.2/node_modules/@stdlib/stats-ttest2/lib/index.js";
+var e = t();
+const s = /* @__PURE__ */ r(e);
+export {
+  s as default
+};
+//# sourceMappingURL=index8.js.map

package/dist/_virtual/index8.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index8.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;"}

package/dist/_virtual/index9.js

@@ -0,0 +1,8 @@
+import { getDefaultExportFromCjs as r } from "./_commonjsHelpers.js";
+import { __require as o } from "../node_modules/.pnpm/@stdlib_stats-kruskal-test@0.2.2/node_modules/@stdlib/stats-kruskal-test/lib/index.js";
+var t = o();
+const i = /* @__PURE__ */ r(t);
+export {
+  i as default
+};
+//# sourceMappingURL=index9.js.map

package/dist/_virtual/index9.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index9.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;"}

package/dist/_virtual/jsx-runtime.js

@@ -1,5 +1,6 @@
-var e = { exports: {} };
+import { __require as r } from "../node_modules/.pnpm/react@18.3.1/node_modules/react/jsx-runtime.js";
+var i = r();
 export {
-  e as __module
+  i as j
 };
 //# sourceMappingURL=jsx-runtime.js.map

package/dist/_virtual/jsx-runtime.js.map

@@ -1 +1 @@
-{"version":3,"file":"jsx-runtime.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}
+{"version":3,"file":"jsx-runtime.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;"}

package/dist/_virtual/jsx-runtime2.js

@@ -0,0 +1,5 @@
+var e = { exports: {} };
+export {
+  e as __module
+};
+//# sourceMappingURL=jsx-runtime2.js.map

package/dist/_virtual/jsx-runtime2.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"jsx-runtime2.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/_virtual/lodash.js

@@ -1,5 +1,9 @@
-var o = { exports: {} };
+import { getDefaultExportFromCjs as r } from "./_commonjsHelpers.js";
+import { __require as o } from "../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/lodash.js";
+var a = o();
+const e = /* @__PURE__ */ r(a);
 export {
-  o as __module
+  e as default,
+  a as l
 };
 //# sourceMappingURL=lodash.js.map

package/dist/_virtual/lodash.js.map

@@ -1 +1 @@
-{"version":3,"file":"lodash.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}
+{"version":3,"file":"lodash.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;"}

package/dist/_virtual/lodash2.js

@@ -0,0 +1,5 @@
+var o = { exports: {} };
+export {
+  o as __module
+};
+//# sourceMappingURL=lodash2.js.map

package/dist/_virtual/lodash2.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lodash2.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/_virtual/server.browser.js

@@ -0,0 +1,6 @@
+import { __require as r } from "../node_modules/.pnpm/react-dom@18.3.1_react@18.3.1/node_modules/react-dom/server.browser.js";
+var s = r();
+export {
+  s
+};
+//# sourceMappingURL=server.browser.js.map

package/dist/_virtual/server.browser.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"server.browser.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;"}

package/dist/_virtual/server.browser2.js

@@ -0,0 +1,5 @@
+var r = {};
+export {
+  r as __exports
+};
+//# sourceMappingURL=server.browser2.js.map

package/dist/_virtual/server.browser2.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"server.browser2.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/assets/getClusters-BScJvejf.js.map

@@ -1 +1 @@
-{"version":3,"file":"getClusters-BScJvejf.js","sources":["../node_modules/d3-random/src/lcg.js","../node_modules/comlink/src/comlink.ts","../src/heatmap/getClusters.ts"],"sourcesContent":["// https://en.wikipedia.org/wiki/Linear_congruential_generator#Parameters_in_common_use\nconst mul = 0x19660D;\nconst inc = 0x3C6EF35F;\nconst eps = 1 / 0x100000000;\n\nexport default function lcg(seed = Math.random()) {\n  let state = (0 <= seed && seed < 1 ? seed / eps : Math.abs(seed)) | 0;\n  return () => (state = mul * state + inc | 0, eps * (state >>> 0));\n}\n",null,"import type { Cluster } from './components/types';\nimport type { DendrogramDistance, DendrogramLinkage } from '../types';\nimport { randomLcg } from 'd3-random';\nimport { expose } from 'comlink';\n\n/* DISTANCE FUNCTIONS - Calculate similarity between two data points */\n\n/**\n * Calculate squared Euclidean distance between two vectors\n * This is faster than regular Euclidean distance since it avoids the square root\n * Formula: Σ(p[i] - q[i])²\n * @param p First vector\n * @param q Second vector\n * @returns Squared distance (always positive)\n */\nexport function squaredEuclidean(p: number[], q: number[]) {\n    let d = 0;\n    // Sum the squared differences for each dimension\n    for (let i = 0; i < p.length; i++) {\n        d += (p[i] - q[i]) * (p[i] - q[i]);\n    }\n    return d;\n}\n\n/**\n * Calculate Euclidean distance between two vectors\n * This is the standard geometric distance in n-dimensional space\n * Formula: √(Σ(p[i] - q[i])²)\n * @param p First vector\n * @param q Second vector\n * @returns Euclidean distance\n */\nexport function euclidean(p: number[], q: number[]) {\n    return Math.sqrt(squaredEuclidean(p, q));\n}\n\n/* LINKAGE FUNCTIONS - Define how to measure distance between two clusters */\n\n/**\n * Average Linkage\n * Calculates the average distance between all pairs of points in the two clusters\n * This is the most commonly used linkage method as it balances between single and complete linkage\n * @param setA Indexes of points in first cluster\n * @param setB Indexes of points in second cluster  \n * @param getDistance Function to get distance between two point indexes\n * @returns Average distance between clusters\n */\nexport const averageLinkage = (setA: number[], setB: number[], getDistance: (i: number, j: number) => number) => {\n    let distance = 0;\n    // Sum all pairwise distances between clusters\n    for (const a of setA) {\n        for (const b of setB) distance += getDistance(a, b);\n    }\n\n    // Return average distance\n    return distance / setA.length / setB.length;\n};\n\n/**\n * Complete Linkage (Maximum Linkage)\n * Uses the maximum distance between any pair of points in the two clusters\n * Tends to create compact, well-separated clusters\n * Formula: max{d(a,b)} for all a in A, b in B\n * @param setA Indexes of points in first cluster\n * @param setB Indexes of points in second cluster\n * @param getDistance Function to get distance between two point indexes\n * @returns Maximum distance between clusters\n */\nexport const completeLinkage = (setA: number[], setB: number[], getDistance: (i: number, j: number) => number) => {\n    let distance = 0;\n    // Find maximum distance between any pair of points\n    for (const a of setA) {\n        for (const b of setB) distance = Math.max(distance, getDistance(a, b));\n    }\n\n    return distance;\n};\n\n/**\n * Single Linkage (Minimum Linkage)\n * Uses the minimum distance between any pair of points in the two clusters\n * Tends to create elongated, chain-like clusters\n * Formula: min{d(a,b)} for all a in A, b in B\n * @param setA Indexes of points in first cluster\n * @param setB Indexes of points in second cluster\n * @param getDistance Function to get distance between two point indexes\n * @returns Minimum distance between clusters\n */\nexport const singleLinkage = (setA: number[], setB: number[], getDistance: (i: number, j: number) => number) => {\n    let distance = Infinity;\n    // Find minimum distance between any pair of points\n    for (const a of setA) {\n        for (const b of setB) distance = Math.min(distance, getDistance(a, b));\n    }\n\n    return distance;\n};\n\n/* HELPER FUNCTIONS - Factory functions for distance and linkage methods */\n\n/**\n * Get the appropriate linkage function based on the linkage type\n * @param linkage Type of linkage method to use\n * @returns Function that calculates distance between two clusters\n */\nfunction getLinkageFn(linkage: DendrogramLinkage) {\n    switch (linkage) {\n        case 'average': return averageLinkage;\n        case 'complete': return completeLinkage;\n        case 'single': return singleLinkage;\n        default: return averageLinkage; // Default to average linkage\n    }\n}\n\n/**\n * Get the appropriate distance function based on the distance type\n * @param distance Type of distance metric to use\n * @returns Function that calculates distance between two points\n */\nfunction getDistanceFn(distance: DendrogramDistance) {\n    switch (distance) {\n        case 'euclidean': return euclidean;\n        case 'squaredEuclidean': return squaredEuclidean;\n        default: return euclidean; // Default to euclidean distance\n    }\n}\n\n/* UTILITY FUNCTIONS - Helper functions for cluster manipulation and sorting */\n\n/**\n * Extract indexes from a cluster hierarchy in the correct hierarchical order\n * This function traverses the cluster tree and collects all indexes in the order\n * they appear in the dendrogram (left-to-right traversal)\n * @param cluster The root cluster to extract indexes from\n * @returns Array of indexes in hierarchical order\n */\nexport function extractOrderedIndexes(cluster: Cluster): number[] {\n    const orderedIndexes: number[] = [];\n    \n    const traverse = (c: Cluster) => {\n        if (c.children.length === 0) {\n            // Leaf node - add all indexes from this cluster\n            orderedIndexes.push(...c.indexes);\n        } else {\n            // Internal node - traverse children in order (left to right)\n            for (const child of c.children) {\n                traverse(child);\n            }\n        }\n    };\n    \n    traverse(cluster);\n    return orderedIndexes;\n}\n\nconst MAX_CLUSTER_SIZE = 2000;\n\n// Approximate clustering using sampling for very large datasets\nexport function getClustersApproximate(\n    dataValues: number[][], \n    distanceType: DendrogramDistance = 'euclidean', \n    linkageType: DendrogramLinkage = 'average',\n): Cluster {    \n    if (dataValues.length <= MAX_CLUSTER_SIZE) {\n        return getClusters(dataValues, distanceType, linkageType);\n    }\n    \n    const N = dataValues.length;\n    const getRandom = randomLcg(1);\n    // Step 1: Random sampling\n    const sampleIndices = new Set<number>();\n    while (sampleIndices.size < MAX_CLUSTER_SIZE) {\n        sampleIndices.add(Math.floor(getRandom() * N));\n    }\n    \n    const sampleIndicesArray = Array.from(sampleIndices);\n    const sampleValues = sampleIndicesArray.map(i => dataValues[i]);\n    \n    // Step 2: Cluster the sample\n    const sampleCluster = getClusters(sampleValues, distanceType, linkageType);\n    \n    // Step 3: Assign remaining points to nearest cluster\n    return assignRemainingPoints(sampleCluster, dataValues, sampleIndicesArray, distanceType);\n}\n\n// Assign remaining points to the nearest cluster from the sample\nfunction assignRemainingPoints(\n    sampleCluster: Cluster, \n    dataValues: number[][], \n    sampleIndices: number[],\n    distanceType: DendrogramDistance\n): Cluster {\n    // console.log('assignRemainingPoints');\n\n    const distanceFn = getDistanceFn(distanceType);\n    const sampleSet = new Set(sampleIndices);\n    \n    // Assign each non-sample point to nearest sample point\n    const assignments = new Map<number, number>(); // point -> sample point\n    for (let i = 0; i < dataValues.length; i++) {\n        if (sampleSet.has(i)) continue;\n        \n        let minDistance = Infinity;\n        let nearestSample = -1;\n        \n        for (const sampleIdx of sampleIndices) {\n            const distance = distanceFn(dataValues[i], dataValues[sampleIdx]);\n            if (distance < minDistance) {\n                minDistance = distance;\n                nearestSample = sampleIdx;\n            }\n        }\n        \n        assignments.set(i, nearestSample);\n    }\n    // Reconstruct cluster with all points\n    return reconstructWithAssignments(sampleCluster, assignments, sampleIndices);\n}\n\n// Reconstruct cluster hierarchy with assigned points\nfunction reconstructWithAssignments(\n    sampleCluster: Cluster, \n    assignments: Map<number, number>, \n    sampleIndices: number[]\n): Cluster {\n    // Create a map of sample indices to their clusters\n    const sampleToCluster = new Map<number, Cluster>();\n    const findSampleClusters = (cluster: Cluster) => {\n        if (cluster.indexes.length === 1) {\n            sampleToCluster.set(sampleIndices[cluster.indexes[0]], cluster);\n        }\n        for (const child of cluster.children) {\n            findSampleClusters(child);\n        }\n    };\n    findSampleClusters(sampleCluster);\n    \n    // Group assigned points by their sample cluster\n    const assignedPointsByCluster = new Map<Cluster, number[]>();\n    for (const [pointIdx, sampleIdx] of assignments) {\n        const sampleCluster = sampleToCluster.get(sampleIdx);\n        if (sampleCluster) {\n            if (!assignedPointsByCluster.has(sampleCluster)) {\n                assignedPointsByCluster.set(sampleCluster, []);\n            }\n            const cluster = assignedPointsByCluster.get(sampleCluster);\n            if (cluster) {\n                cluster.push(pointIdx);\n            }\n        }\n    }\n\n    const fillCorrectIndexes = (c: Cluster) => {\n        c.indexes = c.indexes.map(i => sampleIndices[i]);\n        for (const child of c.children) {\n            fillCorrectIndexes(child);\n        }\n    };\n    fillCorrectIndexes(sampleCluster);\n    for (const [cluster, assignedPoints] of assignedPointsByCluster) {\n        cluster.indexes = [...cluster.indexes, ...assignedPoints];\n    }\n    \n    return {\n        ...sampleCluster,\n        indexes: extractOrderedIndexes(sampleCluster)\n    };\n}\n\n/* MAIN HIERARCHICAL CLUSTERING FUNCTION - Standard agglomerative clustering */\n\n/**\n * Main hierarchical clustering function using agglomerative approach\n * \n * This implements the standard agglomerative hierarchical clustering algorithm:\n * 1. Start with each point as its own cluster\n * 2. Compute pairwise distances between all points\n * 3. Iteratively merge the two closest clusters\n * 4. Continue until only one cluster remains\n * \n * Algorithm complexity:\n * - Time: O(n³) - for each of n-1 iterations, scan all n² cluster pairs\n * - Space: O(n²) - store upper triangular distance matrix\n * \n * Memory optimization:\n * - Uses upper triangular matrix storage (50% memory reduction)\n * - Only stores distances where i < j since distance matrix is symmetric\n * \n * @param dataKeys Labels for each data point\n * @param dataValues Feature vectors for each data point (n×d matrix)\n * @param distanceType Distance metric to use between points\n * @param linkageType Linkage method to use between clusters\n * @returns Root cluster containing the complete hierarchy\n */\nexport function getClusters(dataValues: number[][], distanceType: DendrogramDistance = 'euclidean', linkageType: DendrogramLinkage = 'average'): Cluster {\n    const distanceFn = getDistanceFn(distanceType);\n    const linkageFn = getLinkageFn(linkageType);\n    \n    const N = dataValues.length;\n    \n    // STEP 1: Precompute pairwise distances using upper triangular matrix\n    // This reduces memory usage from O(n²) to O(n²/2) by only storing upper triangle\n    // Since distance matrix is symmetric: d(i,j) = d(j,i)\n    const distances: number[] = [];\n    \n    // Helper function to access distances in upper triangular matrix\n    // Maps 2D coordinates (i,j) to 1D array index\n    const getDistance = (i: number, j: number): number => {\n        if (i === j) return 0; // Distance to self is always 0\n        if (i > j) [i, j] = [j, i]; // Swap to ensure i < j (upper triangular)\n        const index = i * N - (i * (i + 1)) / 2 + (j - i - 1);\n        return distances[index];\n    };\n    \n    // Helper function to set distances in upper triangular matrix\n    const setDistance = (i: number, j: number, value: number): void => {\n        if (i > j) [i, j] = [j, i]; // Swap to ensure i < j (upper triangular)\n        const index = i * N - (i * (i + 1)) / 2 + (j - i - 1);\n        distances[index] = value;\n    };\n    \n    // Calculate all pairwise distances (only upper triangular)\n    // This is the most expensive step: O(n²) distance calculations\n    for (let i1 = 0; i1 < N; i1++) {\n        for (let i2 = i1 + 1; i2 < N; i2++) {\n            const v = distanceFn(dataValues[i1], dataValues[i2]);\n            setDistance(i1, i2, v);\n        }   \n    }\n\n    // STEP 2: Initialize clusters - each point starts as its own cluster\n    // This creates the leaf nodes of the dendrogram\n    const clusters: Cluster[] = dataValues.map((_, index) => ({\n        height: 0, // Height 0 for leaf nodes\n        indexes: [index], // Single index per cluster initially\n        children: [] // No children for leaf nodes\n    }));\n\n    // STEP 3: Agglomerative clustering - merge clusters iteratively\n    // This is the main clustering loop that builds the hierarchy\n    for (let iteration = 0; iteration < N; iteration++) {\n        // Stop when only one cluster remains (root of dendrogram)\n        if (iteration >= N - 1) break;\n\n        // Find the two closest clusters using the selected linkage method\n        let nearestDistance = Infinity;\n        let nearest1 = 0;\n        let nearest2 = 0;\n\n        // Check all pairs of clusters (upper triangular to avoid duplicates)\n        for (let clusterIdx1 = 0; clusterIdx1 < clusters.length; clusterIdx1++) {\n            for (let clusterIdx2 = clusterIdx1 + 1; clusterIdx2 < clusters.length; clusterIdx2++) {\n                // Calculate distance between clusters using linkage method\n                const distance = linkageFn(clusters[clusterIdx1].indexes, clusters[clusterIdx2].indexes, getDistance);\n                \n                // Keep track of the closest pair\n                if (distance < nearestDistance) {\n                    nearestDistance = distance;\n                    nearest1 = clusterIdx1;\n                    nearest2 = clusterIdx2;\n                }\n            }\n        }\n\n        // STEP 4: Merge the two closest clusters\n        // Create a new cluster that combines the two closest clusters\n        const newCluster = {\n            indexes: [...clusters[nearest1].indexes, ...clusters[nearest2].indexes], // Combine all indexes\n            height: nearestDistance, // Height is the distance at which clusters were merged\n            children: [clusters[nearest1], clusters[nearest2]], // Store the two merged clusters as children\n        };\n\n        // STEP 5: Update cluster list\n        // Remove the two merged clusters and add the new merged cluster\n        // Remove higher index first to avoid index shifting issues\n        clusters.splice(Math.max(nearest1, nearest2), 1);\n        clusters.splice(Math.min(nearest1, nearest2), 1);\n        clusters.push(newCluster);\n    }\n\n    // STEP 6: Return the root cluster with properly ordered keys and indexes\n    // The root cluster contains the complete hierarchy\n    const rootCluster = clusters[0];\n    return {\n        ...rootCluster,\n        indexes: extractOrderedIndexes(rootCluster) // Ensure indexes are in hierarchical order\n    };\n}\n\nexpose({getClustersApproximate});"],"names":["eps","lcg","seed","state","proxyMarker","createEndpoint","releaseProxy","finalizer","throwMarker","isObject","val","proxyTransferHandler","obj","port1","port2","expose","port","wrap","throwTransferHandler","value","serialized","transferHandlers","isAllowedOrigin","allowedOrigins","origin","allowedOrigin","ep","callback","ev","id","type","path","argumentList","fromWireValue","returnValue","parent","prop","rawValue","proxy","transfer","wireValue","transferables","toWireValue","closeEndPoint","error","isMessagePort","endpoint","target","pendingListeners","data","resolver","createProxy","throwIfProxyReleased","isReleased","releaseEndpoint","requestResponseMessage","proxyCounter","proxyFinalizers","newCount","registerProxy","unregisterProxy","isProxyReleased","_target","r","p","_thisArg","rawArgumentList","last","processArguments","myFlat","arr","processed","v","transferCache","transfers","name","handler","serializedValue","msg","resolve","generateUUID","squaredEuclidean","q","d","euclidean","averageLinkage","setA","setB","getDistance","distance","b","completeLinkage","singleLinkage","getLinkageFn","linkage","getDistanceFn","extractOrderedIndexes","cluster","orderedIndexes","traverse","c","child","MAX_CLUSTER_SIZE","getClustersApproximate","dataValues","distanceType","linkageType","getClusters","N","getRandom","randomLcg","sampleIndices","sampleIndicesArray","sampleValues","i","sampleCluster","assignRemainingPoints","distanceFn","sampleSet","assignments","minDistance","nearestSample","sampleIdx","reconstructWithAssignments","sampleToCluster","findSampleClusters","assignedPointsByCluster","pointIdx","fillCorrectIndexes","assignedPoints","linkageFn","distances","j","index","setDistance","i1","i2","clusters","_","iteration","nearestDistance","nearest1","nearest2","clusterIdx1","clusterIdx2","newCluster","rootCluster"],"mappings":"yBAGA,MAAMA,EAAM,sBAEG,SAASC,EAAIC,EAAO,KAAK,SAAU,CAChD,IAAIC,GAAS,GAAKD,GAAQA,EAAO,EAAIA,EAAOF,EAAM,KAAK,IAAIE,CAAI,GAAK,EACpE,MAAO,KAAOC,EAAQ,QAAMA,EAAQ,WAAM,EAAGH,GAAOG,IAAU,GAChE,CCRA;AAAA;AAAA;AAAA;AAAA,GAiBa,MAAAC,EAAc,OAAO,eAAe,EACpCC,EAAiB,OAAO,kBAAkB,EAC1CC,EAAe,OAAO,sBAAsB,EAC5CC,EAAY,OAAO,mBAAmB,EAE7CC,EAAc,OAAO,gBAAgB,EAuJrCC,EAAYC,GACf,OAAOA,GAAQ,UAAYA,IAAQ,MAAS,OAAOA,GAAQ,WAkCxDC,EAA6D,CACjE,UAAYD,GACVD,EAASC,CAAG,GAAMA,EAAoBN,CAAW,EACnD,UAAUQ,EAAG,CACX,KAAM,CAAE,MAAAC,EAAO,MAAAC,CAAK,EAAK,IAAI,eAC7B,OAAAC,EAAOH,EAAKC,CAAK,EACV,CAACC,EAAO,CAACA,CAAK,CAAC,CACvB,EACD,YAAYE,EAAI,CACd,OAAAA,EAAK,MAAK,EACHC,EAAKD,CAAI,CACjB,GAkBGE,EAGF,CACF,UAAYC,GACVV,EAASU,CAAK,GAAKX,KAAeW,EACpC,UAAU,CAAE,MAAAA,GAAO,CACjB,IAAIC,EACJ,OAAID,aAAiB,MACnBC,EAAa,CACX,QAAS,GACT,MAAO,CACL,QAASD,EAAM,QACf,KAAMA,EAAM,KACZ,MAAOA,EAAM,KACd,GAGHC,EAAa,CAAE,QAAS,GAAO,MAAAD,CAAK,EAE/B,CAACC,EAAY,EAAE,CACvB,EACD,YAAYA,EAAU,CACpB,MAAIA,EAAW,QACP,OAAO,OACX,IAAI,MAAMA,EAAW,MAAM,OAAO,EAClCA,EAAW,KAAK,EAGdA,EAAW,KAClB,GAMUC,EAAmB,IAAI,IAGlC,CACA,CAAC,QAASV,CAAoB,EAC9B,CAAC,QAASO,CAAoB,CAC/B,CAAA,EAED,SAASI,EACPC,EACAC,EAAc,CAEd,UAAWC,KAAiBF,EAI1B,GAHIC,IAAWC,GAAiBA,IAAkB,KAG9CA,aAAyB,QAAUA,EAAc,KAAKD,CAAM,EAC9D,MAAO,GAGX,MAAO,EACT,CAEM,SAAUT,EACdH,EACAc,EAAe,WACfH,EAAsC,CAAC,GAAG,EAAC,CAE3CG,EAAG,iBAAiB,UAAW,SAASC,EAASC,EAAgB,CAC/D,GAAI,CAACA,GAAM,CAACA,EAAG,KACb,OAEF,GAAI,CAACN,EAAgBC,EAAgBK,EAAG,MAAM,EAAG,CAC/C,QAAQ,KAAK,mBAAmBA,EAAG,MAAM,qBAAqB,EAC9D,MACD,CACD,KAAM,CAAE,GAAAC,EAAI,KAAAC,EAAM,KAAAC,CAAI,EAAE,OAAA,OAAA,CACtB,KAAM,CAAA,GACFH,EAAG,IAAgB,EAEnBI,GAAgBJ,EAAG,KAAK,cAAgB,CAAA,GAAI,IAAIK,CAAa,EACnE,IAAIC,EACJ,GAAI,CACF,MAAMC,EAASJ,EAAK,MAAM,EAAG,EAAE,EAAE,OAAO,CAACnB,EAAKwB,IAASxB,EAAIwB,CAAI,EAAGxB,CAAG,EAC/DyB,EAAWN,EAAK,OAAO,CAACnB,EAAKwB,IAASxB,EAAIwB,CAAI,EAAGxB,CAAG,EAC1D,OAAQkB,EAAI,CACV,IAAA,MAEII,EAAcG,EAEhB,MACF,IAAA,MAEIF,EAAOJ,EAAK,MAAM,EAAE,EAAE,CAAC,CAAC,EAAIE,EAAcL,EAAG,KAAK,KAAK,EACvDM,EAAc,GAEhB,MACF,IAAA,QAEIA,EAAcG,EAAS,MAAMF,EAAQH,CAAY,EAEnD,MACF,IAAA,YACE,CACE,MAAMb,EAAQ,IAAIkB,EAAS,GAAGL,CAAY,EAC1CE,EAAcI,GAAMnB,CAAK,CAC1B,CACD,MACF,IAAA,WACE,CACE,KAAM,CAAE,MAAAN,EAAO,MAAAC,CAAK,EAAK,IAAI,eAC7BC,EAAOH,EAAKE,CAAK,EACjBoB,EAAcK,GAAS1B,EAAO,CAACA,CAAK,CAAC,CACtC,CACD,MACF,IAAA,UAEIqB,EAAc,OAEhB,MACF,QACE,MACH,CACF,OAAQf,EAAO,CACde,EAAc,CAAE,MAAAf,EAAO,CAACX,CAAW,EAAG,CAAC,CACxC,CACD,QAAQ,QAAQ0B,CAAW,EACxB,MAAOf,IACC,CAAE,MAAAA,EAAO,CAACX,CAAW,EAAG,CAAC,EACjC,EACA,KAAM0B,GAAe,CACpB,KAAM,CAACM,EAAWC,CAAa,EAAIC,EAAYR,CAAW,EAC1DR,EAAG,YAAiB,OAAA,OAAA,OAAA,OAAA,CAAA,EAAAc,CAAS,EAAA,CAAE,GAAAX,CAAE,CAAA,EAAIY,CAAa,EAC9CX,IAAI,YAENJ,EAAG,oBAAoB,UAAWC,CAAe,EACjDgB,EAAcjB,CAAE,EACZnB,KAAaK,GAAO,OAAOA,EAAIL,CAAS,GAAM,YAChDK,EAAIL,CAAS,EAAC,EAGpB,CAAC,EACA,MAAOqC,GAAS,CAEf,KAAM,CAACJ,EAAWC,CAAa,EAAIC,EAAY,CAC7C,MAAO,IAAI,UAAU,6BAA6B,EAClD,CAAClC,CAAW,EAAG,CAChB,CAAA,EACDkB,EAAG,YAAiB,OAAA,OAAA,OAAA,OAAA,CAAA,EAAAc,CAAS,EAAA,CAAE,GAAAX,CAAE,CAAA,EAAIY,CAAa,CACpD,CAAC,CACL,CAAQ,EACJf,EAAG,OACLA,EAAG,MAAK,CAEZ,CAEA,SAASmB,EAAcC,EAAkB,CACvC,OAAOA,EAAS,YAAY,OAAS,aACvC,CAEA,SAASH,EAAcG,EAAkB,CACnCD,EAAcC,CAAQ,GAAGA,EAAS,MAAK,CAC7C,CAEgB,SAAA7B,EAAQS,EAAcqB,EAAY,CAChD,MAAMC,EAAyC,IAAI,IAEnD,OAAAtB,EAAG,iBAAiB,UAAW,SAAuBE,EAAS,CAC7D,KAAM,CAAE,KAAAqB,CAAI,EAAKrB,EACjB,GAAI,CAACqB,GAAQ,CAACA,EAAK,GACjB,OAEF,MAAMC,EAAWF,EAAiB,IAAIC,EAAK,EAAE,EAC7C,GAAKC,EAIL,GAAI,CACFA,EAASD,CAAI,CACd,QAAS,CACRD,EAAiB,OAAOC,EAAK,EAAE,CAChC,CACH,CAAC,EAEME,EAAezB,EAAIsB,EAAkB,CAAA,EAAID,CAAM,CACxD,CAEA,SAASK,EAAqBC,EAAmB,CAC/C,GAAIA,EACF,MAAM,IAAI,MAAM,4CAA4C,CAEhE,CAEA,SAASC,EAAgB5B,EAAY,CACnC,OAAO6B,EAAuB7B,EAAI,IAAI,IAAO,CAC3C,KAAyB,SAC1B,CAAA,EAAE,KAAK,IAAK,CACXiB,EAAcjB,CAAE,CAClB,CAAC,CACH,CAaA,MAAM8B,EAAe,IAAI,QACnBC,EACJ,yBAA0B,YAC1B,IAAI,qBAAsB/B,GAAgB,CACxC,MAAMgC,GAAYF,EAAa,IAAI9B,CAAE,GAAK,GAAK,EAC/C8B,EAAa,IAAI9B,EAAIgC,CAAQ,EACzBA,IAAa,GACfJ,EAAgB5B,CAAE,CAEtB,CAAC,EAEH,SAASiC,EAAcrB,EAAeZ,EAAY,CAChD,MAAMgC,GAAYF,EAAa,IAAI9B,CAAE,GAAK,GAAK,EAC/C8B,EAAa,IAAI9B,EAAIgC,CAAQ,EACzBD,GACFA,EAAgB,SAASnB,EAAOZ,EAAIY,CAAK,CAE7C,CAEA,SAASsB,EAAgBtB,EAAa,CAChCmB,GACFA,EAAgB,WAAWnB,CAAK,CAEpC,CAEA,SAASa,EACPzB,EACAsB,EACAjB,EAAqC,CAAA,EACrCgB,EAAiB,UAAA,GAAc,CAE/B,IAAIc,EAAkB,GACtB,MAAMvB,EAAQ,IAAI,MAAMS,EAAQ,CAC9B,IAAIe,EAAS1B,EAAI,CAEf,GADAgB,EAAqBS,CAAe,EAChCzB,IAAS9B,EACX,MAAO,IAAK,CACVsD,EAAgBtB,CAAK,EACrBgB,EAAgB5B,CAAE,EAClBsB,EAAiB,MAAK,EACtBa,EAAkB,EACpB,EAEF,GAAIzB,IAAS,OAAQ,CACnB,GAAIL,EAAK,SAAW,EAClB,MAAO,CAAE,KAAM,IAAMO,CAAK,EAE5B,MAAMyB,EAAIR,EAAuB7B,EAAIsB,EAAkB,CACrD,KAAqB,MACrB,KAAMjB,EAAK,IAAKiC,GAAMA,EAAE,UAAU,CACnC,CAAA,EAAE,KAAK/B,CAAa,EACrB,OAAO8B,EAAE,KAAK,KAAKA,CAAC,CACrB,CACD,OAAOZ,EAAYzB,EAAIsB,EAAkB,CAAC,GAAGjB,EAAMK,CAAI,CAAC,CACzD,EACD,IAAI0B,EAAS1B,EAAMC,EAAQ,CACzBe,EAAqBS,CAAe,EAGpC,KAAM,CAAC1C,EAAOsB,CAAa,EAAIC,EAAYL,CAAQ,EACnD,OAAOkB,EACL7B,EACAsB,EACA,CACE,KAAqB,MACrB,KAAM,CAAC,GAAGjB,EAAMK,CAAI,EAAE,IAAK4B,GAAMA,EAAE,UAAU,EAC7C,MAAA7C,CACD,EACDsB,CAAa,EACb,KAAKR,CAAa,CACrB,EACD,MAAM6B,EAASG,EAAUC,EAAe,CACtCd,EAAqBS,CAAe,EACpC,MAAMM,EAAOpC,EAAKA,EAAK,OAAS,CAAC,EACjC,GAAKoC,IAAiB9D,EACpB,OAAOkD,EAAuB7B,EAAIsB,EAAkB,CAClD,KAA0B,UAC3B,CAAA,EAAE,KAAKf,CAAa,EAGvB,GAAIkC,IAAS,OACX,OAAOhB,EAAYzB,EAAIsB,EAAkBjB,EAAK,MAAM,EAAG,EAAE,CAAC,EAE5D,KAAM,CAACC,EAAcS,CAAa,EAAI2B,EAAiBF,CAAe,EACtE,OAAOX,EACL7B,EACAsB,EACA,CACE,KAAuB,QACvB,KAAMjB,EAAK,IAAKiC,GAAMA,EAAE,UAAU,EAClC,aAAAhC,CACD,EACDS,CAAa,EACb,KAAKR,CAAa,CACrB,EACD,UAAU6B,EAASI,EAAe,CAChCd,EAAqBS,CAAe,EACpC,KAAM,CAAC7B,EAAcS,CAAa,EAAI2B,EAAiBF,CAAe,EACtE,OAAOX,EACL7B,EACAsB,EACA,CACE,KAA2B,YAC3B,KAAMjB,EAAK,IAAKiC,GAAMA,EAAE,UAAU,EAClC,aAAAhC,CACD,EACDS,CAAa,EACb,KAAKR,CAAa,CACrB,CACF,CAAA,EACD,OAAA0B,EAAcrB,EAAOZ,CAAE,EAChBY,CACT,CAEA,SAAS+B,EAAUC,EAAgB,CACjC,OAAO,MAAM,UAAU,OAAO,MAAM,CAAA,EAAIA,CAAG,CAC7C,CAEA,SAASF,EAAiBpC,EAAmB,CAC3C,MAAMuC,EAAYvC,EAAa,IAAIU,CAAW,EAC9C,MAAO,CAAC6B,EAAU,IAAKC,GAAMA,EAAE,CAAC,CAAC,EAAGH,EAAOE,EAAU,IAAKC,GAAMA,EAAE,CAAC,CAAC,CAAC,CAAC,CACxE,CAEA,MAAMC,EAAgB,IAAI,QACV,SAAAlC,GAAY3B,EAAQ8D,EAAyB,CAC3D,OAAAD,EAAc,IAAI7D,EAAK8D,CAAS,EACzB9D,CACT,CAEM,SAAU0B,GAAoB1B,EAAM,CACxC,OAAO,OAAO,OAAOA,EAAK,CAAE,CAACR,CAAW,EAAG,GAAM,CACnD,CAeA,SAASsC,EAAYvB,EAAU,CAC7B,SAAW,CAACwD,EAAMC,CAAO,IAAKvD,EAC5B,GAAIuD,EAAQ,UAAUzD,CAAK,EAAG,CAC5B,KAAM,CAAC0D,EAAiBpC,CAAa,EAAImC,EAAQ,UAAUzD,CAAK,EAChE,MAAO,CACL,CACE,KAA2B,UAC3B,KAAAwD,EACA,MAAOE,CACR,EACDpC,EAEH,CAEH,MAAO,CACL,CACE,KAAuB,MACvB,MAAAtB,CACD,EACDsD,EAAc,IAAItD,CAAK,GAAK,CAAA,EAEhC,CAEA,SAASc,EAAcd,EAAgB,CACrC,OAAQA,EAAM,KAAI,CAChB,IAAA,UACE,OAAOE,EAAiB,IAAIF,EAAM,IAAI,EAAG,YAAYA,EAAM,KAAK,EAClE,IAAA,MACE,OAAOA,EAAM,KAChB,CACH,CAEA,SAASoC,EACP7B,EACAsB,EACA8B,EACAJ,EAA0B,CAE1B,OAAO,IAAI,QAASK,GAAW,CAC7B,MAAMlD,EAAKmD,GAAY,EACvBhC,EAAiB,IAAInB,EAAIkD,CAAO,EAC5BrD,EAAG,OACLA,EAAG,MAAK,EAEVA,EAAG,YAAc,OAAA,OAAA,CAAA,GAAAG,GAAOiD,CAAG,EAAIJ,CAAS,CAC5C,CAAC,CACD,CAEA,SAASM,IAAY,CACnB,OAAO,IAAI,MAAM,CAAC,EACf,KAAK,CAAC,EACN,IAAI,IAAM,KAAK,MAAM,KAAK,SAAW,OAAO,gBAAgB,EAAE,SAAS,EAAE,CAAC,EAC1E,KAAK,GAAG,CACb,CCrnBO,SAASC,EAAiBjB,EAAakB,EAAa,CACvD,IAAIC,EAAI,EAER,QAAS,EAAI,EAAG,EAAInB,EAAE,OAAQ,IAC1BmB,IAAMnB,EAAE,CAAC,EAAIkB,EAAE,CAAC,IAAMlB,EAAE,CAAC,EAAIkB,EAAE,CAAC,GAEpC,OAAOC,CACX,CAUO,SAASC,EAAUpB,EAAakB,EAAa,CAChD,OAAO,KAAK,KAAKD,EAAiBjB,EAAGkB,CAAC,CAAC,CAC3C,CAaO,MAAMG,EAAiB,CAACC,EAAgBC,EAAgBC,IAAkD,CAC7G,IAAIC,EAAW,EAEf,UAAW,KAAKH,EACZ,UAAWI,KAAKH,EAAME,GAAYD,EAAY,EAAGE,CAAC,EAItD,OAAOD,EAAWH,EAAK,OAASC,EAAK,MACzC,EAYaI,GAAkB,CAACL,EAAgBC,EAAgBC,IAAkD,CAC9G,IAAIC,EAAW,EAEf,UAAW,KAAKH,EACZ,UAAWI,KAAKH,EAAME,EAAW,KAAK,IAAIA,EAAUD,EAAY,EAAGE,CAAC,CAAC,EAGzE,OAAOD,CACX,EAYaG,GAAgB,CAACN,EAAgBC,EAAgBC,IAAkD,CAC5G,IAAIC,EAAW,IAEf,UAAW,KAAKH,EACZ,UAAWI,KAAKH,EAAME,EAAW,KAAK,IAAIA,EAAUD,EAAY,EAAGE,CAAC,CAAC,EAGzE,OAAOD,CACX,EASA,SAASI,GAAaC,EAA4B,CAC9C,OAAQA,EAAA,CACJ,IAAK,UAAW,OAAOT,EACvB,IAAK,WAAY,OAAOM,GACxB,IAAK,SAAU,OAAOC,GACtB,QAAS,OAAOP,CAAA,CAExB,CAOA,SAASU,EAAcN,EAA8B,CACjD,OAAQA,EAAA,CACJ,IAAK,YAAa,OAAOL,EACzB,IAAK,mBAAoB,OAAOH,EAChC,QAAS,OAAOG,CAAA,CAExB,CAWO,SAASY,EAAsBC,EAA4B,CAC9D,MAAMC,EAA2B,CAAA,EAE3BC,EAAYC,GAAe,CAC7B,GAAIA,EAAE,SAAS,SAAW,EAEtBF,EAAe,KAAK,GAAGE,EAAE,OAAO,MAGhC,WAAWC,KAASD,EAAE,SAClBD,EAASE,CAAK,CAG1B,EAEA,OAAAF,EAASF,CAAO,EACTC,CACX,CAEA,MAAMI,EAAmB,IAGlB,SAASC,GACZC,EACAC,EAAmC,YACnCC,EAAiC,UAC1B,CACP,GAAIF,EAAW,QAAUF,EACrB,OAAOK,EAAYH,EAAYC,EAAcC,CAAW,EAG5D,MAAME,EAAIJ,EAAW,OACfK,EAAYC,EAAU,CAAC,EAEvBC,MAAoB,IAC1B,KAAOA,EAAc,KAAOT,GACxBS,EAAc,IAAI,KAAK,MAAMF,EAAA,EAAcD,CAAC,CAAC,EAGjD,MAAMI,EAAqB,MAAM,KAAKD,CAAa,EAC7CE,EAAeD,EAAmB,IAAIE,GAAKV,EAAWU,CAAC,CAAC,EAGxDC,EAAgBR,EAAYM,EAAcR,EAAcC,CAAW,EAGzE,OAAOU,GAAsBD,EAAeX,EAAYQ,EAAoBP,CAAY,CAC5F,CAGA,SAASW,GACLD,EACAX,EACAO,EACAN,EACO,CAGP,MAAMY,EAAatB,EAAcU,CAAY,EACvCa,EAAY,IAAI,IAAIP,CAAa,EAGjCQ,MAAkB,IACxB,QAASL,EAAI,EAAGA,EAAIV,EAAW,OAAQU,IAAK,CACxC,GAAII,EAAU,IAAIJ,CAAC,EAAG,SAEtB,IAAIM,EAAc,IACdC,EAAgB,GAEpB,UAAWC,KAAaX,EAAe,CACnC,MAAMtB,EAAW4B,EAAWb,EAAWU,CAAC,EAAGV,EAAWkB,CAAS,CAAC,EAC5DjC,EAAW+B,IACXA,EAAc/B,EACdgC,EAAgBC,EAExB,CAEAH,EAAY,IAAIL,EAAGO,CAAa,CACpC,CAEA,OAAOE,GAA2BR,EAAeI,EAAaR,CAAa,CAC/E,CAGA,SAASY,GACLR,EACAI,EACAR,EACO,CAEP,MAAMa,MAAsB,IACtBC,EAAsB5B,GAAqB,CACzCA,EAAQ,QAAQ,SAAW,GAC3B2B,EAAgB,IAAIb,EAAcd,EAAQ,QAAQ,CAAC,CAAC,EAAGA,CAAO,EAElE,UAAWI,KAASJ,EAAQ,SACxB4B,EAAmBxB,CAAK,CAEhC,EACAwB,EAAmBV,CAAa,EAGhC,MAAMW,MAA8B,IACpC,SAAW,CAACC,EAAUL,CAAS,IAAKH,EAAa,CAC7C,MAAMJ,EAAgBS,EAAgB,IAAIF,CAAS,EACnD,GAAIP,EAAe,CACVW,EAAwB,IAAIX,CAAa,GAC1CW,EAAwB,IAAIX,EAAe,EAAE,EAEjD,MAAMlB,EAAU6B,EAAwB,IAAIX,CAAa,EACrDlB,GACAA,EAAQ,KAAK8B,CAAQ,CAE7B,CACJ,CAEA,MAAMC,EAAsB,GAAe,CACvC,EAAE,QAAU,EAAE,QAAQ,IAAId,GAAKH,EAAcG,CAAC,CAAC,EAC/C,UAAWb,KAAS,EAAE,SAClB2B,EAAmB3B,CAAK,CAEhC,EACA2B,EAAmBb,CAAa,EAChC,SAAW,CAAClB,EAASgC,CAAc,IAAKH,EACpC7B,EAAQ,QAAU,CAAC,GAAGA,EAAQ,QAAS,GAAGgC,CAAc,EAG5D,MAAO,CACH,GAAGd,EACH,QAASnB,EAAsBmB,CAAa,CAAA,CAEpD,CA2BO,SAASR,EAAYH,EAAwBC,EAAmC,YAAaC,EAAiC,UAAoB,CACrJ,MAAMW,EAAatB,EAAcU,CAAY,EACvCyB,EAAYrC,GAAaa,CAAW,EAEpCE,EAAIJ,EAAW,OAKf2B,EAAsB,CAAA,EAItB3C,EAAc,CAAC0B,EAAWkB,IAAsB,CAClD,GAAIlB,IAAMkB,EAAG,MAAO,GAChBlB,EAAIkB,IAAG,CAAClB,EAAGkB,CAAC,EAAI,CAACA,EAAGlB,CAAC,GACzB,MAAMmB,EAAQnB,EAAIN,EAAKM,GAAKA,EAAI,GAAM,GAAKkB,EAAIlB,EAAI,GACnD,OAAOiB,EAAUE,CAAK,CAC1B,EAGMC,EAAc,CAACpB,EAAWkB,EAAWjH,IAAwB,CAC3D+F,EAAIkB,IAAG,CAAClB,EAAGkB,CAAC,EAAI,CAACA,EAAGlB,CAAC,GACzB,MAAMmB,EAAQnB,EAAIN,EAAKM,GAAKA,EAAI,GAAM,GAAKkB,EAAIlB,EAAI,GACnDiB,EAAUE,CAAK,EAAIlH,CACvB,EAIA,QAASoH,EAAK,EAAGA,EAAK3B,EAAG2B,IACrB,QAASC,EAAKD,EAAK,EAAGC,EAAK5B,EAAG4B,IAAM,CAChC,MAAMhE,EAAI6C,EAAWb,EAAW+B,CAAE,EAAG/B,EAAWgC,CAAE,CAAC,EACnDF,EAAYC,EAAIC,EAAIhE,CAAC,CACzB,CAKJ,MAAMiE,EAAsBjC,EAAW,IAAI,CAACkC,EAAGL,KAAW,CACtD,OAAQ,EACR,QAAS,CAACA,CAAK,EACf,SAAU,CAAA,CAAC,EACb,EAIF,QAASM,EAAY,EAAGA,EAAY/B,GAE5B,EAAA+B,GAAa/B,EAAI,GAFc+B,IAAa,CAKhD,IAAIC,EAAkB,IAClBC,EAAW,EACXC,EAAW,EAGf,QAASC,EAAc,EAAGA,EAAcN,EAAS,OAAQM,IACrD,QAASC,EAAcD,EAAc,EAAGC,EAAcP,EAAS,OAAQO,IAAe,CAElF,MAAMvD,EAAWyC,EAAUO,EAASM,CAAW,EAAE,QAASN,EAASO,CAAW,EAAE,QAASxD,CAAW,EAGhGC,EAAWmD,IACXA,EAAkBnD,EAClBoD,EAAWE,EACXD,EAAWE,EAEnB,CAKJ,MAAMC,GAAa,CACf,QAAS,CAAC,GAAGR,EAASI,CAAQ,EAAE,QAAS,GAAGJ,EAASK,CAAQ,EAAE,OAAO,EACtE,OAAQF,EACR,SAAU,CAACH,EAASI,CAAQ,EAAGJ,EAASK,CAAQ,CAAC,CAAA,EAMrDL,EAAS,OAAO,KAAK,IAAII,EAAUC,CAAQ,EAAG,CAAC,EAC/CL,EAAS,OAAO,KAAK,IAAII,EAAUC,CAAQ,EAAG,CAAC,EAC/CL,EAAS,KAAKQ,EAAU,CAC5B,CAIA,MAAMC,EAAcT,EAAS,CAAC,EAC9B,MAAO,CACH,GAAGS,EACH,QAASlD,EAAsBkD,CAAW,CAAA,CAElD,CAEAnI,EAAO,CAAC,uBAAAwF,GAAuB","x_google_ignoreList":[0,1]}
+{"version":3,"file":"getClusters-BScJvejf.js","sources":["../../../node_modules/.pnpm/d3-random@3.0.1/node_modules/d3-random/src/lcg.js","../../../node_modules/.pnpm/comlink@4.4.2/node_modules/comlink/src/comlink.ts","../src/heatmap/getClusters.ts"],"sourcesContent":["// https://en.wikipedia.org/wiki/Linear_congruential_generator#Parameters_in_common_use\nconst mul = 0x19660D;\nconst inc = 0x3C6EF35F;\nconst eps = 1 / 0x100000000;\n\nexport default function lcg(seed = Math.random()) {\n  let state = (0 <= seed && seed < 1 ? seed / eps : Math.abs(seed)) | 0;\n  return () => (state = mul * state + inc | 0, eps * (state >>> 0));\n}\n",null,"import type { Cluster } from './components/types';\nimport type { DendrogramDistance, DendrogramLinkage } from '../types';\nimport { randomLcg } from 'd3-random';\nimport { expose } from 'comlink';\n\n/* DISTANCE FUNCTIONS - Calculate similarity between two data points */\n\n/**\n * Calculate squared Euclidean distance between two vectors\n * This is faster than regular Euclidean distance since it avoids the square root\n * Formula: Σ(p[i] - q[i])²\n * @param p First vector\n * @param q Second vector\n * @returns Squared distance (always positive)\n */\nexport function squaredEuclidean(p: number[], q: number[]) {\n    let d = 0;\n    // Sum the squared differences for each dimension\n    for (let i = 0; i < p.length; i++) {\n        d += (p[i] - q[i]) * (p[i] - q[i]);\n    }\n    return d;\n}\n\n/**\n * Calculate Euclidean distance between two vectors\n * This is the standard geometric distance in n-dimensional space\n * Formula: √(Σ(p[i] - q[i])²)\n * @param p First vector\n * @param q Second vector\n * @returns Euclidean distance\n */\nexport function euclidean(p: number[], q: number[]) {\n    return Math.sqrt(squaredEuclidean(p, q));\n}\n\n/* LINKAGE FUNCTIONS - Define how to measure distance between two clusters */\n\n/**\n * Average Linkage\n * Calculates the average distance between all pairs of points in the two clusters\n * This is the most commonly used linkage method as it balances between single and complete linkage\n * @param setA Indexes of points in first cluster\n * @param setB Indexes of points in second cluster  \n * @param getDistance Function to get distance between two point indexes\n * @returns Average distance between clusters\n */\nexport const averageLinkage = (setA: number[], setB: number[], getDistance: (i: number, j: number) => number) => {\n    let distance = 0;\n    // Sum all pairwise distances between clusters\n    for (const a of setA) {\n        for (const b of setB) distance += getDistance(a, b);\n    }\n\n    // Return average distance\n    return distance / setA.length / setB.length;\n};\n\n/**\n * Complete Linkage (Maximum Linkage)\n * Uses the maximum distance between any pair of points in the two clusters\n * Tends to create compact, well-separated clusters\n * Formula: max{d(a,b)} for all a in A, b in B\n * @param setA Indexes of points in first cluster\n * @param setB Indexes of points in second cluster\n * @param getDistance Function to get distance between two point indexes\n * @returns Maximum distance between clusters\n */\nexport const completeLinkage = (setA: number[], setB: number[], getDistance: (i: number, j: number) => number) => {\n    let distance = 0;\n    // Find maximum distance between any pair of points\n    for (const a of setA) {\n        for (const b of setB) distance = Math.max(distance, getDistance(a, b));\n    }\n\n    return distance;\n};\n\n/**\n * Single Linkage (Minimum Linkage)\n * Uses the minimum distance between any pair of points in the two clusters\n * Tends to create elongated, chain-like clusters\n * Formula: min{d(a,b)} for all a in A, b in B\n * @param setA Indexes of points in first cluster\n * @param setB Indexes of points in second cluster\n * @param getDistance Function to get distance between two point indexes\n * @returns Minimum distance between clusters\n */\nexport const singleLinkage = (setA: number[], setB: number[], getDistance: (i: number, j: number) => number) => {\n    let distance = Infinity;\n    // Find minimum distance between any pair of points\n    for (const a of setA) {\n        for (const b of setB) distance = Math.min(distance, getDistance(a, b));\n    }\n\n    return distance;\n};\n\n/* HELPER FUNCTIONS - Factory functions for distance and linkage methods */\n\n/**\n * Get the appropriate linkage function based on the linkage type\n * @param linkage Type of linkage method to use\n * @returns Function that calculates distance between two clusters\n */\nfunction getLinkageFn(linkage: DendrogramLinkage) {\n    switch (linkage) {\n        case 'average': return averageLinkage;\n        case 'complete': return completeLinkage;\n        case 'single': return singleLinkage;\n        default: return averageLinkage; // Default to average linkage\n    }\n}\n\n/**\n * Get the appropriate distance function based on the distance type\n * @param distance Type of distance metric to use\n * @returns Function that calculates distance between two points\n */\nfunction getDistanceFn(distance: DendrogramDistance) {\n    switch (distance) {\n        case 'euclidean': return euclidean;\n        case 'squaredEuclidean': return squaredEuclidean;\n        default: return euclidean; // Default to euclidean distance\n    }\n}\n\n/* UTILITY FUNCTIONS - Helper functions for cluster manipulation and sorting */\n\n/**\n * Extract indexes from a cluster hierarchy in the correct hierarchical order\n * This function traverses the cluster tree and collects all indexes in the order\n * they appear in the dendrogram (left-to-right traversal)\n * @param cluster The root cluster to extract indexes from\n * @returns Array of indexes in hierarchical order\n */\nexport function extractOrderedIndexes(cluster: Cluster): number[] {\n    const orderedIndexes: number[] = [];\n    \n    const traverse = (c: Cluster) => {\n        if (c.children.length === 0) {\n            // Leaf node - add all indexes from this cluster\n            orderedIndexes.push(...c.indexes);\n        } else {\n            // Internal node - traverse children in order (left to right)\n            for (const child of c.children) {\n                traverse(child);\n            }\n        }\n    };\n    \n    traverse(cluster);\n    return orderedIndexes;\n}\n\nconst MAX_CLUSTER_SIZE = 2000;\n\n// Approximate clustering using sampling for very large datasets\nexport function getClustersApproximate(\n    dataValues: number[][], \n    distanceType: DendrogramDistance = 'euclidean', \n    linkageType: DendrogramLinkage = 'average',\n): Cluster {    \n    if (dataValues.length <= MAX_CLUSTER_SIZE) {\n        return getClusters(dataValues, distanceType, linkageType);\n    }\n    \n    const N = dataValues.length;\n    const getRandom = randomLcg(1);\n    // Step 1: Random sampling\n    const sampleIndices = new Set<number>();\n    while (sampleIndices.size < MAX_CLUSTER_SIZE) {\n        sampleIndices.add(Math.floor(getRandom() * N));\n    }\n    \n    const sampleIndicesArray = Array.from(sampleIndices);\n    const sampleValues = sampleIndicesArray.map(i => dataValues[i]);\n    \n    // Step 2: Cluster the sample\n    const sampleCluster = getClusters(sampleValues, distanceType, linkageType);\n    \n    // Step 3: Assign remaining points to nearest cluster\n    return assignRemainingPoints(sampleCluster, dataValues, sampleIndicesArray, distanceType);\n}\n\n// Assign remaining points to the nearest cluster from the sample\nfunction assignRemainingPoints(\n    sampleCluster: Cluster, \n    dataValues: number[][], \n    sampleIndices: number[],\n    distanceType: DendrogramDistance\n): Cluster {\n    // console.log('assignRemainingPoints');\n\n    const distanceFn = getDistanceFn(distanceType);\n    const sampleSet = new Set(sampleIndices);\n    \n    // Assign each non-sample point to nearest sample point\n    const assignments = new Map<number, number>(); // point -> sample point\n    for (let i = 0; i < dataValues.length; i++) {\n        if (sampleSet.has(i)) continue;\n        \n        let minDistance = Infinity;\n        let nearestSample = -1;\n        \n        for (const sampleIdx of sampleIndices) {\n            const distance = distanceFn(dataValues[i], dataValues[sampleIdx]);\n            if (distance < minDistance) {\n                minDistance = distance;\n                nearestSample = sampleIdx;\n            }\n        }\n        \n        assignments.set(i, nearestSample);\n    }\n    // Reconstruct cluster with all points\n    return reconstructWithAssignments(sampleCluster, assignments, sampleIndices);\n}\n\n// Reconstruct cluster hierarchy with assigned points\nfunction reconstructWithAssignments(\n    sampleCluster: Cluster, \n    assignments: Map<number, number>, \n    sampleIndices: number[]\n): Cluster {\n    // Create a map of sample indices to their clusters\n    const sampleToCluster = new Map<number, Cluster>();\n    const findSampleClusters = (cluster: Cluster) => {\n        if (cluster.indexes.length === 1) {\n            sampleToCluster.set(sampleIndices[cluster.indexes[0]], cluster);\n        }\n        for (const child of cluster.children) {\n            findSampleClusters(child);\n        }\n    };\n    findSampleClusters(sampleCluster);\n    \n    // Group assigned points by their sample cluster\n    const assignedPointsByCluster = new Map<Cluster, number[]>();\n    for (const [pointIdx, sampleIdx] of assignments) {\n        const sampleCluster = sampleToCluster.get(sampleIdx);\n        if (sampleCluster) {\n            if (!assignedPointsByCluster.has(sampleCluster)) {\n                assignedPointsByCluster.set(sampleCluster, []);\n            }\n            const cluster = assignedPointsByCluster.get(sampleCluster);\n            if (cluster) {\n                cluster.push(pointIdx);\n            }\n        }\n    }\n\n    const fillCorrectIndexes = (c: Cluster) => {\n        c.indexes = c.indexes.map(i => sampleIndices[i]);\n        for (const child of c.children) {\n            fillCorrectIndexes(child);\n        }\n    };\n    fillCorrectIndexes(sampleCluster);\n    for (const [cluster, assignedPoints] of assignedPointsByCluster) {\n        cluster.indexes = [...cluster.indexes, ...assignedPoints];\n    }\n    \n    return {\n        ...sampleCluster,\n        indexes: extractOrderedIndexes(sampleCluster)\n    };\n}\n\n/* MAIN HIERARCHICAL CLUSTERING FUNCTION - Standard agglomerative clustering */\n\n/**\n * Main hierarchical clustering function using agglomerative approach\n * \n * This implements the standard agglomerative hierarchical clustering algorithm:\n * 1. Start with each point as its own cluster\n * 2. Compute pairwise distances between all points\n * 3. Iteratively merge the two closest clusters\n * 4. Continue until only one cluster remains\n * \n * Algorithm complexity:\n * - Time: O(n³) - for each of n-1 iterations, scan all n² cluster pairs\n * - Space: O(n²) - store upper triangular distance matrix\n * \n * Memory optimization:\n * - Uses upper triangular matrix storage (50% memory reduction)\n * - Only stores distances where i < j since distance matrix is symmetric\n * \n * @param dataKeys Labels for each data point\n * @param dataValues Feature vectors for each data point (n×d matrix)\n * @param distanceType Distance metric to use between points\n * @param linkageType Linkage method to use between clusters\n * @returns Root cluster containing the complete hierarchy\n */\nexport function getClusters(dataValues: number[][], distanceType: DendrogramDistance = 'euclidean', linkageType: DendrogramLinkage = 'average'): Cluster {\n    const distanceFn = getDistanceFn(distanceType);\n    const linkageFn = getLinkageFn(linkageType);\n    \n    const N = dataValues.length;\n    \n    // STEP 1: Precompute pairwise distances using upper triangular matrix\n    // This reduces memory usage from O(n²) to O(n²/2) by only storing upper triangle\n    // Since distance matrix is symmetric: d(i,j) = d(j,i)\n    const distances: number[] = [];\n    \n    // Helper function to access distances in upper triangular matrix\n    // Maps 2D coordinates (i,j) to 1D array index\n    const getDistance = (i: number, j: number): number => {\n        if (i === j) return 0; // Distance to self is always 0\n        if (i > j) [i, j] = [j, i]; // Swap to ensure i < j (upper triangular)\n        const index = i * N - (i * (i + 1)) / 2 + (j - i - 1);\n        return distances[index];\n    };\n    \n    // Helper function to set distances in upper triangular matrix\n    const setDistance = (i: number, j: number, value: number): void => {\n        if (i > j) [i, j] = [j, i]; // Swap to ensure i < j (upper triangular)\n        const index = i * N - (i * (i + 1)) / 2 + (j - i - 1);\n        distances[index] = value;\n    };\n    \n    // Calculate all pairwise distances (only upper triangular)\n    // This is the most expensive step: O(n²) distance calculations\n    for (let i1 = 0; i1 < N; i1++) {\n        for (let i2 = i1 + 1; i2 < N; i2++) {\n            const v = distanceFn(dataValues[i1], dataValues[i2]);\n            setDistance(i1, i2, v);\n        }   \n    }\n\n    // STEP 2: Initialize clusters - each point starts as its own cluster\n    // This creates the leaf nodes of the dendrogram\n    const clusters: Cluster[] = dataValues.map((_, index) => ({\n        height: 0, // Height 0 for leaf nodes\n        indexes: [index], // Single index per cluster initially\n        children: [] // No children for leaf nodes\n    }));\n\n    // STEP 3: Agglomerative clustering - merge clusters iteratively\n    // This is the main clustering loop that builds the hierarchy\n    for (let iteration = 0; iteration < N; iteration++) {\n        // Stop when only one cluster remains (root of dendrogram)\n        if (iteration >= N - 1) break;\n\n        // Find the two closest clusters using the selected linkage method\n        let nearestDistance = Infinity;\n        let nearest1 = 0;\n        let nearest2 = 0;\n\n        // Check all pairs of clusters (upper triangular to avoid duplicates)\n        for (let clusterIdx1 = 0; clusterIdx1 < clusters.length; clusterIdx1++) {\n            for (let clusterIdx2 = clusterIdx1 + 1; clusterIdx2 < clusters.length; clusterIdx2++) {\n                // Calculate distance between clusters using linkage method\n                const distance = linkageFn(clusters[clusterIdx1].indexes, clusters[clusterIdx2].indexes, getDistance);\n                \n                // Keep track of the closest pair\n                if (distance < nearestDistance) {\n                    nearestDistance = distance;\n                    nearest1 = clusterIdx1;\n                    nearest2 = clusterIdx2;\n                }\n            }\n        }\n\n        // STEP 4: Merge the two closest clusters\n        // Create a new cluster that combines the two closest clusters\n        const newCluster = {\n            indexes: [...clusters[nearest1].indexes, ...clusters[nearest2].indexes], // Combine all indexes\n            height: nearestDistance, // Height is the distance at which clusters were merged\n            children: [clusters[nearest1], clusters[nearest2]], // Store the two merged clusters as children\n        };\n\n        // STEP 5: Update cluster list\n        // Remove the two merged clusters and add the new merged cluster\n        // Remove higher index first to avoid index shifting issues\n        clusters.splice(Math.max(nearest1, nearest2), 1);\n        clusters.splice(Math.min(nearest1, nearest2), 1);\n        clusters.push(newCluster);\n    }\n\n    // STEP 6: Return the root cluster with properly ordered keys and indexes\n    // The root cluster contains the complete hierarchy\n    const rootCluster = clusters[0];\n    return {\n        ...rootCluster,\n        indexes: extractOrderedIndexes(rootCluster) // Ensure indexes are in hierarchical order\n    };\n}\n\nexpose({getClustersApproximate});"],"names":["eps","lcg","seed","state","proxyMarker","createEndpoint","releaseProxy","finalizer","throwMarker","isObject","val","proxyTransferHandler","obj","port1","port2","expose","port","wrap","throwTransferHandler","value","serialized","transferHandlers","isAllowedOrigin","allowedOrigins","origin","allowedOrigin","ep","callback","ev","id","type","path","argumentList","fromWireValue","returnValue","parent","prop","rawValue","proxy","transfer","wireValue","transferables","toWireValue","closeEndPoint","error","isMessagePort","endpoint","target","pendingListeners","data","resolver","createProxy","throwIfProxyReleased","isReleased","releaseEndpoint","requestResponseMessage","proxyCounter","proxyFinalizers","newCount","registerProxy","unregisterProxy","isProxyReleased","_target","r","p","_thisArg","rawArgumentList","last","processArguments","myFlat","arr","processed","v","transferCache","transfers","name","handler","serializedValue","msg","resolve","generateUUID","squaredEuclidean","q","d","euclidean","averageLinkage","setA","setB","getDistance","distance","b","completeLinkage","singleLinkage","getLinkageFn","linkage","getDistanceFn","extractOrderedIndexes","cluster","orderedIndexes","traverse","c","child","MAX_CLUSTER_SIZE","getClustersApproximate","dataValues","distanceType","linkageType","getClusters","N","getRandom","randomLcg","sampleIndices","sampleIndicesArray","sampleValues","i","sampleCluster","assignRemainingPoints","distanceFn","sampleSet","assignments","minDistance","nearestSample","sampleIdx","reconstructWithAssignments","sampleToCluster","findSampleClusters","assignedPointsByCluster","pointIdx","fillCorrectIndexes","assignedPoints","linkageFn","distances","j","index","setDistance","i1","i2","clusters","_","iteration","nearestDistance","nearest1","nearest2","clusterIdx1","clusterIdx2","newCluster","rootCluster"],"mappings":"yBAGA,MAAMA,EAAM,sBAEG,SAASC,EAAIC,EAAO,KAAK,SAAU,CAChD,IAAIC,GAAS,GAAKD,GAAQA,EAAO,EAAIA,EAAOF,EAAM,KAAK,IAAIE,CAAI,GAAK,EACpE,MAAO,KAAOC,EAAQ,QAAMA,EAAQ,WAAM,EAAGH,GAAOG,IAAU,GAChE,CCRA;AAAA;AAAA;AAAA;AAAA,GAiBa,MAAAC,EAAc,OAAO,eAAe,EACpCC,EAAiB,OAAO,kBAAkB,EAC1CC,EAAe,OAAO,sBAAsB,EAC5CC,EAAY,OAAO,mBAAmB,EAE7CC,EAAc,OAAO,gBAAgB,EAuJrCC,EAAYC,GACf,OAAOA,GAAQ,UAAYA,IAAQ,MAAS,OAAOA,GAAQ,WAkCxDC,EAA6D,CACjE,UAAYD,GACVD,EAASC,CAAG,GAAMA,EAAoBN,CAAW,EACnD,UAAUQ,EAAG,CACX,KAAM,CAAE,MAAAC,EAAO,MAAAC,CAAK,EAAK,IAAI,eAC7B,OAAAC,EAAOH,EAAKC,CAAK,EACV,CAACC,EAAO,CAACA,CAAK,CAAC,CACvB,EACD,YAAYE,EAAI,CACd,OAAAA,EAAK,MAAK,EACHC,EAAKD,CAAI,CACjB,GAkBGE,EAGF,CACF,UAAYC,GACVV,EAASU,CAAK,GAAKX,KAAeW,EACpC,UAAU,CAAE,MAAAA,GAAO,CACjB,IAAIC,EACJ,OAAID,aAAiB,MACnBC,EAAa,CACX,QAAS,GACT,MAAO,CACL,QAASD,EAAM,QACf,KAAMA,EAAM,KACZ,MAAOA,EAAM,KACd,GAGHC,EAAa,CAAE,QAAS,GAAO,MAAAD,CAAK,EAE/B,CAACC,EAAY,EAAE,CACvB,EACD,YAAYA,EAAU,CACpB,MAAIA,EAAW,QACP,OAAO,OACX,IAAI,MAAMA,EAAW,MAAM,OAAO,EAClCA,EAAW,KAAK,EAGdA,EAAW,KAClB,GAMUC,EAAmB,IAAI,IAGlC,CACA,CAAC,QAASV,CAAoB,EAC9B,CAAC,QAASO,CAAoB,CAC/B,CAAA,EAED,SAASI,EACPC,EACAC,EAAc,CAEd,UAAWC,KAAiBF,EAI1B,GAHIC,IAAWC,GAAiBA,IAAkB,KAG9CA,aAAyB,QAAUA,EAAc,KAAKD,CAAM,EAC9D,MAAO,GAGX,MAAO,EACT,CAEM,SAAUT,EACdH,EACAc,EAAe,WACfH,EAAsC,CAAC,GAAG,EAAC,CAE3CG,EAAG,iBAAiB,UAAW,SAASC,EAASC,EAAgB,CAC/D,GAAI,CAACA,GAAM,CAACA,EAAG,KACb,OAEF,GAAI,CAACN,EAAgBC,EAAgBK,EAAG,MAAM,EAAG,CAC/C,QAAQ,KAAK,mBAAmBA,EAAG,MAAM,qBAAqB,EAC9D,MACD,CACD,KAAM,CAAE,GAAAC,EAAI,KAAAC,EAAM,KAAAC,CAAI,EAAE,OAAA,OAAA,CACtB,KAAM,CAAA,GACFH,EAAG,IAAgB,EAEnBI,GAAgBJ,EAAG,KAAK,cAAgB,CAAA,GAAI,IAAIK,CAAa,EACnE,IAAIC,EACJ,GAAI,CACF,MAAMC,EAASJ,EAAK,MAAM,EAAG,EAAE,EAAE,OAAO,CAACnB,EAAKwB,IAASxB,EAAIwB,CAAI,EAAGxB,CAAG,EAC/DyB,EAAWN,EAAK,OAAO,CAACnB,EAAKwB,IAASxB,EAAIwB,CAAI,EAAGxB,CAAG,EAC1D,OAAQkB,EAAI,CACV,IAAA,MAEII,EAAcG,EAEhB,MACF,IAAA,MAEIF,EAAOJ,EAAK,MAAM,EAAE,EAAE,CAAC,CAAC,EAAIE,EAAcL,EAAG,KAAK,KAAK,EACvDM,EAAc,GAEhB,MACF,IAAA,QAEIA,EAAcG,EAAS,MAAMF,EAAQH,CAAY,EAEnD,MACF,IAAA,YACE,CACE,MAAMb,EAAQ,IAAIkB,EAAS,GAAGL,CAAY,EAC1CE,EAAcI,GAAMnB,CAAK,CAC1B,CACD,MACF,IAAA,WACE,CACE,KAAM,CAAE,MAAAN,EAAO,MAAAC,CAAK,EAAK,IAAI,eAC7BC,EAAOH,EAAKE,CAAK,EACjBoB,EAAcK,GAAS1B,EAAO,CAACA,CAAK,CAAC,CACtC,CACD,MACF,IAAA,UAEIqB,EAAc,OAEhB,MACF,QACE,MACH,CACF,OAAQf,EAAO,CACde,EAAc,CAAE,MAAAf,EAAO,CAACX,CAAW,EAAG,CAAC,CACxC,CACD,QAAQ,QAAQ0B,CAAW,EACxB,MAAOf,IACC,CAAE,MAAAA,EAAO,CAACX,CAAW,EAAG,CAAC,EACjC,EACA,KAAM0B,GAAe,CACpB,KAAM,CAACM,EAAWC,CAAa,EAAIC,EAAYR,CAAW,EAC1DR,EAAG,YAAiB,OAAA,OAAA,OAAA,OAAA,CAAA,EAAAc,CAAS,EAAA,CAAE,GAAAX,CAAE,CAAA,EAAIY,CAAa,EAC9CX,IAAI,YAENJ,EAAG,oBAAoB,UAAWC,CAAe,EACjDgB,EAAcjB,CAAE,EACZnB,KAAaK,GAAO,OAAOA,EAAIL,CAAS,GAAM,YAChDK,EAAIL,CAAS,EAAC,EAGpB,CAAC,EACA,MAAOqC,GAAS,CAEf,KAAM,CAACJ,EAAWC,CAAa,EAAIC,EAAY,CAC7C,MAAO,IAAI,UAAU,6BAA6B,EAClD,CAAClC,CAAW,EAAG,CAChB,CAAA,EACDkB,EAAG,YAAiB,OAAA,OAAA,OAAA,OAAA,CAAA,EAAAc,CAAS,EAAA,CAAE,GAAAX,CAAE,CAAA,EAAIY,CAAa,CACpD,CAAC,CACL,CAAQ,EACJf,EAAG,OACLA,EAAG,MAAK,CAEZ,CAEA,SAASmB,EAAcC,EAAkB,CACvC,OAAOA,EAAS,YAAY,OAAS,aACvC,CAEA,SAASH,EAAcG,EAAkB,CACnCD,EAAcC,CAAQ,GAAGA,EAAS,MAAK,CAC7C,CAEgB,SAAA7B,EAAQS,EAAcqB,EAAY,CAChD,MAAMC,EAAyC,IAAI,IAEnD,OAAAtB,EAAG,iBAAiB,UAAW,SAAuBE,EAAS,CAC7D,KAAM,CAAE,KAAAqB,CAAI,EAAKrB,EACjB,GAAI,CAACqB,GAAQ,CAACA,EAAK,GACjB,OAEF,MAAMC,EAAWF,EAAiB,IAAIC,EAAK,EAAE,EAC7C,GAAKC,EAIL,GAAI,CACFA,EAASD,CAAI,CACd,QAAS,CACRD,EAAiB,OAAOC,EAAK,EAAE,CAChC,CACH,CAAC,EAEME,EAAezB,EAAIsB,EAAkB,CAAA,EAAID,CAAM,CACxD,CAEA,SAASK,EAAqBC,EAAmB,CAC/C,GAAIA,EACF,MAAM,IAAI,MAAM,4CAA4C,CAEhE,CAEA,SAASC,EAAgB5B,EAAY,CACnC,OAAO6B,EAAuB7B,EAAI,IAAI,IAAO,CAC3C,KAAyB,SAC1B,CAAA,EAAE,KAAK,IAAK,CACXiB,EAAcjB,CAAE,CAClB,CAAC,CACH,CAaA,MAAM8B,EAAe,IAAI,QACnBC,EACJ,yBAA0B,YAC1B,IAAI,qBAAsB/B,GAAgB,CACxC,MAAMgC,GAAYF,EAAa,IAAI9B,CAAE,GAAK,GAAK,EAC/C8B,EAAa,IAAI9B,EAAIgC,CAAQ,EACzBA,IAAa,GACfJ,EAAgB5B,CAAE,CAEtB,CAAC,EAEH,SAASiC,EAAcrB,EAAeZ,EAAY,CAChD,MAAMgC,GAAYF,EAAa,IAAI9B,CAAE,GAAK,GAAK,EAC/C8B,EAAa,IAAI9B,EAAIgC,CAAQ,EACzBD,GACFA,EAAgB,SAASnB,EAAOZ,EAAIY,CAAK,CAE7C,CAEA,SAASsB,EAAgBtB,EAAa,CAChCmB,GACFA,EAAgB,WAAWnB,CAAK,CAEpC,CAEA,SAASa,EACPzB,EACAsB,EACAjB,EAAqC,CAAA,EACrCgB,EAAiB,UAAA,GAAc,CAE/B,IAAIc,EAAkB,GACtB,MAAMvB,EAAQ,IAAI,MAAMS,EAAQ,CAC9B,IAAIe,EAAS1B,EAAI,CAEf,GADAgB,EAAqBS,CAAe,EAChCzB,IAAS9B,EACX,MAAO,IAAK,CACVsD,EAAgBtB,CAAK,EACrBgB,EAAgB5B,CAAE,EAClBsB,EAAiB,MAAK,EACtBa,EAAkB,EACpB,EAEF,GAAIzB,IAAS,OAAQ,CACnB,GAAIL,EAAK,SAAW,EAClB,MAAO,CAAE,KAAM,IAAMO,CAAK,EAE5B,MAAMyB,EAAIR,EAAuB7B,EAAIsB,EAAkB,CACrD,KAAqB,MACrB,KAAMjB,EAAK,IAAKiC,GAAMA,EAAE,UAAU,CACnC,CAAA,EAAE,KAAK/B,CAAa,EACrB,OAAO8B,EAAE,KAAK,KAAKA,CAAC,CACrB,CACD,OAAOZ,EAAYzB,EAAIsB,EAAkB,CAAC,GAAGjB,EAAMK,CAAI,CAAC,CACzD,EACD,IAAI0B,EAAS1B,EAAMC,EAAQ,CACzBe,EAAqBS,CAAe,EAGpC,KAAM,CAAC1C,EAAOsB,CAAa,EAAIC,EAAYL,CAAQ,EACnD,OAAOkB,EACL7B,EACAsB,EACA,CACE,KAAqB,MACrB,KAAM,CAAC,GAAGjB,EAAMK,CAAI,EAAE,IAAK4B,GAAMA,EAAE,UAAU,EAC7C,MAAA7C,CACD,EACDsB,CAAa,EACb,KAAKR,CAAa,CACrB,EACD,MAAM6B,EAASG,EAAUC,EAAe,CACtCd,EAAqBS,CAAe,EACpC,MAAMM,EAAOpC,EAAKA,EAAK,OAAS,CAAC,EACjC,GAAKoC,IAAiB9D,EACpB,OAAOkD,EAAuB7B,EAAIsB,EAAkB,CAClD,KAA0B,UAC3B,CAAA,EAAE,KAAKf,CAAa,EAGvB,GAAIkC,IAAS,OACX,OAAOhB,EAAYzB,EAAIsB,EAAkBjB,EAAK,MAAM,EAAG,EAAE,CAAC,EAE5D,KAAM,CAACC,EAAcS,CAAa,EAAI2B,EAAiBF,CAAe,EACtE,OAAOX,EACL7B,EACAsB,EACA,CACE,KAAuB,QACvB,KAAMjB,EAAK,IAAKiC,GAAMA,EAAE,UAAU,EAClC,aAAAhC,CACD,EACDS,CAAa,EACb,KAAKR,CAAa,CACrB,EACD,UAAU6B,EAASI,EAAe,CAChCd,EAAqBS,CAAe,EACpC,KAAM,CAAC7B,EAAcS,CAAa,EAAI2B,EAAiBF,CAAe,EACtE,OAAOX,EACL7B,EACAsB,EACA,CACE,KAA2B,YAC3B,KAAMjB,EAAK,IAAKiC,GAAMA,EAAE,UAAU,EAClC,aAAAhC,CACD,EACDS,CAAa,EACb,KAAKR,CAAa,CACrB,CACF,CAAA,EACD,OAAA0B,EAAcrB,EAAOZ,CAAE,EAChBY,CACT,CAEA,SAAS+B,EAAUC,EAAgB,CACjC,OAAO,MAAM,UAAU,OAAO,MAAM,CAAA,EAAIA,CAAG,CAC7C,CAEA,SAASF,EAAiBpC,EAAmB,CAC3C,MAAMuC,EAAYvC,EAAa,IAAIU,CAAW,EAC9C,MAAO,CAAC6B,EAAU,IAAKC,GAAMA,EAAE,CAAC,CAAC,EAAGH,EAAOE,EAAU,IAAKC,GAAMA,EAAE,CAAC,CAAC,CAAC,CAAC,CACxE,CAEA,MAAMC,EAAgB,IAAI,QACV,SAAAlC,GAAY3B,EAAQ8D,EAAyB,CAC3D,OAAAD,EAAc,IAAI7D,EAAK8D,CAAS,EACzB9D,CACT,CAEM,SAAU0B,GAAoB1B,EAAM,CACxC,OAAO,OAAO,OAAOA,EAAK,CAAE,CAACR,CAAW,EAAG,GAAM,CACnD,CAeA,SAASsC,EAAYvB,EAAU,CAC7B,SAAW,CAACwD,EAAMC,CAAO,IAAKvD,EAC5B,GAAIuD,EAAQ,UAAUzD,CAAK,EAAG,CAC5B,KAAM,CAAC0D,EAAiBpC,CAAa,EAAImC,EAAQ,UAAUzD,CAAK,EAChE,MAAO,CACL,CACE,KAA2B,UAC3B,KAAAwD,EACA,MAAOE,CACR,EACDpC,EAEH,CAEH,MAAO,CACL,CACE,KAAuB,MACvB,MAAAtB,CACD,EACDsD,EAAc,IAAItD,CAAK,GAAK,CAAA,EAEhC,CAEA,SAASc,EAAcd,EAAgB,CACrC,OAAQA,EAAM,KAAI,CAChB,IAAA,UACE,OAAOE,EAAiB,IAAIF,EAAM,IAAI,EAAG,YAAYA,EAAM,KAAK,EAClE,IAAA,MACE,OAAOA,EAAM,KAChB,CACH,CAEA,SAASoC,EACP7B,EACAsB,EACA8B,EACAJ,EAA0B,CAE1B,OAAO,IAAI,QAASK,GAAW,CAC7B,MAAMlD,EAAKmD,GAAY,EACvBhC,EAAiB,IAAInB,EAAIkD,CAAO,EAC5BrD,EAAG,OACLA,EAAG,MAAK,EAEVA,EAAG,YAAc,OAAA,OAAA,CAAA,GAAAG,GAAOiD,CAAG,EAAIJ,CAAS,CAC5C,CAAC,CACD,CAEA,SAASM,IAAY,CACnB,OAAO,IAAI,MAAM,CAAC,EACf,KAAK,CAAC,EACN,IAAI,IAAM,KAAK,MAAM,KAAK,SAAW,OAAO,gBAAgB,EAAE,SAAS,EAAE,CAAC,EAC1E,KAAK,GAAG,CACb,CCrnBO,SAASC,EAAiBjB,EAAakB,EAAa,CACvD,IAAIC,EAAI,EAER,QAAS,EAAI,EAAG,EAAInB,EAAE,OAAQ,IAC1BmB,IAAMnB,EAAE,CAAC,EAAIkB,EAAE,CAAC,IAAMlB,EAAE,CAAC,EAAIkB,EAAE,CAAC,GAEpC,OAAOC,CACX,CAUO,SAASC,EAAUpB,EAAakB,EAAa,CAChD,OAAO,KAAK,KAAKD,EAAiBjB,EAAGkB,CAAC,CAAC,CAC3C,CAaO,MAAMG,EAAiB,CAACC,EAAgBC,EAAgBC,IAAkD,CAC7G,IAAIC,EAAW,EAEf,UAAW,KAAKH,EACZ,UAAWI,KAAKH,EAAME,GAAYD,EAAY,EAAGE,CAAC,EAItD,OAAOD,EAAWH,EAAK,OAASC,EAAK,MACzC,EAYaI,GAAkB,CAACL,EAAgBC,EAAgBC,IAAkD,CAC9G,IAAIC,EAAW,EAEf,UAAW,KAAKH,EACZ,UAAWI,KAAKH,EAAME,EAAW,KAAK,IAAIA,EAAUD,EAAY,EAAGE,CAAC,CAAC,EAGzE,OAAOD,CACX,EAYaG,GAAgB,CAACN,EAAgBC,EAAgBC,IAAkD,CAC5G,IAAIC,EAAW,IAEf,UAAW,KAAKH,EACZ,UAAWI,KAAKH,EAAME,EAAW,KAAK,IAAIA,EAAUD,EAAY,EAAGE,CAAC,CAAC,EAGzE,OAAOD,CACX,EASA,SAASI,GAAaC,EAA4B,CAC9C,OAAQA,EAAA,CACJ,IAAK,UAAW,OAAOT,EACvB,IAAK,WAAY,OAAOM,GACxB,IAAK,SAAU,OAAOC,GACtB,QAAS,OAAOP,CAAA,CAExB,CAOA,SAASU,EAAcN,EAA8B,CACjD,OAAQA,EAAA,CACJ,IAAK,YAAa,OAAOL,EACzB,IAAK,mBAAoB,OAAOH,EAChC,QAAS,OAAOG,CAAA,CAExB,CAWO,SAASY,EAAsBC,EAA4B,CAC9D,MAAMC,EAA2B,CAAA,EAE3BC,EAAYC,GAAe,CAC7B,GAAIA,EAAE,SAAS,SAAW,EAEtBF,EAAe,KAAK,GAAGE,EAAE,OAAO,MAGhC,WAAWC,KAASD,EAAE,SAClBD,EAASE,CAAK,CAG1B,EAEA,OAAAF,EAASF,CAAO,EACTC,CACX,CAEA,MAAMI,EAAmB,IAGlB,SAASC,GACZC,EACAC,EAAmC,YACnCC,EAAiC,UAC1B,CACP,GAAIF,EAAW,QAAUF,EACrB,OAAOK,EAAYH,EAAYC,EAAcC,CAAW,EAG5D,MAAME,EAAIJ,EAAW,OACfK,EAAYC,EAAU,CAAC,EAEvBC,MAAoB,IAC1B,KAAOA,EAAc,KAAOT,GACxBS,EAAc,IAAI,KAAK,MAAMF,EAAA,EAAcD,CAAC,CAAC,EAGjD,MAAMI,EAAqB,MAAM,KAAKD,CAAa,EAC7CE,EAAeD,EAAmB,IAAIE,GAAKV,EAAWU,CAAC,CAAC,EAGxDC,EAAgBR,EAAYM,EAAcR,EAAcC,CAAW,EAGzE,OAAOU,GAAsBD,EAAeX,EAAYQ,EAAoBP,CAAY,CAC5F,CAGA,SAASW,GACLD,EACAX,EACAO,EACAN,EACO,CAGP,MAAMY,EAAatB,EAAcU,CAAY,EACvCa,EAAY,IAAI,IAAIP,CAAa,EAGjCQ,MAAkB,IACxB,QAASL,EAAI,EAAGA,EAAIV,EAAW,OAAQU,IAAK,CACxC,GAAII,EAAU,IAAIJ,CAAC,EAAG,SAEtB,IAAIM,EAAc,IACdC,EAAgB,GAEpB,UAAWC,KAAaX,EAAe,CACnC,MAAMtB,EAAW4B,EAAWb,EAAWU,CAAC,EAAGV,EAAWkB,CAAS,CAAC,EAC5DjC,EAAW+B,IACXA,EAAc/B,EACdgC,EAAgBC,EAExB,CAEAH,EAAY,IAAIL,EAAGO,CAAa,CACpC,CAEA,OAAOE,GAA2BR,EAAeI,EAAaR,CAAa,CAC/E,CAGA,SAASY,GACLR,EACAI,EACAR,EACO,CAEP,MAAMa,MAAsB,IACtBC,EAAsB5B,GAAqB,CACzCA,EAAQ,QAAQ,SAAW,GAC3B2B,EAAgB,IAAIb,EAAcd,EAAQ,QAAQ,CAAC,CAAC,EAAGA,CAAO,EAElE,UAAWI,KAASJ,EAAQ,SACxB4B,EAAmBxB,CAAK,CAEhC,EACAwB,EAAmBV,CAAa,EAGhC,MAAMW,MAA8B,IACpC,SAAW,CAACC,EAAUL,CAAS,IAAKH,EAAa,CAC7C,MAAMJ,EAAgBS,EAAgB,IAAIF,CAAS,EACnD,GAAIP,EAAe,CACVW,EAAwB,IAAIX,CAAa,GAC1CW,EAAwB,IAAIX,EAAe,EAAE,EAEjD,MAAMlB,EAAU6B,EAAwB,IAAIX,CAAa,EACrDlB,GACAA,EAAQ,KAAK8B,CAAQ,CAE7B,CACJ,CAEA,MAAMC,EAAsB,GAAe,CACvC,EAAE,QAAU,EAAE,QAAQ,IAAId,GAAKH,EAAcG,CAAC,CAAC,EAC/C,UAAWb,KAAS,EAAE,SAClB2B,EAAmB3B,CAAK,CAEhC,EACA2B,EAAmBb,CAAa,EAChC,SAAW,CAAClB,EAASgC,CAAc,IAAKH,EACpC7B,EAAQ,QAAU,CAAC,GAAGA,EAAQ,QAAS,GAAGgC,CAAc,EAG5D,MAAO,CACH,GAAGd,EACH,QAASnB,EAAsBmB,CAAa,CAAA,CAEpD,CA2BO,SAASR,EAAYH,EAAwBC,EAAmC,YAAaC,EAAiC,UAAoB,CACrJ,MAAMW,EAAatB,EAAcU,CAAY,EACvCyB,EAAYrC,GAAaa,CAAW,EAEpCE,EAAIJ,EAAW,OAKf2B,EAAsB,CAAA,EAItB3C,EAAc,CAAC0B,EAAWkB,IAAsB,CAClD,GAAIlB,IAAMkB,EAAG,MAAO,GAChBlB,EAAIkB,IAAG,CAAClB,EAAGkB,CAAC,EAAI,CAACA,EAAGlB,CAAC,GACzB,MAAMmB,EAAQnB,EAAIN,EAAKM,GAAKA,EAAI,GAAM,GAAKkB,EAAIlB,EAAI,GACnD,OAAOiB,EAAUE,CAAK,CAC1B,EAGMC,EAAc,CAACpB,EAAWkB,EAAWjH,IAAwB,CAC3D+F,EAAIkB,IAAG,CAAClB,EAAGkB,CAAC,EAAI,CAACA,EAAGlB,CAAC,GACzB,MAAMmB,EAAQnB,EAAIN,EAAKM,GAAKA,EAAI,GAAM,GAAKkB,EAAIlB,EAAI,GACnDiB,EAAUE,CAAK,EAAIlH,CACvB,EAIA,QAASoH,EAAK,EAAGA,EAAK3B,EAAG2B,IACrB,QAASC,EAAKD,EAAK,EAAGC,EAAK5B,EAAG4B,IAAM,CAChC,MAAMhE,EAAI6C,EAAWb,EAAW+B,CAAE,EAAG/B,EAAWgC,CAAE,CAAC,EACnDF,EAAYC,EAAIC,EAAIhE,CAAC,CACzB,CAKJ,MAAMiE,EAAsBjC,EAAW,IAAI,CAACkC,EAAGL,KAAW,CACtD,OAAQ,EACR,QAAS,CAACA,CAAK,EACf,SAAU,CAAA,CAAC,EACb,EAIF,QAASM,EAAY,EAAGA,EAAY/B,GAE5B,EAAA+B,GAAa/B,EAAI,GAFc+B,IAAa,CAKhD,IAAIC,EAAkB,IAClBC,EAAW,EACXC,EAAW,EAGf,QAASC,EAAc,EAAGA,EAAcN,EAAS,OAAQM,IACrD,QAASC,EAAcD,EAAc,EAAGC,EAAcP,EAAS,OAAQO,IAAe,CAElF,MAAMvD,EAAWyC,EAAUO,EAASM,CAAW,EAAE,QAASN,EAASO,CAAW,EAAE,QAASxD,CAAW,EAGhGC,EAAWmD,IACXA,EAAkBnD,EAClBoD,EAAWE,EACXD,EAAWE,EAEnB,CAKJ,MAAMC,GAAa,CACf,QAAS,CAAC,GAAGR,EAASI,CAAQ,EAAE,QAAS,GAAGJ,EAASK,CAAQ,EAAE,OAAO,EACtE,OAAQF,EACR,SAAU,CAACH,EAASI,CAAQ,EAAGJ,EAASK,CAAQ,CAAC,CAAA,EAMrDL,EAAS,OAAO,KAAK,IAAII,EAAUC,CAAQ,EAAG,CAAC,EAC/CL,EAAS,OAAO,KAAK,IAAII,EAAUC,CAAQ,EAAG,CAAC,EAC/CL,EAAS,KAAKQ,EAAU,CAC5B,CAIA,MAAMC,EAAcT,EAAS,CAAC,EAC9B,MAAO,CACH,GAAGS,EACH,QAASlD,EAAsBkD,CAAW,CAAA,CAElD,CAEAnI,EAAO,CAAC,uBAAAwF,GAAuB","x_google_ignoreList":[0,1]}

package/dist/bubble/BubbleSettingsImpl.d.ts

@@ -77,4 +77,3 @@ export declare class BubbleSettingsImpl implements SettingsInterface {
     };
     constructor(settings: BubbleSettings);
 }
-//# sourceMappingURL=BubbleSettingsImpl.d.ts.map

package/dist/bubble/BubbleSettingsImpl.js

@@ -9,7 +9,7 @@ import "../types/heatmap.js";
 import "../types/dendro.js";
 import "../types/histogram.js";
 import { BubblesSettingsSchema as B } from "../types/bubble.js";
-import w from "../node_modules/lodash/lodash.js";
+import w from "../_virtual/lodash.js";
 class F {
   constructor(l) {
     o(this, "id");

package/dist/bubble/ChartRenderer.d.ts

@@ -50,4 +50,3 @@ declare class ChartRenderer {
     renderError(message: string): void;
 }
 export default ChartRenderer;
-//# sourceMappingURL=ChartRenderer.d.ts.map