@gen-epix/ui-phylogenetic-tree 2.1.1 → 3.0.0

package/README.md

@@ -12,7 +12,7 @@ The platform is currently in beta and is not yet intended for production use. Fe
 
 ## About @gen-epix/ui-phylogenetic-tree
 
-`@gen-epix/ui-phylogenetic-tree` is a standalone React package that provides a phylogenetic tree visualization component for the Gen-EpiX platform. It has no dependency on the full `@gen-epix/ui` application framework.
+`@gen-epix/ui-phylogenetic-tree` is a standalone React package that provides a phylogenetic tree visualization component for the Gen-EpiX platform. It has no dependency on the full `@gen-epix/ui-client-common` application framework.
 
 - **Components** — `PhylogeneticTree` — an interactive, canvas-rendered phylogenetic tree viewer
 - **Models** — tree data types and interfaces (`tree`)

package/dist/_chunks/identity.js

@@ -5,10 +5,10 @@ var e = Object.create, t = Object.defineProperty, n = Object.getOwnPropertyDescr
 		enumerable: !(s = n(i, d)) || s.enumerable
 	});
 	return e;
-}, c = (n, r, a) => (a = n == null ? {} : e(i(n)), s(r || !n || !n.__esModule ? t(a, "default", {
+}, c = (n, r, o) => (o = n == null ? {} : e(i(n)), s(r || !n || !n.__esModule || !a.call(n, "default") ? t(o, "default", {
 	value: n,
 	enumerable: !0
-}) : a, n)), l = 9e15, u = 1e9, d = "0123456789abcdef", f = "2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058", p = "3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789", m = {
+}) : o, n)), l = 9e15, u = 1e9, d = "0123456789abcdef", f = "2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058", p = "3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789", m = {
 	precision: 20,
 	rounding: 4,
 	modulo: 1,
@@ -42,15 +42,17 @@ P.absoluteValue = P.abs = function() {
 }, P.cubeRoot = P.cbrt = function() {
 	var e, t, n, r, i, a, o, s, c, l, u = this, d = u.constructor;
 	if (!u.isFinite() || u.isZero()) return new d(u);
-	for (_ = !1, a = u.s * w(u.s * u, 1 / 3), !a || Math.abs(a) == Infinity ? (n = F(u.d), e = u.e, (a = (e - n.length + 1) % 3) && (n += a == 1 || a == -2 ? "0" : "00"), a = w(n, 1 / 3), e = C((e + 1) / 3) - (e % 3 == (e < 0 ? -1 : 2)), a == Infinity ? n = "5e" + e : (n = a.toExponential(), n = n.slice(0, n.indexOf("e") + 1) + e), r = new d(n), r.s = u.s) : r = new d(a.toString()), o = (e = d.precision) + 3;;) if (s = r, c = s.times(s).times(s), l = c.plus(u), r = z(l.plus(u).times(s), l.plus(c), o + 2, 1), F(s.d).slice(0, o) === (n = F(r.d)).slice(0, o)) if (n = n.slice(o - 3, o + 1), n == "9999" || !i && n == "4999") {
-		if (!i && (B(s, e + 1, 0), s.times(s).times(s).eq(u))) {
-			r = s;
+	for (_ = !1, a = u.s * w(u.s * u, 1 / 3), !a || Math.abs(a) == 1 / 0 ? (n = F(u.d), e = u.e, (a = (e - n.length + 1) % 3) && (n += a == 1 || a == -2 ? "0" : "00"), a = w(n, 1 / 3), e = C((e + 1) / 3) - (e % 3 == (e < 0 ? -1 : 2)), a == 1 / 0 ? n = "5e" + e : (n = a.toExponential(), n = n.slice(0, n.indexOf("e") + 1) + e), r = new d(n), r.s = u.s) : r = new d(a.toString()), o = (e = d.precision) + 3;;) if (s = r, c = s.times(s).times(s), l = c.plus(u), r = z(l.plus(u).times(s), l.plus(c), o + 2, 1), F(s.d).slice(0, o) === (n = F(r.d)).slice(0, o)) {
+		if (n = n.slice(o - 3, o + 1), n == "9999" || !i && n == "4999") {
+			if (!i && (B(s, e + 1, 0), s.times(s).times(s).eq(u))) {
+				r = s;
+				break;
+			}
+			o += 4, i = 1;
+		} else {
+			(!+n || !+n.slice(1) && n.charAt(0) == "5") && (B(r, e + 1, 1), t = !r.times(r).times(r).eq(u));
 			break;
 		}
-		o += 4, i = 1;
-	} else {
-		(!+n || !+n.slice(1) && n.charAt(0) == "5") && (B(r, e + 1, 1), t = !r.times(r).times(r).eq(u));
-		break;
 	}
 	return _ = !0, B(r, e, d.rounding, t);
 }, P.decimalPlaces = P.dp = function() {
@@ -76,7 +78,7 @@ P.absoluteValue = P.abs = function() {
 	return t == 1 || t === 0;
 }, P.hyperbolicCosine = P.cosh = function() {
 	var e, t, n, r, i, a = this, o = a.constructor, s = new o(1);
-	if (!a.isFinite()) return new o(a.s ? Infinity : NaN);
+	if (!a.isFinite()) return new o(a.s ? 1 / 0 : NaN);
 	if (a.isZero()) return s;
 	n = o.precision, r = o.rounding, o.precision = n + Math.max(a.e, a.sd()) + 4, o.rounding = 1, i = a.d.length, i < 32 ? (e = Math.ceil(i / 3), t = (1 / X(4, e)).toString()) : (e = 16, t = "2.3283064365386962890625e-10"), a = Y(o, 1, a.times(t), new o(1), !0);
 	for (var c, l = e, u = new o(8); l--;) c = a.times(a), a = s.minus(c.times(u.minus(c.times(u))));
@@ -141,11 +143,13 @@ P.absoluteValue = P.abs = function() {
 		if (e = new u(e), n = e.d, e.s < 0 || !n || !n[0] || e.eq(1)) return new u(NaN);
 		t = e.eq(10);
 	}
-	if (n = l.d, l.s < 0 || !n || !n[0] || l.eq(1)) return new u(n && !n[0] ? -Infinity : l.s == 1 ? n ? 0 : Infinity : NaN);
-	if (t) if (n.length > 1) a = !0;
-	else {
-		for (i = n[0]; i % 10 == 0;) i /= 10;
-		a = i !== 1;
+	if (n = l.d, l.s < 0 || !n || !n[0] || l.eq(1)) return new u(n && !n[0] ? -1 / 0 : l.s == 1 ? n ? 0 : 1 / 0 : NaN);
+	if (t) {
+		if (n.length > 1) a = !0;
+		else {
+			for (i = n[0]; i % 10 == 0;) i /= 10;
+			a = i !== 1;
+		}
 	}
 	if (_ = !1, s = d + p, o = q(l, s), r = t ? U(u, s + 10) : q(e, s), c = z(o, r, s, 1), L(c.d, i = d, f)) do
 		if (s += 10, o = q(l, s), r = t ? U(u, s + 10) : q(e, s), c = z(o, r, s, 1), !a) {
@@ -219,16 +223,18 @@ P.absoluteValue = P.abs = function() {
 	return n.isFinite() ? n.isZero() ? new r(n) : (e = r.precision, t = r.rounding, r.precision = e + Math.max(n.e, n.sd()) + A, r.rounding = 1, n = se(r, Z(r, n)), r.precision = e, r.rounding = t, B(g > 2 ? n.neg() : n, e, t, !0)) : new r(NaN);
 }, P.squareRoot = P.sqrt = function() {
 	var e, t, n, r, i, a, o = this, s = o.d, c = o.e, l = o.s, u = o.constructor;
-	if (l !== 1 || !s || !s[0]) return new u(!l || l < 0 && (!s || s[0]) ? NaN : s ? o : Infinity);
-	for (_ = !1, l = Math.sqrt(+o), l == 0 || l == Infinity ? (t = F(s), (t.length + c) % 2 == 0 && (t += "0"), l = Math.sqrt(t), c = C((c + 1) / 2) - (c < 0 || c % 2), l == Infinity ? t = "5e" + c : (t = l.toExponential(), t = t.slice(0, t.indexOf("e") + 1) + c), r = new u(t)) : r = new u(l.toString()), n = (c = u.precision) + 3;;) if (a = r, r = a.plus(z(o, a, n + 2, 1)).times(.5), F(a.d).slice(0, n) === (t = F(r.d)).slice(0, n)) if (t = t.slice(n - 3, n + 1), t == "9999" || !i && t == "4999") {
-		if (!i && (B(a, c + 1, 0), a.times(a).eq(o))) {
-			r = a;
+	if (l !== 1 || !s || !s[0]) return new u(!l || l < 0 && (!s || s[0]) ? NaN : s ? o : 1 / 0);
+	for (_ = !1, l = Math.sqrt(+o), l == 0 || l == 1 / 0 ? (t = F(s), (t.length + c) % 2 == 0 && (t += "0"), l = Math.sqrt(t), c = C((c + 1) / 2) - (c < 0 || c % 2), l == 1 / 0 ? t = "5e" + c : (t = l.toExponential(), t = t.slice(0, t.indexOf("e") + 1) + c), r = new u(t)) : r = new u(l.toString()), n = (c = u.precision) + 3;;) if (a = r, r = a.plus(z(o, a, n + 2, 1)).times(.5), F(a.d).slice(0, n) === (t = F(r.d)).slice(0, n)) {
+		if (t = t.slice(n - 3, n + 1), t == "9999" || !i && t == "4999") {
+			if (!i && (B(a, c + 1, 0), a.times(a).eq(o))) {
+				r = a;
+				break;
+			}
+			n += 4, i = 1;
+		} else {
+			(!+t || !+t.slice(1) && t.charAt(0) == "5") && (B(r, c + 1, 1), e = !r.times(r).eq(o));
 			break;
 		}
-		n += 4, i = 1;
-	} else {
-		(!+t || !+t.slice(1) && t.charAt(0) == "5") && (B(r, c + 1, 1), e = !r.times(r).eq(o));
-		break;
 	}
 	return _ = !0, B(r, c, u.rounding, e);
 }, P.tangent = P.tan = function() {
@@ -274,7 +280,7 @@ P.absoluteValue = P.abs = function() {
 		e = new r(1), t = r.rounding;
 	} else {
 		if (e = new r(e), t === void 0 ? t = r.rounding : I(t, 0, 8), !n.d) return e.s ? n : e;
-		if (!e.d) return e.s &&= n.s, e;
+		if (!e.d) return e.s && (e.s = n.s), e;
 	}
 	return e.d[0] ? (_ = !1, n = z(n, e, 0, t, 1).times(e), _ = !0, B(n)) : (e.s = n.s, n = e), n;
 }, P.toNumber = function() {
@@ -322,7 +328,7 @@ function I(e, t, n) {
 function L(e, t, n, r) {
 	var i, a, o, s;
 	for (a = e[0]; a >= 10; a /= 10) --t;
-	return --t < 0 ? (t += A, i = 0) : (i = Math.ceil((t + 1) / A), t %= A), a = w(10, A - t), s = e[i] % a | 0, r == null ? t < 3 ? (t == 0 ? s = s / 100 | 0 : t == 1 && (s = s / 10 | 0), o = n < 4 && s == 99999 || n > 3 && s == 49999 || s == 5e4 || s == 0) : o = (n < 4 && s + 1 == a || n > 3 && s + 1 == a / 2) && (e[i + 1] / a / 100 | 0) == w(10, t - 2) - 1 || (s == a / 2 || s == 0) && (e[i + 1] / a / 100 | 0) == 0 : t < 4 ? (t == 0 ? s = s / 1e3 | 0 : t == 1 ? s = s / 100 | 0 : t == 2 && (s = s / 10 | 0), o = (r || n < 4) && s == 9999 || !r && n > 3 && s == 4999) : o = ((r || n < 4) && s + 1 == a || !r && n > 3 && s + 1 == a / 2) && (e[i + 1] / a / 1e3 | 0) == w(10, t - 3) - 1, o;
+	return --t < 0 ? (t += A, i = 0) : (i = Math.ceil((t + 1) / A), t %= A), a = w(10, A - t), s = e[i] % a | 0, r == null ? t < 3 ? (t == 0 ? s = s / 100 | 0 : t == 1 && (s = s / 10 | 0), o = n < 4 && s == 99999 || n > 3 && s == 49999 || s == 5e4 || s == 0) : o = (n < 4 && s + 1 == a || n > 3 && s + 1 == a / 2) && (e[i + 1] / a / 100 | 0) == w(10, t - 2) - 1 || (s == a / 2 || s == 0) && !(e[i + 1] / a / 100 | 0) : t < 4 ? (t == 0 ? s = s / 1e3 | 0 : t == 1 ? s = s / 100 | 0 : t == 2 && (s = s / 10 | 0), o = (r || n < 4) && s == 9999 || !r && n > 3 && s == 4999) : o = ((r || n < 4) && s + 1 == a || !r && n > 3 && s + 1 == a / 2) && (e[i + 1] / a / 1e3 | 0) == w(10, t - 3) - 1, o;
 }
 function R(e, t, n) {
 	for (var r, i = [0], a, o = 0, s = e.length; o < s;) {
@@ -393,11 +399,12 @@ function B(e, t, n, r) {
 		if (d = e.d, !d) return e;
 		for (i = 1, s = d[0]; s >= 10; s /= 10) i++;
 		if (a = t - i, a < 0) a += A, o = t, u = d[f = 0], c = u / w(10, i - o - 1) % 10 | 0;
-		else if (f = Math.ceil((a + 1) / A), s = d.length, f >= s) if (r) {
-			for (; s++ <= f;) d.push(0);
-			u = c = 0, i = 1, a %= A, o = a - A + 1;
-		} else break out;
-		else {
+		else if (f = Math.ceil((a + 1) / A), s = d.length, f >= s) {
+			if (r) {
+				for (; s++ <= f;) d.push(0);
+				u = c = 0, i = 1, a %= A, o = a - A + 1;
+			} else break out;
+		} else {
 			for (u = s = d[f], i = 1; s >= 10; s /= 10) i++;
 			a %= A, o = a - A + i, c = o < 0 ? 0 : u / w(10, i - o - 1) % 10 | 0;
 		}
@@ -471,29 +478,33 @@ function ie(e, t, n) {
 }
 function K(e, t) {
 	var n, r, i, a, o, s, c, l = 0, u = 0, d = 0, f = e.constructor, p = f.rounding, m = f.precision;
-	if (!e.d || !e.d[0] || e.e > 17) return new f(e.d ? e.d[0] ? e.s < 0 ? 0 : Infinity : 1 : e.s ? e.s < 0 ? 0 : e : NaN);
+	if (!e.d || !e.d[0] || e.e > 17) return new f(e.d ? e.d[0] ? e.s < 0 ? 0 : 1 / 0 : 1 : e.s ? e.s < 0 ? 0 : e : NaN);
 	for (t == null ? (_ = !1, c = m) : c = t, s = new f(.03125); e.e > -2;) e = e.times(s), d += 5;
 	for (r = Math.log(w(2, d)) / Math.LN10 * 2 + 5 | 0, c += r, n = a = o = new f(1), f.precision = c;;) {
 		if (a = B(a.times(e), c, 1), n = n.times(++u), s = o.plus(z(a, n, c, 1)), F(s.d).slice(0, c) === F(o.d).slice(0, c)) {
 			for (i = d; i--;) o = B(o.times(o), c, 1);
-			if (t == null) if (l < 3 && L(o.d, c - r, p, l)) f.precision = c += 10, n = a = s = new f(1), u = 0, l++;
-			else return B(o, f.precision = m, p, _ = !0);
-			else return f.precision = m, o;
+			if (t == null) {
+				if (l < 3 && L(o.d, c - r, p, l)) f.precision = c += 10, n = a = s = new f(1), u = 0, l++;
+				else return B(o, f.precision = m, p, _ = !0);
+			} else return f.precision = m, o;
 		}
 		o = s;
 	}
 }
 function q(e, t) {
 	var n, r, i, a, o, s, c, l, u, d, f, p = 1, m = 10, h = e, g = h.d, v = h.constructor, y = v.rounding, b = v.precision;
-	if (h.s < 0 || !g || !g[0] || !h.e && g[0] == 1 && g.length == 1) return new v(g && !g[0] ? -Infinity : h.s == 1 ? g ? 0 : h : NaN);
+	if (h.s < 0 || !g || !g[0] || !h.e && g[0] == 1 && g.length == 1) return new v(g && !g[0] ? -1 / 0 : h.s == 1 ? g ? 0 : h : NaN);
 	if (t == null ? (_ = !1, u = b) : u = t, v.precision = u += m, n = F(g), r = n.charAt(0), Math.abs(a = h.e) < 0x5543df729c000) {
 		for (; r < 7 && r != 1 || r == 1 && n.charAt(1) > 3;) h = h.times(e), n = F(h.d), r = n.charAt(0), p++;
 		a = h.e, r > 1 ? (h = new v("0." + n), a++) : h = new v(r + "." + n.slice(1));
 	} else return l = U(v, u + 2, b).times(a + ""), h = q(new v(r + "." + n.slice(1)), u - m).plus(l), v.precision = b, t == null ? B(h, b, y, _ = !0) : h;
 	for (d = h, c = o = h = z(h.minus(1), h.plus(1), u, 1), f = B(h.times(h), u, 1), i = 3;;) {
-		if (o = B(o.times(f), u, 1), l = c.plus(z(o, new v(i), u, 1)), F(l.d).slice(0, u) === F(c.d).slice(0, u)) if (c = c.times(2), a !== 0 && (c = c.plus(U(v, u + 2, b).times(a + ""))), c = z(c, new v(p), u, 1), t == null) if (L(c.d, u - m, y, s)) v.precision = u += m, l = o = h = z(d.minus(1), d.plus(1), u, 1), f = B(h.times(h), u, 1), i = s = 1;
-		else return B(c, v.precision = b, y, _ = !0);
-		else return v.precision = b, c;
+		if (o = B(o.times(f), u, 1), l = c.plus(z(o, new v(i), u, 1)), F(l.d).slice(0, u) === F(c.d).slice(0, u)) {
+			if (c = c.times(2), a !== 0 && (c = c.plus(U(v, u + 2, b).times(a + ""))), c = z(c, new v(p), u, 1), t == null) {
+				if (L(c.d, u - m, y, s)) v.precision = u += m, l = o = h = z(d.minus(1), d.plus(1), u, 1), f = B(h.times(h), u, 1), i = s = 1;
+				else return B(c, v.precision = b, y, _ = !0);
+			} else return v.precision = b, c;
+		}
 		c = l, i += 2;
 	}
 }
@@ -569,11 +580,13 @@ function Q(e, t, n, r) {
 			for (c = p.length; !p[c - 1]; --c);
 			for (o = 0, f = ""; o < c; o++) f += d.charAt(p[o]);
 			if (_) {
-				if (c > 1) if (t == 16 || t == 8) {
-					for (o = t == 16 ? 4 : 3, --c; c % o; c++) f += "0";
-					for (p = R(f, i, t), c = p.length; !p[c - 1]; --c);
-					for (o = 1, f = "1."; o < c; o++) f += d.charAt(p[o]);
-				} else f = f.charAt(0) + "." + f.slice(1);
+				if (c > 1) {
+					if (t == 16 || t == 8) {
+						for (o = t == 16 ? 4 : 3, --c; c % o; c++) f += "0";
+						for (p = R(f, i, t), c = p.length; !p[c - 1]; --c);
+						for (o = 1, f = "1."; o < c; o++) f += d.charAt(p[o]);
+					} else f = f.charAt(0) + "." + f.slice(1);
+				}
 				f = f + (a < 0 ? "p" : "p+") + a;
 			} else if (a < 0) {
 				for (; ++a;) f = "0" + f;
@@ -651,12 +664,18 @@ function xe(e) {
 		0,
 		9
 	];
-	for (t = 0; t < a.length; t += 3) if (n = a[t], i && (this[n] = m[n]), (r = e[n]) !== void 0) if (C(r) === r && r >= a[t + 1] && r <= a[t + 2]) this[n] = r;
-	else throw Error(y + n + ": " + r);
-	if (n = "crypto", i && (this[n] = m[n]), (r = e[n]) !== void 0) if (r === !0 || r === !1 || r === 0 || r === 1) if (r) if (typeof crypto < "u" && crypto && (crypto.getRandomValues || crypto.randomBytes)) this[n] = !0;
-	else throw Error(x);
-	else this[n] = !1;
-	else throw Error(y + n + ": " + r);
+	for (t = 0; t < a.length; t += 3) if (n = a[t], i && (this[n] = m[n]), (r = e[n]) !== void 0) {
+		if (C(r) === r && r >= a[t + 1] && r <= a[t + 2]) this[n] = r;
+		else throw Error(y + n + ": " + r);
+	}
+	if (n = "crypto", i && (this[n] = m[n]), (r = e[n]) !== void 0) {
+		if (r === !0 || r === !1 || r === 0 || r === 1) {
+			if (r) {
+				if (typeof crypto < "u" && crypto && (crypto.getRandomValues || crypto.randomBytes)) this[n] = !0;
+				else throw Error(x);
+			} else this[n] = !1;
+		} else throw Error(y + n + ": " + r);
+	}
 	return this;
 }
 function Se(e) {
@@ -719,7 +738,7 @@ function Oe() {
 	var e, t, n = new this(0);
 	for (_ = !1, e = 0; e < arguments.length;) if (t = new this(arguments[e++]), t.d) n.d && (n = n.plus(t.times(t)));
 	else {
-		if (t.s) return _ = !0, new this(Infinity);
+		if (t.s) return _ = !0, new this(1 / 0);
 		n = t;
 	}
 	return _ = !0, n.sqrt();