@ndmspc/ndmvr-core 1.1.1 → 1.1.2-rc.2

package/dist/index.es.js

@@ -1010,6 +1010,7 @@ function et(e) {
 	if (!e) return;
 	let t = (e) => {
 		let t = -Infinity;
+		if (!e) return null;
 		for (let n = 0; n < e.length; n++) {
 			let r = e[n];
 			r > t && (t = r);
@@ -1019,7 +1020,7 @@ function et(e) {
 	n[0] = { content: t(e.fArray) }, e.fArrays && Object.keys(e?.fArrays).forEach((r) => {
 		n[0] = {
 			...n[0],
-			[r]: t(e.fArrays[r].values)
+			[r]: e.fArrays[r].max ?? t(e.fArrays[r].values)
 		};
 	});
 	let r = (e, i = 1) => {
@@ -1029,7 +1030,7 @@ function et(e) {
 				let o = t(a.fArray);
 				(!(e in n[i]) || o > n[i][e]) && (n[i][e] = o), a.fArrays && Object.keys(a.fArrays).forEach((e) => {
 					let r = a.fArrays[e].max;
-					(!(e in n[i]) || r > n[i][e]) && (n[i][e] = r), n[i][e] = Math.max(n[i][e], t(a.fArrays[e].values));
+					(!(e in n[i]) || r > n[i][e]) && (n[i][e] = r), n[i][e] = Math.max(n[i][e], a.fArrays[e].max ?? t(a.fArrays[e].values));
 				}), a.children && r(a.children, i + 1);
 			});
 		});
@@ -1039,6 +1040,7 @@ function et(e) {
 function tt(e, t) {
 	if (!e) return;
 	let n = (e) => {
+		if (!e) return null;
 		let t = 0;
 		for (let n = 0; n < e.length; n++) {
 			let r = e[n];
@@ -1049,7 +1051,7 @@ function tt(e, t) {
 	r[0] = { content: n(e.fSumw2) }, e.fArrays && Object.keys(e?.fArrays).forEach((t) => {
 		e.fArrays[t].errors && (r[0] = {
 			...r[0],
-			[t]: n(e.fArrays[t].errors)
+			[t]: n(e.fArrays[t].errors) ?? Math.sqrt(e.fArrays[t].max)
 		});
 	});
 	let i = (e, t = 1) => {
@@ -1058,7 +1060,7 @@ function tt(e, t) {
 				if (!a) return;
 				let o = n(a.fSumw2), s = isNaN(o) ? 0 : o;
 				(!(e in r[t]) || s > r[t][e]) && (r[t][e] = s), a.fArrays && Object.keys(a.fArrays).forEach((e) => {
-					a.fArrays[e].errors && ((!(e in r[t]) || s > r[t][e]) && (r[t][e] = s), r[t][e] = Math.max(r[t][e], n(a.fArrays[e].errors)));
+					a.fArrays[e].errors && ((!(e in r[t]) || s > r[t][e]) && (r[t][e] = s), r[t][e] = Math.max(r[t][e], n(a.fArrays[e].errors) ?? Math.sqrt(a.fArrays[e].max)));
 				}), a.children && i(a.children, t + 1);
 			});
 		});
@@ -1073,6 +1075,7 @@ function nt(e, t) {
 	if (!e) return;
 	let n = (e) => {
 		let t = Infinity;
+		if (!e) return null;
 		for (let n = 0; n < e.length; n++) {
 			let r = e[n];
 			r !== 0 && r < t && (t = r);
@@ -1082,17 +1085,17 @@ function nt(e, t) {
 	r[0] = { content: n(e.fSumw2) }, e.fArrays && Object.keys(e?.fArrays).forEach((t) => {
 		e.fArrays[t].errors && (r[0] = {
 			...r[0],
-			[t]: n(e.fArrays[t].errors)
+			[t]: n(e.fArrays[t].errors) ?? Math.sqrt(e.fArrays[t].min)
 		});
 	});
-	let i = (e, t = 1) => {
-		r[t] || (r[t] = {}), Object.entries(e).forEach(([e, a]) => {
-			a.forEach((a) => {
-				if (!a) return;
-				let o = n(a.fSumw2), s = isNaN(o) ? 0 : o;
-				(!(e in r[t]) || s < r[t][e]) && (r[t][e] = s), a.fArrays && Object.keys(a.fArrays).forEach((e) => {
-					a.fArrays[e].errors && ((!(e in r[t]) || s < r[t][e]) && (r[t][e] = s), r[t][e] = Math.min(r[t][e], n(a.fArrays[e].errors.filter((e) => e > 0))));
-				}), a.children && i(a.children, t + 1);
+	let i = (t, a = 1) => {
+		r[a] || (r[a] = {}), Object.entries(t).forEach(([t, o]) => {
+			o.forEach((o) => {
+				if (!o) return;
+				let s = n(o.fSumw2), c = isNaN(s) ? 0 : s;
+				(!(t in r[a]) || c < r[a][t]) && (r[a][t] = c), o.fArrays && Object.keys(o.fArrays).forEach((t) => {
+					o.fArrays[t].errors && ((!(t in r[a]) || c < r[a][t]) && (r[a][t] = c), r[a][t] = Math.min(r[a][t], n(o.fArrays[t]?.errors?.filter((e) => e > 0)) ?? Math.sqrt(e.fArrays[t].min)));
+				}), o.children && i(o.children, a + 1);
 			});
 		});
 	};
@@ -1106,6 +1109,7 @@ function rt(e) {
 	if (!e) return;
 	let t = (e) => {
 		let t = Infinity;
+		if (!e) return null;
 		for (let n = 0; n < e.length; n++) {
 			let r = e[n];
 			r < t && (t = r);
@@ -1115,17 +1119,17 @@ function rt(e) {
 	n[0] = { content: t(e.fArray.filter((e) => e !== 0)) }, e.fArrays && Object.keys(e?.fArrays).forEach((r) => {
 		n[0] = {
 			...n[0],
-			[r]: t(e.fArrays[r].values.filter((e) => e !== 0))
+			[r]: e.fArrays[r].min ?? t(e.fArrays[r]?.values?.filter((e) => e !== 0))
 		};
 	});
-	let r = (e, i = 1) => {
-		n[i] || (n[i] = {}), Object.entries(e).forEach(([e, a]) => {
-			a.forEach((a) => {
-				if (!a) return;
-				let o = t(a.fArray.filter((e) => e !== 0));
-				(!(e in n[i]) || o < n[i][e]) && (n[i][e] = o), a.fArrays && Object.keys(a.fArrays).forEach((e) => {
-					(!(e in n[i]) || o > n[i][e]) && (n[i][e] = o), n[i][e] = Math.min(n[i][e], t(a.fArrays[e].values.filter((e) => e !== 0)));
-				}), a.children && r(a.children, i + 1);
+	let r = (i, a = 1) => {
+		n[a] || (n[a] = {}), Object.entries(i).forEach(([i, o]) => {
+			o.forEach((o) => {
+				if (!o) return;
+				let s = t(o.fArray.filter((e) => e !== 0));
+				(!(i in n[a]) || s < n[a][i]) && (n[a][i] = s), o.fArrays && Object.keys(o.fArrays).forEach((r) => {
+					(!(r in n[a]) || s > n[a][r]) && (n[a][r] = s), n[a][r] = Math.min(n[a][r], e.fArrays[r].min ?? t(o.fArrays[r]?.values?.filter((e) => e !== 0)));
+				}), o.children && r(o.children, a + 1);
 			});
 		});
 	};
@@ -1786,6 +1790,64 @@ var $ = class {
 			obj: e.jsrootObj
 		});
 	}
+	getBinPosScaleByIndexMC(e, t) {
+		let n = t && t !== "content" ? this.matrixCache[e.length - 1][this.availableSets.indexOf(t)] : this.matrixCache[e.length - 1], r = e.at(-1) / this.maxInstancesPerLayer.slice(e.length).reduce((e, t) => e * t, 1) * 3;
+		return {
+			position: n.pos.slice(r, r + 3),
+			scale: n.scale.slice(r, r + 3)
+		};
+	}
+	getBinPosScaleByIndex(e, t, n, r) {
+		let i = ({ scale: e, position: t }) => ({
+			scale: {
+				x: e[0],
+				y: e[1],
+				z: e[2]
+			},
+			position: {
+				x: t[0],
+				y: t[1],
+				z: t[2]
+			}
+		}), a = e.length - 1, o = a === 0 ? this.limits : i(this.getBinPosScaleByIndexMC(e.slice(0, -1), null)), s = {
+			x: {
+				size: 0,
+				pos: 0
+			},
+			y: {
+				size: 0,
+				pos: 0
+			},
+			z: {
+				size: 0,
+				pos: 0
+			}
+		}, c = n._typename.substring(0, 3) === "TH1", l = this.config.padding.layer[a] ?? this.config.padding.default, u = !this.config.padding.layer[a] && c ? {
+			x: l.x,
+			y: l.y,
+			z: l.z
+		} : { ...l };
+		return t && this.config.padding.sets && c && (u = {
+			x: this.config.padding.sets.x,
+			y: 0,
+			z: 0
+		}), this.pointer.isOnSet && (u = {
+			x: 0,
+			y: 0,
+			z: 0
+		}), Ye(o.position.z, o.scale.z, qe(Je(n, r, u, o?.scale, o?.position, a, s))), {
+			position: [
+				s.x.pos,
+				s.y.pos,
+				s.z.pos
+			],
+			scale: [
+				s.x.size,
+				s.y.size,
+				s.z.size
+			]
+		};
+	}
 	mousemoveDefault(e) {
 		if (((e, t) => {
 			if (e.length !== t.length) return !1;
@@ -1812,20 +1874,22 @@ var $ = class {
 				bin: r
 			};
 		});
-		let { range: n, level: r, content: i, error: a, set: o, triggerSource: s, instanceId: c } = {
+		let n = {
 			...e,
 			level: t.length,
 			range: t.concat(e.range)
-		}, l = {
-			coords: n,
-			level: r,
-			content: i,
-			error: a,
-			set: o,
-			triggerSource: s,
-			instanceId: c
+		}, { range: r, level: i, content: a, error: o, set: s, triggerSource: c, instanceId: l } = n, u = {
+			coords: r,
+			level: i,
+			content: a,
+			error: o,
+			set: s,
+			triggerSource: c,
+			instanceId: l,
+			binPosSize: this.getBinPosScaleByIndexMC(n.instanceId, n.set),
+			binWholePosSize: this.getBinPosScaleByIndex(n.instanceId, n.set, n.jsrootObj, n.index.at(-1))
 		};
-		G().next(l);
+		G().next(u);
 	}
 	shiftMouseClickDefault(e) {
 		this.hideChildHistogram(e.index);