udi-yac 0.10.0 → 0.11.0

package/dist/{ce-entry-CaIPHibV.js → ce-entry-BSPPuAns.js}

@@ -95358,72 +95358,84 @@ function m9(e) {
 	throw Error(`Expr: unrecognized expression node ${JSON.stringify(e)}`);
 }
 var h9 = Oht("DataSourcesStore", () => {
-	let e = /* @__PURE__ */ r6({}), t = /* @__PURE__ */ r6({});
-	function n() {
+	let e = /* @__PURE__ */ r6({}), t = /* @__PURE__ */ r6({}), n = /* @__PURE__ */ r6({});
+	function r(e, t) {
+		t === null ? delete n.value[e] : n.value[e] = {
+			dimensions: [...t.dimensions],
+			measures: [...t.measures]
+		};
+	}
+	function i(e) {
+		return n.value[e] ?? null;
+	}
+	function a(e) {
+		return e in n.value;
+	}
+	function o() {
 		let e = {};
 		for (let [n, r] of Object.entries(t.value)) e[n] = r?.selection ?? null;
-		h.value = JSON.stringify(e);
+		y.value = JSON.stringify(e);
 	}
-	function r(e) {
-		let r = !1;
-		for (let [n, i] of Object.entries(e)) n in t.value && (0, f9.isEqual)(t.value[n], i) || (t.value[n] = i, r = !0);
-		r && n();
+	function s(e) {
+		let n = !1;
+		for (let [r, i] of Object.entries(e)) r in t.value && (0, f9.isEqual)(t.value[r], i) || (t.value[r] = i, n = !0);
+		n && o();
 	}
-	function i(e, r, i) {
-		let a = t.value[r];
-		return a?.type === i ? { alreadyExists: !0 } : (t.value[r] = {
+	function c(e, n, r) {
+		let i = t.value[n];
+		return i?.type === r ? { alreadyExists: !0 } : (t.value[n] = {
 			dataSourceKey: e,
 			selection: null,
-			type: i
-		}, a?.selection != null && n(), { alreadyExists: !1 });
+			type: r
+		}, i?.selection != null && o(), { alreadyExists: !1 });
 	}
-	function a(e, r) {
+	function l(e, n) {
 		if (!(e in t.value)) throw Error(`Selection name ${e} not found`);
-		if (r != null && t.value[e].type === "interval") {
-			for (let e of Object.values(r)) if (Array.isArray(e) && e.some((e) => typeof e == "number" && !isFinite(e))) {
-				r = null;
+		if (n != null && t.value[e].type === "interval") {
+			for (let e of Object.values(n)) if (Array.isArray(e) && e.some((e) => typeof e == "number" && !isFinite(e))) {
+				n = null;
 				break;
 			}
 		}
-		let i = t.value[e].selection;
-		(0, f9.isEqual)(i, r) || (t.value[e].selection = r, n());
+		let r = t.value[e].selection;
+		(0, f9.isEqual)(r, n) || (t.value[e].selection = n, o());
 	}
-	function o(e) {
-		a(e, null);
+	function u(e) {
+		l(e, null);
 	}
-	function s() {
-		Object.keys(t.value).length !== 0 && (t.value = {}, h.value = "{}");
+	function d() {
+		Object.keys(t.value).length !== 0 && (t.value = {}, y.value = "{}");
 	}
-	function c(e) {
+	function f(e) {
 		if (!(e in t.value)) throw Error(`Selection name ${e} not found`);
 		return t.value[e].selection;
 	}
-	let l = (e) => e.length ? EY((t) => e.every((e) => e(t))) : null;
-	function u(e) {
+	let p = (e) => e.length ? EY((t) => e.every((e) => e(t))) : null;
+	function m(e) {
 		if (e === null) return null;
 		let t = [];
 		for (let [n, [r, i]] of Object.entries(e)) r != null && t.push((e) => e[n] >= r), i != null && t.push((e) => e[n] <= i);
-		return l(t);
+		return p(t);
 	}
-	function d(e) {
+	function h(e) {
 		if (e === null) return null;
 		let t = Object.entries(e).filter(([, e]) => e.length > 0).map(([e, t]) => {
 			let n = new Set(t.map(String));
 			return (t) => n.has(String(t[e]));
 		});
-		return l(t);
+		return p(t);
 	}
-	function f(e) {
+	function g(e) {
 		let { type: t, selection: n } = e;
-		return t === "point" ? d(n) : u(n);
+		return t === "point" ? h(n) : m(n);
 	}
-	function p({ key: n, inTable: r, selectionName: i, selectionMatching: a = "any", selectionEntityRelationship: o, selectionSourceKey: s }) {
+	function _({ key: n, inTable: r, selectionName: i, selectionMatching: a = "any", selectionEntityRelationship: o, selectionSourceKey: s }) {
 		let c = t.value[i];
 		if (!c || !c.selection) return null;
 		let { originKey: l, targetKey: u } = o || {
 			originKey: null,
 			targetKey: null
-		}, d = f(c);
+		}, d = g(c);
 		if (!l || !u || !s) {
 			if (d) {
 				let e = new Set(r.columnNames());
@@ -95431,31 +95443,31 @@ var h9 = Oht("DataSourcesStore", () => {
 			}
 			return d;
 		}
-		let p = e.value[s];
-		if (!p || !d) return console.warn(`No relevant table or filter for mapping: ${s}`), null;
+		let f = e.value[s];
+		if (!f || !d) return console.warn(`No relevant table or filter for mapping: ${s}`), null;
 		if (!r.columnNames().includes(u)) throw Error(`Identifying key [${u}] not found in table [${n}]. Ensure any filters relying on the [${u}] column are applied before other transformations that may remove it.`);
-		let m = p.dest.reify(), h = p.dest.filter(d).reify(), g = (e) => {
+		let p = f.dest.reify(), m = f.dest.filter(d).reify(), h = (e) => {
 			let t = new Set(e);
 			return t.size === 0 ? "false" : EY((e) => t.has(e[u]));
 		};
 		if (a === "none") {
-			let e = new Set(h.array(l));
+			let e = new Set(m.array(l));
 			return EY((t) => t[u] != null && !e.has(t[u]));
 		}
-		if (a != "all") return g(h.array(l));
+		if (a != "all") return h(m.array(l));
 		let _ = (e) => {
 			let t = /* @__PURE__ */ new Map();
 			for (let n of e) t.set(n, (t.get(n) ?? 0) + 1);
 			return t;
-		}, v = _(m.array(l)), y = _(h.array(l)), b = [];
+		}, v = _(p.array(l)), y = _(m.array(l)), b = [];
 		for (let [e, t] of y.entries()) {
 			let n = v.get(e) ?? 0;
 			t > 0 && t === n && b.push(e);
 		}
-		return g(b);
+		return h(b);
 	}
-	let m = /* @__PURE__ */ r6(!0), h = /* @__PURE__ */ r6(""), g = /* @__PURE__ */ r6(0);
-	async function _(t, n) {
+	let v = /* @__PURE__ */ r6(!0), y = /* @__PURE__ */ r6(""), b = /* @__PURE__ */ r6(0);
+	async function x(t, n) {
 		let r = n ? t.map((e) => {
 			let t = n[e.name];
 			return t ? {
@@ -95466,15 +95478,15 @@ var h9 = Oht("DataSourcesStore", () => {
 		r.some((t) => {
 			let n = e.value[t.name];
 			return !n || !(0, f9.isEqual)(n.source, t);
-		}) && (m.value = !0);
-		let i = r.map((e) => y(e));
-		await Promise.all(i), m.value = !1;
+		}) && (v.value = !0);
+		let i = r.map((e) => C(e));
+		await Promise.all(i), v.value = !1;
 	}
-	let v = /* @__PURE__ */ new Map();
-	async function y(t) {
+	let S = /* @__PURE__ */ new Map();
+	async function C(t) {
 		let n = e.value[t.name];
 		if (n && (0, f9.isEqual)(n.source, t)) return;
-		let r = t.name + "\0" + t.source, i = v.get(r);
+		let r = t.name + "\0" + t.source, i = S.get(r);
 		if (i) return i;
 		let a = (async () => {
 			let n = ",";
@@ -95483,16 +95495,16 @@ var h9 = Oht("DataSourcesStore", () => {
 			e.value[t.name] = {
 				source: t,
 				dest: r
-			}, g.value++;
+			}, b.value++;
 		})();
-		v.set(r, a);
+		S.set(r, a);
 		try {
 			await a;
 		} finally {
-			v.delete(r);
+			S.delete(r);
 		}
 	}
-	function b(t, n, r) {
+	function w(t, n, r) {
 		let i = {
 			name: t,
 			source: n
@@ -95500,37 +95512,37 @@ var h9 = Oht("DataSourcesStore", () => {
 		e.value[t] = {
 			source: i,
 			dest: r
-		}, g.value++;
+		}, b.value++;
 	}
-	function x(t) {
+	function T(t) {
 		return t in e.value ? e.value[t] ?? null : null;
 	}
-	let S = /* @__PURE__ */ new Map(), C = -1;
-	function w(e) {
-		C !== g.value && (S.clear(), C = g.value);
-		let t = S.get(e);
+	let E = /* @__PURE__ */ new Map(), D = -1;
+	function O(e) {
+		D !== b.value && (E.clear(), D = b.value);
+		let t = E.get(e);
 		if (t) return t;
-		let n = x(e);
+		let n = T(e);
 		if (!n) return null;
 		let r = OY(n.dest.reify());
-		return S.set(e, r), r;
+		return E.set(e, r), r;
 	}
-	let T = /* @__PURE__ */ new Map();
-	function E(e, t, n) {
-		let r = t ?? [], i = r.length > 0 && "rollup" in r[r.length - 1], a = n?.displayDataOnly ?? i, o = `${g.value}|${h.value}|${a ? "d" : "a"}|${e.join("\0")}|${JSON.stringify(t ?? null)}`, s = T.get(o);
-		if (s) return T.delete(o), T.set(o, s), s;
+	let k = /* @__PURE__ */ new Map();
+	function A(e, t, n) {
+		let r = t ?? [], i = r.length > 0 && "rollup" in r[r.length - 1], a = n?.displayDataOnly ?? i, o = `${b.value}|${y.value}|${a ? "d" : "a"}|${e.join("\0")}|${JSON.stringify(t ?? null)}`, s = k.get(o);
+		if (s) return k.delete(o), k.set(o, s), s;
 		let c = () => {
 			let t = /* @__PURE__ */ new Map();
 			for (let n of e) {
-				let e = w(n);
+				let e = O(n);
 				e ? t.set(n, e) : console.warn(`Skipping missing data source for key: ${n}`);
 			}
 			return t;
 		}, l = c();
 		if (l.size !== new Set(e).size) return null;
-		let { data: u, containsNamedFilter: d } = D(l, t ?? [], { skipNamedFilters: !1 }), f = u.objects(), p = f;
+		let { data: u, containsNamedFilter: d } = ee(l, t ?? [], { skipNamedFilters: !1 }), f = u.objects(), p = f;
 		if (d && !a) {
-			let { data: e } = D(c(), t ?? [], { skipNamedFilters: !0 });
+			let { data: e } = ee(c(), t ?? [], { skipNamedFilters: !0 });
 			p = e.objects();
 		}
 		let m = {
@@ -95538,64 +95550,71 @@ var h9 = Oht("DataSourcesStore", () => {
 			allData: p,
 			isDisplayDataSubset: d
 		};
-		if (T.set(o, m), T.size > 64) {
-			let e = T.keys().next().value;
-			e !== void 0 && T.delete(e);
+		if (k.set(o, m), k.size > 64) {
+			let e = k.keys().next().value;
+			e !== void 0 && k.delete(e);
 		}
 		return m;
 	}
-	function D(e, t, n) {
-		let r = new Map(e), i = !1, a = e.keys().next().value ?? "", o = e.get(a);
-		if (!o) throw Error(`Table not found for key: ${a}`);
-		let s = {
-			key: a,
-			table: o
-		}, c = (t) => {
-			let n = t ? e.get(t) : s.table;
+	function ee(e, t, n) {
+		let r = new Map(e), a = !1, o = e.keys().next().value ?? "", s = e.get(o);
+		if (!s) throw Error(`Table not found for key: ${o}`);
+		let c = {
+			key: o,
+			table: s
+		}, l = (t) => {
+			let n = t ? e.get(t) : c.table;
 			if (!n) throw Error("in table not found");
 			return n;
-		}, l = (t) => {
-			t.out ? s.key = t.out : t.in && !Array.isArray(t.in) && (s.key = t.in), e.set(s.key, s.table);
+		}, u = (t) => {
+			t.out ? c.key = t.out : t.in && !Array.isArray(t.in) && (c.key = t.in), e.set(c.key, c.table);
 		};
-		for (let [o, u] of t.entries()) {
-			if ("filter" in u) {
-				let { filter: e, in: t } = u, r = c(t);
-				if (typeof e == "string") s.table = r.filter(e).reify();
-				else if (p9(e)) s.table = r.filter(m9(e)).reify();
+		for (let [s, d] of t.entries()) {
+			if ("filter" in d) {
+				let { filter: e, in: t } = d, r = l(t);
+				if (typeof e == "string") c.table = r.filter(e).reify();
+				else if (p9(e)) c.table = r.filter(m9(e)).reify();
 				else {
-					if (i = !0, n?.skipNamedFilters) continue;
-					let t = p({
-						key: a,
+					if (a = !0, n?.skipNamedFilters) continue;
+					let t = _({
+						key: o,
 						inTable: r,
 						selectionName: e.name,
 						selectionSourceKey: e.source,
 						...e.match === void 0 ? {} : { selectionMatching: e.match },
 						...e.entityRelationship === void 0 ? {} : { selectionEntityRelationship: e.entityRelationship }
 					});
-					s.table = t ? r.filter(t).reify() : r;
+					c.table = t ? r.filter(t).reify() : r;
 				}
-			} else if ("groupby" in u) {
-				let e = c(u.in);
-				s.table = Array.isArray(u.groupby) ? e.groupby(...u.groupby) : e.groupby(u.groupby);
-			} else if ("unnest" in u) {
-				let e = c(u.in), { field: t, separator: n = ";", out: r = u.unnest.field } = u.unnest, i = EY((e) => {
+			} else if ("only" in d) {
+				let e = l(d.in), t = d.in ?? c.key, n = Array.isArray(d.only) ? d.only : [d.only], r = d.dimensions ?? i(t)?.dimensions;
+				if (!r) throw Error(`'only' transformation on source '${t}' requires cube metadata: register the source's udi:dimensions via loadDataPackage, or list them inline with 'dimensions'.`);
+				let a = n.filter((e) => !r.includes(e));
+				if (a.length > 0) throw Error(`'only' transformation names non-dimension field(s) ${JSON.stringify(a)} on source '${t}'; its dimensions are ${JSON.stringify(r)}.`);
+				let o = new Set(n);
+				c.table = e.filter(EY((e) => r.every((t) => o.has(t) ? e[t] != null : e[t] == null))).reify();
+			} else if ("groupby" in d) {
+				let e = l(d.in);
+				c.table = Array.isArray(d.groupby) ? e.groupby(...d.groupby) : e.groupby(d.groupby);
+			} else if ("unnest" in d) {
+				let e = l(d.in), { field: t, separator: n = ";", out: r = d.unnest.field } = d.unnest, i = EY((e) => {
 					let r = e[t];
 					return r == null ? [] : typeof r == "string" ? r.split(n).map((e) => e.trim()).filter((e) => e.length > 0) : [r];
 				});
-				s.table = e.derive({ [r]: i }).unroll(r).reify();
-			} else if ("binby" in u) {
-				let e = c(u.in), { field: i, bins: a = 10, nice: l = !0, unit: d } = u.binby, { bin_start: f = "start", bin_end: p = "end" } = u.binby.output ?? {
+				c.table = e.derive({ [r]: i }).unroll(r).reify();
+			} else if ("binby" in d) {
+				let e = l(d.in), { field: i, bins: a = 10, nice: o = !0, unit: u } = d.binby, { bin_start: f = "start", bin_end: p = "end" } = d.binby.output ?? {
 					bin_start: "start",
 					bin_end: "end"
 				}, m = e;
 				if (!n?.skipNamedFilters) {
-					let { data: e } = D(new Map(r), t.slice(0, o), { skipNamedFilters: !0 });
+					let { data: e } = ee(new Map(r), t.slice(0, s), { skipNamedFilters: !0 });
 					m = e;
 				}
-				let h = d ?? 1, [g, _, v] = DY(d ? m.params({
+				let h = u ?? 1, [g, _, v] = DY(u ? m.params({
 					binField: i,
-					binUnit: d
-				}).derive({ __binby_units: (e, t) => e[t.binField] / t.binUnit }) : m, UW.bins(d ? "__binby_units" : i, a, l)), [y, b, x] = [
+					binUnit: u
+				}).derive({ __binby_units: (e, t) => e[t.binField] / t.binUnit }) : m, UW.bins(u ? "__binby_units" : i, a, o)), [y, b, x] = [
 					g * h,
 					_ * h,
 					v * h
@@ -95603,26 +95622,26 @@ var h9 = Oht("DataSourcesStore", () => {
 					[f]: `d => op.bin(d[${S}], ${y}, ${b}, ${x}, 0)`,
 					[p]: `d => op.bin(d[${S}], ${y}, ${b}, ${x}, 1)`
 				};
-				s.table = e.derive(C).groupby(f, p);
-			} else if ("rollup" in u) {
-				let e = c(u.in), t = {}, n = [];
-				for (let [e, r] of Object.entries(u.rollup)) t[e] = O(r), r.op === "frequency" && n.push(e);
-				s.table = e.rollup(t);
+				c.table = e.derive(C).groupby(f, p);
+			} else if ("rollup" in d) {
+				let e = l(d.in), t = {}, n = [];
+				for (let [e, r] of Object.entries(d.rollup)) t[e] = j(r), r.op === "frequency" && n.push(e);
+				c.table = e.rollup(t);
 				for (let e of n) {
 					let t = {};
-					t[e] = (e, t) => e[t.freqKey] / UW.sum(e[t.freqKey]), s.table = s.table.params({ freqKey: e }).derive(t);
+					t[e] = (e, t) => e[t.freqKey] / UW.sum(e[t.freqKey]), c.table = c.table.params({ freqKey: e }).derive(t);
 				}
-			} else if ("orderby" in u) {
-				let e = c(u.in), t;
-				t = Array.isArray(u.orderby) ? u.orderby : [u.orderby];
+			} else if ("orderby" in d) {
+				let e = l(d.in), t;
+				t = Array.isArray(d.orderby) ? d.orderby : [d.orderby];
 				let n = t.flatMap((e) => {
 					if (typeof e == "string") return [e];
 					let t = Array.isArray(e.field) ? e.field : [e.field];
 					return e.order === "desc" ? t.map((e) => xWe(e)) : t;
 				});
-				s.table = e.orderby(n);
-			} else if ("derive" in u) {
-				let e = c(u.in), t = (0, f9.cloneDeep)(u.derive);
+				c.table = e.orderby(n);
+			} else if ("derive" in d) {
+				let e = l(d.in), t = (0, f9.cloneDeep)(d.derive);
 				for (let [e, n] of Object.entries(t)) if (typeof n != "string") {
 					if (p9(n)) t[e] = m9(n);
 					else {
@@ -95630,19 +95649,19 @@ var h9 = Oht("DataSourcesStore", () => {
 						t[e] = SWe(p9(r) ? m9(r) : r, n.rolling.window);
 					}
 				}
-				s.table = e.derive(t);
-			} else if ("join" in u) {
-				let [t, n] = u.in, r = e.get(t), i = e.get(n);
+				c.table = e.derive(t);
+			} else if ("join" in d) {
+				let [t, n] = d.in, r = e.get(t), i = e.get(n);
 				if (!r || !i) throw Error("join table not found");
-				let a = u.join.kind === "left" ? "join_left" : "join";
-				if (typeof u.join.on == "string" || u.join.on.every((e) => typeof e == "string")) s.table = r[a](i, u.join.on);
+				let a = d.join.kind === "left" ? "join_left" : "join";
+				if (typeof d.join.on == "string" || d.join.on.every((e) => typeof e == "string")) c.table = r[a](i, d.join.on);
 				else {
-					let [e, t] = u.join.on;
+					let [e, t] = d.join.on;
 					if (e.length !== t.length) throw Error("left and right multi keys must be the same length");
-					s.table = r.params({ leftMultiKeys: u.join.on[0] }).derive({ udi_internal_multi_key_join: EY((e, t) => t.leftMultiKeys.map((t) => e[t]).join("¶")) })[a](i.params({ rightMultiKeys: u.join.on[1] }).derive({ udi_internal_multi_key_join: EY((e, t) => t.rightMultiKeys.map((t) => e[t]).join("¶")) }), "udi_internal_multi_key_join");
+					c.table = r.params({ leftMultiKeys: d.join.on[0] }).derive({ udi_internal_multi_key_join: EY((e, t) => t.leftMultiKeys.map((t) => e[t]).join("¶")) })[a](i.params({ rightMultiKeys: d.join.on[1] }).derive({ udi_internal_multi_key_join: EY((e, t) => t.rightMultiKeys.map((t) => e[t]).join("¶")) }), "udi_internal_multi_key_join");
 				}
-			} else if ("kde" in u) {
-				let e = c(u.in), { field: t, samples: n } = u.kde, { bandwidth: r } = u.kde, { sample: i = "sample", density: a = "density" } = u.kde.output ?? {
+			} else if ("kde" in d) {
+				let e = l(d.in), { field: t, samples: n } = d.kde, { bandwidth: r } = d.kde, { sample: i = "sample", density: a = "density" } = d.kde.output ?? {
 					sample: "sample",
 					density: "density"
 				}, o = {
@@ -95651,25 +95670,25 @@ var h9 = Oht("DataSourcesStore", () => {
 				};
 				if (e.isGrouped()) for (let t of e.groups().names) t != null && (o[t] = []);
 				if (e.numRows() < 2) {
-					s.table = OY(o), l(u);
+					c.table = OY(o), u(d);
 					continue;
 				}
 				r ??= Lht(e.array(t), (e) => e), (r == null || !Number.isFinite(r) || r <= 0) && (r = 1);
-				let d, f = DY(e, UW.min(t)), p = DY(e, UW.max(t));
+				let s, f = DY(e, UW.min(t)), p = DY(e, UW.max(t));
 				if (!Number.isFinite(f) || !Number.isFinite(p) || f === p) {
-					s.table = OY(o), l(u);
+					c.table = OY(o), u(d);
 					continue;
 				}
 				let m = e.partitions(), h = e.column(t);
 				for (let t = 0; t < m.length; t++) {
 					let o = m[t];
 					if (!o || o.length < 2) continue;
-					let s = OY(Bht(Array.from(o, (e) => h?.at(e)), {
+					let c = OY(Bht(Array.from(o, (e) => h?.at(e)), {
 						bandwidth: r,
 						bins: n,
 						extent: [f, p]
 					}).points());
-					if (s = s.rename({
+					if (c = c.rename({
 						x: i,
 						y: a
 					}), e.isGrouped()) {
@@ -95680,21 +95699,21 @@ var h9 = Oht("DataSourcesStore", () => {
 							let i = n.get[e], a = n.rows[t];
 							if (a == null) throw Error("rowIndex is undefined");
 							let o = i(a);
-							s = s.derive({ [r]: EY(o) });
+							c = c.derive({ [r]: EY(o) });
 						}
 					}
-					d = d ? d.concat(s) : s;
+					s = s ? s.concat(c) : c;
 				}
-				d ||= OY(o), s.table = d;
+				s ||= OY(o), c.table = s;
 			}
-			l(u);
+			u(d);
 		}
 		return {
-			data: s.table,
-			containsNamedFilter: i
+			data: c.table,
+			containsNamedFilter: a
 		};
 	}
-	function O(e) {
+	function j(e) {
 		switch (e.op) {
 			case "count": return UW.count();
 			case "sum":
@@ -95716,19 +95735,22 @@ var h9 = Oht("DataSourcesStore", () => {
 	}
 	return {
 		dataSources: e,
-		loading: m,
-		tablesVersion: g,
-		selectionHash: h,
-		initDataSources: _,
-		seedDataSource: b,
-		getDataObject: E,
-		watchDataSelection: i,
-		getDataSelection: c,
-		updateDataSelection: a,
-		clearDataSelection: o,
-		clearAllSelections: s,
+		loading: v,
+		tablesVersion: b,
+		selectionHash: y,
+		initDataSources: x,
+		seedDataSource: w,
+		setCubeMetadata: r,
+		getCubeMetadata: i,
+		isCubeSource: a,
+		getDataObject: A,
+		watchDataSelection: c,
+		getDataSelection: f,
+		updateDataSelection: l,
+		clearDataSelection: u,
+		clearAllSelections: d,
 		dataSelections: t,
-		bindExternalDataSelections: r
+		bindExternalDataSelections: s
 	};
 }), g9 = {
 	kind: "local",
@@ -99221,20 +99243,23 @@ function Gvt(e) {
 }
 async function Kvt(e, t, n) {
 	let r = h9(e), i = [];
-	for (let e of t) try {
-		let t = await fetch(e.url, n?.fetchOptions);
-		if (!t.ok) throw Error(`HTTP ${t.status} ${t.statusText}`);
-		let a = _We(await t.text(), { delimiter: Gvt(e) });
-		r.seedDataSource(e.name, e.url, a), i.push({
-			entityName: e.name,
-			fieldDescriptions: e.fieldDescriptions ?? {},
-			columns: a.columnNames().map((e) => ({
-				name: e,
-				values: a.array(e)
-			}))
-		});
-	} catch (t) {
-		n?.onError?.(e.name, t instanceof Error ? t.message : String(t));
+	for (let e of t) {
+		r.setCubeMetadata(e.name, e.cube ?? null);
+		try {
+			let t = await fetch(e.url, n?.fetchOptions);
+			if (!t.ok) throw Error(`HTTP ${t.status} ${t.statusText}`);
+			let a = _We(await t.text(), { delimiter: Gvt(e) });
+			r.seedDataSource(e.name, e.url, a), i.push({
+				entityName: e.name,
+				fieldDescriptions: e.fieldDescriptions ?? {},
+				columns: a.columnNames().map((e) => ({
+					name: e,
+					values: a.array(e)
+				}))
+			});
+		} catch (t) {
+			n?.onError?.(e.name, t instanceof Error ? t.message : String(t));
+		}
 	}
 	if (i.length !== 0) try {
 		await qvt(i, n);
@@ -99300,16 +99325,19 @@ function Zvt(e, t) {
 	return Kvt($9, e, t);
 }
 function Qvt(e) {
+	return h9($9).getCubeMetadata(e);
+}
+function $vt(e) {
 	let t = h9($9);
 	return K6(() => t.selectionHash, () => e(), { flush: "sync" });
 }
-function $vt() {
+function eyt() {
 	h9($9).clearAllSelections();
 }
-var eyt = null, tyt = {};
-function nyt() {
+var tyt = null, nyt = {};
+function ryt() {
 	let e = h9($9);
-	return e.selectionHash !== eyt && (eyt = e.selectionHash, tyt = { ...e.dataSelections }), tyt;
+	return e.selectionHash !== tyt && (tyt = e.selectionHash, nyt = { ...e.dataSelections }), nyt;
 }
 //#endregion
-export { R9 as DEFAULT_PALETTE, g9 as LOCAL_BACKEND, Yvt as UDIVisElement, $vt as clearAllSelections, ggt as createRemoteBackend, n as formatTime, nyt as getDataSelections, _9 as getQueryBackend, Zvt as loadDataPackage, Xvt as queryData, hgt as setQueryBackend, o as setTimeFormats, Qvt as subscribeToSelections };
+export { R9 as DEFAULT_PALETTE, g9 as LOCAL_BACKEND, Yvt as UDIVisElement, eyt as clearAllSelections, ggt as createRemoteBackend, n as formatTime, Qvt as getCubeMetadata, ryt as getDataSelections, _9 as getQueryBackend, Zvt as loadDataPackage, Xvt as queryData, hgt as setQueryBackend, o as setTimeFormats, $vt as subscribeToSelections };