@milaboratories/miplots4 1.0.176 → 1.0.177

package/dist/AbstractChart.js

@@ -1,15 +1,11 @@
-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 {
-  e as AbstractChart
+var e = class {
+	hasError = !1;
+	errorInfo = null;
+	calculatedData = null;
+	constructor(e, t) {
+		this.data = e, this.settings = t;
+	}
 };
-//# sourceMappingURL=AbstractChart.js.map
+export { 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 {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;"}
+{"version":3,"file":"AbstractChart.js","names":[],"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"],"mappings":"AAcA,IAAsB,IAAtB,MAA8D;CAC1D,WAAW;CACX,YAA8B;CAC9B,iBAAiB;CAEjB,YAAsB,GAAwB,GAAmC;AAA5B,EAAxB,KAAA,OAAA,GAAwB,KAAA,WAAA"}

package/dist/DataFrame.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"DataFrame.d.ts","sourceRoot":"","sources":["../src/DataFrame.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AAGnD,MAAM,MAAM,aAAa,GAAG;IACxB,IAAI,EAAE,SAAS,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC;IACpC,EAAE,EAAE,MAAM,CAAA;CACb,CAAA;AACD,MAAM,MAAM,OAAO,GAAG,SAAS,GAAG,aAAa,CAAC;AAChD,eAAO,MAAM,UAAU,eAAsB,CAAC;AAC9C,MAAM,MAAM,QAAQ,GAAG,MAAM,GAAG,OAAO,UAAU,CAAC;AAClD,MAAM,MAAM,QAAQ,GAAG,MAAM,CAAC;AAC9B,KAAK,SAAS,GAAG,MAAM,CACnB,QAAQ,EACR;IACI,UAAU,EAAE,WAAW,CAAC;IACxB,OAAO,EAAE,SAAS,CAAC;CACtB,CACJ,CAAC;AAMF,KAAK,UAAU,GAAG,MAAM,CAAC;AAIzB,qBAAa,SAAS;IAClB,MAAM,CAAC,UAAU,UAAW,SAAS,KAAG,MAAM,CAAkB;IAEhE,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IAEpB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC;IAC3C,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,WAAW,EAAE,UAAU,EAAE,CAAC;IACnC,QAAQ,CAAC,UAAU,EAAE,WAAW,CAAC;IAEjC,QAAQ,CAAC,mBAAmB,EAAE,GAAG,CAAC,UAAU,EAAE,QAAQ,EAAE,CAAC,CAAa;IACtE,QAAQ,CAAC,6BAA6B,EAAE,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAa;IAE3F,WAAW,CAAC,EAAE,SAAS,CAAC;IAExB,MAAM,CAAC,IAAI,CAAE,IAAI,EAAE,OAAO,GAAE,SAAS;gBAUzB,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC;IAQzD,SAAS,CAAC,GAAG,EAAE,MAAM,GAAG,SAAS,EAAE;IAInC,cAAc,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,SAAS;IAIrD,sBAAsB,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,QAAQ;IAI5D,mBAAmB,CAAC,GAAG,EAAE,MAAM,EAAE,UAAU,UAAO,GAAG,QAAQ,EAAE;IAW/D,yBAAyB,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,GAAG,QAAQ;IAUjE,OAAO,CAAC,uBAAuB;IAiC/B,WAAW,CAAC,iBAAiB,EAAE,CAAC,MAAM,GAAG,IAAI,CAAC,EAAE,EAAE,YAAY,CAAC,EAAE,CAAC,QAAQ,EAAE,GAAG,SAAS,CAAC,EAAE;IAiC3F,mBAAmB,CAAC,YAAY,EAAE,QAAQ,EAAE,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM,EAAE;IAmB3E,iBAAiB,CAAC,YAAY,EAAE,QAAQ,EAAE,GAAG,WAAW;CAiB3D"}
+{"version":3,"file":"DataFrame.d.ts","sourceRoot":"","sources":["../src/DataFrame.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AAGnD,MAAM,MAAM,aAAa,GAAG;IACxB,IAAI,EAAE,SAAS,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC;IACpC,EAAE,EAAE,MAAM,CAAA;CACb,CAAA;AACD,MAAM,MAAM,OAAO,GAAG,SAAS,GAAG,aAAa,CAAC;AAChD,eAAO,MAAM,UAAU,eAAsB,CAAC;AAC9C,MAAM,MAAM,QAAQ,GAAG,MAAM,GAAG,OAAO,UAAU,CAAC;AAClD,MAAM,MAAM,QAAQ,GAAG,MAAM,CAAC;AAC9B,KAAK,SAAS,GAAG,MAAM,CACnB,QAAQ,EACR;IACI,UAAU,EAAE,WAAW,CAAC;IACxB,OAAO,EAAE,SAAS,CAAC;CACtB,CACJ,CAAC;AAMF,KAAK,UAAU,GAAG,MAAM,CAAC;AAIzB,qBAAa,SAAS;IAClB,MAAM,CAAC,UAAU,GAAI,OAAO,SAAS,KAAG,MAAM,CAAkB;IAEhE,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IAEpB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC;IAC3C,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,WAAW,EAAE,UAAU,EAAE,CAAC;IACnC,QAAQ,CAAC,UAAU,EAAE,WAAW,CAAC;IAEjC,QAAQ,CAAC,mBAAmB,EAAE,GAAG,CAAC,UAAU,EAAE,QAAQ,EAAE,CAAC,CAAa;IACtE,QAAQ,CAAC,6BAA6B,EAAE,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAa;IAE3F,WAAW,CAAC,EAAE,SAAS,CAAC;IAExB,MAAM,CAAC,IAAI,CAAE,IAAI,EAAE,OAAO,GAAE,SAAS;gBAUzB,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC;IAQzD,SAAS,CAAC,GAAG,EAAE,MAAM,GAAG,SAAS,EAAE;IAInC,cAAc,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,SAAS;IAIrD,sBAAsB,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,QAAQ;IAI5D,mBAAmB,CAAC,GAAG,EAAE,MAAM,EAAE,UAAU,UAAO,GAAG,QAAQ,EAAE;IAW/D,yBAAyB,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,GAAG,QAAQ;IAUjE,OAAO,CAAC,uBAAuB;IAiC/B,WAAW,CAAC,iBAAiB,EAAE,CAAC,MAAM,GAAG,IAAI,CAAC,EAAE,EAAE,YAAY,CAAC,EAAE,CAAC,QAAQ,EAAE,GAAG,SAAS,CAAC,EAAE;IAiC3F,mBAAmB,CAAC,YAAY,EAAE,QAAQ,EAAE,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM,EAAE;IAmB3E,iBAAiB,CAAC,YAAY,EAAE,QAAQ,EAAE,GAAG,WAAW;CAiB3D"}

package/dist/DataFrame.js

@@ -1,129 +1,111 @@
-var f = Object.defineProperty;
-var x = (u, e, t) => e in u ? f(u, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : u[e] = t;
-var s = (u, e, t) => x(u, typeof e != "symbol" ? e + "" : e, t);
-import { l as I } from "./_virtual/lodash.js";
-import { exhaustive as G } from "./utils/index.js";
-const c = Symbol("noGrouped");
-function E(u) {
-  return "type" in u && u.type === "columns";
+import { exhaustive as e } from "./utils/index.js";
+import { groupBy as t } from "lodash";
+const n = Symbol("noGrouped");
+function r(e) {
+	return "type" in e && e.type === "columns";
 }
-const w = new Uint32Array(0), h = class h {
-  constructor(e, t) {
-    s(this, "id");
-    // input data grouped by columns
-    s(this, "data");
-    s(this, "rowsCount");
-    s(this, "columnNames");
-    s(this, "rowIndexes");
-    s(this, "mapColumnCategories", /* @__PURE__ */ new Map());
-    s(this, "mapColumnCategoriesRowIndexes", /* @__PURE__ */ new Map());
-    s(this, "rowsGrouped");
-    this.id = e, this.data = t, this.columnNames = Object.keys(t), this.rowsCount = this.columnNames.length ? t[this.columnNames[0]].length : 0, this.rowIndexes = new Uint32Array(Array.from({ length: this.rowsCount }, (o, r) => r));
-  }
-  static from(e) {
-    if (e instanceof h)
-      return e;
-    if (E(e))
-      return new h(e.id, e.values);
-    G(e, "Unknown input data format");
-  }
-  getColumn(e) {
-    return this.data[e];
-  }
-  getColumnValue(e, t) {
-    var o;
-    return (o = this.data[e]) == null ? void 0 : o[t];
-  }
-  getColumnValueCategory(e, t) {
-    return h.toCategory(this.getColumnValue(e, t));
-  }
-  getColumnCategories(e, t = !0) {
-    this.mapColumnCategories.has(e) || this.computeColumnCategories(e);
-    const o = this.mapColumnCategories.get(e) ?? [];
-    return t && o && o.length > 0 && o[o.length - 1] === "null" ? o.slice(0, -1) : o;
-  }
-  getColumnCategoryRowIndex(e, t) {
-    var r;
-    const o = (r = this.mapColumnCategoriesRowIndexes.get(e)) == null ? void 0 : r.get(t);
-    if (o === void 0)
-      throw new Error(`Category ${t} not found in column ${e}`);
-    return o;
-  }
-  computeColumnCategories(e) {
-    if (!this.columnNames.includes(e))
-      throw new Error(`Column ${e} does not exist`);
-    const t = this.getColumn(e), o = /* @__PURE__ */ new Set(), r = [], n = /* @__PURE__ */ new Map();
-    let m = -1;
-    for (let a = 0; a < t.length; a++) {
-      const i = t[a];
-      if (o.has(i))
-        continue;
-      if (o.add(i), i === null) {
-        m = a;
-        continue;
-      }
-      const l = h.toCategory(i);
-      r.push(l), n.set(l, a);
-    }
-    m !== -1 && (r.push("null"), n.set("null", m)), this.mapColumnCategories.set(e, r), this.mapColumnCategoriesRowIndexes.set(e, n);
-  }
-  setGrouping(e, t) {
-    const o = { grouped: {}, rowIndexes: this.rowIndexes };
-    let r = [o];
-    e.forEach((n, m) => {
-      const a = n === null ? [c] : (t == null ? void 0 : t[m]) ?? this.getColumnCategories(n, !1), i = [];
-      r.forEach((l) => {
-        if (n === null)
-          l.grouped = {
-            [c]: {
-              rowIndexes: l.rowIndexes,
-              grouped: {}
-            }
-          }, i.push(l.grouped[c]);
-        else {
-          const p = I.groupBy(l.rowIndexes, (d) => this.getColumnValueCategory(n, d));
-          l.grouped = a.reduce((d, g) => (d[g] = {
-            rowIndexes: new Uint32Array(p[g] ?? []),
-            grouped: {}
-          }, i.push(d[g]), d), {});
-        }
-      }), r = i;
-    }), this.rowsGrouped = o.grouped;
-  }
-  // TODO: fix all places where this method is used
-  getColumnByGrouping(e, t) {
-    if (!this.rowsGrouped)
-      return [];
-    if (!e.length)
-      return Array.from(this.rowIndexes).map((r) => Number(this.getColumnValue(t, r)));
-    let o = { grouped: this.rowsGrouped, rowIndexes: this.rowIndexes };
-    return e.forEach((r) => {
-      const n = o.grouped[r ?? "null"];
-      if (!n)
-        return [];
-      o = n;
-    }), Array.from(o.rowIndexes).map((r) => Number(this.getColumnValue(t, r)));
-  }
-  // TODO: fix all places where this method is used
-  getRowsByGrouping(e) {
-    if (!this.rowsGrouped)
-      return w;
-    if (!e.length)
-      return this.rowIndexes;
-    let t = { grouped: this.rowsGrouped, rowIndexes: this.rowIndexes };
-    for (const o of e) {
-      const r = t.grouped[o];
-      if (!r)
-        return w;
-      t = r;
-    }
-    return t.rowIndexes;
-  }
+var i = new Uint32Array(), a = class a {
+	static toCategory = (e) => String(e);
+	id;
+	data;
+	rowsCount;
+	columnNames;
+	rowIndexes;
+	mapColumnCategories = /* @__PURE__ */ new Map();
+	mapColumnCategoriesRowIndexes = /* @__PURE__ */ new Map();
+	rowsGrouped;
+	static from(t) {
+		if (t instanceof a) return t;
+		if (r(t)) return new a(t.id, t.values);
+		e(t, "Unknown input data format");
+	}
+	constructor(e, t) {
+		this.id = e, this.data = t, this.columnNames = Object.keys(t), this.rowsCount = this.columnNames.length ? t[this.columnNames[0]].length : 0, this.rowIndexes = new Uint32Array(Array.from({ length: this.rowsCount }, (e, t) => t));
+	}
+	getColumn(e) {
+		return this.data[e];
+	}
+	getColumnValue(e, t) {
+		return this.data[e]?.[t];
+	}
+	getColumnValueCategory(e, t) {
+		return a.toCategory(this.getColumnValue(e, t));
+	}
+	getColumnCategories(e, t = !0) {
+		this.mapColumnCategories.has(e) || this.computeColumnCategories(e);
+		let n = this.mapColumnCategories.get(e) ?? [];
+		return t && n && n.length > 0 && n[n.length - 1] === "null" ? n.slice(0, -1) : n;
+	}
+	getColumnCategoryRowIndex(e, t) {
+		let n = this.mapColumnCategoriesRowIndexes.get(e)?.get(t);
+		if (n === void 0) throw Error(`Category ${t} not found in column ${e}`);
+		return n;
+	}
+	computeColumnCategories(e) {
+		if (!this.columnNames.includes(e)) throw Error(`Column ${e} does not exist`);
+		let t = this.getColumn(e), n = /* @__PURE__ */ new Set(), r = [], i = /* @__PURE__ */ new Map(), o = -1;
+		for (let e = 0; e < t.length; e++) {
+			let s = t[e];
+			if (n.has(s)) continue;
+			if (n.add(s), s === null) {
+				o = e;
+				continue;
+			}
+			let c = a.toCategory(s);
+			r.push(c), i.set(c, e);
+		}
+		o !== -1 && (r.push("null"), i.set("null", o)), this.mapColumnCategories.set(e, r), this.mapColumnCategoriesRowIndexes.set(e, i);
+	}
+	setGrouping(e, r) {
+		let i = {
+			grouped: {},
+			rowIndexes: this.rowIndexes
+		}, a = [i];
+		e.forEach((e, i) => {
+			let o = e === null ? [n] : r?.[i] ?? this.getColumnCategories(e, !1), s = [];
+			a.forEach((r) => {
+				if (e === null) r.grouped = { [n]: {
+					rowIndexes: r.rowIndexes,
+					grouped: {}
+				} }, s.push(r.grouped[n]);
+				else {
+					let n = t(r.rowIndexes, (t) => this.getColumnValueCategory(e, t));
+					r.grouped = o.reduce((e, t) => (e[t] = {
+						rowIndexes: new Uint32Array(n[t] ?? []),
+						grouped: {}
+					}, s.push(e[t]), e), {});
+				}
+			}), a = s;
+		}), this.rowsGrouped = i.grouped;
+	}
+	getColumnByGrouping(e, t) {
+		if (!this.rowsGrouped) return [];
+		if (!e.length) return Array.from(this.rowIndexes).map((e) => Number(this.getColumnValue(t, e)));
+		let n = {
+			grouped: this.rowsGrouped,
+			rowIndexes: this.rowIndexes
+		};
+		return e.forEach((e) => {
+			let t = n.grouped[e ?? "null"];
+			if (!t) return [];
+			n = t;
+		}), Array.from(n.rowIndexes).map((e) => Number(this.getColumnValue(t, e)));
+	}
+	getRowsByGrouping(e) {
+		if (!this.rowsGrouped) return i;
+		if (!e.length) return this.rowIndexes;
+		let t = {
+			grouped: this.rowsGrouped,
+			rowIndexes: this.rowIndexes
+		};
+		for (let n of e) {
+			let e = t.grouped[n];
+			if (!e) return i;
+			t = e;
+		}
+		return t.rowIndexes;
+	}
 };
-s(h, "toCategory", (e) => String(e));
-let C = h;
-export {
-  C as DataFrame,
-  c as NO_GROUPED
-};
-//# sourceMappingURL=DataFrame.js.map
+export { a as DataFrame, n as NO_GROUPED };
+
+//# sourceMappingURL=DataFrame.js.map

package/dist/DataFrame.js.map

@@ -1 +1 @@
-{"version":3,"file":"DataFrame.js","sources":["../src/DataFrame.ts"],"sourcesContent":["import { groupBy } from 'lodash';\nimport type { Category, DataValue } from './types';\nimport { exhaustive } from './utils';\n\nexport type DataByColumns = {\n    type: 'columns',\n    values: Record<string, DataValue[]>,\n    id: string\n}\nexport type DataSet = DataFrame | DataByColumns;\nexport const NO_GROUPED = Symbol('noGrouped');\nexport type GroupKey = string | typeof NO_GROUPED;\nexport type RowIndex = number;\ntype RowsGroup = Record<\n    GroupKey,\n    {\n        rowIndexes: Uint32Array;\n        grouped: RowsGroup;\n    }\n>;\n\nfunction isDataByColumns (data:DataSet): data is DataByColumns {\n    return 'type' in data && data.type === 'columns';\n}\n\ntype ColumnName = string;\n\nconst EMPTY_INDEXES = new Uint32Array(0);\n\nexport class DataFrame {\n    static toCategory = (value: DataValue): string => String(value);\n\n    readonly id: string;\n    // input data grouped by columns\n    readonly data: Record<string, DataValue[]>;\n    readonly rowsCount: number;\n    readonly columnNames: ColumnName[];\n    readonly rowIndexes: Uint32Array;\n\n    readonly mapColumnCategories: Map<ColumnName, Category[]> = new Map();\n    readonly mapColumnCategoriesRowIndexes: Map<ColumnName, Map<Category, number>> = new Map();\n\n    rowsGrouped?: RowsGroup;\n\n    static from (data: DataSet):DataFrame {\n        if (data instanceof DataFrame) {\n            return data;\n        } else if (isDataByColumns(data)) {\n            return new DataFrame(data.id, data.values);\n        } else {\n            exhaustive(data, 'Unknown input data format');\n        }\n    }\n\n    constructor(id: string, data: Record<string, DataValue[]>) {\n        this.id = id;\n        this.data = data;\n        this.columnNames = Object.keys(data);\n        this.rowsCount = this.columnNames.length ? data[this.columnNames[0]].length : 0;\n        this.rowIndexes = new Uint32Array(Array.from({length: this.rowsCount}, (_, i) => i));\n    }\n\n    getColumn(key: string): DataValue[] {\n        return this.data[key];\n    }\n\n    getColumnValue(key: string, index: number): DataValue {\n        return this.data[key]?.[index];\n    }\n\n    getColumnValueCategory(key: string, index: number): Category {\n        return DataFrame.toCategory(this.getColumnValue(key, index));\n    }\n\n    getColumnCategories(key: string, ignoreNull = true): Category[] {\n        if (!this.mapColumnCategories.has(key)) {\n            this.computeColumnCategories(key);\n        }\n\n        const categories = this.mapColumnCategories.get(key) ?? [];\n        return ignoreNull && categories && categories.length > 0 && categories[categories.length - 1] === 'null'\n            ? categories.slice(0, -1) // full copy without null to heavy for large datasets\n            : categories; \n    }\n\n    getColumnCategoryRowIndex(key: string, value: Category): RowIndex {\n        const rowIndex = this.mapColumnCategoriesRowIndexes.get(key)?.get(value);\n        \n        if (rowIndex === undefined) {\n            throw new Error(`Category ${value} not found in column ${key}`);\n        }\n\n        return rowIndex;\n    }\n\n    private computeColumnCategories(key: ColumnName) {\n        if (!this.columnNames.includes(key)) {\n            throw new Error(`Column ${key} does not exist`);\n        }\n        \n        const columnData = this.getColumn(key);\n        const uniqValues = new Set<DataValue>();\n        const categories: string[] = [];\n        const categoriesIndexes = new Map<string, number>();\n        let nullIdx = -1;\n        for (let i = 0; i < columnData.length; i++) {\n            const value = columnData[i];\n            if (uniqValues.has(value)) {\n                continue;\n            }\n            uniqValues.add(value);\n            if (value === null) {\n                nullIdx = i;\n                continue;\n            }\n            const category = DataFrame.toCategory(value);\n            categories.push(category);\n            categoriesIndexes.set(category, i);\n        }\n        if (nullIdx !== -1) {\n            categories.push('null');\n            categoriesIndexes.set('null', nullIdx);\n        }\n\n        this.mapColumnCategories.set(key, categories);\n        this.mapColumnCategoriesRowIndexes.set(key, categoriesIndexes);\n    }\n\n    setGrouping(groupingColumnIds: (string | null)[], groupingKeys?: (GroupKey[] | undefined)[]) { \n        const root = {grouped: {} as RowsGroup, rowIndexes: this.rowIndexes};\n        let groups: RowsGroup[keyof RowsGroup][] = [root];\n        groupingColumnIds.forEach((column, idx) => {\n            const keys: GroupKey[] = column === null ? [NO_GROUPED] : (groupingKeys?.[idx] ?? this.getColumnCategories(column, false));\n            const nextGroups: RowsGroup[keyof RowsGroup][] = [];\n            groups.forEach(group => {\n                if (column === null) {\n                    group.grouped = {\n                        [NO_GROUPED]: {\n                            rowIndexes: group.rowIndexes,\n                            grouped: {} as RowsGroup,\n                        },\n                    };\n                    nextGroups.push(group.grouped[NO_GROUPED]);\n                } else {\n                    const groupedBy = groupBy(group.rowIndexes, idx => this.getColumnValueCategory(column, idx));\n                    group.grouped = keys.reduce((res, key) => {\n                        res[key] = {\n                            rowIndexes: new Uint32Array(groupedBy[key as string] ?? []),\n                            grouped: {} as RowsGroup,\n                        };\n                        nextGroups.push(res[key]);\n                        return res;\n                    }, {} as RowsGroup);\n                }\n            });\n            groups = nextGroups;\n        });\n        this.rowsGrouped = root.grouped;\n    }\n\n    // TODO: fix all places where this method is used\n    getColumnByGrouping(groupingKeys: GroupKey[], keyYColumn: string): number[] {\n        if (!this.rowsGrouped) {\n            return [];\n        }\n        if (!groupingKeys.length) {\n            return Array.from(this.rowIndexes).map(idx => Number(this.getColumnValue(keyYColumn, idx)));\n        }\n        let result: {grouped: RowsGroup; rowIndexes: Uint32Array} = {grouped: this.rowsGrouped, rowIndexes: this.rowIndexes};\n        groupingKeys.forEach(key => {\n            const nextGroup = result.grouped[key ?? 'null'];\n            if (!nextGroup) {\n                return [];\n            }\n            result = nextGroup;\n        });\n        return Array.from(result.rowIndexes).map(idx => Number(this.getColumnValue(keyYColumn, idx)));\n    }\n\n    // TODO: fix all places where this method is used\n    getRowsByGrouping(groupingKeys: GroupKey[]): Uint32Array {\n        if (!this.rowsGrouped) {\n            return EMPTY_INDEXES;\n        }\n        if (!groupingKeys.length) {\n            return this.rowIndexes;\n        }\n        let result: {grouped: RowsGroup; rowIndexes: Uint32Array} = {grouped: this.rowsGrouped, rowIndexes: this.rowIndexes};\n        for (const key of groupingKeys) {\n            const nextGroup = result.grouped[key];\n            if (!nextGroup) {\n                return EMPTY_INDEXES;\n            }\n            result = nextGroup;\n        }\n        return result.rowIndexes;\n    }\n}\n"],"names":["NO_GROUPED","isDataByColumns","data","EMPTY_INDEXES","_DataFrame","id","__publicField","_","i","exhaustive","key","index","_a","ignoreNull","categories","value","rowIndex","columnData","uniqValues","categoriesIndexes","nullIdx","category","groupingColumnIds","groupingKeys","root","groups","column","idx","keys","nextGroups","group","groupedBy","groupBy","res","keyYColumn","result","nextGroup","DataFrame"],"mappings":";;;;;AAUO,MAAMA,IAAa,OAAO,WAAW;AAW5C,SAASC,EAAiBC,GAAqC;AAC3D,SAAO,UAAUA,KAAQA,EAAK,SAAS;AAC3C;AAIA,MAAMC,IAAgB,IAAI,YAAY,CAAC,GAE1BC,IAAN,MAAMA,EAAU;AAAA,EAyBnB,YAAYC,GAAYH,GAAmC;AAtBlD,IAAAI,EAAA;AAEA;AAAA,IAAAA,EAAA;AACA,IAAAA,EAAA;AACA,IAAAA,EAAA;AACA,IAAAA,EAAA;AAEA,IAAAA,EAAA,iDAAuD,IAAA;AACvD,IAAAA,EAAA,2DAA4E,IAAA;AAErF,IAAAA,EAAA;AAaI,SAAK,KAAKD,GACV,KAAK,OAAOH,GACZ,KAAK,cAAc,OAAO,KAAKA,CAAI,GACnC,KAAK,YAAY,KAAK,YAAY,SAASA,EAAK,KAAK,YAAY,CAAC,CAAC,EAAE,SAAS,GAC9E,KAAK,aAAa,IAAI,YAAY,MAAM,KAAK,EAAC,QAAQ,KAAK,UAAA,GAAY,CAACK,GAAGC,MAAMA,CAAC,CAAC;AAAA,EACvF;AAAA,EAhBA,OAAO,KAAMN,GAAyB;AAClC,QAAIA,aAAgBE;AAChB,aAAOF;AACX,QAAWD,EAAgBC,CAAI;AAC3B,aAAO,IAAIE,EAAUF,EAAK,IAAIA,EAAK,MAAM;AAEzC,IAAAO,EAAWP,GAAM,2BAA2B;AAAA,EAEpD;AAAA,EAUA,UAAUQ,GAA0B;AAChC,WAAO,KAAK,KAAKA,CAAG;AAAA,EACxB;AAAA,EAEA,eAAeA,GAAaC,GAA0B;;AAClD,YAAOC,IAAA,KAAK,KAAKF,CAAG,MAAb,gBAAAE,EAAiBD;AAAA,EAC5B;AAAA,EAEA,uBAAuBD,GAAaC,GAAyB;AACzD,WAAOP,EAAU,WAAW,KAAK,eAAeM,GAAKC,CAAK,CAAC;AAAA,EAC/D;AAAA,EAEA,oBAAoBD,GAAaG,IAAa,IAAkB;AAC5D,IAAK,KAAK,oBAAoB,IAAIH,CAAG,KACjC,KAAK,wBAAwBA,CAAG;AAGpC,UAAMI,IAAa,KAAK,oBAAoB,IAAIJ,CAAG,KAAK,CAAA;AACxD,WAAOG,KAAcC,KAAcA,EAAW,SAAS,KAAKA,EAAWA,EAAW,SAAS,CAAC,MAAM,SAC5FA,EAAW,MAAM,GAAG,EAAE,IACtBA;AAAA,EACV;AAAA,EAEA,0BAA0BJ,GAAaK,GAA2B;;AAC9D,UAAMC,KAAWJ,IAAA,KAAK,8BAA8B,IAAIF,CAAG,MAA1C,gBAAAE,EAA6C,IAAIG;AAElE,QAAIC,MAAa;AACb,YAAM,IAAI,MAAM,YAAYD,CAAK,wBAAwBL,CAAG,EAAE;AAGlE,WAAOM;AAAA,EACX;AAAA,EAEQ,wBAAwBN,GAAiB;AAC7C,QAAI,CAAC,KAAK,YAAY,SAASA,CAAG;AAC9B,YAAM,IAAI,MAAM,UAAUA,CAAG,iBAAiB;AAGlD,UAAMO,IAAa,KAAK,UAAUP,CAAG,GAC/BQ,wBAAiB,IAAA,GACjBJ,IAAuB,CAAA,GACvBK,wBAAwB,IAAA;AAC9B,QAAIC,IAAU;AACd,aAASZ,IAAI,GAAGA,IAAIS,EAAW,QAAQT,KAAK;AACxC,YAAMO,IAAQE,EAAWT,CAAC;AAC1B,UAAIU,EAAW,IAAIH,CAAK;AACpB;AAGJ,UADAG,EAAW,IAAIH,CAAK,GAChBA,MAAU,MAAM;AAChB,QAAAK,IAAUZ;AACV;AAAA,MACJ;AACA,YAAMa,IAAWjB,EAAU,WAAWW,CAAK;AAC3C,MAAAD,EAAW,KAAKO,CAAQ,GACxBF,EAAkB,IAAIE,GAAUb,CAAC;AAAA,IACrC;AACA,IAAIY,MAAY,OACZN,EAAW,KAAK,MAAM,GACtBK,EAAkB,IAAI,QAAQC,CAAO,IAGzC,KAAK,oBAAoB,IAAIV,GAAKI,CAAU,GAC5C,KAAK,8BAA8B,IAAIJ,GAAKS,CAAiB;AAAA,EACjE;AAAA,EAEA,YAAYG,GAAsCC,GAA2C;AACzF,UAAMC,IAAO,EAAC,SAAS,CAAA,GAAiB,YAAY,KAAK,WAAA;AACzD,QAAIC,IAAuC,CAACD,CAAI;AAChD,IAAAF,EAAkB,QAAQ,CAACI,GAAQC,MAAQ;AACvC,YAAMC,IAAmBF,MAAW,OAAO,CAAC1B,CAAU,KAAKuB,KAAA,gBAAAA,EAAeI,OAAQ,KAAK,oBAAoBD,GAAQ,EAAK,GAClHG,IAA2C,CAAA;AACjD,MAAAJ,EAAO,QAAQ,CAAAK,MAAS;AACpB,YAAIJ,MAAW;AACX,UAAAI,EAAM,UAAU;AAAA,YACZ,CAAC9B,CAAU,GAAG;AAAA,cACV,YAAY8B,EAAM;AAAA,cAClB,SAAS,CAAA;AAAA,YAAC;AAAA,UACd,GAEJD,EAAW,KAAKC,EAAM,QAAQ9B,CAAU,CAAC;AAAA,aACtC;AACH,gBAAM+B,IAAYC,EAAAA,QAAQF,EAAM,YAAY,CAAAH,MAAO,KAAK,uBAAuBD,GAAQC,CAAG,CAAC;AAC3F,UAAAG,EAAM,UAAUF,EAAK,OAAO,CAACK,GAAKvB,OAC9BuB,EAAIvB,CAAG,IAAI;AAAA,YACP,YAAY,IAAI,YAAYqB,EAAUrB,CAAa,KAAK,CAAA,CAAE;AAAA,YAC1D,SAAS,CAAA;AAAA,UAAC,GAEdmB,EAAW,KAAKI,EAAIvB,CAAG,CAAC,GACjBuB,IACR,CAAA,CAAe;AAAA,QACtB;AAAA,MACJ,CAAC,GACDR,IAASI;AAAA,IACb,CAAC,GACD,KAAK,cAAcL,EAAK;AAAA,EAC5B;AAAA;AAAA,EAGA,oBAAoBD,GAA0BW,GAA8B;AACxE,QAAI,CAAC,KAAK;AACN,aAAO,CAAA;AAEX,QAAI,CAACX,EAAa;AACd,aAAO,MAAM,KAAK,KAAK,UAAU,EAAE,IAAI,CAAAI,MAAO,OAAO,KAAK,eAAeO,GAAYP,CAAG,CAAC,CAAC;AAE9F,QAAIQ,IAAwD,EAAC,SAAS,KAAK,aAAa,YAAY,KAAK,WAAA;AACzG,WAAAZ,EAAa,QAAQ,CAAAb,MAAO;AACxB,YAAM0B,IAAYD,EAAO,QAAQzB,KAAO,MAAM;AAC9C,UAAI,CAAC0B;AACD,eAAO,CAAA;AAEX,MAAAD,IAASC;AAAA,IACb,CAAC,GACM,MAAM,KAAKD,EAAO,UAAU,EAAE,IAAI,CAAAR,MAAO,OAAO,KAAK,eAAeO,GAAYP,CAAG,CAAC,CAAC;AAAA,EAChG;AAAA;AAAA,EAGA,kBAAkBJ,GAAuC;AACrD,QAAI,CAAC,KAAK;AACN,aAAOpB;AAEX,QAAI,CAACoB,EAAa;AACd,aAAO,KAAK;AAEhB,QAAIY,IAAwD,EAAC,SAAS,KAAK,aAAa,YAAY,KAAK,WAAA;AACzG,eAAWzB,KAAOa,GAAc;AAC5B,YAAMa,IAAYD,EAAO,QAAQzB,CAAG;AACpC,UAAI,CAAC0B;AACD,eAAOjC;AAEX,MAAAgC,IAASC;AAAA,IACb;AACA,WAAOD,EAAO;AAAA,EAClB;AACJ;AAvKI7B,EADSF,GACF,cAAa,CAACW,MAA6B,OAAOA,CAAK;AAD3D,IAAMsB,IAANjC;"}
+{"version":3,"file":"DataFrame.js","names":[],"sources":["../src/DataFrame.ts"],"sourcesContent":["import { groupBy } from 'lodash';\nimport type { Category, DataValue } from './types';\nimport { exhaustive } from './utils';\n\nexport type DataByColumns = {\n    type: 'columns',\n    values: Record<string, DataValue[]>,\n    id: string\n}\nexport type DataSet = DataFrame | DataByColumns;\nexport const NO_GROUPED = Symbol('noGrouped');\nexport type GroupKey = string | typeof NO_GROUPED;\nexport type RowIndex = number;\ntype RowsGroup = Record<\n    GroupKey,\n    {\n        rowIndexes: Uint32Array;\n        grouped: RowsGroup;\n    }\n>;\n\nfunction isDataByColumns (data:DataSet): data is DataByColumns {\n    return 'type' in data && data.type === 'columns';\n}\n\ntype ColumnName = string;\n\nconst EMPTY_INDEXES = new Uint32Array(0);\n\nexport class DataFrame {\n    static toCategory = (value: DataValue): string => String(value);\n\n    readonly id: string;\n    // input data grouped by columns\n    readonly data: Record<string, DataValue[]>;\n    readonly rowsCount: number;\n    readonly columnNames: ColumnName[];\n    readonly rowIndexes: Uint32Array;\n\n    readonly mapColumnCategories: Map<ColumnName, Category[]> = new Map();\n    readonly mapColumnCategoriesRowIndexes: Map<ColumnName, Map<Category, number>> = new Map();\n\n    rowsGrouped?: RowsGroup;\n\n    static from (data: DataSet):DataFrame {\n        if (data instanceof DataFrame) {\n            return data;\n        } else if (isDataByColumns(data)) {\n            return new DataFrame(data.id, data.values);\n        } else {\n            exhaustive(data, 'Unknown input data format');\n        }\n    }\n\n    constructor(id: string, data: Record<string, DataValue[]>) {\n        this.id = id;\n        this.data = data;\n        this.columnNames = Object.keys(data);\n        this.rowsCount = this.columnNames.length ? data[this.columnNames[0]].length : 0;\n        this.rowIndexes = new Uint32Array(Array.from({length: this.rowsCount}, (_, i) => i));\n    }\n\n    getColumn(key: string): DataValue[] {\n        return this.data[key];\n    }\n\n    getColumnValue(key: string, index: number): DataValue {\n        return this.data[key]?.[index];\n    }\n\n    getColumnValueCategory(key: string, index: number): Category {\n        return DataFrame.toCategory(this.getColumnValue(key, index));\n    }\n\n    getColumnCategories(key: string, ignoreNull = true): Category[] {\n        if (!this.mapColumnCategories.has(key)) {\n            this.computeColumnCategories(key);\n        }\n\n        const categories = this.mapColumnCategories.get(key) ?? [];\n        return ignoreNull && categories && categories.length > 0 && categories[categories.length - 1] === 'null'\n            ? categories.slice(0, -1) // full copy without null to heavy for large datasets\n            : categories; \n    }\n\n    getColumnCategoryRowIndex(key: string, value: Category): RowIndex {\n        const rowIndex = this.mapColumnCategoriesRowIndexes.get(key)?.get(value);\n        \n        if (rowIndex === undefined) {\n            throw new Error(`Category ${value} not found in column ${key}`);\n        }\n\n        return rowIndex;\n    }\n\n    private computeColumnCategories(key: ColumnName) {\n        if (!this.columnNames.includes(key)) {\n            throw new Error(`Column ${key} does not exist`);\n        }\n        \n        const columnData = this.getColumn(key);\n        const uniqValues = new Set<DataValue>();\n        const categories: string[] = [];\n        const categoriesIndexes = new Map<string, number>();\n        let nullIdx = -1;\n        for (let i = 0; i < columnData.length; i++) {\n            const value = columnData[i];\n            if (uniqValues.has(value)) {\n                continue;\n            }\n            uniqValues.add(value);\n            if (value === null) {\n                nullIdx = i;\n                continue;\n            }\n            const category = DataFrame.toCategory(value);\n            categories.push(category);\n            categoriesIndexes.set(category, i);\n        }\n        if (nullIdx !== -1) {\n            categories.push('null');\n            categoriesIndexes.set('null', nullIdx);\n        }\n\n        this.mapColumnCategories.set(key, categories);\n        this.mapColumnCategoriesRowIndexes.set(key, categoriesIndexes);\n    }\n\n    setGrouping(groupingColumnIds: (string | null)[], groupingKeys?: (GroupKey[] | undefined)[]) { \n        const root = {grouped: {} as RowsGroup, rowIndexes: this.rowIndexes};\n        let groups: RowsGroup[keyof RowsGroup][] = [root];\n        groupingColumnIds.forEach((column, idx) => {\n            const keys: GroupKey[] = column === null ? [NO_GROUPED] : (groupingKeys?.[idx] ?? this.getColumnCategories(column, false));\n            const nextGroups: RowsGroup[keyof RowsGroup][] = [];\n            groups.forEach(group => {\n                if (column === null) {\n                    group.grouped = {\n                        [NO_GROUPED]: {\n                            rowIndexes: group.rowIndexes,\n                            grouped: {} as RowsGroup,\n                        },\n                    };\n                    nextGroups.push(group.grouped[NO_GROUPED]);\n                } else {\n                    const groupedBy = groupBy(group.rowIndexes, idx => this.getColumnValueCategory(column, idx));\n                    group.grouped = keys.reduce((res, key) => {\n                        res[key] = {\n                            rowIndexes: new Uint32Array(groupedBy[key as string] ?? []),\n                            grouped: {} as RowsGroup,\n                        };\n                        nextGroups.push(res[key]);\n                        return res;\n                    }, {} as RowsGroup);\n                }\n            });\n            groups = nextGroups;\n        });\n        this.rowsGrouped = root.grouped;\n    }\n\n    // TODO: fix all places where this method is used\n    getColumnByGrouping(groupingKeys: GroupKey[], keyYColumn: string): number[] {\n        if (!this.rowsGrouped) {\n            return [];\n        }\n        if (!groupingKeys.length) {\n            return Array.from(this.rowIndexes).map(idx => Number(this.getColumnValue(keyYColumn, idx)));\n        }\n        let result: {grouped: RowsGroup; rowIndexes: Uint32Array} = {grouped: this.rowsGrouped, rowIndexes: this.rowIndexes};\n        groupingKeys.forEach(key => {\n            const nextGroup = result.grouped[key ?? 'null'];\n            if (!nextGroup) {\n                return [];\n            }\n            result = nextGroup;\n        });\n        return Array.from(result.rowIndexes).map(idx => Number(this.getColumnValue(keyYColumn, idx)));\n    }\n\n    // TODO: fix all places where this method is used\n    getRowsByGrouping(groupingKeys: GroupKey[]): Uint32Array {\n        if (!this.rowsGrouped) {\n            return EMPTY_INDEXES;\n        }\n        if (!groupingKeys.length) {\n            return this.rowIndexes;\n        }\n        let result: {grouped: RowsGroup; rowIndexes: Uint32Array} = {grouped: this.rowsGrouped, rowIndexes: this.rowIndexes};\n        for (const key of groupingKeys) {\n            const nextGroup = result.grouped[key];\n            if (!nextGroup) {\n                return EMPTY_INDEXES;\n            }\n            result = nextGroup;\n        }\n        return result.rowIndexes;\n    }\n}\n"],"mappings":";;AAUA,MAAa,IAAa,OAAO,YAAY;AAW7C,SAAS,EAAiB,GAAqC;AAC3D,QAAO,UAAU,KAAQ,EAAK,SAAS;;AAK3C,IAAM,IAAgB,IAAI,aAAc,EAE3B,IAAb,MAAa,EAAU;CACnB,OAAO,cAAc,MAA6B,OAAO,EAAM;CAE/D;CAEA;CACA;CACA;CACA;CAEA,sCAA4D,IAAI,KAAK;CACrE,gDAAiF,IAAI,KAAK;CAE1F;CAEA,OAAO,KAAM,GAAyB;AAClC,MAAI,aAAgB,EAChB,QAAO;MACA,EAAgB,EAAK,CAC5B,QAAO,IAAI,EAAU,EAAK,IAAI,EAAK,OAAO;AAE1C,IAAW,GAAM,4BAA4B;;CAIrD,YAAY,GAAY,GAAmC;AAKvD,EAJA,KAAK,KAAK,GACV,KAAK,OAAO,GACZ,KAAK,cAAc,OAAO,KAAK,EAAK,EACpC,KAAK,YAAY,KAAK,YAAY,SAAS,EAAK,KAAK,YAAY,IAAI,SAAS,GAC9E,KAAK,aAAa,IAAI,YAAY,MAAM,KAAK,EAAC,QAAQ,KAAK,WAAU,GAAG,GAAG,MAAM,EAAE,CAAC;;CAGxF,UAAU,GAA0B;AAChC,SAAO,KAAK,KAAK;;CAGrB,eAAe,GAAa,GAA0B;AAClD,SAAO,KAAK,KAAK,KAAO;;CAG5B,uBAAuB,GAAa,GAAyB;AACzD,SAAO,EAAU,WAAW,KAAK,eAAe,GAAK,EAAM,CAAC;;CAGhE,oBAAoB,GAAa,IAAa,IAAkB;AAC5D,EAAK,KAAK,oBAAoB,IAAI,EAAI,IAClC,KAAK,wBAAwB,EAAI;EAGrC,IAAM,IAAa,KAAK,oBAAoB,IAAI,EAAI,IAAI,EAAE;AAC1D,SAAO,KAAc,KAAc,EAAW,SAAS,KAAK,EAAW,EAAW,SAAS,OAAO,SAC5F,EAAW,MAAM,GAAG,GAAG,GACvB;;CAGV,0BAA0B,GAAa,GAA2B;EAC9D,IAAM,IAAW,KAAK,8BAA8B,IAAI,EAAI,EAAE,IAAI,EAAM;AAExE,MAAI,MAAa,KAAA,EACb,OAAU,MAAM,YAAY,EAAM,uBAAuB,IAAM;AAGnE,SAAO;;CAGX,wBAAgC,GAAiB;AAC7C,MAAI,CAAC,KAAK,YAAY,SAAS,EAAI,CAC/B,OAAU,MAAM,UAAU,EAAI,iBAAiB;EAGnD,IAAM,IAAa,KAAK,UAAU,EAAI,EAChC,oBAAa,IAAI,KAAgB,EACjC,IAAuB,EAAE,EACzB,oBAAoB,IAAI,KAAqB,EAC/C,IAAU;AACd,OAAK,IAAI,IAAI,GAAG,IAAI,EAAW,QAAQ,KAAK;GACxC,IAAM,IAAQ,EAAW;AACzB,OAAI,EAAW,IAAI,EAAM,CACrB;AAGJ,OADA,EAAW,IAAI,EAAM,EACjB,MAAU,MAAM;AAChB,QAAU;AACV;;GAEJ,IAAM,IAAW,EAAU,WAAW,EAAM;AAE5C,GADA,EAAW,KAAK,EAAS,EACzB,EAAkB,IAAI,GAAU,EAAE;;AAQtC,EANI,MAAY,OACZ,EAAW,KAAK,OAAO,EACvB,EAAkB,IAAI,QAAQ,EAAQ,GAG1C,KAAK,oBAAoB,IAAI,GAAK,EAAW,EAC7C,KAAK,8BAA8B,IAAI,GAAK,EAAkB;;CAGlE,YAAY,GAAsC,GAA2C;EACzF,IAAM,IAAO;GAAC,SAAS,EAAE;GAAe,YAAY,KAAK;GAAW,EAChE,IAAuC,CAAC,EAAK;AA2BjD,EA1BA,EAAkB,SAAS,GAAQ,MAAQ;GACvC,IAAM,IAAmB,MAAW,OAAO,CAAC,EAAW,GAAI,IAAe,MAAQ,KAAK,oBAAoB,GAAQ,GAAM,EACnH,IAA2C,EAAE;AAsBnD,GArBA,EAAO,SAAQ,MAAS;AACpB,QAAI,MAAW,KAOX,CANA,EAAM,UAAU,GACX,IAAa;KACV,YAAY,EAAM;KAClB,SAAS,EAAE;KACd,EACJ,EACD,EAAW,KAAK,EAAM,QAAQ,GAAY;SACvC;KACH,IAAM,IAAY,EAAQ,EAAM,aAAY,MAAO,KAAK,uBAAuB,GAAQ,EAAI,CAAC;AAC5F,OAAM,UAAU,EAAK,QAAQ,GAAK,OAC9B,EAAI,KAAO;MACP,YAAY,IAAI,YAAY,EAAU,MAAkB,EAAE,CAAC;MAC3D,SAAS,EAAE;MACd,EACD,EAAW,KAAK,EAAI,GAAK,EAClB,IACR,EAAE,CAAc;;KAEzB,EACF,IAAS;IACX,EACF,KAAK,cAAc,EAAK;;CAI5B,oBAAoB,GAA0B,GAA8B;AACxE,MAAI,CAAC,KAAK,YACN,QAAO,EAAE;AAEb,MAAI,CAAC,EAAa,OACd,QAAO,MAAM,KAAK,KAAK,WAAW,CAAC,KAAI,MAAO,OAAO,KAAK,eAAe,GAAY,EAAI,CAAC,CAAC;EAE/F,IAAI,IAAwD;GAAC,SAAS,KAAK;GAAa,YAAY,KAAK;GAAW;AAQpH,SAPA,EAAa,SAAQ,MAAO;GACxB,IAAM,IAAY,EAAO,QAAQ,KAAO;AACxC,OAAI,CAAC,EACD,QAAO,EAAE;AAEb,OAAS;IACX,EACK,MAAM,KAAK,EAAO,WAAW,CAAC,KAAI,MAAO,OAAO,KAAK,eAAe,GAAY,EAAI,CAAC,CAAC;;CAIjG,kBAAkB,GAAuC;AACrD,MAAI,CAAC,KAAK,YACN,QAAO;AAEX,MAAI,CAAC,EAAa,OACd,QAAO,KAAK;EAEhB,IAAI,IAAwD;GAAC,SAAS,KAAK;GAAa,YAAY,KAAK;GAAW;AACpH,OAAK,IAAM,KAAO,GAAc;GAC5B,IAAM,IAAY,EAAO,QAAQ;AACjC,OAAI,CAAC,EACD,QAAO;AAEX,OAAS;;AAEb,SAAO,EAAO"}

package/dist/MiPlots.js

@@ -1,73 +1,61 @@
-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 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";
-import { ChartScatterplotUmap as w } from "./scatterplot-umap/index.js";
-import { ChartBubble as l } from "./bubble/index.js";
-import { DataFrame as i } from "./DataFrame.js";
-import { exhaustive as d } from "./utils/index.js";
-class c {
-  constructor(t) {
-    o(this, "node");
-    o(this, "chart");
-    this.chart = t;
-  }
-  static createChart(t, r, a) {
-    const { type: h } = r;
-    if (h === "discrete")
-      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")
-      return new w(t, r, a);
-    if (h === "heatmap")
-      return new f(t, r, a);
-    if (h === "histogram")
-      return new s(t, r, a);
-    if (h === "bubble")
-      return new l(t, r, a);
-    d(h, `Unknown chart type: ${h}`);
-  }
-  static newPlot(t, r, a) {
-    const h = i.from(t);
-    return new this(c.createChart(h, r, a));
-  }
-  get calculatedData() {
-    return this.chart.calculatedData;
-  }
-  get hasError() {
-    return this.chart.hasError;
-  }
-  get errorInfo() {
-    return this.chart.errorInfo;
-  }
-  mount(t) {
-    this.node = t, this.chart.mount(t);
-  }
-  unmount() {
-    delete this.node, this.chart.unmount();
-  }
-  updateSettingsAndData(t, r) {
-    if (r.type !== this.chart.settings.type) {
-      const a = c.createChart(this.chart.data, r);
-      this.node ? (this.chart.unmount(), this.chart = a, this.chart.mount(this.node)) : this.chart = a;
-    } else
-      this.chart.updateSettingsAndData(i.from(t), r);
-  }
-  updateChartState(t, r) {
-    this.chart.updateChartState(t, r);
-  }
-  export() {
-    return this.chart.export();
-  }
-}
-export {
-  c as MiPlots
+import { exhaustive as e } from "./utils/index.js";
+import { ChartDendro as t } from "./dendro/index.js";
+import { DataFrame as n } from "./DataFrame.js";
+import { ChartDiscrete as r } from "./discrete/index.js";
+import { ChartHeatmap as i } from "./heatmap/index.js";
+import { ChartHistogram as a } from "./histogram/index.js";
+import { ChartScatterplot as o } from "./scatterplot/index.js";
+import { ChartScatterplotUmap as s } from "./scatterplot-umap/index.js";
+import { ChartBubble as c } from "./bubble/index.js";
+var l = class l {
+	node;
+	chart;
+	static createChart(n, l, u) {
+		let { type: d } = l;
+		if (d === "discrete") return new r(n, l, u);
+		if (d === "dendro") return new t(n, l, u);
+		if (d === "scatterplot") return new o(n, l, u);
+		if (d === "scatterplot-umap") return new s(n, l, u);
+		if (d === "heatmap") return new i(n, l, u);
+		if (d === "histogram") return new a(n, l, u);
+		if (d === "bubble") return new c(n, l, u);
+		e(d, `Unknown chart type: ${d}`);
+	}
+	static newPlot(e, t, r) {
+		let i = n.from(e);
+		return new this(l.createChart(i, t, r));
+	}
+	constructor(e) {
+		this.chart = e;
+	}
+	get calculatedData() {
+		return this.chart.calculatedData;
+	}
+	get hasError() {
+		return this.chart.hasError;
+	}
+	get errorInfo() {
+		return this.chart.errorInfo;
+	}
+	mount(e) {
+		this.node = e, this.chart.mount(e);
+	}
+	unmount() {
+		delete this.node, this.chart.unmount();
+	}
+	updateSettingsAndData(e, t) {
+		if (t.type !== this.chart.settings.type) {
+			let e = l.createChart(this.chart.data, t);
+			this.node ? (this.chart.unmount(), this.chart = e, this.chart.mount(this.node)) : this.chart = e;
+		} else this.chart.updateSettingsAndData(n.from(e), t);
+	}
+	updateChartState(e, t) {
+		this.chart.updateChartState(e, t);
+	}
+	export() {
+		return this.chart.export();
+	}
 };
-//# sourceMappingURL=MiPlots.js.map
+export { l as MiPlots };
+
+//# sourceMappingURL=MiPlots.js.map

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    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;"}
+{"version":3,"file":"MiPlots.js","names":[],"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"],"mappings":";;;;;;;;;AAsBA,IAAa,IAAb,MAAa,EAAkC;CAC3C;CACA;CAEA,OAAe,YACX,GACA,GACA,GACa;EACb,IAAM,EAAC,YAAQ;AAEf,MAAI,MAAS,WACT,QAAO,IAAI,EAAc,GAAM,GAAU,EAAuC;AAGpF,MAAI,MAAS,SACT,QAAO,IAAI,EAAY,GAAM,GAAU,EAAqC;AAGhF,MAAI,MAAS,cACT,QAAO,IAAI,EAAiB,GAAM,GAAU,EAA0C;AAG1F,MAAI,MAAS,mBACT,QAAO,IAAI,EAAqB,GAAM,GAAU,EAA0C;AAG9F,MAAI,MAAS,UACT,QAAO,IAAI,EAAa,GAAM,GAAU,EAAsC;AAGlF,MAAI,MAAS,YACT,QAAO,IAAI,EAAe,GAAM,GAAU,EAAwC;AAGtF,MAAI,MAAS,SACT,QAAO,IAAI,EAAY,GAAM,GAAU,EAAqC;AAGhF,IAAW,GAAM,uBAAuB,IAAO;;CAGnD,OAAO,QAAQ,GAAe,GAAoB,GAAsD;EACpG,IAAM,IAAY,EAAU,KAAK,EAAK;AACtC,SAAO,IAAI,KAAK,EAAQ,YAAY,GAAW,GAAU,EAAc,CAAC;;CAG5E,YAAY,GAAsB;AAC9B,OAAK,QAAQ;;CAGjB,IAAI,iBAAiB;AACjB,SAAO,KAAK,MAAM;;CAGtB,IAAI,WAAW;AACX,SAAO,KAAK,MAAM;;CAGtB,IAAI,YAAY;AACZ,SAAO,KAAK,MAAM;;CAGtB,MAAM,GAAmB;AAErB,EADA,KAAK,OAAO,GACZ,KAAK,MAAM,MAAM,EAAK;;CAG1B,UAAU;AAEN,EADA,OAAO,KAAK,MACZ,KAAK,MAAM,SAAS;;CAGxB,sBAAsB,GAAe,GAAoB;AACrD,MAAI,EAAS,SAAS,KAAK,MAAM,SAAS,MAAM;GAC5C,IAAM,IAAW,EAAQ,YAAY,KAAK,MAAM,MAAM,EAAS;AAE/D,GAAI,KAAK,QACL,KAAK,MAAM,SAAS,EACpB,KAAK,QAAQ,GACb,KAAK,MAAM,MAAM,KAAK,KAAK,IAE3B,KAAK,QAAQ;QAGjB,MAAK,MAAM,sBAAsB,EAAU,KAAK,EAAK,EAAE,EAAS;;CAIxE,iBAAiB,GAAe,GAAgB;AAC5C,OAAK,MAAM,iBAAiB,GAAO,EAAM;;CAG7C,SAAS;AACL,SAAO,KAAK,MAAM,QAAQ"}

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

@@ -0,0 +1 @@
+{"version":3,"file":"getClusters-BhuSlPP7.js","names":[],"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});"],"x_google_ignoreList":[0,1],"mappings":"YACA,IAEM,EAAM,EAAI,WAEhB,SAAwB,EAAI,EAAO,KAAK,QAAQ,CAAE,CAChD,IAAI,GAAS,GAAK,GAAQ,EAAO,EAAI,EAAO,EAAM,KAAK,IAAI,EAAK,EAAI,EACpE,WAAc,EAAQ,QAAM,EAAQ,WAAM,EAAG,GAAO,IAAU;;;;;;ICUnD,EAAc,OAAO,gBAAe,CACpC,EAAiB,OAAO,mBAAkB,CAC1C,EAAe,OAAO,uBAAsB,CAC5C,EAAY,OAAO,oBAAmB,CAE7C,EAAc,OAAO,iBAAiB,CAuJtC,EAAY,GACf,OAAO,GAAQ,YAAY,GAAiB,OAAO,GAAQ,WAmGjD,EAAmB,IAAI,IAGlC,CACA,CAAC,QArEgE,CACjE,UAAY,GACV,EAAS,EAAI,EAAK,EAAoB,GACxC,UAAU,EAAG,CACX,GAAM,CAAE,QAAO,SAAU,IAAI,eAE7B,OADA,EAAO,EAAK,EAAM,CACX,CAAC,EAAO,CAAC,EAAM,CAAC,EAEzB,YAAY,EAAI,CAEd,OADA,EAAK,OAAO,CACL,EAAK,EAAK,EAEpB,CAyDgC,CAC/B,CAAC,QAtCC,CACF,UAAY,GACV,EAAS,EAAM,EAAI,KAAe,EACpC,UAAU,CAAE,SAAO,CACjB,IAAI,EAaJ,MAZA,CAUE,EAVE,aAAiB,MACN,CACX,QAAS,GACT,MAAO,CACL,QAAS,EAAM,QACf,KAAM,EAAM,KACZ,MAAO,EAAM,MACd,CACF,CAEY,CAAE,QAAS,GAAO,QAAO,CAEjC,CAAC,EAAY,EAAE,CAAC,EAEzB,YAAY,EAAU,CAOpB,MANI,EAAW,QACP,OAAO,OACP,MAAM,EAAW,MAAM,QAAQ,CACnC,EAAW,MACZ,CAEG,EAAW,OAEpB,CAUgC,CAChC,CAAA,CAED,SAAS,EACP,EACA,EAAc,CAEd,IAAK,IAAM,KAAiB,EAI1B,GAHI,IAAW,GAAiB,IAAkB,KAG9C,aAAyB,QAAU,EAAc,KAAK,EAAO,CAC/D,MAAO,GAGX,MAAO,GAGH,SAAU,EACd,EACA,EAAe,WACf,EAAsC,CAAC,IAAI,CAAA,CAE3C,EAAG,iBAAiB,UAAW,SAAS,EAAS,EAAgB,CAC/D,GAAI,CAAC,GAAM,CAAC,EAAG,KACb,OAEF,GAAI,CAAC,EAAgB,EAAgB,EAAG,OAAO,CAAE,CAC/C,QAAQ,KAAK,mBAAmB,EAAG,OAA2B,qBAAC,CAC/D,OAEF,GAAM,CAAE,KAAI,OAAM,QAAM,OAAA,OAAA,CACtB,KAAM,EAAc,CAChB,CAAA,EAAG,KACR,CACK,GAAgB,EAAG,KAAK,cAAgB,EAAE,EAAE,IAAI,EAAc,CAChE,EACJ,GAAI,CACF,IAAM,EAAS,EAAK,MAAM,EAAG,GAAG,CAAC,QAAQ,EAAK,IAAS,EAAI,GAAO,EAAI,CAChE,EAAW,EAAK,QAAQ,EAAK,IAAS,EAAI,GAAO,EAAI,CAC3D,OAAQ,EAAR,CACE,IAAA,MAEI,EAAc,EAEhB,MACF,IAAA,MAEI,EAAO,EAAK,MAAM,GAAG,CAAC,IAAM,EAAc,EAAG,KAAK,MAAM,CACxD,EAAc,GAEhB,MACF,IAAA,QAEI,EAAc,EAAS,MAAM,EAAQ,EAAa,CAEpD,MACF,IAAA,YAGI,EAAc,EADA,IAAI,EAAS,GAAG,EAAa,CACjB,CAE5B,MACF,IAAA,WACE,CACE,GAAM,CAAE,QAAO,SAAU,IAAI,eAC7B,EAAO,EAAK,EAAM,CAClB,EAAc,EAAS,EAAO,CAAC,EAAM,CAAC,CAExC,MACF,IAAA,UAEI,EAAc,IAAA,GAEhB,MACF,QACE,cAEG,EAAO,CACd,EAAc,CAAE,SAAQ,GAAc,EAAG,CAE3C,QAAQ,QAAQ,EAAY,CACzB,MAAO,IACC,CAAE,SAAQ,GAAc,EAAG,EAClC,CACD,KAAM,GAAe,CACpB,GAAM,CAAC,EAAW,GAAiB,EAAY,EAAY,CAC3D,EAAG,YAAiB,OAAA,OAAA,OAAA,OAAA,EAAA,CAAA,EAAS,CAAA,CAAE,KAAE,CAAA,CAAI,EAAc,CAC/C,IAAI,YAEN,EAAG,oBAAoB,UAAW,EAAgB,CAClD,EAAc,EAAG,CACb,KAAa,GAAO,OAAO,EAAI,IAAe,YAChD,EAAI,IAAY,GAGpB,CACD,MAAO,GAAS,CAEf,GAAM,CAAC,EAAW,GAAiB,EAAY,CAC7C,MAAW,UAAU,8BAA8B,EAClD,GAAc,EAChB,CAAC,CACF,EAAG,YAAiB,OAAA,OAAA,OAAA,OAAA,EAAA,CAAA,EAAS,CAAA,CAAE,KAAE,CAAA,CAAI,EAAc,EACnD,EACG,CACL,EAAG,OACL,EAAG,OAAO,CAId,SAAS,EAAc,EAAkB,CACvC,OAAO,EAAS,YAAY,OAAS,cAGvC,SAAS,EAAc,EAAkB,CACnC,EAAc,EAAS,EAAE,EAAS,OAAO,CAG/B,SAAA,EAAQ,EAAc,EAAY,CAChD,IAAM,EAAyC,IAAI,IAmBnD,OAjBA,EAAG,iBAAiB,UAAW,SAAuB,EAAS,CAC7D,GAAM,CAAE,QAAS,EACjB,GAAI,CAAC,GAAQ,CAAC,EAAK,GACjB,OAEF,IAAM,EAAW,EAAiB,IAAI,EAAK,GAAG,CACzC,KAIL,GAAI,CACF,EAAS,EAAK,QACN,CACR,EAAiB,OAAO,EAAK,GAAG,GAElC,CAEK,EAAe,EAAI,EAAkB,EAAE,CAAE,EAAc,CAGhE,SAAS,EAAqB,EAAmB,CAC/C,GAAI,EACF,MAAU,MAAM,6CAA6C,CAIjE,SAAS,EAAgB,EAAY,CACnC,OAAO,EAAuB,EAAI,IAAI,IAAO,CAC3C,KAAyB,UAC1B,CAAC,CAAC,SAAU,CACX,EAAc,EAAG,EACjB,CAcJ,IAAM,EAAe,IAAI,QACnB,EACJ,yBAA0B,YAC1B,IAAI,qBAAsB,GAAgB,CACxC,IAAM,GAAY,EAAa,IAAI,EAAG,EAAI,GAAK,EAC/C,EAAa,IAAI,EAAI,EAAS,CAC1B,IAAa,GACf,EAAgB,EAAG,EAErB,CAEJ,SAAS,EAAc,EAAe,EAAY,CAChD,IAAM,GAAY,EAAa,IAAI,EAAG,EAAI,GAAK,EAC/C,EAAa,IAAI,EAAI,EAAS,CAC1B,GACF,EAAgB,SAAS,EAAO,EAAI,EAAM,CAI9C,SAAS,EAAgB,EAAa,CAChC,GACF,EAAgB,WAAW,EAAM,CAIrC,SAAS,EACP,EACA,EACA,EAAqC,EAAE,CACvC,EAAiB,UAAA,GAAc,CAE/B,IAAI,EAAkB,GAChB,EAAQ,IAAI,MAAM,EAAQ,CAC9B,IAAI,EAAS,EAAI,CAEf,GADA,EAAqB,EAAgB,CACjC,IAAS,EACX,UAAY,CACV,EAAgB,EAAM,CACtB,EAAgB,EAAG,CACnB,EAAiB,OAAO,CACxB,EAAkB,IAGtB,GAAI,IAAS,OAAQ,CACnB,GAAI,EAAK,SAAW,EAClB,MAAO,CAAE,SAAY,EAAO,CAE9B,IAAM,EAAI,EAAuB,EAAI,EAAkB,CACrD,KAAqB,MACrB,KAAM,EAAK,IAAK,GAAM,EAAE,UAAU,CAAC,CACpC,CAAC,CAAC,KAAK,EAAc,CACtB,OAAO,EAAE,KAAK,KAAK,EAAE,CAEvB,OAAO,EAAY,EAAI,EAAkB,CAAC,GAAG,EAAM,EAAK,CAAC,EAE3D,IAAI,EAAS,EAAM,EAAQ,CACzB,EAAqB,EAAgB,CAGrC,GAAM,CAAC,EAAO,GAAiB,EAAY,EAAS,CACpD,OAAO,EACL,EACA,EACA,CACE,KAAqB,MACrB,KAAM,CAAC,GAAG,EAAM,EAAK,CAAC,IAAK,GAAM,EAAE,UAAU,CAAC,CAC9C,QACD,CACD,EACD,CAAC,KAAK,EAAqB,EAE9B,MAAM,EAAS,EAAU,EAAe,CACtC,EAAqB,EAAgB,CACrC,IAAM,EAAO,EAAK,EAAK,OAAS,GAChC,GAAK,IAAiB,EACpB,OAAO,EAAuB,EAAI,EAAkB,CAClD,KAA0B,WAC3B,CAAC,CAAC,KAAK,EAAc,CAGxB,GAAI,IAAS,OACX,OAAO,EAAY,EAAI,EAAkB,EAAK,MAAM,EAAG,GAAG,CAAC,CAE7D,GAAM,CAAC,EAAc,GAAiB,EAAiB,EAAgB,CACvE,OAAO,EACL,EACA,EACA,CACE,KAAuB,QACvB,KAAM,EAAK,IAAK,GAAM,EAAE,UAAU,CAAC,CACnC,eACD,CACD,EACD,CAAC,KAAK,EAAc,EAEvB,UAAU,EAAS,EAAe,CAChC,EAAqB,EAAgB,CACrC,GAAM,CAAC,EAAc,GAAiB,EAAiB,EAAgB,CACvE,OAAO,EACL,EACA,EACA,CACE,KAA2B,YAC3B,KAAM,EAAK,IAAK,GAAM,EAAE,UAAU,CAAC,CACnC,eACD,CACD,EACD,CAAC,KAAK,EAAc,EAExB,CAAC,CAEF,OADA,EAAc,EAAO,EAAG,CACjB,EAGT,SAAS,EAAU,EAAgB,CACjC,OAAO,MAAM,UAAU,OAAO,MAAM,EAAE,CAAE,EAAI,CAG9C,SAAS,EAAiB,EAAmB,CAC3C,IAAM,EAAY,EAAa,IAAI,EAAY,CAC/C,MAAO,CAAC,EAAU,IAAK,GAAM,EAAE,GAAG,CAAE,EAAO,EAAU,IAAK,GAAM,EAAE,GAAG,CAAC,CAAC,CAGzE,IAAM,EAAgB,IAAI,QACV,SAAA,EAAY,EAAQ,EAAyB,CAE3D,OADA,EAAc,IAAI,EAAK,EAAU,CAC1B,EAGH,SAAU,EAAoB,EAAM,CACxC,OAAO,OAAO,OAAO,EAAK,EAAG,GAAc,GAAM,CAAQ,CAgB3D,SAAS,EAAY,EAAU,CAC7B,IAAK,GAAM,CAAC,EAAM,KAAY,EAC5B,GAAI,EAAQ,UAAU,EAAM,CAAE,CAC5B,GAAM,CAAC,EAAiB,GAAiB,EAAQ,UAAU,EAAM,CACjE,MAAO,CACL,CACE,KAA2B,UAC3B,OACA,MAAO,EACR,CACD,EACD,CAGL,MAAO,CACL,CACE,KAAuB,MACvB,QACD,CACD,EAAc,IAAI,EAAM,EAAI,EAAE,CAC/B,CAGH,SAAS,EAAc,EAAgB,CACrC,OAAQ,EAAM,KAAd,CACE,IAAA,UACE,OAAO,EAAiB,IAAI,EAAM,KAAM,CAAC,YAAY,EAAM,MAAM,CACnE,IAAA,MACE,OAAO,EAAM,OAInB,SAAS,EACP,EACA,EACA,EACA,EAA0B,CAE1B,OAAO,IAAI,QAAS,GAAW,CAC7B,IAAM,EAAK,GAAc,CACzB,EAAiB,IAAI,EAAI,EAAQ,CAC7B,EAAG,OACL,EAAG,OAAO,CAEZ,EAAG,YAAc,OAAA,OAAA,CAAA,KAAE,CAAK,EAAG,CAAI,EAAU,EAC3C,CAGF,SAAS,GAAY,CACnB,MAAO,MAAY,CAChB,KAAK,EAAE,CACP,QAAU,KAAK,MAAM,KAAK,QAAQ,WAA2B,CAAC,SAAS,GAAG,CAAC,CAC3E,KAAK,IAAI,CCpnBd,SAAgB,EAAiB,EAAa,EAAa,CACvD,IAAI,EAAI,EAER,IAAK,IAAI,EAAI,EAAG,EAAI,EAAE,OAAQ,IAC1B,IAAM,EAAE,GAAK,EAAE,KAAO,EAAE,GAAK,EAAE,IAEnC,OAAO,EAWX,SAAgB,EAAU,EAAa,EAAa,CAChD,OAAO,KAAK,KAAK,EAAiB,EAAG,EAAE,CAAC,CAc5C,IAAa,GAAkB,EAAgB,EAAgB,IAAkD,CAC7G,IAAI,EAAW,EAEf,IAAK,IAAM,KAAK,EACZ,IAAK,IAAM,KAAK,EAAM,GAAY,EAAY,EAAG,EAAE,CAIvD,OAAO,EAAW,EAAK,OAAS,EAAK,QAa5B,GAAmB,EAAgB,EAAgB,IAAkD,CAC9G,IAAI,EAAW,EAEf,IAAK,IAAM,KAAK,EACZ,IAAK,IAAM,KAAK,EAAM,EAAW,KAAK,IAAI,EAAU,EAAY,EAAG,EAAE,CAAC,CAG1E,OAAO,GAaE,GAAiB,EAAgB,EAAgB,IAAkD,CAC5G,IAAI,EAAW,IAEf,IAAK,IAAM,KAAK,EACZ,IAAK,IAAM,KAAK,EAAM,EAAW,KAAK,IAAI,EAAU,EAAY,EAAG,EAAE,CAAC,CAG1E,OAAO,GAUX,SAAS,EAAa,EAA4B,CAC9C,OAAQ,EAAR,CACI,IAAK,UAAW,OAAO,EACvB,IAAK,WAAY,OAAO,EACxB,IAAK,SAAU,OAAO,EACtB,QAAS,OAAO,GASxB,SAAS,EAAc,EAA8B,CACjD,OAAQ,EAAR,CACI,IAAK,YAAa,OAAO,EACzB,IAAK,mBAAoB,OAAO,EAChC,QAAS,OAAO,GAaxB,SAAgB,EAAsB,EAA4B,CAC9D,IAAM,EAA2B,EAAE,CAE7B,EAAY,GAAe,CAC7B,GAAI,EAAE,SAAS,SAAW,EAEtB,EAAe,KAAK,GAAG,EAAE,QAAQ,MAGjC,IAAK,IAAM,KAAS,EAAE,SAClB,EAAS,EAAM,EAM3B,OADA,EAAS,EAAQ,CACV,EAGX,IAAM,EAAmB,IAGzB,SAAgB,EACZ,EACA,EAAmC,YACnC,EAAiC,UAC1B,CACP,GAAI,EAAW,QAAU,EACrB,OAAO,EAAY,EAAY,EAAc,EAAY,CAG7D,IAAM,EAAI,EAAW,OACf,EAAY,EAAU,EAAE,CAExB,EAAgB,IAAI,IAC1B,KAAO,EAAc,KAAO,GACxB,EAAc,IAAI,KAAK,MAAM,GAAW,CAAG,EAAE,CAAC,CAGlD,IAAM,EAAqB,MAAM,KAAK,EAAc,CAOpD,OAAO,EAHe,EAHD,EAAmB,IAAI,GAAK,EAAW,GAAG,CAGf,EAAc,EAAY,CAG9B,EAAY,EAAoB,EAAa,CAI7F,SAAS,EACL,EACA,EACA,EACA,EACO,CAGP,IAAM,EAAa,EAAc,EAAa,CACxC,EAAY,IAAI,IAAI,EAAc,CAGlC,EAAc,IAAI,IACxB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAW,OAAQ,IAAK,CACxC,GAAI,EAAU,IAAI,EAAE,CAAE,SAEtB,IAAI,EAAc,IACd,EAAgB,GAEpB,IAAK,IAAM,KAAa,EAAe,CACnC,IAAM,EAAW,EAAW,EAAW,GAAI,EAAW,GAAW,CAC7D,EAAW,IACX,EAAc,EACd,EAAgB,GAIxB,EAAY,IAAI,EAAG,EAAc,CAGrC,OAAO,EAA2B,EAAe,EAAa,EAAc,CAIhF,SAAS,EACL,EACA,EACA,EACO,CAEP,IAAM,EAAkB,IAAI,IACtB,EAAsB,GAAqB,CACzC,EAAQ,QAAQ,SAAW,GAC3B,EAAgB,IAAI,EAAc,EAAQ,QAAQ,IAAK,EAAQ,CAEnE,IAAK,IAAM,KAAS,EAAQ,SACxB,EAAmB,EAAM,EAGjC,EAAmB,EAAc,CAGjC,IAAM,EAA0B,IAAI,IACpC,IAAK,GAAM,CAAC,EAAU,KAAc,EAAa,CAC7C,IAAM,EAAgB,EAAgB,IAAI,EAAU,CACpD,GAAI,EAAe,CACV,EAAwB,IAAI,EAAc,EAC3C,EAAwB,IAAI,EAAe,EAAE,CAAC,CAElD,IAAM,EAAU,EAAwB,IAAI,EAAc,CACtD,GACA,EAAQ,KAAK,EAAS,EAKlC,IAAM,EAAsB,GAAe,CACvC,EAAE,QAAU,EAAE,QAAQ,IAAI,GAAK,EAAc,GAAG,CAChD,IAAK,IAAM,KAAS,EAAE,SAClB,EAAmB,EAAM,EAGjC,EAAmB,EAAc,CACjC,IAAK,GAAM,CAAC,EAAS,KAAmB,EACpC,EAAQ,QAAU,CAAC,GAAG,EAAQ,QAAS,GAAG,EAAe,CAG7D,MAAO,CACH,GAAG,EACH,QAAS,EAAsB,EAAc,CAChD,CA4BL,SAAgB,EAAY,EAAwB,EAAmC,YAAa,EAAiC,UAAoB,CACrJ,IAAM,EAAa,EAAc,EAAa,CACxC,EAAY,EAAa,EAAY,CAErC,EAAI,EAAW,OAKf,EAAsB,EAAE,CAIxB,GAAe,EAAW,IACxB,IAAM,EAAU,GAChB,EAAI,IAAG,CAAC,EAAG,GAAK,CAAC,EAAG,EAAE,EAEnB,EADO,EAAI,EAAK,GAAK,EAAI,GAAM,GAAK,EAAI,EAAI,KAKjD,GAAe,EAAW,EAAW,IAAwB,CAC3D,EAAI,IAAG,CAAC,EAAG,GAAK,CAAC,EAAG,EAAE,EAC1B,IAAM,EAAQ,EAAI,EAAK,GAAK,EAAI,GAAM,GAAK,EAAI,EAAI,GACnD,EAAU,GAAS,GAKvB,IAAK,IAAI,EAAK,EAAG,EAAK,EAAG,IACrB,IAAK,IAAI,EAAK,EAAK,EAAG,EAAK,EAAG,IAAM,CAChC,IAAM,EAAI,EAAW,EAAW,GAAK,EAAW,GAAI,CACpD,EAAY,EAAI,EAAI,EAAE,CAM9B,IAAM,EAAsB,EAAW,KAAK,EAAG,KAAW,CACtD,OAAQ,EACR,QAAS,CAAC,EAAM,CAChB,SAAU,EAAE,CACf,EAAE,CAIH,IAAK,IAAI,EAAY,EAAG,EAAY,GAE5B,KAAa,EAAI,GAFc,IAAa,CAKhD,IAAI,EAAkB,IAClB,EAAW,EACX,EAAW,EAGf,IAAK,IAAI,EAAc,EAAG,EAAc,EAAS,OAAQ,IACrD,IAAK,IAAI,EAAc,EAAc,EAAG,EAAc,EAAS,OAAQ,IAAe,CAElF,IAAM,EAAW,EAAU,EAAS,GAAa,QAAS,EAAS,GAAa,QAAS,EAAY,CAGjG,EAAW,IACX,EAAkB,EAClB,EAAW,EACX,EAAW,GAOvB,IAAM,EAAa,CACf,QAAS,CAAC,GAAG,EAAS,GAAU,QAAS,GAAG,EAAS,GAAU,QAAQ,CACvE,OAAQ,EACR,SAAU,CAAC,EAAS,GAAW,EAAS,GAAU,CACrD,CAKD,EAAS,OAAO,KAAK,IAAI,EAAU,EAAS,CAAE,EAAE,CAChD,EAAS,OAAO,KAAK,IAAI,EAAU,EAAS,CAAE,EAAE,CAChD,EAAS,KAAK,EAAW,CAK7B,IAAM,EAAc,EAAS,GAC7B,MAAO,CACH,GAAG,EACH,QAAS,EAAsB,EAAY,CAC9C,CAGL,EAAO,CAAC,yBAAuB,CAAC"}