@gen-epix/ui-client-casedb 4.0.0

package/dist/_chunks/dashboardStore.js

@@ -0,0 +1,743 @@
+import { h as e } from "./_MapCache.js";
+import { n as t, r as n, t as r } from "./FilterUtil.js";
+import { SELECTION_FILTER_GROUP as i, TREE_FILTER_GROUP as a, t as o } from "../utils/CaseTypeUtil/index.js";
+import { CASEDB_QUERY_KEY as s } from "../constants/query.js";
+import { t as c } from "../utils/CaseUtil/index.js";
+import { STRATIFICATION_MODE as l } from "../models/stratification.js";
+import { StratificationUtil as u } from "../utils/StratificationUtil/index.js";
+import { DASHBOARD_COMPONENT_NAME as d } from "../constants/dashboard.js";
+import { t as ee } from "./vanilla.js";
+import { t as f } from "./last.js";
+import { r as te, t as p } from "./cloneDeep.js";
+import { t as m } from "i18next";
+import { CaseDbCaseApi as ne } from "@gen-epix/api-casedb";
+import { QueryClientService as h } from "@gen-epix/ui/classes/services/QueryClientService";
+import { ObjectUtil as re } from "@gen-epix/ui-core/utils/ObjectUtil";
+import { ConfigService as ie } from "@gen-epix/ui/classes/services/ConfigService";
+import { NotificationService as ae } from "@gen-epix/ui/classes/services/NotificationService";
+import { FILTER_MODE as oe } from "@gen-epix/ui/classes/abstracts/FilterAbstract";
+import { createContext as se } from "react";
+import { AxiosUtil as ce } from "@gen-epix/ui/utils/AxiosUtil";
+import { createTableStoreActions as le, createTableStoreInitialState as ue, createTableStorePersistConfiguration as de } from "@gen-epix/ui/stores/tableStore";
+import { NewickUtil as fe } from "@gen-epix/ui-phylogenetic-tree/utils/NewickUtil";
+import { TreeUtil as g } from "@gen-epix/ui-phylogenetic-tree/utils/TreeUtil";
+//#region ../../node_modules/.pnpm/immer@11.1.9/node_modules/immer/dist/immer.mjs
+var pe = Symbol.for("immer-nothing"), me = Symbol.for("immer-draftable"), _ = Symbol.for("immer-state"), he = process.env.NODE_ENV === "production" ? [] : [
+	function(e) {
+		return `The plugin for '${e}' has not been loaded into Immer. To enable the plugin, import and call \`enable${e}()\` when initializing your application.`;
+	},
+	function(e) {
+		return `produce can only be called on things that are draftable: plain objects, arrays, Map, Set or classes that are marked with '[immerable]: true'. Got '${e}'`;
+	},
+	"This object has been frozen and should not be mutated",
+	function(e) {
+		return "Cannot use a proxy that has been revoked. Did you pass an object from inside an immer function to an async process? " + e;
+	},
+	"An immer producer returned a new value *and* modified its draft. Either return a new value *or* modify the draft.",
+	"Immer forbids circular references",
+	"The first or second argument to `produce` must be a function",
+	"The third argument to `produce` must be a function or undefined",
+	"First argument to `createDraft` must be a plain object, an array, or an immerable object",
+	"First argument to `finishDraft` must be a draft returned by `createDraft`",
+	function(e) {
+		return `'current' expects a draft, got: ${e}`;
+	},
+	"Object.defineProperty() cannot be used on an Immer draft",
+	"Object.setPrototypeOf() cannot be used on an Immer draft",
+	"Immer only supports deleting array indices",
+	"Immer only supports setting array indices and the 'length' property",
+	function(e) {
+		return `'original' expects a draft, got: ${e}`;
+	}
+];
+function v(e, ...t) {
+	if (process.env.NODE_ENV !== "production") {
+		let n = he[e], r = I(n) ? n.apply(null, t) : n;
+		throw Error(`[Immer] ${r}`);
+	}
+	throw Error(`[Immer] minified error nr: ${e}. Full error at: https://bit.ly/3cXEKWf`);
+}
+var y = Object, b = y.getPrototypeOf, x = "constructor", S = "prototype", ge = "configurable", C = "enumerable", w = "writable", T = "value", E = (e) => !!e && !!e[_];
+function D(e) {
+	return e ? ye(e) || M(e) || !!e[me] || !!e[x]?.[me] || N(e) || P(e) : !1;
+}
+var _e = y[S][x].toString(), ve = /* @__PURE__ */ new WeakMap();
+function ye(e) {
+	if (!e || !F(e)) return !1;
+	let t = b(e);
+	if (t === null || t === y[S]) return !0;
+	let n = y.hasOwnProperty.call(t, x) && t[x];
+	if (n === Object) return !0;
+	if (!I(n)) return !1;
+	let r = ve.get(n);
+	return r === void 0 && (r = Function.toString.call(n), ve.set(n, r)), r === _e;
+}
+function O(e, t, n = !0) {
+	k(e) === 0 ? (n ? Reflect.ownKeys(e) : y.keys(e)).forEach((n) => {
+		t(n, e[n], e);
+	}) : e.forEach((n, r) => t(r, n, e));
+}
+function k(e) {
+	let t = e[_];
+	return t ? t.type_ : M(e) ? 1 : N(e) ? 2 : P(e) ? 3 : 0;
+}
+var be = (e, t, n = k(e)) => n === 2 ? e.has(t) : y[S].hasOwnProperty.call(e, t), A = (e, t, n = k(e)) => n === 2 ? e.get(t) : e[t], j = (e, t, n, r = k(e)) => {
+	r === 2 ? e.set(t, n) : r === 3 ? e.add(n) : e[t] = n;
+};
+function xe(e, t) {
+	return e === t ? e !== 0 || 1 / e == 1 / t : e !== e && t !== t;
+}
+var M = Array.isArray, N = (e) => e instanceof Map, P = (e) => e instanceof Set, F = (e) => typeof e == "object", I = (e) => typeof e == "function", L = (e) => typeof e == "boolean";
+function Se(e) {
+	let t = +e;
+	return Number.isInteger(t) && String(t) === e;
+}
+var R = (e) => e.copy_ || e.base_, z = (e) => e.modified_ ? e.copy_ : e.base_;
+function B(e, t) {
+	if (N(e)) return new Map(e);
+	if (P(e)) return new Set(e);
+	if (M(e)) return Array[S].slice.call(e);
+	let n = ye(e);
+	if (t === !0 || t === "class_only" && !n) {
+		let t = y.getOwnPropertyDescriptors(e);
+		delete t[_];
+		let n = Reflect.ownKeys(t);
+		for (let r = 0; r < n.length; r++) {
+			let i = n[r], a = t[i];
+			a[w] === !1 && (a[w] = !0, a[ge] = !0), (a.get || a.set) && (t[i] = {
+				[ge]: !0,
+				[w]: !0,
+				[C]: a[C],
+				[T]: e[i]
+			});
+		}
+		return y.create(b(e), t);
+	} else {
+		let t = b(e);
+		if (t !== null && n) return { ...e };
+		let r = y.create(t);
+		return y.assign(r, e);
+	}
+}
+function V(e, t = !1) {
+	return U(e) || E(e) || !D(e) ? e : (k(e) > 1 && y.defineProperties(e, {
+		set: H,
+		add: H,
+		clear: H,
+		delete: H
+	}), y.freeze(e), t && O(e, (e, t) => {
+		V(t, !0);
+	}, !1), e);
+}
+function Ce() {
+	v(2);
+}
+var H = { [T]: Ce };
+function U(e) {
+	return e === null || !F(e) ? !0 : y.isFrozen(e);
+}
+var W = "MapSet", we = "Patches", Te = "ArrayMethods", Ee = {};
+function G(e) {
+	let t = Ee[e];
+	return t || v(0, e), t;
+}
+var De = (e) => !!Ee[e], K, Oe = () => K, ke = (e, t) => ({
+	drafts_: [],
+	parent_: e,
+	immer_: t,
+	canAutoFreeze_: !0,
+	unfinalizedDrafts_: 0,
+	handledSet_: /* @__PURE__ */ new Set(),
+	processedForPatches_: /* @__PURE__ */ new Set(),
+	mapSetPlugin_: De(W) ? G(W) : void 0,
+	arrayMethodsPlugin_: De(Te) ? G(Te) : void 0
+});
+function Ae(e, t) {
+	t && (e.patchPlugin_ = G(we), e.patches_ = [], e.inversePatches_ = [], e.patchListener_ = t);
+}
+function je(e) {
+	Me(e), e.drafts_.forEach(Pe), e.drafts_ = null;
+}
+function Me(e) {
+	e === K && (K = e.parent_);
+}
+var Ne = (e) => K = ke(K, e);
+function Pe(e) {
+	let t = e[_];
+	t.type_ === 0 || t.type_ === 1 ? t.revoke_() : t.revoked_ = !0;
+}
+function Fe(e, t) {
+	t.unfinalizedDrafts_ = t.drafts_.length;
+	let n = t.drafts_[0];
+	if (e !== void 0 && e !== n) {
+		n[_].modified_ && (je(t), v(4)), D(e) && (e = Ie(t, e));
+		let { patchPlugin_: r } = t;
+		r && r.generateReplacementPatches_(n[_].base_, e, t);
+	} else e = Ie(t, n);
+	return Le(t, e, !0), je(t), t.patches_ && t.patchListener_(t.patches_, t.inversePatches_), e === pe ? void 0 : e;
+}
+function Ie(e, t) {
+	if (U(t)) return t;
+	let n = t[_];
+	if (!n) return J(t, e.handledSet_, e);
+	if (!q(n, e)) return t;
+	if (!n.modified_) return n.base_;
+	if (!n.finalized_) {
+		let { callbacks_: t } = n;
+		if (t) for (; t.length > 0;) t.pop()(e);
+		He(n, e);
+	}
+	return n.copy_;
+}
+function Le(e, t, n = !1) {
+	!e.parent_ && e.immer_.autoFreeze_ && e.canAutoFreeze_ && V(t, n);
+}
+function Re(e) {
+	e.finalized_ = !0, e.scope_.unfinalizedDrafts_--;
+}
+var q = (e, t) => e.scope_ === t, ze = [];
+function Be(e, t, n, r) {
+	let i = R(e), a = e.type_;
+	if (r !== void 0 && A(i, r, a) === t) {
+		j(i, r, n, a);
+		return;
+	}
+	if (!e.draftLocations_) {
+		let t = e.draftLocations_ = /* @__PURE__ */ new Map();
+		O(i, (e, n) => {
+			if (E(n)) {
+				let r = t.get(n) || [];
+				r.push(e), t.set(n, r);
+			}
+		});
+	}
+	let o = e.draftLocations_.get(t) ?? ze;
+	for (let e of o) j(i, e, n, a);
+}
+function Ve(e, t, n) {
+	e.callbacks_.push(function(r) {
+		let i = t;
+		if (!i || !q(i, r)) return;
+		r.mapSetPlugin_?.fixSetContents(i);
+		let a = z(i);
+		Be(e, i.draft_ ?? i, a, n), He(i, r);
+	});
+}
+function He(e, t) {
+	if (e.modified_ && !e.finalized_ && (e.type_ === 3 || e.type_ === 1 && e.allIndicesReassigned_ || (e.assigned_?.size ?? 0) > 0)) {
+		let { patchPlugin_: n } = t;
+		if (n) {
+			let r = n.getPath(e);
+			r && n.generatePatches_(e, r, t);
+		}
+		Re(e);
+	}
+}
+function Ue(e, t, n) {
+	let { scope_: r } = e;
+	if (E(n)) {
+		let i = n[_];
+		q(i, r) && i.callbacks_.push(function() {
+			Z(e), Be(e, n, z(i), t);
+		});
+	} else D(n) && e.callbacks_.push(function() {
+		let i = R(e);
+		e.type_ === 3 ? i.has(n) && J(n, r.handledSet_, r) : A(i, t, e.type_) === n && r.drafts_.length > 1 && (e.assigned_.get(t) ?? !1) === !0 && e.copy_ && J(A(e.copy_, t, e.type_), r.handledSet_, r);
+	});
+}
+function J(e, t, n) {
+	return !n.immer_.autoFreeze_ && n.unfinalizedDrafts_ < 1 || E(e) || t.has(e) || !D(e) || U(e) ? e : (t.add(e), O(e, (r, i) => {
+		if (E(i)) {
+			let t = i[_];
+			q(t, n) && (j(e, r, z(t), e.type_), Re(t));
+		} else D(i) && J(i, t, n);
+	}), e);
+}
+function We(e, t) {
+	let n = M(e), r = {
+		type_: +!!n,
+		scope_: t ? t.scope_ : Oe(),
+		modified_: !1,
+		finalized_: !1,
+		assigned_: void 0,
+		parent_: t,
+		base_: e,
+		draft_: null,
+		copy_: null,
+		revoke_: null,
+		isManual_: !1,
+		callbacks_: void 0
+	}, i = r, a = Y;
+	n && (i = [r], a = X);
+	let { revoke: o, proxy: s } = Proxy.revocable(i, a);
+	return r.draft_ = s, r.revoke_ = o, [s, r];
+}
+var Y = {
+	get(e, t) {
+		if (t === _) return e;
+		if (t === "constructor" || t === "__proto__") {
+			let n = R(e)[t];
+			return new Proxy(n || {}, {
+				get: (e, t) => t === "__proto__" || t === "prototype" ? Object.freeze(/* @__PURE__ */ Object.create(null)) : Reflect.get(e, t),
+				set: () => !0,
+				apply: (e, t, n) => Reflect.apply(e, t, n)
+			});
+		}
+		let n = e.scope_.arrayMethodsPlugin_, r = e.type_ === 1 && typeof t == "string";
+		if (r && n?.isArrayOperationMethod(t)) return n.createMethodInterceptor(e, t);
+		let i = R(e);
+		if (!be(i, t, e.type_)) return Ke(e, i, t);
+		let a = i[t];
+		if (e.finalized_ || !D(a) || r && e.operationMethod && n?.isMutatingArrayMethod(e.operationMethod) && Se(t)) return a;
+		if (a === Ge(e.base_, t)) {
+			Z(e);
+			let n = e.type_ === 1 ? +t : t, r = Q(e.scope_, a, e, n);
+			return e.copy_[n] = r;
+		}
+		return a;
+	},
+	has(e, t) {
+		return t === "constructor" || t === "__proto__" || t === "prototype" ? !1 : t in R(e);
+	},
+	ownKeys(e) {
+		return Reflect.ownKeys(R(e));
+	},
+	set(e, t, n) {
+		if (t === "constructor" || t === "__proto__" || t === "prototype") return !0;
+		let r = qe(R(e), t);
+		if (r?.set) return r.set.call(e.draft_, n), !0;
+		if (!e.modified_) {
+			let r = Ge(R(e), t), i = r?.[_];
+			if (i && i.base_ === n) return e.copy_[t] = n, e.assigned_.set(t, !1), !0;
+			if (xe(n, r) && (n !== void 0 || be(e.base_, t, e.type_))) return !0;
+			Z(e), Je(e);
+		}
+		return e.copy_[t] === n && (n !== void 0 || t in e.copy_) || Number.isNaN(n) && Number.isNaN(e.copy_[t]) ? !0 : (e.copy_[t] = n, e.assigned_.set(t, !0), Ue(e, t, n), !0);
+	},
+	deleteProperty(e, t) {
+		return Z(e), Ge(e.base_, t) !== void 0 || t in e.base_ ? (e.assigned_.set(t, !1), Je(e)) : e.assigned_.delete(t), e.copy_ && delete e.copy_[t], !0;
+	},
+	getOwnPropertyDescriptor(e, t) {
+		let n = R(e), r = Reflect.getOwnPropertyDescriptor(n, t);
+		return r && {
+			[w]: !0,
+			[ge]: e.type_ !== 1 || t !== "length",
+			[C]: r[C],
+			[T]: n[t]
+		};
+	},
+	defineProperty() {
+		v(11);
+	},
+	getPrototypeOf(e) {
+		return b(e.base_);
+	},
+	setPrototypeOf() {
+		v(12);
+	}
+}, X = {};
+for (let e in Y) {
+	let t = Y[e];
+	X[e] = function() {
+		let e = arguments;
+		return e[0] = e[0][0], t.apply(this, e);
+	};
+}
+X.deleteProperty = function(e, t) {
+	return process.env.NODE_ENV !== "production" && isNaN(parseInt(t)) && v(13), X.set.call(this, e, t, void 0);
+}, X.set = function(e, t, n) {
+	return process.env.NODE_ENV !== "production" && t !== "length" && isNaN(parseInt(t)) && v(14), Y.set.call(this, e[0], t, n, e[0]);
+};
+function Ge(e, t) {
+	let n = e[_];
+	return (n ? R(n) : e)[t];
+}
+function Ke(e, t, n) {
+	let r = qe(t, n);
+	return r ? T in r ? r[T] : r.get?.call(e.draft_) : void 0;
+}
+function qe(e, t) {
+	if (!(t in e)) return;
+	let n = b(e);
+	for (; n;) {
+		let e = Object.getOwnPropertyDescriptor(n, t);
+		if (e) return e;
+		n = b(n);
+	}
+}
+function Je(e) {
+	e.modified_ || (e.modified_ = !0, e.parent_ && Je(e.parent_));
+}
+function Z(e) {
+	e.copy_ ||= (e.assigned_ = /* @__PURE__ */ new Map(), B(e.base_, e.scope_.immer_.useStrictShallowCopy_));
+}
+var Ye = class {
+	constructor(e) {
+		this.autoFreeze_ = !0, this.useStrictShallowCopy_ = !1, this.useStrictIteration_ = !1, this.produce = (e, t, n) => {
+			if (I(e) && !I(t)) {
+				let n = t;
+				t = e;
+				let r = this;
+				return function(e = n, ...i) {
+					return r.produce(e, (e) => t.call(this, e, ...i));
+				};
+			}
+			I(t) || v(6), n !== void 0 && !I(n) && v(7);
+			let r;
+			if (D(e)) {
+				let i = Ne(this), a = Q(i, e, void 0), o = !0;
+				try {
+					r = t(a), o = !1;
+				} finally {
+					o ? je(i) : Me(i);
+				}
+				return Ae(i, n), Fe(r, i);
+			} else if (!e || !F(e)) {
+				if (r = t(e), r === void 0 && (r = e), r === pe && (r = void 0), this.autoFreeze_ && V(r, !0), n) {
+					let t = [], i = [];
+					G(we).generateReplacementPatches_(e, r, {
+						patches_: t,
+						inversePatches_: i
+					}), n(t, i);
+				}
+				return r;
+			} else v(1, e);
+		}, this.produceWithPatches = (e, t) => {
+			if (I(e)) return (t, ...n) => this.produceWithPatches(t, (t) => e(t, ...n));
+			let n, r;
+			return [
+				this.produce(e, t, (e, t) => {
+					n = e, r = t;
+				}),
+				n,
+				r
+			];
+		}, L(e?.autoFreeze) && this.setAutoFreeze(e.autoFreeze), L(e?.useStrictShallowCopy) && this.setUseStrictShallowCopy(e.useStrictShallowCopy), L(e?.useStrictIteration) && this.setUseStrictIteration(e.useStrictIteration);
+	}
+	createDraft(e) {
+		D(e) || v(8), E(e) && (e = Xe(e));
+		let t = Ne(this), n = Q(t, e, void 0);
+		return n[_].isManual_ = !0, Me(t), n;
+	}
+	finishDraft(e, t) {
+		let n = e && e[_];
+		(!n || !n.isManual_) && v(9);
+		let { scope_: r } = n;
+		return Ae(r, t), Fe(void 0, r);
+	}
+	setAutoFreeze(e) {
+		this.autoFreeze_ = e;
+	}
+	setUseStrictShallowCopy(e) {
+		this.useStrictShallowCopy_ = e;
+	}
+	setUseStrictIteration(e) {
+		this.useStrictIteration_ = e;
+	}
+	shouldUseStrictIteration() {
+		return this.useStrictIteration_;
+	}
+	applyPatches(e, t) {
+		let n;
+		for (n = t.length - 1; n >= 0; n--) {
+			let r = t[n];
+			if (r.path.length === 0 && r.op === "replace") {
+				e = r.value;
+				break;
+			}
+		}
+		n > -1 && (t = t.slice(n + 1));
+		let r = G(we).applyPatches_;
+		return E(e) ? r(e, t) : this.produce(e, (e) => r(e, t));
+	}
+};
+function Q(e, t, n, r) {
+	let [i, a] = N(t) ? G(W).proxyMap_(t, n) : P(t) ? G(W).proxySet_(t, n) : We(t, n);
+	return (n?.scope_ ?? Oe()).drafts_.push(i), a.callbacks_ = n?.callbacks_ ?? [], a.key_ = r, n && r !== void 0 ? Ve(n, a, r) : a.callbacks_.push(function(e) {
+		e.mapSetPlugin_?.fixSetContents(a);
+		let { patchPlugin_: t } = e;
+		a.modified_ && t && t.generatePatches_(a, [], e);
+	}), i;
+}
+function Xe(e) {
+	return E(e) || v(10, e), Ze(e);
+}
+function Ze(e) {
+	if (!D(e) || U(e)) return e;
+	let t = e[_], n, r = !0;
+	if (t) {
+		if (!t.modified_) return t.base_;
+		t.finalized_ = !0, n = B(e, t.scope_.immer_.useStrictShallowCopy_), r = t.scope_.immer_.shouldUseStrictIteration();
+	} else n = B(e, !0);
+	return O(n, (e, t) => {
+		j(n, e, Ze(t));
+	}, r), t && (t.finalized_ = !1), n;
+}
+var $ = new Ye().produce, Qe = /* @__PURE__ */ e(c(), 1), $e = /* @__PURE__ */ e(o(), 1), et = /* @__PURE__ */ e(f(), 1), tt = /* @__PURE__ */ e(p(), 1), nt = (e) => {
+	let { caseSetId: t, completeCaseType: n, ...r } = e;
+	return {
+		...ue(r),
+		caseSetId: t,
+		completeCaseType: n,
+		dataContext: n,
+		expandedZone: null,
+		filteredData: {
+			[i]: [],
+			[a]: []
+		},
+		findSimilarCasesResults: [],
+		frontendFilterPriorities: [i, a],
+		isMaxResultsExceeded: !1,
+		isMaxResultsExceededDismissed: !1,
+		newick: null,
+		numVisibleAttributesInSummary: ie.getInstance().config.epi.INITIAL_NUM_VISIBLE_ATTRIBUTES_IN_CASE_SUMMARY,
+		stratification: null,
+		stratifyableColumns: [],
+		tree: null,
+		treeAddresses: {},
+		treeResponse: null,
+		widgetData: Object.entries(ie.getInstance().config.dashboard.WIDGETS).reduce((e, [t, n]) => (e[t] = (0, tt.default)(n.dataDefaultValues), e), {}),
+		widgetDataPersistable: Object.entries(ie.getInstance().config.dashboard.WIDGETS).reduce((e, [t, n]) => (e[t] = (0, tt.default)(n.dataDefaultValues), e), {})
+	};
+}, rt = (e) => {
+	let { caseSetId: o, completeCaseType: c, ...f } = e, p = ee()(te((e, r) => {
+		let i = nt({
+			caseSetId: o,
+			completeCaseType: c,
+			...f
+		}), a = le({
+			get: r,
+			set: e
+		});
+		return {
+			...i,
+			...a,
+			addTreeFilter: async (e) => {
+				let { filters: n, reloadSelectedIds: i, resetTreeAddresses: a, setFilterValue: o } = r();
+				a(), await o(n.find((e) => e instanceof t).id, e), i();
+			},
+			destroy: () => {
+				a.destroy();
+			},
+			expandZone: (t) => {
+				e({ expandedZone: t });
+			},
+			fetchData: async () => {
+				e({
+					dataError: null,
+					isMaxResultsExceeded: !1,
+					isMaxResultsExceededDismissed: !1
+				});
+				let { fetchAbortController: t, findSimilarCasesResults: n, globalAbortSignal: i } = r(), a = h.getInstance().queryClient, l = n?.flatMap((e) => e.similarCaseIds) || [];
+				t && !t.signal.aborted && t.abort();
+				let u = new AbortController(), d = () => {
+					u.abort(), i.removeEventListener("abort", d);
+				};
+				i.addEventListener("abort", d), e({ fetchAbortController: u }), e({ isDataLoading: !0 });
+				let { filters: ee, setBaseData: f } = r(), te = ee.filter((e) => e.filterMode === oe.BACKEND && !e.isInitialFilterValue()).map((e) => e.toBackendFilter()).filter((e) => !!e), p = te.length ? {
+					filters: te,
+					operator: "AND",
+					type: "COMPOSITE"
+				} : void 0, m = {
+					case_set_ids: o ? [o] : void 0,
+					case_type_id: c.id,
+					filter: p
+				}, re = [
+					s.CASE_IDS_BY_QUERY,
+					c.id,
+					JSON.stringify(m)
+				];
+				try {
+					let t = h.getInstance().getValidQueryData(re);
+					t || (t = (await ne.getInstance().retrieveCaseIdsByQuery(m, { signal: u.signal })).data, a.setQueryData(re, t));
+					let n = (0, $e.default)([...t.case_ids, ...l]), r = h.getInstance().getValidQueryData(h.getInstance().getGenericKey(s.CASES_LAZY)), i = (0, Qe.default)(n, (r ?? []).map((e) => e.id));
+					if (i.length) {
+						let e = (await ne.getInstance().retrieveCasesByIds({
+							case_ids: i,
+							case_type_id: c.id
+						}, { signal: u.signal })).data;
+						a.setQueryData(h.getInstance().getGenericKey(s.CASES_LAZY), [...r ?? [], ...e]);
+					}
+					let o = new Map((h.getInstance().getValidQueryData(h.getInstance().getGenericKey(s.CASES_LAZY)) ?? []).map((e) => [e.id, e]));
+					o.forEach((e) => {
+						a.setQueryData(h.getInstance().getGenericKey(s.CASES_LAZY, e.id), e);
+					}), f(n.map((e) => o.get(e))), e({
+						isDataLoading: !1,
+						isMaxResultsExceeded: t.is_max_results_exceeded
+					});
+				} catch (t) {
+					ce.isAxiosCanceledError(t) || e({ dataError: t });
+				} finally {
+					i.removeEventListener("abort", d);
+				}
+			},
+			getWidgetData: (e) => r().widgetData[e],
+			getWidgetDataPersistable: (e) => r().widgetDataPersistable[e],
+			mutateCachedCase: (e, t) => {
+				let n = h.getInstance().queryClient, r = h.getInstance().getValidQueryData(h.getInstance().getGenericKey(s.CASES_LAZY));
+				n.setQueryData(h.getInstance().getGenericKey(s.CASES_LAZY), r.map((n) => n.id === e ? t : n));
+			},
+			reloadFieldStratification: () => {
+				let { stratification: e, stratify: t, stratifyableColumns: n } = r();
+				if (e?.mode === l.FIELD && !n.find((t) => t.col.ref_col_id === e.col.ref_col_id)?.enabled) {
+					ae.getInstance().showNotification({
+						message: m`The grouping column is no longer available. Grouping has been removed.`,
+						severity: "info"
+					}), t(null);
+					return;
+				}
+			},
+			reloadFilterData: () => {
+				let { reloadFieldStratification: e, reloadStratifyableColumns: t } = r();
+				a.reloadFilterData(), t(), e();
+			},
+			reloadFilterPriorityData: (e, i) => {
+				let { filters: a, reloadTree: o } = r();
+				if (e === "selection") {
+					let e = a.find((e) => e instanceof n), t;
+					if (e.isInitialFilterValue()) t = i;
+					else {
+						let n = e.filterValue;
+						t = i.filter((e) => n.includes(e.id));
+					}
+					return t;
+				}
+				if (e === "tree") {
+					let e = a.find((e) => e instanceof t);
+					o();
+					let { tree: n } = r(), s;
+					if (e.isInitialFilterValue()) s = i;
+					else {
+						let { subTreeLeaveNames: e } = n;
+						s = i.filter((t) => e.includes(t.id));
+					}
+					return s;
+				}
+				throw Error(`Unknown filter group: ${e}`);
+			},
+			reloadStratifyableColumns: () => {
+				let { filteredData: t, frontendFilterPriorities: n } = r(), i = t[(0, et.default)(n)];
+				e({ stratifyableColumns: u.getStratifyableColumns({
+					completeCaseType: c,
+					data: i
+				}) });
+			},
+			reloadTree: () => {
+				let { filters: n, getWidgetDataPersistable: i, treeResponse: a } = r(), o = i(d.TREE).treeConfiguration, s = n.find((e) => e instanceof t)?.filterValue, c = s ? g.findNewTreeRoot(a, s, "node") : a;
+				c && e({ treeAddresses: {
+					...r().treeAddresses,
+					[o.col.id]: {
+						addresses: g.createTreeAddresses(c),
+						algorithmCode: o.treeAlgorithm.code
+					}
+				} }), e({ tree: c });
+			},
+			removeTreeFilter: async () => {
+				let { filters: e, resetTreeAddresses: n, setFilterValue: i } = r(), a = e.find((e) => e instanceof t);
+				a.filterValue && (n(), await i(a.id, a.initialFilterValue));
+			},
+			resetTreeAddresses: () => {
+				e({ treeAddresses: {} });
+			},
+			setFilterValues: async (e) => {
+				let { filters: n } = r(), i = {};
+				n.forEach((e) => {
+					i[e.id] = e.filterValue;
+				});
+				let o = re.getObjectDiff(i, e), s = n.find((e) => e instanceof t);
+				!s.isInitialFilterValue(i[s.id]) && !o.includes(s.id) ? (ae.getInstance().showNotification({
+					message: m`The tree filter has automatically been removed, because it's incompatible with the results of the other filters.`,
+					severity: "info"
+				}), await a.setFilterValues({
+					...e,
+					[s.id]: s.initialFilterValue
+				})) : await a.setFilterValues(e);
+			},
+			setFindSimilarCasesResults: async (n) => {
+				let { filters: i, stratification: o, stratify: s } = r(), c = {};
+				i.forEach((e) => {
+					c[e.id] = e.filterValue;
+				});
+				let u = i.find((e) => e instanceof t);
+				u.isInitialFilterValue(c[u.id]) || (ae.getInstance().showNotification({
+					message: m`The tree filter has automatically been removed, because it's incompatible with the results of "Find Similar Cases".`,
+					severity: "info"
+				}), await a.setFilterValues({
+					...c,
+					[u.id]: u.initialFilterValue
+				})), e({ findSimilarCasesResults: n }), await r().fetchData(), o?.mode === l.SIMILAR_CASES && s(l.SIMILAR_CASES);
+			},
+			setNumVisibleAttributesInSummary: (t) => {
+				e({ numVisibleAttributesInSummary: t });
+			},
+			setPhylogeneticTreeResponse: (t) => {
+				let { newick: n, reloadSelectedIds: i, reloadSortedData: a, reloadTree: o } = r();
+				if (n !== t.newick_repr) {
+					if (t.newick_repr && t.newick_repr.trim().length > 0 && t.newick_repr !== "();") {
+						let n = fe.parse(t.newick_repr), r = g.sanitizeTree(n, c.genetic_distance_protocols[t.protocol_id].seqdb_max_stored_distance), i = fe.getSortedNames(r);
+						e({
+							newick: t.newick_repr,
+							sortedIds: i,
+							tree: r,
+							treeResponse: r
+						});
+					} else e({
+						newick: t.newick_repr,
+						sortedIds: [],
+						tree: null,
+						treeResponse: null
+					});
+					o(), a(), i();
+				}
+			},
+			setSelectedIds: (e) => {
+				a.setSelectedIds(e);
+				let { stratification: t, stratify: n } = r();
+				e.length && (!t || t?.mode === l.SELECTION) ? n(l.SELECTION) : t?.mode === l.SELECTION && !e.length && n(null);
+			},
+			stratify: (t, n) => {
+				let { findSimilarCasesResults: i, selectedIds: a, sortedData: o } = r();
+				e({ stratification: u.getStratification({
+					col: n,
+					completeCaseType: c,
+					mode: t,
+					selectedIds: a,
+					similarCaseIds: i?.flatMap((e) => e.similarCaseIds) || [],
+					sortedData: o
+				}) });
+			},
+			treeFilterStepOut: async () => {
+				let { filters: e, resetTreeAddresses: n, setFilterValue: i, treeResponse: a } = r();
+				n();
+				let o = e.find((e) => e instanceof t), s = g.findNewTreeRoot(a, o?.filterValue, "parent").name;
+				await i(o.id, s === a.name ? null : s);
+			},
+			updateWidgetData: (t, n) => {
+				e({ widgetData: $(r().widgetData, (e) => ({
+					...e,
+					[t]: {
+						...e[t],
+						...n
+					}
+				})) });
+			},
+			updateWidgetDataPersistable: (t, n) => {
+				e({ widgetDataPersistable: $(r().widgetDataPersistable, (e) => ({
+					...e,
+					[t]: {
+						...e[t],
+						...n
+					}
+				})) });
+			}
+		};
+	}, de(e.storageNamePostFix, e.storageVersion, (e) => ({
+		numVisibleAttributesInSummary: e.numVisibleAttributesInSummary,
+		widgetDataPersistable: e.widgetDataPersistable
+	}))));
+	return p.getState().setFilters(r.createFilters(c), r.createFilterDimensions(c), [i, a]), p;
+}, it = se(null);
+//#endregion
+export { rt as n, $ as r, it as t };
+
+//# sourceMappingURL=dashboardStore.js.map