@gen-epix/ui-phylogenetic-tree 2.0.0

package/dist/_chunks/identity.js

@@ -0,0 +1,820 @@
+//#region \0rolldown/runtime.js
+var e = Object.create, t = Object.defineProperty, n = Object.getOwnPropertyDescriptor, r = Object.getOwnPropertyNames, i = Object.getPrototypeOf, a = Object.prototype.hasOwnProperty, o = (e, t) => () => (t || (e((t = { exports: {} }).exports, t), e = null), t.exports), s = (e, i, o, s) => {
+	if (i && typeof i == "object" || typeof i == "function") for (var c = r(i), l = 0, u = c.length, d; l < u; l++) d = c[l], !a.call(e, d) && d !== o && t(e, d, {
+		get: ((e) => i[e]).bind(null, d),
+		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", {
+	value: n,
+	enumerable: !0
+}) : a, n)), l = 9e15, u = 1e9, d = "0123456789abcdef", f = "2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058", p = "3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789", m = {
+	precision: 20,
+	rounding: 4,
+	modulo: 1,
+	toExpNeg: -7,
+	toExpPos: 21,
+	minE: -l,
+	maxE: l,
+	crypto: !1
+}, h, g, _ = !0, v = "[DecimalError] ", y = v + "Invalid argument: ", b = v + "Precision limit exceeded", x = v + "crypto unavailable", S = "[object Decimal]", C = Math.floor, w = Math.pow, T = /^0b([01]+(\.[01]*)?|\.[01]+)(p[+-]?\d+)?$/i, E = /^0x([0-9a-f]+(\.[0-9a-f]*)?|\.[0-9a-f]+)(p[+-]?\d+)?$/i, D = /^0o([0-7]+(\.[0-7]*)?|\.[0-7]+)(p[+-]?\d+)?$/i, O = /^(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i, k = 1e7, A = 7, j = 9007199254740991, M = f.length - 1, N = p.length - 1, P = { toStringTag: S };
+P.absoluteValue = P.abs = function() {
+	var e = new this.constructor(this);
+	return e.s < 0 && (e.s = 1), B(e);
+}, P.ceil = function() {
+	return B(new this.constructor(this), this.e + 1, 2);
+}, P.clampedTo = P.clamp = function(e, t) {
+	var n, r = this, i = r.constructor;
+	if (e = new i(e), t = new i(t), !e.s || !t.s) return new i(NaN);
+	if (e.gt(t)) throw Error(y + t);
+	return n = r.cmp(e), n < 0 ? e : r.cmp(t) > 0 ? t : new i(r);
+}, P.comparedTo = P.cmp = function(e) {
+	var t, n, r, i, a = this, o = a.d, s = (e = new a.constructor(e)).d, c = a.s, l = e.s;
+	if (!o || !s) return !c || !l ? NaN : c === l ? o === s ? 0 : !o ^ c < 0 ? 1 : -1 : c;
+	if (!o[0] || !s[0]) return o[0] ? c : s[0] ? -l : 0;
+	if (c !== l) return c;
+	if (a.e !== e.e) return a.e > e.e ^ c < 0 ? 1 : -1;
+	for (r = o.length, i = s.length, t = 0, n = r < i ? r : i; t < n; ++t) if (o[t] !== s[t]) return o[t] > s[t] ^ c < 0 ? 1 : -1;
+	return r === i ? 0 : r > i ^ c < 0 ? 1 : -1;
+}, P.cosine = P.cos = function() {
+	var e, t, n = this, r = n.constructor;
+	return n.d ? n.d[0] ? (e = r.precision, t = r.rounding, r.precision = e + Math.max(n.e, n.sd()) + A, r.rounding = 1, n = ee(r, Z(r, n)), r.precision = e, r.rounding = t, B(g == 2 || g == 3 ? n.neg() : n, e, t, !0)) : new r(1) : new r(NaN);
+}, 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;
+			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() {
+	var e, t = this.d, n = NaN;
+	if (t) {
+		if (e = t.length - 1, n = (e - C(this.e / A)) * A, e = t[e], e) for (; e % 10 == 0; e /= 10) n--;
+		n < 0 && (n = 0);
+	}
+	return n;
+}, P.dividedBy = P.div = function(e) {
+	return z(this, new this.constructor(e));
+}, P.dividedToIntegerBy = P.divToInt = function(e) {
+	var t = this, n = t.constructor;
+	return B(z(t, new n(e), 0, 1, 1), n.precision, n.rounding);
+}, P.equals = P.eq = function(e) {
+	return this.cmp(e) === 0;
+}, P.floor = function() {
+	return B(new this.constructor(this), this.e + 1, 3);
+}, P.greaterThan = P.gt = function(e) {
+	return this.cmp(e) > 0;
+}, P.greaterThanOrEqualTo = P.gte = function(e) {
+	var t = this.cmp(e);
+	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.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))));
+	return B(a, o.precision = n, o.rounding = r, !0);
+}, P.hyperbolicSine = P.sinh = function() {
+	var e, t, n, r, i = this, a = i.constructor;
+	if (!i.isFinite() || i.isZero()) return new a(i);
+	if (t = a.precision, n = a.rounding, a.precision = t + Math.max(i.e, i.sd()) + 4, a.rounding = 1, r = i.d.length, r < 3) i = Y(a, 2, i, i, !0);
+	else {
+		e = 1.4 * Math.sqrt(r), e = e > 16 ? 16 : e | 0, i = i.times(1 / X(5, e)), i = Y(a, 2, i, i, !0);
+		for (var o, s = new a(5), c = new a(16), l = new a(20); e--;) o = i.times(i), i = i.times(s.plus(o.times(c.times(o).plus(l))));
+	}
+	return a.precision = t, a.rounding = n, B(i, t, n, !0);
+}, P.hyperbolicTangent = P.tanh = function() {
+	var e, t, n = this, r = n.constructor;
+	return n.isFinite() ? n.isZero() ? new r(n) : (e = r.precision, t = r.rounding, r.precision = e + 7, r.rounding = 1, z(n.sinh(), n.cosh(), r.precision = e, r.rounding = t)) : new r(n.s);
+}, P.inverseCosine = P.acos = function() {
+	var e = this, t = e.constructor, n = e.abs().cmp(1), r = t.precision, i = t.rounding;
+	return n === -1 ? e.isZero() ? W(t, r + 4, i).times(.5) : (t.precision = r + 6, t.rounding = 1, e = new t(1).minus(e).div(e.plus(1)).sqrt().atan(), t.precision = r, t.rounding = i, e.times(2)) : n === 0 ? e.isNeg() ? W(t, r, i) : new t(0) : new t(NaN);
+}, P.inverseHyperbolicCosine = P.acosh = function() {
+	var e, t, n = this, r = n.constructor;
+	return n.lte(1) ? new r(n.eq(1) ? 0 : NaN) : n.isFinite() ? (e = r.precision, t = r.rounding, r.precision = e + Math.max(Math.abs(n.e), n.sd()) + 4, r.rounding = 1, _ = !1, n = n.times(n).minus(1).sqrt().plus(n), _ = !0, r.precision = e, r.rounding = t, n.ln()) : new r(n);
+}, P.inverseHyperbolicSine = P.asinh = function() {
+	var e, t, n = this, r = n.constructor;
+	return !n.isFinite() || n.isZero() ? new r(n) : (e = r.precision, t = r.rounding, r.precision = e + 2 * Math.max(Math.abs(n.e), n.sd()) + 6, r.rounding = 1, _ = !1, n = n.times(n).plus(1).sqrt().plus(n), _ = !0, r.precision = e, r.rounding = t, n.ln());
+}, P.inverseHyperbolicTangent = P.atanh = function() {
+	var e, t, n, r, i = this, a = i.constructor;
+	return i.isFinite() ? i.e >= 0 ? new a(i.abs().eq(1) ? i.s / 0 : i.isZero() ? i : NaN) : (e = a.precision, t = a.rounding, r = i.sd(), Math.max(r, e) < 2 * -i.e - 1 ? B(new a(i), e, t, !0) : (a.precision = n = r - i.e, i = z(i.plus(1), new a(1).minus(i), n + e, 1), a.precision = e + 4, a.rounding = 1, i = i.ln(), a.precision = e, a.rounding = t, i.times(.5))) : new a(NaN);
+}, P.inverseSine = P.asin = function() {
+	var e, t, n, r, i = this, a = i.constructor;
+	return i.isZero() ? new a(i) : (t = i.abs().cmp(1), n = a.precision, r = a.rounding, t === -1 ? (a.precision = n + 6, a.rounding = 1, i = i.div(new a(1).minus(i.times(i)).sqrt().plus(1)).atan(), a.precision = n, a.rounding = r, i.times(2)) : t === 0 ? (e = W(a, n + 4, r).times(.5), e.s = i.s, e) : new a(NaN));
+}, P.inverseTangent = P.atan = function() {
+	var e, t, n, r, i, a, o, s, c, l = this, u = l.constructor, d = u.precision, f = u.rounding;
+	if (!l.isFinite()) {
+		if (!l.s) return new u(NaN);
+		if (d + 4 <= N) return o = W(u, d + 4, f).times(.5), o.s = l.s, o;
+	} else if (l.isZero()) return new u(l);
+	else if (l.abs().eq(1) && d + 4 <= N) return o = W(u, d + 4, f).times(.25), o.s = l.s, o;
+	for (u.precision = s = d + 10, u.rounding = 1, n = Math.min(28, s / A + 2 | 0), e = n; e; --e) l = l.div(l.times(l).plus(1).sqrt().plus(1));
+	for (_ = !1, t = Math.ceil(s / A), r = 1, c = l.times(l), o = new u(l), i = l; e !== -1;) if (i = i.times(c), a = o.minus(i.div(r += 2)), i = i.times(c), o = a.plus(i.div(r += 2)), o.d[t] !== void 0) for (e = t; o.d[e] === a.d[e] && e--;);
+	return n && (o = o.times(2 << n - 1)), _ = !0, B(o, u.precision = d, u.rounding = f, !0);
+}, P.isFinite = function() {
+	return !!this.d;
+}, P.isInteger = P.isInt = function() {
+	return !!this.d && C(this.e / A) > this.d.length - 2;
+}, P.isNaN = function() {
+	return !this.s;
+}, P.isNegative = P.isNeg = function() {
+	return this.s < 0;
+}, P.isPositive = P.isPos = function() {
+	return this.s > 0;
+}, P.isZero = function() {
+	return !!this.d && this.d[0] === 0;
+}, P.lessThan = P.lt = function(e) {
+	return this.cmp(e) < 0;
+}, P.lessThanOrEqualTo = P.lte = function(e) {
+	return this.cmp(e) < 1;
+}, P.logarithm = P.log = function(e) {
+	var t, n, r, i, a, o, s, c, l = this, u = l.constructor, d = u.precision, f = u.rounding, p = 5;
+	if (e == null) e = new u(10), t = !0;
+	else {
+		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 (_ = !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) {
+			+F(c.d).slice(i + 1, i + 15) + 1 == 0x5af3107a4000 && (c = B(c, d + 1, 0));
+			break;
+		}
+	while (L(c.d, i += 10, f));
+	return _ = !0, B(c, d, f);
+}, P.minus = P.sub = function(e) {
+	var t, n, r, i, a, o, s, c, l, u, d, f, p = this, m = p.constructor;
+	if (e = new m(e), !p.d || !e.d) return !p.s || !e.s ? e = new m(NaN) : p.d ? e.s = -e.s : e = new m(e.d || p.s !== e.s ? p : NaN), e;
+	if (p.s != e.s) return e.s = -e.s, p.plus(e);
+	if (l = p.d, f = e.d, s = m.precision, c = m.rounding, !l[0] || !f[0]) {
+		if (f[0]) e.s = -e.s;
+		else if (l[0]) e = new m(p);
+		else return new m(c === 3 ? -0 : 0);
+		return _ ? B(e, s, c) : e;
+	}
+	if (n = C(e.e / A), u = C(p.e / A), l = l.slice(), a = u - n, a) {
+		for (d = a < 0, d ? (t = l, a = -a, o = f.length) : (t = f, n = u, o = l.length), r = Math.max(Math.ceil(s / A), o) + 2, a > r && (a = r, t.length = 1), t.reverse(), r = a; r--;) t.push(0);
+		t.reverse();
+	} else {
+		for (r = l.length, o = f.length, d = r < o, d && (o = r), r = 0; r < o; r++) if (l[r] != f[r]) {
+			d = l[r] < f[r];
+			break;
+		}
+		a = 0;
+	}
+	for (d && (t = l, l = f, f = t, e.s = -e.s), o = l.length, r = f.length - o; r > 0; --r) l[o++] = 0;
+	for (r = f.length; r > a;) {
+		if (l[--r] < f[r]) {
+			for (i = r; i && l[--i] === 0;) l[i] = k - 1;
+			--l[i], l[r] += k;
+		}
+		l[r] -= f[r];
+	}
+	for (; l[--o] === 0;) l.pop();
+	for (; l[0] === 0; l.shift()) --n;
+	return l[0] ? (e.d = l, e.e = H(l, n), _ ? B(e, s, c) : e) : new m(c === 3 ? -0 : 0);
+}, P.modulo = P.mod = function(e) {
+	var t, n = this, r = n.constructor;
+	return e = new r(e), !n.d || !e.s || e.d && !e.d[0] ? new r(NaN) : !e.d || n.d && !n.d[0] ? B(new r(n), r.precision, r.rounding) : (_ = !1, r.modulo == 9 ? (t = z(n, e.abs(), 0, 3, 1), t.s *= e.s) : t = z(n, e, 0, r.modulo, 1), t = t.times(e), _ = !0, n.minus(t));
+}, P.naturalExponential = P.exp = function() {
+	return K(this);
+}, P.naturalLogarithm = P.ln = function() {
+	return q(this);
+}, P.negated = P.neg = function() {
+	var e = new this.constructor(this);
+	return e.s = -e.s, B(e);
+}, P.plus = P.add = function(e) {
+	var t, n, r, i, a, o, s, c, l, u, d = this, f = d.constructor;
+	if (e = new f(e), !d.d || !e.d) return !d.s || !e.s ? e = new f(NaN) : d.d || (e = new f(e.d || d.s === e.s ? d : NaN)), e;
+	if (d.s != e.s) return e.s = -e.s, d.minus(e);
+	if (l = d.d, u = e.d, s = f.precision, c = f.rounding, !l[0] || !u[0]) return u[0] || (e = new f(d)), _ ? B(e, s, c) : e;
+	if (a = C(d.e / A), r = C(e.e / A), l = l.slice(), i = a - r, i) {
+		for (i < 0 ? (n = l, i = -i, o = u.length) : (n = u, r = a, o = l.length), a = Math.ceil(s / A), o = a > o ? a + 1 : o + 1, i > o && (i = o, n.length = 1), n.reverse(); i--;) n.push(0);
+		n.reverse();
+	}
+	for (o = l.length, i = u.length, o - i < 0 && (i = o, n = u, u = l, l = n), t = 0; i;) t = (l[--i] = l[i] + u[i] + t) / k | 0, l[i] %= k;
+	for (t && (l.unshift(t), ++r), o = l.length; l[--o] == 0;) l.pop();
+	return e.d = l, e.e = H(l, r), _ ? B(e, s, c) : e;
+}, P.precision = P.sd = function(e) {
+	var t, n = this;
+	if (e !== void 0 && e !== !!e && e !== 1 && e !== 0) throw Error(y + e);
+	return n.d ? (t = te(n.d), e && n.e + 1 > t && (t = n.e + 1)) : t = NaN, t;
+}, P.round = function() {
+	var e = this, t = e.constructor;
+	return B(new t(e), e.e + 1, t.rounding);
+}, P.sine = P.sin = function() {
+	var e, t, n = this, r = n.constructor;
+	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;
+			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() {
+	var e, t, n = this, r = n.constructor;
+	return n.isFinite() ? n.isZero() ? new r(n) : (e = r.precision, t = r.rounding, r.precision = e + 10, r.rounding = 1, n = n.sin(), n.s = 1, n = z(n, new r(1).minus(n.times(n)).sqrt(), e + 10, 0), r.precision = e, r.rounding = t, B(g == 2 || g == 4 ? n.neg() : n, e, t, !0)) : new r(NaN);
+}, P.times = P.mul = function(e) {
+	var t, n, r, i, a, o, s, c, l, u = this, d = u.constructor, f = u.d, p = (e = new d(e)).d;
+	if (e.s *= u.s, !f || !f[0] || !p || !p[0]) return new d(!e.s || f && !f[0] && !p || p && !p[0] && !f ? NaN : !f || !p ? e.s / 0 : e.s * 0);
+	for (n = C(u.e / A) + C(e.e / A), c = f.length, l = p.length, c < l && (a = f, f = p, p = a, o = c, c = l, l = o), a = [], o = c + l, r = o; r--;) a.push(0);
+	for (r = l; --r >= 0;) {
+		for (t = 0, i = c + r; i > r;) s = a[i] + p[r] * f[i - r - 1] + t, a[i--] = s % k | 0, t = s / k | 0;
+		a[i] = (a[i] + t) % k | 0;
+	}
+	for (; !a[--o];) a.pop();
+	return t ? ++n : a.shift(), e.d = a, e.e = H(a, n), _ ? B(e, d.precision, d.rounding) : e;
+}, P.toBinary = function(e, t) {
+	return Q(this, 2, e, t);
+}, P.toDecimalPlaces = P.toDP = function(e, t) {
+	var n = this, r = n.constructor;
+	return n = new r(n), e === void 0 ? n : (I(e, 0, u), t === void 0 ? t = r.rounding : I(t, 0, 8), B(n, e + n.e + 1, t));
+}, P.toExponential = function(e, t) {
+	var n, r = this, i = r.constructor;
+	return e === void 0 ? n = V(r, !0) : (I(e, 0, u), t === void 0 ? t = i.rounding : I(t, 0, 8), r = B(new i(r), e + 1, t), n = V(r, !0, e + 1)), r.isNeg() && !r.isZero() ? "-" + n : n;
+}, P.toFixed = function(e, t) {
+	var n, r, i = this, a = i.constructor;
+	return e === void 0 ? n = V(i) : (I(e, 0, u), t === void 0 ? t = a.rounding : I(t, 0, 8), r = B(new a(i), e + i.e + 1, t), n = V(r, !1, e + r.e + 1)), i.isNeg() && !i.isZero() ? "-" + n : n;
+}, P.toFraction = function(e) {
+	var t, n, r, i, a, o, s, c, l, u, d, f, p = this, m = p.d, h = p.constructor;
+	if (!m) return new h(p);
+	if (l = n = new h(1), r = c = new h(0), t = new h(r), a = t.e = te(m) - p.e - 1, o = a % A, t.d[0] = w(10, o < 0 ? A + o : o), e == null) e = a > 0 ? t : l;
+	else {
+		if (s = new h(e), !s.isInt() || s.lt(l)) throw Error(y + s);
+		e = s.gt(t) ? a > 0 ? t : l : s;
+	}
+	for (_ = !1, s = new h(F(m)), u = h.precision, h.precision = a = m.length * A * 2; d = z(s, t, 0, 1, 1), i = n.plus(d.times(r)), i.cmp(e) != 1;) n = r, r = i, i = l, l = c.plus(d.times(i)), c = i, i = t, t = s.minus(d.times(i)), s = i;
+	return i = z(e.minus(n), r, 0, 1, 1), c = c.plus(i.times(l)), n = n.plus(i.times(r)), c.s = l.s = p.s, f = z(l, r, a, 1).minus(p).abs().cmp(z(c, n, a, 1).minus(p).abs()) < 1 ? [l, r] : [c, n], h.precision = u, _ = !0, f;
+}, P.toHexadecimal = P.toHex = function(e, t) {
+	return Q(this, 16, e, t);
+}, P.toNearest = function(e, t) {
+	var n = this, r = n.constructor;
+	if (n = new r(n), e == null) {
+		if (!n.d) return n;
+		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;
+	}
+	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() {
+	return +this;
+}, P.toOctal = function(e, t) {
+	return Q(this, 8, e, t);
+}, P.toPower = P.pow = function(e) {
+	var t, n, r, i, a, o, s = this, c = s.constructor, l = +(e = new c(e));
+	if (!s.d || !e.d || !s.d[0] || !e.d[0]) return new c(w(+s, l));
+	if (s = new c(s), s.eq(1)) return s;
+	if (r = c.precision, a = c.rounding, e.eq(1)) return B(s, r, a);
+	if (t = C(e.e / A), t >= e.d.length - 1 && (n = l < 0 ? -l : l) <= j) return i = ne(c, s, n, r), e.s < 0 ? new c(1).div(i) : B(i, r, a);
+	if (o = s.s, o < 0) {
+		if (t < e.d.length - 1) return new c(NaN);
+		if (e.d[t] & 1 || (o = 1), s.e == 0 && s.d[0] == 1 && s.d.length == 1) return s.s = o, s;
+	}
+	return n = w(+s, l), t = n == 0 || !isFinite(n) ? C(l * (Math.log("0." + F(s.d)) / Math.LN10 + s.e + 1)) : new c(n + "").e, t > c.maxE + 1 || t < c.minE - 1 ? new c(t > 0 ? o / 0 : 0) : (_ = !1, c.rounding = s.s = 1, n = Math.min(12, (t + "").length), i = K(e.times(q(s, r + n)), r), i.d && (i = B(i, r + 5, 1), L(i.d, r, a) && (t = r + 10, i = B(K(e.times(q(s, t + n)), t), t + 5, 1), +F(i.d).slice(r + 1, r + 15) + 1 == 0x5af3107a4000 && (i = B(i, r + 1, 0)))), i.s = o, _ = !0, c.rounding = a, B(i, r, a));
+}, P.toPrecision = function(e, t) {
+	var n, r = this, i = r.constructor;
+	return e === void 0 ? n = V(r, r.e <= i.toExpNeg || r.e >= i.toExpPos) : (I(e, 1, u), t === void 0 ? t = i.rounding : I(t, 0, 8), r = B(new i(r), e, t), n = V(r, e <= r.e || r.e <= i.toExpNeg, e)), r.isNeg() && !r.isZero() ? "-" + n : n;
+}, P.toSignificantDigits = P.toSD = function(e, t) {
+	var n = this, r = n.constructor;
+	return e === void 0 ? (e = r.precision, t = r.rounding) : (I(e, 1, u), t === void 0 ? t = r.rounding : I(t, 0, 8)), B(new r(n), e, t);
+}, P.toString = function() {
+	var e = this, t = e.constructor, n = V(e, e.e <= t.toExpNeg || e.e >= t.toExpPos);
+	return e.isNeg() && !e.isZero() ? "-" + n : n;
+}, P.truncated = P.trunc = function() {
+	return B(new this.constructor(this), this.e + 1, 1);
+}, P.valueOf = P.toJSON = function() {
+	var e = this, t = e.constructor, n = V(e, e.e <= t.toExpNeg || e.e >= t.toExpPos);
+	return e.isNeg() ? "-" + n : n;
+};
+function F(e) {
+	var t, n, r, i = e.length - 1, a = "", o = e[0];
+	if (i > 0) {
+		for (a += o, t = 1; t < i; t++) r = e[t] + "", n = A - r.length, n && (a += G(n)), a += r;
+		o = e[t], r = o + "", n = A - r.length, n && (a += G(n));
+	} else if (o === 0) return "0";
+	for (; o % 10 == 0;) o /= 10;
+	return a + o;
+}
+function I(e, t, n) {
+	if (e !== ~~e || e < t || e > n) throw Error(y + e);
+}
+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;
+}
+function R(e, t, n) {
+	for (var r, i = [0], a, o = 0, s = e.length; o < s;) {
+		for (a = i.length; a--;) i[a] *= t;
+		for (i[0] += d.indexOf(e.charAt(o++)), r = 0; r < i.length; r++) i[r] > n - 1 && (i[r + 1] === void 0 && (i[r + 1] = 0), i[r + 1] += i[r] / n | 0, i[r] %= n);
+	}
+	return i.reverse();
+}
+function ee(e, t) {
+	var n, r, i;
+	if (t.isZero()) return t;
+	r = t.d.length, r < 32 ? (n = Math.ceil(r / 3), i = (1 / X(4, n)).toString()) : (n = 16, i = "2.3283064365386962890625e-10"), e.precision += n, t = Y(e, 1, t.times(i), new e(1));
+	for (var a = n; a--;) {
+		var o = t.times(t);
+		t = o.times(o).minus(o).times(8).plus(1);
+	}
+	return e.precision -= n, t;
+}
+var z = (function() {
+	function e(e, t, n) {
+		var r, i = 0, a = e.length;
+		for (e = e.slice(); a--;) r = e[a] * t + i, e[a] = r % n | 0, i = r / n | 0;
+		return i && e.unshift(i), e;
+	}
+	function t(e, t, n, r) {
+		var i, a;
+		if (n != r) a = n > r ? 1 : -1;
+		else for (i = a = 0; i < n; i++) if (e[i] != t[i]) {
+			a = e[i] > t[i] ? 1 : -1;
+			break;
+		}
+		return a;
+	}
+	function n(e, t, n, r) {
+		for (var i = 0; n--;) e[n] -= i, i = +(e[n] < t[n]), e[n] = i * r + e[n] - t[n];
+		for (; !e[0] && e.length > 1;) e.shift();
+	}
+	return function(r, i, a, o, s, c) {
+		var l, u, d, f, p, m, g, _, v, y, b, x, S, w, T, E, D, O, j, M, N = r.constructor, P = r.s == i.s ? 1 : -1, F = r.d, I = i.d;
+		if (!F || !F[0] || !I || !I[0]) return new N(!r.s || !i.s || (F ? I && F[0] == I[0] : !I) ? NaN : F && F[0] == 0 || !I ? P * 0 : P / 0);
+		for (c ? (p = 1, u = r.e - i.e) : (c = k, p = A, u = C(r.e / p) - C(i.e / p)), j = I.length, D = F.length, v = new N(P), y = v.d = [], d = 0; I[d] == (F[d] || 0); d++);
+		if (I[d] > (F[d] || 0) && u--, a == null ? (w = a = N.precision, o = N.rounding) : w = s ? a + (r.e - i.e) + 1 : a, w < 0) y.push(1), m = !0;
+		else {
+			if (w = w / p + 2 | 0, d = 0, j == 1) {
+				for (f = 0, I = I[0], w++; (d < D || f) && w--; d++) T = f * c + (F[d] || 0), y[d] = T / I | 0, f = T % I | 0;
+				m = f || d < D;
+			} else {
+				for (f = c / (I[0] + 1) | 0, f > 1 && (I = e(I, f, c), F = e(F, f, c), j = I.length, D = F.length), E = j, b = F.slice(0, j), x = b.length; x < j;) b[x++] = 0;
+				M = I.slice(), M.unshift(0), O = I[0], I[1] >= c / 2 && ++O;
+				do
+					f = 0, l = t(I, b, j, x), l < 0 ? (S = b[0], j != x && (S = S * c + (b[1] || 0)), f = S / O | 0, f > 1 ? (f >= c && (f = c - 1), g = e(I, f, c), _ = g.length, x = b.length, l = t(g, b, _, x), l == 1 && (f--, n(g, j < _ ? M : I, _, c))) : (f == 0 && (l = f = 1), g = I.slice()), _ = g.length, _ < x && g.unshift(0), n(b, g, x, c), l == -1 && (x = b.length, l = t(I, b, j, x), l < 1 && (f++, n(b, j < x ? M : I, x, c))), x = b.length) : l === 0 && (f++, b = [0]), y[d++] = f, l && b[0] ? b[x++] = F[E] || 0 : (b = [F[E]], x = 1);
+				while ((E++ < D || b[0] !== void 0) && w--);
+				m = b[0] !== void 0;
+			}
+			y[0] || y.shift();
+		}
+		if (p == 1) v.e = u, h = m;
+		else {
+			for (d = 1, f = y[0]; f >= 10; f /= 10) d++;
+			v.e = d + u * p - 1, B(v, s ? a + v.e + 1 : a, o, m);
+		}
+		return v;
+	};
+})();
+function B(e, t, n, r) {
+	var i, a, o, s, c, l, u, d, f, p = e.constructor;
+	out: if (t != null) {
+		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 {
+			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;
+		}
+		if (r = r || t < 0 || d[f + 1] !== void 0 || (o < 0 ? u : u % w(10, i - o - 1)), l = n < 4 ? (c || r) && (n == 0 || n == (e.s < 0 ? 3 : 2)) : c > 5 || c == 5 && (n == 4 || r || n == 6 && (a > 0 ? o > 0 ? u / w(10, i - o) : 0 : d[f - 1]) % 10 & 1 || n == (e.s < 0 ? 8 : 7)), t < 1 || !d[0]) return d.length = 0, l ? (t -= e.e + 1, d[0] = w(10, (A - t % A) % A), e.e = -t || 0) : d[0] = e.e = 0, e;
+		if (a == 0 ? (d.length = f, s = 1, f--) : (d.length = f + 1, s = w(10, A - a), d[f] = o > 0 ? (u / w(10, i - o) % w(10, o) | 0) * s : 0), l) for (;;) if (f == 0) {
+			for (a = 1, o = d[0]; o >= 10; o /= 10) a++;
+			for (o = d[0] += s, s = 1; o >= 10; o /= 10) s++;
+			a != s && (e.e++, d[0] == k && (d[0] = 1));
+			break;
+		} else {
+			if (d[f] += s, d[f] != k) break;
+			d[f--] = 0, s = 1;
+		}
+		for (a = d.length; d[--a] === 0;) d.pop();
+	}
+	return _ && (e.e > p.maxE ? (e.d = null, e.e = NaN) : e.e < p.minE && (e.e = 0, e.d = [0])), e;
+}
+function V(e, t, n) {
+	if (!e.isFinite()) return ae(e);
+	var r, i = e.e, a = F(e.d), o = a.length;
+	return t ? (n && (r = n - o) > 0 ? a = a.charAt(0) + "." + a.slice(1) + G(r) : o > 1 && (a = a.charAt(0) + "." + a.slice(1)), a = a + (e.e < 0 ? "e" : "e+") + e.e) : i < 0 ? (a = "0." + G(-i - 1) + a, n && (r = n - o) > 0 && (a += G(r))) : i >= o ? (a += G(i + 1 - o), n && (r = n - i - 1) > 0 && (a = a + "." + G(r))) : ((r = i + 1) < o && (a = a.slice(0, r) + "." + a.slice(r)), n && (r = n - o) > 0 && (i + 1 === o && (a += "."), a += G(r))), a;
+}
+function H(e, t) {
+	var n = e[0];
+	for (t *= A; n >= 10; n /= 10) t++;
+	return t;
+}
+function U(e, t, n) {
+	if (t > M) throw _ = !0, n && (e.precision = n), Error(b);
+	return B(new e(f), t, 1, !0);
+}
+function W(e, t, n) {
+	if (t > N) throw Error(b);
+	return B(new e(p), t, n, !0);
+}
+function te(e) {
+	var t = e.length - 1, n = t * A + 1;
+	if (t = e[t], t) {
+		for (; t % 10 == 0; t /= 10) n--;
+		for (t = e[0]; t >= 10; t /= 10) n++;
+	}
+	return n;
+}
+function G(e) {
+	for (var t = ""; e--;) t += "0";
+	return t;
+}
+function ne(e, t, n, r) {
+	var i, a = new e(1), o = Math.ceil(r / A + 4);
+	for (_ = !1;;) {
+		if (n % 2 && (a = a.times(t), ce(a.d, o) && (i = !0)), n = C(n / 2), n === 0) {
+			n = a.d.length - 1, i && a.d[n] === 0 && ++a.d[n];
+			break;
+		}
+		t = t.times(t), ce(t.d, o);
+	}
+	return _ = !0, a;
+}
+function re(e) {
+	return e.d[e.d.length - 1] & 1;
+}
+function ie(e, t, n) {
+	for (var r, i, a = new e(t[0]), o = 0; ++o < t.length;) {
+		if (i = new e(t[o]), !i.s) {
+			a = i;
+			break;
+		}
+		r = a.cmp(i), (r === n || r === 0 && a.s === n) && (a = i);
+	}
+	return a;
+}
+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);
+	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;
+		}
+		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 (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;
+		c = l, i += 2;
+	}
+}
+function ae(e) {
+	return String(e.s * e.s / 0);
+}
+function J(e, t) {
+	var n, r, i;
+	for ((n = t.indexOf(".")) > -1 && (t = t.replace(".", "")), (r = t.search(/e/i)) > 0 ? (n < 0 && (n = r), n += +t.slice(r + 1), t = t.substring(0, r)) : n < 0 && (n = t.length), r = 0; t.charCodeAt(r) === 48; r++);
+	for (i = t.length; t.charCodeAt(i - 1) === 48; --i);
+	if (t = t.slice(r, i), t) {
+		if (i -= r, e.e = n = n - r - 1, e.d = [], r = (n + 1) % A, n < 0 && (r += A), r < i) {
+			for (r && e.d.push(+t.slice(0, r)), i -= A; r < i;) e.d.push(+t.slice(r, r += A));
+			t = t.slice(r), r = A - t.length;
+		} else r -= i;
+		for (; r--;) t += "0";
+		e.d.push(+t), _ && (e.e > e.constructor.maxE ? (e.d = null, e.e = NaN) : e.e < e.constructor.minE && (e.e = 0, e.d = [0]));
+	} else e.e = 0, e.d = [0];
+	return e;
+}
+function oe(e, t) {
+	var n, r, i, a, o, s, c, l, u;
+	if (t.indexOf("_") > -1) {
+		if (t = t.replace(/(\d)_(?=\d)/g, "$1"), O.test(t)) return J(e, t);
+	} else if (t === "Infinity" || t === "NaN") return +t || (e.s = NaN), e.e = NaN, e.d = null, e;
+	if (E.test(t)) n = 16, t = t.toLowerCase();
+	else if (T.test(t)) n = 2;
+	else if (D.test(t)) n = 8;
+	else throw Error(y + t);
+	for (a = t.search(/p/i), a > 0 ? (c = +t.slice(a + 1), t = t.substring(2, a)) : t = t.slice(2), a = t.indexOf("."), o = a >= 0, r = e.constructor, o && (t = t.replace(".", ""), s = t.length, a = s - a, i = ne(r, new r(n), a, a * 2)), l = R(t, n, k), u = l.length - 1, a = u; l[a] === 0; --a) l.pop();
+	return a < 0 ? new r(e.s * 0) : (e.e = H(l, u), e.d = l, _ = !1, o && (e = z(e, i, s * 4)), c && (e = e.times(Math.abs(c) < 54 ? w(2, c) : $.pow(2, c))), _ = !0, e);
+}
+function se(e, t) {
+	var n, r = t.d.length;
+	if (r < 3) return t.isZero() ? t : Y(e, 2, t, t);
+	n = 1.4 * Math.sqrt(r), n = n > 16 ? 16 : n | 0, t = t.times(1 / X(5, n)), t = Y(e, 2, t, t);
+	for (var i, a = new e(5), o = new e(16), s = new e(20); n--;) i = t.times(t), t = t.times(a.plus(i.times(o.times(i).minus(s))));
+	return t;
+}
+function Y(e, t, n, r, i) {
+	var a, o, s, c, l = 1, u = e.precision, d = Math.ceil(u / A);
+	for (_ = !1, c = n.times(n), s = new e(r);;) {
+		if (o = z(s.times(c), new e(t++ * t++), u, 1), s = i ? r.plus(o) : r.minus(o), r = z(o.times(c), new e(t++ * t++), u, 1), o = s.plus(r), o.d[d] !== void 0) {
+			for (a = d; o.d[a] === s.d[a] && a--;);
+			if (a == -1) break;
+		}
+		a = s, s = r, r = o, o = a, l++;
+	}
+	return _ = !0, o.d.length = d + 1, o;
+}
+function X(e, t) {
+	for (var n = e; --t;) n *= e;
+	return n;
+}
+function Z(e, t) {
+	var n, r = t.s < 0, i = W(e, e.precision, 1), a = i.times(.5);
+	if (t = t.abs(), t.lte(a)) return g = r ? 4 : 1, t;
+	if (n = t.divToInt(i), n.isZero()) g = r ? 3 : 2;
+	else {
+		if (t = t.minus(n.times(i)), t.lte(a)) return g = re(n) ? r ? 2 : 3 : r ? 4 : 1, t;
+		g = re(n) ? r ? 1 : 4 : r ? 3 : 2;
+	}
+	return t.minus(i).abs();
+}
+function Q(e, t, n, r) {
+	var i, a, o, s, c, l, f, p, m, g = e.constructor, _ = n !== void 0;
+	if (_ ? (I(n, 1, u), r === void 0 ? r = g.rounding : I(r, 0, 8)) : (n = g.precision, r = g.rounding), !e.isFinite()) f = ae(e);
+	else {
+		for (f = V(e), o = f.indexOf("."), _ ? (i = 2, t == 16 ? n = n * 4 - 3 : t == 8 && (n = n * 3 - 2)) : i = t, o >= 0 && (f = f.replace(".", ""), m = new g(1), m.e = f.length - o, m.d = R(V(m), 10, i), m.e = m.d.length), p = R(f, 10, i), a = c = p.length; p[--c] == 0;) p.pop();
+		if (!p[0]) f = _ ? "0p+0" : "0";
+		else {
+			if (o < 0 ? a-- : (e = new g(e), e.d = p, e.e = a, e = z(e, m, n, r, 0, i), p = e.d, a = e.e, l = h), o = p[n], s = i / 2, l ||= p[n + 1] !== void 0, l = r < 4 ? (o !== void 0 || l) && (r === 0 || r === (e.s < 0 ? 3 : 2)) : o > s || o === s && (r === 4 || l || r === 6 && p[n - 1] & 1 || r === (e.s < 0 ? 8 : 7)), p.length = n, l) for (; ++p[--n] > i - 1;) p[n] = 0, n || (++a, p.unshift(1));
+			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);
+				f = f + (a < 0 ? "p" : "p+") + a;
+			} else if (a < 0) {
+				for (; ++a;) f = "0" + f;
+				f = "0." + f;
+			} else if (++a > c) for (a -= c; a--;) f += "0";
+			else a < c && (f = f.slice(0, a) + "." + f.slice(a));
+		}
+		f = (t == 16 ? "0x" : t == 2 ? "0b" : t == 8 ? "0o" : "") + f;
+	}
+	return e.s < 0 ? "-" + f : f;
+}
+function ce(e, t) {
+	if (e.length > t) return e.length = t, !0;
+}
+function le(e) {
+	return new this(e).abs();
+}
+function ue(e) {
+	return new this(e).acos();
+}
+function de(e) {
+	return new this(e).acosh();
+}
+function fe(e, t) {
+	return new this(e).plus(t);
+}
+function pe(e) {
+	return new this(e).asin();
+}
+function me(e) {
+	return new this(e).asinh();
+}
+function he(e) {
+	return new this(e).atan();
+}
+function ge(e) {
+	return new this(e).atanh();
+}
+function _e(e, t) {
+	e = new this(e), t = new this(t);
+	var n, r = this.precision, i = this.rounding, a = r + 4;
+	return !e.s || !t.s ? n = new this(NaN) : !e.d && !t.d ? (n = W(this, a, 1).times(t.s > 0 ? .25 : .75), n.s = e.s) : !t.d || e.isZero() ? (n = t.s < 0 ? W(this, r, i) : new this(0), n.s = e.s) : !e.d || t.isZero() ? (n = W(this, a, 1).times(.5), n.s = e.s) : t.s < 0 ? (this.precision = a, this.rounding = 1, n = this.atan(z(e, t, a, 1)), t = W(this, a, 1), this.precision = r, this.rounding = i, n = e.s < 0 ? n.minus(t) : n.plus(t)) : n = this.atan(z(e, t, a, 1)), n;
+}
+function ve(e) {
+	return new this(e).cbrt();
+}
+function ye(e) {
+	return B(e = new this(e), e.e + 1, 2);
+}
+function be(e, t, n) {
+	return new this(e).clamp(t, n);
+}
+function xe(e) {
+	if (!e || typeof e != "object") throw Error(v + "Object expected");
+	var t, n, r, i = e.defaults === !0, a = [
+		"precision",
+		1,
+		u,
+		"rounding",
+		0,
+		8,
+		"toExpNeg",
+		-l,
+		0,
+		"toExpPos",
+		0,
+		l,
+		"maxE",
+		0,
+		l,
+		"minE",
+		-l,
+		0,
+		"modulo",
+		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);
+	return this;
+}
+function Se(e) {
+	return new this(e).cos();
+}
+function Ce(e) {
+	return new this(e).cosh();
+}
+function we(e) {
+	var t, n, r;
+	function i(e) {
+		var t, n, r, a = this;
+		if (!(a instanceof i)) return new i(e);
+		if (a.constructor = i, ke(e)) {
+			a.s = e.s, _ ? !e.d || e.e > i.maxE ? (a.e = NaN, a.d = null) : e.e < i.minE ? (a.e = 0, a.d = [0]) : (a.e = e.e, a.d = e.d.slice()) : (a.e = e.e, a.d = e.d ? e.d.slice() : e.d);
+			return;
+		}
+		if (r = typeof e, r === "number") {
+			if (e === 0) {
+				a.s = 1 / e < 0 ? -1 : 1, a.e = 0, a.d = [0];
+				return;
+			}
+			if (e < 0 ? (e = -e, a.s = -1) : a.s = 1, e === ~~e && e < 1e7) {
+				for (t = 0, n = e; n >= 10; n /= 10) t++;
+				_ ? t > i.maxE ? (a.e = NaN, a.d = null) : t < i.minE ? (a.e = 0, a.d = [0]) : (a.e = t, a.d = [e]) : (a.e = t, a.d = [e]);
+				return;
+			}
+			if (e * 0 != 0) {
+				e || (a.s = NaN), a.e = NaN, a.d = null;
+				return;
+			}
+			return J(a, e.toString());
+		}
+		if (r === "string") return (n = e.charCodeAt(0)) === 45 ? (e = e.slice(1), a.s = -1) : (n === 43 && (e = e.slice(1)), a.s = 1), O.test(e) ? J(a, e) : oe(a, e);
+		if (r === "bigint") return e < 0 ? (e = -e, a.s = -1) : a.s = 1, J(a, e.toString());
+		throw Error(y + e);
+	}
+	if (i.prototype = P, i.ROUND_UP = 0, i.ROUND_DOWN = 1, i.ROUND_CEIL = 2, i.ROUND_FLOOR = 3, i.ROUND_HALF_UP = 4, i.ROUND_HALF_DOWN = 5, i.ROUND_HALF_EVEN = 6, i.ROUND_HALF_CEIL = 7, i.ROUND_HALF_FLOOR = 8, i.EUCLID = 9, i.config = i.set = xe, i.clone = we, i.isDecimal = ke, i.abs = le, i.acos = ue, i.acosh = de, i.add = fe, i.asin = pe, i.asinh = me, i.atan = he, i.atanh = ge, i.atan2 = _e, i.cbrt = ve, i.ceil = ye, i.clamp = be, i.cos = Se, i.cosh = Ce, i.div = Te, i.exp = Ee, i.floor = De, i.hypot = Oe, i.ln = Ae, i.log = je, i.log10 = Ne, i.log2 = Me, i.max = Pe, i.min = Fe, i.mod = Ie, i.mul = Le, i.pow = Re, i.random = ze, i.round = Be, i.sign = Ve, i.sin = He, i.sinh = Ue, i.sqrt = We, i.sub = Ge, i.sum = Ke, i.tan = qe, i.tanh = Je, i.trunc = Ye, e === void 0 && (e = {}), e && e.defaults !== !0) for (r = [
+		"precision",
+		"rounding",
+		"toExpNeg",
+		"toExpPos",
+		"maxE",
+		"minE",
+		"modulo",
+		"crypto"
+	], t = 0; t < r.length;) e.hasOwnProperty(n = r[t++]) || (e[n] = this[n]);
+	return i.config(e), i;
+}
+function Te(e, t) {
+	return new this(e).div(t);
+}
+function Ee(e) {
+	return new this(e).exp();
+}
+function De(e) {
+	return B(e = new this(e), e.e + 1, 3);
+}
+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);
+		n = t;
+	}
+	return _ = !0, n.sqrt();
+}
+function ke(e) {
+	return e instanceof $ || e && e.toStringTag === S || !1;
+}
+function Ae(e) {
+	return new this(e).ln();
+}
+function je(e, t) {
+	return new this(e).log(t);
+}
+function Me(e) {
+	return new this(e).log(2);
+}
+function Ne(e) {
+	return new this(e).log(10);
+}
+function Pe() {
+	return ie(this, arguments, -1);
+}
+function Fe() {
+	return ie(this, arguments, 1);
+}
+function Ie(e, t) {
+	return new this(e).mod(t);
+}
+function Le(e, t) {
+	return new this(e).mul(t);
+}
+function Re(e, t) {
+	return new this(e).pow(t);
+}
+function ze(e) {
+	var t, n, r, i, a = 0, o = new this(1), s = [];
+	if (e === void 0 ? e = this.precision : I(e, 1, u), r = Math.ceil(e / A), !this.crypto) for (; a < r;) s[a++] = Math.random() * 1e7 | 0;
+	else if (crypto.getRandomValues) for (t = crypto.getRandomValues(new Uint32Array(r)); a < r;) i = t[a], i >= 429e7 ? t[a] = crypto.getRandomValues(/* @__PURE__ */ new Uint32Array(1))[0] : s[a++] = i % 1e7;
+	else if (crypto.randomBytes) {
+		for (t = crypto.randomBytes(r *= 4); a < r;) i = t[a] + (t[a + 1] << 8) + (t[a + 2] << 16) + ((t[a + 3] & 127) << 24), i >= 214e7 ? crypto.randomBytes(4).copy(t, a) : (s.push(i % 1e7), a += 4);
+		a = r / 4;
+	} else throw Error(x);
+	for (r = s[--a], e %= A, r && e && (i = w(10, A - e), s[a] = (r / i | 0) * i); s[a] === 0; a--) s.pop();
+	if (a < 0) n = 0, s = [0];
+	else {
+		for (n = -1; s[0] === 0; n -= A) s.shift();
+		for (r = 1, i = s[0]; i >= 10; i /= 10) r++;
+		r < A && (n -= A - r);
+	}
+	return o.e = n, o.d = s, o;
+}
+function Be(e) {
+	return B(e = new this(e), e.e + 1, this.rounding);
+}
+function Ve(e) {
+	return e = new this(e), e.d ? e.d[0] ? e.s : 0 * e.s : e.s || NaN;
+}
+function He(e) {
+	return new this(e).sin();
+}
+function Ue(e) {
+	return new this(e).sinh();
+}
+function We(e) {
+	return new this(e).sqrt();
+}
+function Ge(e, t) {
+	return new this(e).sub(t);
+}
+function Ke() {
+	var e = 0, t = arguments, n = new this(t[e]);
+	for (_ = !1; n.s && ++e < t.length;) n = n.plus(t[e]);
+	return _ = !0, B(n, this.precision, this.rounding);
+}
+function qe(e) {
+	return new this(e).tan();
+}
+function Je(e) {
+	return new this(e).tanh();
+}
+function Ye(e) {
+	return B(e = new this(e), e.e + 1, 1);
+}
+P[Symbol.for("nodejs.util.inspect.custom")] = P.toString, P[Symbol.toStringTag] = "Decimal";
+var $ = P.constructor = we(m);
+f = new $(f), p = new $(p);
+//#endregion
+//#region ../../node_modules/.pnpm/lodash@4.18.1/node_modules/lodash/identity.js
+var Xe = /* @__PURE__ */ o(((e, t) => {
+	function n(e) {
+		return e;
+	}
+	t.exports = n;
+}));
+//#endregion
+export { c as i, $ as n, o as r, Xe as t };
+
+//# sourceMappingURL=identity.js.map