@unicom-cloud/utils 0.1.42 → 0.1.44

package/decimal/decimal.js

@@ -1,27 +1,28 @@
-/* 潘启宝 2026-04-23 09:23:17 星期四 */
-import e from "lodash/isUndefined.js";
+/* 潘启宝 2026-05-15 17:45:33 星期五 */
+import { hasOwn as e } from "../object/index.js";
+import t from "lodash/isUndefined.js";
 //#region utils/decimal/decimal.js
-var t = 9e15, n = 1e9, r = "0123456789abcdef", i = "2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058", a = "3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789", o = {
+var n = 9e15, r = 1e9, i = "0123456789abcdef", a = "2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058", o = "3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789", s = {
 	precision: 20,
 	rounding: 4,
 	modulo: 1,
 	toExpNeg: -7,
 	toExpPos: 21,
-	minE: -t,
-	maxE: t,
+	minE: -n,
+	maxE: n,
 	crypto: !1
-}, s, c, l, u = !0, d = "[DecimalError] ", f = `${d}Invalid argument: `, p = `${d}Precision limit exceeded`, m = `${d}crypto unavailable`, h = "[object Decimal]", g = Math.floor, _ = Math.pow, v = /^0b([01]+(\.[01]*)?|\.[01]+)(p[+-]?\d+)?$/i, y = /^0x([0-9a-f]+(\.[0-9a-f]*)?|\.[0-9a-f]+)(p[+-]?\d+)?$/i, b = /^0o([0-7]+(\.[0-7]*)?|\.[0-7]+)(p[+-]?\d+)?$/i, x = /^(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i, S = 1e7, C = 7, w = 9007199254740991, T = i.length - 1, E = a.length - 1, D = { toStringTag: h };
-D.absoluteValue = D.abs = function() {
+}, c, l, u, d = !0, f = "[DecimalError] ", p = `${f}Invalid argument: `, m = `${f}Precision limit exceeded`, h = `${f}crypto unavailable`, g = "[object Decimal]", _ = Math.floor, v = Math.pow, y = /^0b([01]+(\.[01]*)?|\.[01]+)(p[+-]?\d+)?$/i, b = /^0x([0-9a-f]+(\.[0-9a-f]*)?|\.[0-9a-f]+)(p[+-]?\d+)?$/i, x = /^0o([0-7]+(\.[0-7]*)?|\.[0-7]+)(p[+-]?\d+)?$/i, S = /^(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i, C = 1e7, w = 7, T = 9007199254740991, E = a.length - 1, D = o.length - 1, O = { toStringTag: g };
+O.absoluteValue = O.abs = function() {
 	var e = new this.constructor(this);
-	return e.s < 0 && (e.s = 1), P(e);
-}, D.ceil = function() {
-	return P(new this.constructor(this), this.e + 1, 2);
-}, D.clampedTo = D.clamp = function(e, t) {
+	return e.s < 0 && (e.s = 1), F(e);
+}, O.ceil = function() {
+	return F(new this.constructor(this), this.e + 1, 2);
+}, O.clampedTo = O.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(f + t);
+	if (e.gt(t)) throw Error(p + t);
 	return n = r.cmp(e), n < 0 ? e : r.cmp(t) > 0 ? t : new i(r);
-}, D.comparedTo = D.cmp = function(e) {
+}, O.comparedTo = O.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;
@@ -29,136 +30,136 @@ D.absoluteValue = D.abs = function() {
 	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;
-}, D.cosine = D.cos = function() {
+}, O.cosine = O.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()) + C, r.rounding = 1, n = M(r, Y(r, n)), r.precision = e, r.rounding = t, P(l == 2 || l == 3 ? n.neg() : n, e, t, !0)) : new r(1) : new r(NaN);
-}, D.cubeRoot = D.cbrt = function() {
-	var e, t, n, r, i, a, o, s, c, l, d = this, f = d.constructor;
-	if (!d.isFinite() || d.isZero()) return new f(d);
-	for (u = !1, a = d.s * _(d.s * d, 1 / 3), !a || Math.abs(a) == Infinity ? (n = O(d.d), e = d.e, (a = (e - n.length + 1) % 3) && (n += a == 1 || a == -2 ? "0" : "00"), a = _(n, 1 / 3), e = g((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 f(n), r.s = d.s) : r = new f(a.toString()), o = (e = f.precision) + 3;;) if (s = r, c = s.times(s).times(s), l = c.plus(d), r = N(l.plus(d).times(s), l.plus(c), o + 2, 1), O(s.d).slice(0, o) === (n = O(r.d)).slice(0, o)) if (n = n.slice(o - 3, o + 1), n == "9999" || !i && n == "4999") {
-		if (!i && (P(s, e + 1, 0), s.times(s).times(s).eq(d))) {
+	return n.d ? n.d[0] ? (e = r.precision, t = r.rounding, r.precision = e + Math.max(n.e, n.sd()) + w, r.rounding = 1, n = N(r, X(r, n)), r.precision = e, r.rounding = t, F(u == 2 || u == 3 ? n.neg() : n, e, t, !0)) : new r(1) : new r(NaN);
+}, O.cubeRoot = O.cbrt = function() {
+	var e, t, n, r, i, a, o, s, c, l, u = this, f = u.constructor;
+	if (!u.isFinite() || u.isZero()) return new f(u);
+	for (d = !1, a = u.s * v(u.s * u, 1 / 3), !a || Math.abs(a) == Infinity ? (n = k(u.d), e = u.e, (a = (e - n.length + 1) % 3) && (n += a == 1 || a == -2 ? "0" : "00"), a = v(n, 1 / 3), e = _((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 f(n), r.s = u.s) : r = new f(a.toString()), o = (e = f.precision) + 3;;) if (s = r, c = s.times(s).times(s), l = c.plus(u), r = P(l.plus(u).times(s), l.plus(c), o + 2, 1), k(s.d).slice(0, o) === (n = k(r.d)).slice(0, o)) if (n = n.slice(o - 3, o + 1), n == "9999" || !i && n == "4999") {
+		if (!i && (F(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") && (P(r, e + 1, 1), t = !r.times(r).times(r).eq(d));
+		(!+n || !+n.slice(1) && n.charAt(0) == "5") && (F(r, e + 1, 1), t = !r.times(r).times(r).eq(u));
 		break;
 	}
-	return u = !0, P(r, e, f.rounding, t);
-}, D.decimalPlaces = D.dp = function() {
+	return d = !0, F(r, e, f.rounding, t);
+}, O.decimalPlaces = O.dp = function() {
 	var e, t = this.d, n = NaN;
 	if (t) {
-		if (e = t.length - 1, n = (e - g(this.e / C)) * C, e = t[e], e) for (; e % 10 == 0; e /= 10) n--;
+		if (e = t.length - 1, n = (e - _(this.e / w)) * w, e = t[e], e) for (; e % 10 == 0; e /= 10) n--;
 		n < 0 && (n = 0);
 	}
 	return n;
-}, D.dividedBy = D.div = function(e) {
-	return N(this, new this.constructor(e));
-}, D.dividedToIntegerBy = D.divToInt = function(e) {
+}, O.dividedBy = O.div = function(e) {
+	return P(this, new this.constructor(e));
+}, O.dividedToIntegerBy = O.divToInt = function(e) {
 	var t = this, n = t.constructor;
-	return P(N(t, new n(e), 0, 1, 1), n.precision, n.rounding);
-}, D.equals = D.eq = function(e) {
+	return F(P(t, new n(e), 0, 1, 1), n.precision, n.rounding);
+}, O.equals = O.eq = function(e) {
 	return this.cmp(e) === 0;
-}, D.floor = function() {
-	return P(new this.constructor(this), this.e + 1, 3);
-}, D.greaterThan = D.gt = function(e) {
+}, O.floor = function() {
+	return F(new this.constructor(this), this.e + 1, 3);
+}, O.greaterThan = O.gt = function(e) {
 	return this.cmp(e) > 0;
-}, D.greaterThanOrEqualTo = D.gte = function(e) {
+}, O.greaterThanOrEqualTo = O.gte = function(e) {
 	var t = this.cmp(e);
 	return t == 1 || t === 0;
-}, D.hyperbolicCosine = D.cosh = function() {
+}, O.hyperbolicCosine = O.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 / J(4, e)).toString()) : (e = 16, t = "2.3283064365386962890625e-10"), a = q(o, 1, a.times(t), new o(1), !0);
+	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 / Y(4, e)).toString()) : (e = 16, t = "2.3283064365386962890625e-10"), a = J(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 P(a, o.precision = n, o.rounding = r, !0);
-}, D.hyperbolicSine = D.sinh = function() {
+	return F(a, o.precision = n, o.rounding = r, !0);
+}, O.hyperbolicSine = O.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 = q(a, 2, i, i, !0);
+	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 = J(a, 2, i, i, !0);
 	else {
-		e = 1.4 * Math.sqrt(r), e = e > 16 ? 16 : e | 0, i = i.times(1 / J(5, e)), i = q(a, 2, i, i, !0);
+		e = 1.4 * Math.sqrt(r), e = e > 16 ? 16 : e | 0, i = i.times(1 / Y(5, e)), i = J(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, P(i, t, n, !0);
-}, D.hyperbolicTangent = D.tanh = function() {
+	return a.precision = t, a.rounding = n, F(i, t, n, !0);
+}, O.hyperbolicTangent = O.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, N(n.sinh(), n.cosh(), r.precision = e, r.rounding = t)) : new r(n.s);
-}, D.inverseCosine = D.acos = function() {
+	return n.isFinite() ? n.isZero() ? new r(n) : (e = r.precision, t = r.rounding, r.precision = e + 7, r.rounding = 1, P(n.sinh(), n.cosh(), r.precision = e, r.rounding = t)) : new r(n.s);
+}, O.inverseCosine = O.acos = function() {
 	var e = this, t = e.constructor, n = e.abs().cmp(1), r = t.precision, i = t.rounding;
-	return n === -1 ? e.isZero() ? R(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() ? R(t, r, i) : new t(0) : new t(NaN);
-}, D.inverseHyperbolicCosine = D.acosh = function() {
+	return n === -1 ? e.isZero() ? z(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() ? z(t, r, i) : new t(0) : new t(NaN);
+}, O.inverseHyperbolicCosine = O.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, u = !1, n = n.times(n).minus(1).sqrt().plus(n), u = !0, r.precision = e, r.rounding = t, n.ln()) : new r(n);
-}, D.inverseHyperbolicSine = D.asinh = function() {
+	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, d = !1, n = n.times(n).minus(1).sqrt().plus(n), d = !0, r.precision = e, r.rounding = t, n.ln()) : new r(n);
+}, O.inverseHyperbolicSine = O.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, u = !1, n = n.times(n).plus(1).sqrt().plus(n), u = !0, r.precision = e, r.rounding = t, n.ln());
-}, D.inverseHyperbolicTangent = D.atanh = function() {
+	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, d = !1, n = n.times(n).plus(1).sqrt().plus(n), d = !0, r.precision = e, r.rounding = t, n.ln());
+}, O.inverseHyperbolicTangent = O.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 ? P(new a(i), e, t, !0) : (a.precision = n = r - i.e, i = N(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);
-}, D.inverseSine = D.asin = function() {
+	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 ? F(new a(i), e, t, !0) : (a.precision = n = r - i.e, i = P(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);
+}, O.inverseSine = O.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 = R(a, n + 4, r).times(.5), e.s = i.s, e) : new a(NaN));
-}, D.inverseTangent = D.atan = function() {
-	var e, t, n, r, i, a, o, s, c, l = this, d = l.constructor, f = d.precision, p = d.rounding;
+	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 = z(a, n + 4, r).times(.5), e.s = i.s, e) : new a(NaN));
+}, O.inverseTangent = O.atan = function() {
+	var e, t, n, r, i, a, o, s, c, l = this, u = l.constructor, f = u.precision, p = u.rounding;
 	if (!l.isFinite()) {
-		if (!l.s) return new d(NaN);
-		if (f + 4 <= E) return o = R(d, f + 4, p).times(.5), o.s = l.s, o;
-	} else if (l.isZero()) return new d(l);
-	else if (l.abs().eq(1) && f + 4 <= E) return o = R(d, f + 4, p).times(.25), o.s = l.s, o;
-	for (d.precision = s = f + 10, d.rounding = 1, n = Math.min(28, s / C + 2 | 0), e = n; e; --e) l = l.div(l.times(l).plus(1).sqrt().plus(1));
-	for (u = !1, t = Math.ceil(s / C), r = 1, c = l.times(l), o = new d(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)), u = !0, P(o, d.precision = f, d.rounding = p, !0);
-}, D.isFinite = function() {
+		if (!l.s) return new u(NaN);
+		if (f + 4 <= D) return o = z(u, f + 4, p).times(.5), o.s = l.s, o;
+	} else if (l.isZero()) return new u(l);
+	else if (l.abs().eq(1) && f + 4 <= D) return o = z(u, f + 4, p).times(.25), o.s = l.s, o;
+	for (u.precision = s = f + 10, u.rounding = 1, n = Math.min(28, s / w + 2 | 0), e = n; e; --e) l = l.div(l.times(l).plus(1).sqrt().plus(1));
+	for (d = !1, t = Math.ceil(s / w), 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)), d = !0, F(o, u.precision = f, u.rounding = p, !0);
+}, O.isFinite = function() {
 	return !!this.d;
-}, D.isInteger = D.isInt = function() {
-	return !!this.d && g(this.e / C) > this.d.length - 2;
-}, D.isNaN = function() {
+}, O.isInteger = O.isInt = function() {
+	return !!this.d && _(this.e / w) > this.d.length - 2;
+}, O.isNaN = function() {
 	return !this.s;
-}, D.isNegative = D.isNeg = function() {
+}, O.isNegative = O.isNeg = function() {
 	return this.s < 0;
-}, D.isPositive = D.isPos = function() {
+}, O.isPositive = O.isPos = function() {
 	return this.s > 0;
-}, D.isZero = function() {
+}, O.isZero = function() {
 	return !!this.d && this.d[0] === 0;
-}, D.lessThan = D.lt = function(e) {
+}, O.lessThan = O.lt = function(e) {
 	return this.cmp(e) < 0;
-}, D.lessThanOrEqualTo = D.lte = function(e) {
+}, O.lessThanOrEqualTo = O.lte = function(e) {
 	return this.cmp(e) < 1;
-}, D.logarithm = D.log = function(e) {
-	var t, n, r, i, a, o, s, c, l = this, d = l.constructor, f = d.precision, p = d.rounding, m = 5;
-	if (e == null) e = new d(10), t = !0;
+}, O.logarithm = O.log = function(e) {
+	var t, n, r, i, a, o, s, c, l = this, u = l.constructor, f = u.precision, p = u.rounding, m = 5;
+	if (e == null) e = new u(10), t = !0;
 	else {
-		if (e = new d(e), n = e.d, e.s < 0 || !n || !n[0] || e.eq(1)) return new d(NaN);
+		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 d(n && !n[0] ? -Infinity : l.s == 1 ? n ? 0 : Infinity : NaN);
+	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 (u = !1, s = f + m, o = W(l, s), r = t ? L(d, s + 10) : W(e, s), c = N(o, r, s, 1), A(c.d, i = f, p)) do
-		if (s += 10, o = W(l, s), r = t ? L(d, s + 10) : W(e, s), c = N(o, r, s, 1), !a) {
-			+O(c.d).slice(i + 1, i + 15) + 1 == 0x5af3107a4000 && (c = P(c, f + 1, 0));
+	if (d = !1, s = f + m, o = G(l, s), r = t ? R(u, s + 10) : G(e, s), c = P(o, r, s, 1), j(c.d, i = f, p)) do
+		if (s += 10, o = G(l, s), r = t ? R(u, s + 10) : G(e, s), c = P(o, r, s, 1), !a) {
+			+k(c.d).slice(i + 1, i + 15) + 1 == 0x5af3107a4000 && (c = F(c, f + 1, 0));
 			break;
 		}
-	while (A(c.d, i += 10, p));
-	return u = !0, P(c, f, p);
-}, D.minus = D.sub = function(e) {
-	var t, n, r, i, a, o, s, c, l, d, f, p, m = this, h = m.constructor;
+	while (j(c.d, i += 10, p));
+	return d = !0, F(c, f, p);
+}, O.minus = O.sub = function(e) {
+	var t, n, r, i, a, o, s, c, l, u, f, p, m = this, h = m.constructor;
 	if (e = new h(e), !m.d || !e.d) return !m.s || !e.s ? e = new h(NaN) : m.d ? e.s = -e.s : e = new h(e.d || m.s !== e.s ? m : NaN), e;
 	if (m.s != e.s) return e.s = -e.s, m.plus(e);
 	if (l = m.d, p = e.d, s = h.precision, c = h.rounding, !l[0] || !p[0]) {
 		if (p[0]) e.s = -e.s;
 		else if (l[0]) e = new h(m);
 		else return new h(c === 3 ? -0 : 0);
-		return u ? P(e, s, c) : e;
+		return d ? F(e, s, c) : e;
 	}
-	if (n = g(e.e / C), d = g(m.e / C), l = l.slice(), a = d - n, a) {
-		for (f = a < 0, f ? (t = l, a = -a, o = p.length) : (t = p, n = d, o = l.length), r = Math.max(Math.ceil(s / C), o) + 2, a > r && (a = r, t.length = 1), t.reverse(), r = a; r--;) t.push(0);
+	if (n = _(e.e / w), u = _(m.e / w), l = l.slice(), a = u - n, a) {
+		for (f = a < 0, f ? (t = l, a = -a, o = p.length) : (t = p, n = u, o = l.length), r = Math.max(Math.ceil(s / w), 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 = p.length, f = r < o, f && (o = r), r = 0; r < o; r++) if (l[r] != p[r]) {
@@ -170,171 +171,171 @@ D.absoluteValue = D.abs = function() {
 	for (f && (t = l, l = p, p = t, e.s = -e.s), o = l.length, r = p.length - o; r > 0; --r) l[o++] = 0;
 	for (r = p.length; r > a;) {
 		if (l[--r] < p[r]) {
-			for (i = r; i && l[--i] === 0;) l[i] = S - 1;
-			--l[i], l[r] += S;
+			for (i = r; i && l[--i] === 0;) l[i] = C - 1;
+			--l[i], l[r] += C;
 		}
 		l[r] -= p[r];
 	}
 	for (; l[--o] === 0;) l.pop();
 	for (; l[0] === 0; l.shift()) --n;
-	return l[0] ? (e.d = l, e.e = I(l, n), u ? P(e, s, c) : e) : new h(c === 3 ? -0 : 0);
-}, D.modulo = D.mod = function(e) {
+	return l[0] ? (e.d = l, e.e = L(l, n), d ? F(e, s, c) : e) : new h(c === 3 ? -0 : 0);
+}, O.modulo = O.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] ? P(new r(n), r.precision, r.rounding) : (u = !1, r.modulo == 9 ? (t = N(n, e.abs(), 0, 3, 1), t.s *= e.s) : t = N(n, e, 0, r.modulo, 1), t = t.times(e), u = !0, n.minus(t));
-}, D.naturalExponential = D.exp = function() {
-	return U(this);
-}, D.naturalLogarithm = D.ln = function() {
+	return e = new r(e), !n.d || !e.s || e.d && !e.d[0] ? new r(NaN) : !e.d || n.d && !n.d[0] ? F(new r(n), r.precision, r.rounding) : (d = !1, r.modulo == 9 ? (t = P(n, e.abs(), 0, 3, 1), t.s *= e.s) : t = P(n, e, 0, r.modulo, 1), t = t.times(e), d = !0, n.minus(t));
+}, O.naturalExponential = O.exp = function() {
 	return W(this);
-}, D.negated = D.neg = function() {
+}, O.naturalLogarithm = O.ln = function() {
+	return G(this);
+}, O.negated = O.neg = function() {
 	var e = new this.constructor(this);
-	return e.s = -e.s, P(e);
-}, D.plus = D.add = function(e) {
-	var t, n, r, i, a, o, s, c, l, d, f = this, p = f.constructor;
+	return e.s = -e.s, F(e);
+}, O.plus = O.add = function(e) {
+	var t, n, r, i, a, o, s, c, l, u, f = this, p = f.constructor;
 	if (e = new p(e), !f.d || !e.d) return !f.s || !e.s ? e = new p(NaN) : f.d || (e = new p(e.d || f.s === e.s ? f : NaN)), e;
 	if (f.s != e.s) return e.s = -e.s, f.minus(e);
-	if (l = f.d, d = e.d, s = p.precision, c = p.rounding, !l[0] || !d[0]) return d[0] || (e = new p(f)), u ? P(e, s, c) : e;
-	if (a = g(f.e / C), r = g(e.e / C), l = l.slice(), i = a - r, i) {
-		for (i < 0 ? (n = l, i = -i, o = d.length) : (n = d, r = a, o = l.length), a = Math.ceil(s / C), o = a > o ? a + 1 : o + 1, i > o && (i = o, n.length = 1), n.reverse(); i--;) n.push(0);
+	if (l = f.d, u = e.d, s = p.precision, c = p.rounding, !l[0] || !u[0]) return u[0] || (e = new p(f)), d ? F(e, s, c) : e;
+	if (a = _(f.e / w), r = _(e.e / w), 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 / w), 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 = d.length, o - i < 0 && (i = o, n = d, d = l, l = n), t = 0; i;) t = (l[--i] = l[i] + d[i] + t) / S | 0, l[i] %= S;
+	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) / C | 0, l[i] %= C;
 	for (t && (l.unshift(t), ++r), o = l.length; l[--o] == 0;) l.pop();
-	return e.d = l, e.e = I(l, r), u ? P(e, s, c) : e;
-}, D.precision = D.sd = function(e) {
+	return e.d = l, e.e = L(l, r), d ? F(e, s, c) : e;
+}, O.precision = O.sd = function(e) {
 	var t, n = this;
-	if (e !== void 0 && e !== !!e && e !== 1 && e !== 0) throw Error(f + e);
-	return n.d ? (t = z(n.d), e && n.e + 1 > t && (t = n.e + 1)) : t = NaN, t;
-}, D.round = function() {
+	if (e !== void 0 && e !== !!e && e !== 1 && e !== 0) throw Error(p + e);
+	return n.d ? (t = B(n.d), e && n.e + 1 > t && (t = n.e + 1)) : t = NaN, t;
+}, O.round = function() {
 	var e = this, t = e.constructor;
-	return P(new t(e), e.e + 1, t.rounding);
-}, D.sine = D.sin = function() {
+	return F(new t(e), e.e + 1, t.rounding);
+}, O.sine = O.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()) + C, r.rounding = 1, n = ne(r, Y(r, n)), r.precision = e, r.rounding = t, P(l > 2 ? n.neg() : n, e, t, !0)) : new r(NaN);
-}, D.squareRoot = D.sqrt = function() {
-	var e, t, n, r, i, a, o = this, s = o.d, c = o.e, l = o.s, d = o.constructor;
-	if (l !== 1 || !s || !s[0]) return new d(!l || l < 0 && (!s || s[0]) ? NaN : s ? o : Infinity);
-	for (u = !1, l = Math.sqrt(+o), l == 0 || l == Infinity ? (t = O(s), (t.length + c) % 2 == 0 && (t += "0"), l = Math.sqrt(t), c = g((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 d(t)) : r = new d(l.toString()), n = (c = d.precision) + 3;;) if (a = r, r = a.plus(N(o, a, n + 2, 1)).times(.5), O(a.d).slice(0, n) === (t = O(r.d)).slice(0, n)) if (t = t.slice(n - 3, n + 1), t == "9999" || !i && t == "4999") {
-		if (!i && (P(a, c + 1, 0), a.times(a).eq(o))) {
+	return n.isFinite() ? n.isZero() ? new r(n) : (e = r.precision, t = r.rounding, r.precision = e + Math.max(n.e, n.sd()) + w, r.rounding = 1, n = ne(r, X(r, n)), r.precision = e, r.rounding = t, F(u > 2 ? n.neg() : n, e, t, !0)) : new r(NaN);
+}, O.squareRoot = O.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 (d = !1, l = Math.sqrt(+o), l == 0 || l == Infinity ? (t = k(s), (t.length + c) % 2 == 0 && (t += "0"), l = Math.sqrt(t), 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(P(o, a, n + 2, 1)).times(.5), k(a.d).slice(0, n) === (t = k(r.d)).slice(0, n)) if (t = t.slice(n - 3, n + 1), t == "9999" || !i && t == "4999") {
+		if (!i && (F(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") && (P(r, c + 1, 1), e = !r.times(r).eq(o));
+		(!+t || !+t.slice(1) && t.charAt(0) == "5") && (F(r, c + 1, 1), e = !r.times(r).eq(o));
 		break;
 	}
-	return u = !0, P(r, c, d.rounding, e);
-}, D.tangent = D.tan = function() {
+	return d = !0, F(r, c, u.rounding, e);
+}, O.tangent = O.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 = N(n, new r(1).minus(n.times(n)).sqrt(), e + 10, 0), r.precision = e, r.rounding = t, P(l == 2 || l == 4 ? n.neg() : n, e, t, !0)) : new r(NaN);
-}, D.times = D.mul = function(e) {
-	var t, n, r, i, a, o, s, c, l, d = this, f = d.constructor, p = d.d, m = (e = new f(e)).d;
-	if (e.s *= d.s, !p || !p[0] || !m || !m[0]) return new f(!e.s || p && !p[0] && !m || m && !m[0] && !p ? NaN : !p || !m ? e.s / 0 : e.s * 0);
-	for (n = g(d.e / C) + g(e.e / C), c = p.length, l = m.length, c < l && (a = p, p = m, m = a, o = c, c = l, l = o), a = [], o = c + l, r = o; r--;) a.push(0);
+	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 = P(n, new r(1).minus(n.times(n)).sqrt(), e + 10, 0), r.precision = e, r.rounding = t, F(u == 2 || u == 4 ? n.neg() : n, e, t, !0)) : new r(NaN);
+}, O.times = O.mul = function(e) {
+	var t, n, r, i, a, o, s, c, l, u = this, f = u.constructor, p = u.d, m = (e = new f(e)).d;
+	if (e.s *= u.s, !p || !p[0] || !m || !m[0]) return new f(!e.s || p && !p[0] && !m || m && !m[0] && !p ? NaN : !p || !m ? e.s / 0 : e.s * 0);
+	for (n = _(u.e / w) + _(e.e / w), c = p.length, l = m.length, c < l && (a = p, p = m, m = 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] + m[r] * p[i - r - 1] + t, a[i--] = s % S | 0, t = s / S | 0;
-		a[i] = (a[i] + t) % S | 0;
+		for (t = 0, i = c + r; i > r;) s = a[i] + m[r] * p[i - r - 1] + t, a[i--] = s % C | 0, t = s / C | 0;
+		a[i] = (a[i] + t) % C | 0;
 	}
 	for (; !a[--o];) a.pop();
-	return t ? ++n : a.shift(), e.d = a, e.e = I(a, n), u ? P(e, f.precision, f.rounding) : e;
-}, D.toBinary = function(e, t) {
-	return X(this, 2, e, t);
-}, D.toDecimalPlaces = D.toDP = function(e, t) {
-	var r = this, i = r.constructor;
-	return r = new i(r), e === void 0 ? r : (k(e, 0, n), t === void 0 ? t = i.rounding : k(t, 0, 8), P(r, e + r.e + 1, t));
-}, D.toExponential = function(e, t) {
-	var r, i = this, a = i.constructor;
-	return e === void 0 ? r = F(i, !0) : (k(e, 0, n), t === void 0 ? t = a.rounding : k(t, 0, 8), i = P(new a(i), e + 1, t), r = F(i, !0, e + 1)), i.isNeg() && !i.isZero() ? "-" + r : r;
-}, D.toFixed = function(e, t) {
-	var r, i, a = this, o = a.constructor;
-	return e === void 0 ? r = F(a) : (k(e, 0, n), t === void 0 ? t = o.rounding : k(t, 0, 8), i = P(new o(a), e + a.e + 1, t), r = F(i, !1, e + i.e + 1)), a.isNeg() && !a.isZero() ? "-" + r : r;
-}, D.toFraction = function(e) {
-	var t, n, r, i, a, o, s, c, l, d, p, m, h = this, g = h.d, v = h.constructor;
-	if (!g) return new v(h);
-	if (l = n = new v(1), r = c = new v(0), t = new v(r), a = t.e = z(g) - h.e - 1, o = a % C, t.d[0] = _(10, o < 0 ? C + o : o), e == null) e = a > 0 ? t : l;
+	return t ? ++n : a.shift(), e.d = a, e.e = L(a, n), d ? F(e, f.precision, f.rounding) : e;
+}, O.toBinary = function(e, t) {
+	return Z(this, 2, e, t);
+}, O.toDecimalPlaces = O.toDP = function(e, t) {
+	var n = this, i = n.constructor;
+	return n = new i(n), e === void 0 ? n : (A(e, 0, r), t === void 0 ? t = i.rounding : A(t, 0, 8), F(n, e + n.e + 1, t));
+}, O.toExponential = function(e, t) {
+	var n, i = this, a = i.constructor;
+	return e === void 0 ? n = I(i, !0) : (A(e, 0, r), t === void 0 ? t = a.rounding : A(t, 0, 8), i = F(new a(i), e + 1, t), n = I(i, !0, e + 1)), i.isNeg() && !i.isZero() ? "-" + n : n;
+}, O.toFixed = function(e, t) {
+	var n, i, a = this, o = a.constructor;
+	return e === void 0 ? n = I(a) : (A(e, 0, r), t === void 0 ? t = o.rounding : A(t, 0, 8), i = F(new o(a), e + a.e + 1, t), n = I(i, !1, e + i.e + 1)), a.isNeg() && !a.isZero() ? "-" + n : n;
+}, O.toFraction = function(e) {
+	var t, n, r, i, a, o, s, c, l, u, f, m, h = this, g = h.d, _ = h.constructor;
+	if (!g) return new _(h);
+	if (l = n = new _(1), r = c = new _(0), t = new _(r), a = t.e = B(g) - h.e - 1, o = a % w, t.d[0] = v(10, o < 0 ? w + o : o), e == null) e = a > 0 ? t : l;
 	else {
-		if (s = new v(e), !s.isInt() || s.lt(l)) throw Error(f + s);
+		if (s = new _(e), !s.isInt() || s.lt(l)) throw Error(p + s);
 		e = s.gt(t) ? a > 0 ? t : l : s;
 	}
-	for (u = !1, s = new v(O(g)), d = v.precision, v.precision = a = g.length * C * 2; p = N(s, t, 0, 1, 1), i = n.plus(p.times(r)), i.cmp(e) != 1;) n = r, r = i, i = l, l = c.plus(p.times(i)), c = i, i = t, t = s.minus(p.times(i)), s = i;
-	return i = N(e.minus(n), r, 0, 1, 1), c = c.plus(i.times(l)), n = n.plus(i.times(r)), c.s = l.s = h.s, m = N(l, r, a, 1).minus(h).abs().cmp(N(c, n, a, 1).minus(h).abs()) < 1 ? [l, r] : [c, n], v.precision = d, u = !0, m;
-}, D.toHexadecimal = D.toHex = function(e, t) {
-	return X(this, 16, e, t);
-}, D.toNearest = function(e, t) {
+	for (d = !1, s = new _(k(g)), u = _.precision, _.precision = a = g.length * w * 2; f = P(s, t, 0, 1, 1), i = n.plus(f.times(r)), i.cmp(e) != 1;) n = r, r = i, i = l, l = c.plus(f.times(i)), c = i, i = t, t = s.minus(f.times(i)), s = i;
+	return i = P(e.minus(n), r, 0, 1, 1), c = c.plus(i.times(l)), n = n.plus(i.times(r)), c.s = l.s = h.s, m = P(l, r, a, 1).minus(h).abs().cmp(P(c, n, a, 1).minus(h).abs()) < 1 ? [l, r] : [c, n], _.precision = u, d = !0, m;
+}, O.toHexadecimal = O.toHex = function(e, t) {
+	return Z(this, 16, e, t);
+}, O.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 : k(t, 0, 8), !n.d) return e.s ? n : e;
+		if (e = new r(e), t === void 0 ? t = r.rounding : A(t, 0, 8), !n.d) return e.s ? n : e;
 		if (!e.d) return e.s &&= n.s, e;
 	}
-	return e.d[0] ? (u = !1, n = N(n, e, 0, t, 1).times(e), u = !0, P(n)) : (e.s = n.s, n = e), n;
-}, D.toNumber = function() {
+	return e.d[0] ? (d = !1, n = P(n, e, 0, t, 1).times(e), d = !0, F(n)) : (e.s = n.s, n = e), n;
+}, O.toNumber = function() {
 	return +this;
-}, D.toOctal = function(e, t) {
-	return X(this, 8, e, t);
-}, D.toPower = D.pow = function(e) {
+}, O.toOctal = function(e, t) {
+	return Z(this, 8, e, t);
+}, O.toPower = O.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(_(+s, l));
+	if (!s.d || !e.d || !s.d[0] || !e.d[0]) return new c(v(+s, l));
 	if (s = new c(s), s.eq(1)) return s;
-	if (r = c.precision, a = c.rounding, e.eq(1)) return P(s, r, a);
-	if (t = g(e.e / C), t >= e.d.length - 1 && (n = l < 0 ? -l : l) <= w) return i = ee(c, s, n, r), e.s < 0 ? new c(1).div(i) : P(i, r, a);
+	if (r = c.precision, a = c.rounding, e.eq(1)) return F(s, r, a);
+	if (t = _(e.e / w), t >= e.d.length - 1 && (n = l < 0 ? -l : l) <= T) return i = H(c, s, n, r), e.s < 0 ? new c(1).div(i) : F(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 = _(+s, l), t = n == 0 || !isFinite(n) ? g(l * (Math.log("0." + O(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) : (u = !1, c.rounding = s.s = 1, n = Math.min(12, (t + "").length), i = U(e.times(W(s, r + n)), r), i.d && (i = P(i, r + 5, 1), A(i.d, r, a) && (t = r + 10, i = P(U(e.times(W(s, t + n)), t), t + 5, 1), +O(i.d).slice(r + 1, r + 15) + 1 == 0x5af3107a4000 && (i = P(i, r + 1, 0)))), i.s = o, u = !0, c.rounding = a, P(i, r, a));
-}, D.toPrecision = function(e, t) {
-	var r, i = this, a = i.constructor;
-	return e === void 0 ? r = F(i, i.e <= a.toExpNeg || i.e >= a.toExpPos) : (k(e, 1, n), t === void 0 ? t = a.rounding : k(t, 0, 8), i = P(new a(i), e, t), r = F(i, e <= i.e || i.e <= a.toExpNeg, e)), i.isNeg() && !i.isZero() ? "-" + r : r;
-}, D.toSignificantDigits = D.toSD = function(e, t) {
-	var r = this, i = r.constructor;
-	return e === void 0 ? (e = i.precision, t = i.rounding) : (k(e, 1, n), t === void 0 ? t = i.rounding : k(t, 0, 8)), P(new i(r), e, t);
-}, D.toString = function() {
-	var e = this, t = e.constructor, n = F(e, e.e <= t.toExpNeg || e.e >= t.toExpPos);
+	return n = v(+s, l), t = n == 0 || !isFinite(n) ? _(l * (Math.log("0." + k(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) : (d = !1, c.rounding = s.s = 1, n = Math.min(12, (t + "").length), i = W(e.times(G(s, r + n)), r), i.d && (i = F(i, r + 5, 1), j(i.d, r, a) && (t = r + 10, i = F(W(e.times(G(s, t + n)), t), t + 5, 1), +k(i.d).slice(r + 1, r + 15) + 1 == 0x5af3107a4000 && (i = F(i, r + 1, 0)))), i.s = o, d = !0, c.rounding = a, F(i, r, a));
+}, O.toPrecision = function(e, t) {
+	var n, i = this, a = i.constructor;
+	return e === void 0 ? n = I(i, i.e <= a.toExpNeg || i.e >= a.toExpPos) : (A(e, 1, r), t === void 0 ? t = a.rounding : A(t, 0, 8), i = F(new a(i), e, t), n = I(i, e <= i.e || i.e <= a.toExpNeg, e)), i.isNeg() && !i.isZero() ? "-" + n : n;
+}, O.toSignificantDigits = O.toSD = function(e, t) {
+	var n = this, i = n.constructor;
+	return e === void 0 ? (e = i.precision, t = i.rounding) : (A(e, 1, r), t === void 0 ? t = i.rounding : A(t, 0, 8)), F(new i(n), e, t);
+}, O.toString = function() {
+	var e = this, t = e.constructor, n = I(e, e.e <= t.toExpNeg || e.e >= t.toExpPos);
 	return e.isNeg() && !e.isZero() ? "-" + n : n;
-}, D.truncated = D.trunc = function() {
-	return P(new this.constructor(this), this.e + 1, 1);
-}, D.valueOf = D.toJSON = function() {
-	var e = this, t = e.constructor, n = F(e, e.e <= t.toExpNeg || e.e >= t.toExpPos);
+}, O.truncated = O.trunc = function() {
+	return F(new this.constructor(this), this.e + 1, 1);
+}, O.valueOf = O.toJSON = function() {
+	var e = this, t = e.constructor, n = I(e, e.e <= t.toExpNeg || e.e >= t.toExpPos);
 	return e.isNeg() ? "-" + n : n;
 };
-function O(e) {
+function k(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 = C - r.length, n && (a += B(n)), a += r;
-		o = e[t], r = o + "", n = C - r.length, n && (a += B(n));
+		for (a += o, t = 1; t < i; t++) r = e[t] + "", n = w - r.length, n && (a += V(n)), a += r;
+		o = e[t], r = o + "", n = w - r.length, n && (a += V(n));
 	} else if (o === 0) return "0";
 	for (; o % 10 == 0;) o /= 10;
 	return a + o;
 }
-function k(e, t, n) {
-	if (e !== ~~e || e < t || e > n) throw Error(f + e);
+function A(e, t, n) {
+	if (e !== ~~e || e < t || e > n) throw Error(p + e);
 }
-function A(e, t, n, r) {
+function j(e, t, n, r) {
 	var i, a, o, s;
 	for (a = e[0]; a >= 10; a /= 10) --t;
-	return --t < 0 ? (t += C, i = 0) : (i = Math.ceil((t + 1) / C), t %= C), a = _(10, C - 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) == _(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) == _(10, t - 3) - 1, o;
+	return --t < 0 ? (t += w, i = 0) : (i = Math.ceil((t + 1) / w), t %= w), a = v(10, w - 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) == v(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) == v(10, t - 3) - 1, o;
 }
-function j(e, t, n) {
-	for (var i, a = [0], o, s = 0, c = e.length; s < c;) {
+function M(e, t, n) {
+	for (var r, a = [0], o, s = 0, c = e.length; s < c;) {
 		for (o = a.length; o--;) a[o] *= t;
-		for (a[0] += r.indexOf(e.charAt(s++)), i = 0; i < a.length; i++) a[i] > n - 1 && (a[i + 1] === void 0 && (a[i + 1] = 0), a[i + 1] += a[i] / n | 0, a[i] %= n);
+		for (a[0] += i.indexOf(e.charAt(s++)), r = 0; r < a.length; r++) a[r] > n - 1 && (a[r + 1] === void 0 && (a[r + 1] = 0), a[r + 1] += a[r] / n | 0, a[r] %= n);
 	}
 	return a.reverse();
 }
-function M(e, t) {
+function N(e, t) {
 	var n, r, i;
 	if (t.isZero()) return t;
-	r = t.d.length, r < 32 ? (n = Math.ceil(r / 3), i = (1 / J(4, n)).toString()) : (n = 16, i = "2.3283064365386962890625e-10"), e.precision += n, t = q(e, 1, t.times(i), new e(1));
+	r = t.d.length, r < 32 ? (n = Math.ceil(r / 3), i = (1 / Y(4, n)).toString()) : (n = 16, i = "2.3283064365386962890625e-10"), e.precision += n, t = J(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 N = (function() {
+var P = (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;
@@ -353,106 +354,106 @@ var N = (function() {
 		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, l) {
-		var u, d, f, p, m, h, _, v, y, b, x, w, T, E, D, O, k, A, j, M, N = r.constructor, F = r.s == i.s ? 1 : -1, I = r.d, L = i.d;
-		if (!I || !I[0] || !L || !L[0]) return new N(!r.s || !i.s || (I ? L && I[0] == L[0] : !L) ? NaN : I && I[0] == 0 || !L ? F * 0 : F / 0);
-		for (l ? (m = 1, d = r.e - i.e) : (l = S, m = C, d = g(r.e / m) - g(i.e / m)), j = L.length, k = I.length, y = new N(F), b = y.d = [], f = 0; L[f] == (I[f] || 0); f++);
+	return function(r, i, a, o, s, c) {
+		var u, d, f, p, m, h, g, v, y, b, x, S, T, E, D, O, k, A, j, M, N = r.constructor, P = r.s == i.s ? 1 : -1, I = r.d, L = i.d;
+		if (!I || !I[0] || !L || !L[0]) return new N(!r.s || !i.s || (I ? L && I[0] == L[0] : !L) ? NaN : I && I[0] == 0 || !L ? P * 0 : P / 0);
+		for (c ? (m = 1, d = r.e - i.e) : (c = C, m = w, d = _(r.e / m) - _(i.e / m)), j = L.length, k = I.length, y = new N(P), b = y.d = [], f = 0; L[f] == (I[f] || 0); f++);
 		if (L[f] > (I[f] || 0) && d--, a == null ? (E = a = N.precision, o = N.rounding) : E = s ? a + (r.e - i.e) + 1 : a, E < 0) b.push(1), h = !0;
 		else {
 			if (E = E / m + 2 | 0, f = 0, j == 1) {
-				for (p = 0, L = L[0], E++; (f < k || p) && E--; f++) D = p * l + (I[f] || 0), b[f] = D / L | 0, p = D % L | 0;
+				for (p = 0, L = L[0], E++; (f < k || p) && E--; f++) D = p * c + (I[f] || 0), b[f] = D / L | 0, p = D % L | 0;
 				h = p || f < k;
 			} else {
-				for (p = l / (L[0] + 1) | 0, p > 1 && (L = e(L, p, l), I = e(I, p, l), j = L.length, k = I.length), O = j, x = I.slice(0, j), w = x.length; w < j;) x[w++] = 0;
-				M = L.slice(), M.unshift(0), A = L[0], L[1] >= l / 2 && ++A;
+				for (p = c / (L[0] + 1) | 0, p > 1 && (L = e(L, p, c), I = e(I, p, c), j = L.length, k = I.length), O = j, x = I.slice(0, j), S = x.length; S < j;) x[S++] = 0;
+				M = L.slice(), M.unshift(0), A = L[0], L[1] >= c / 2 && ++A;
 				do
-					p = 0, u = t(L, x, j, w), u < 0 ? (T = x[0], j != w && (T = T * l + (x[1] || 0)), p = T / A | 0, p > 1 ? (p >= l && (p = l - 1), _ = e(L, p, l), v = _.length, w = x.length, u = t(_, x, v, w), u == 1 && (p--, n(_, j < v ? M : L, v, l))) : (p == 0 && (u = p = 1), _ = L.slice()), v = _.length, v < w && _.unshift(0), n(x, _, w, l), u == -1 && (w = x.length, u = t(L, x, j, w), u < 1 && (p++, n(x, j < w ? M : L, w, l))), w = x.length) : u === 0 && (p++, x = [0]), b[f++] = p, u && x[0] ? x[w++] = I[O] || 0 : (x = [I[O]], w = 1);
+					p = 0, u = t(L, x, j, S), u < 0 ? (T = x[0], j != S && (T = T * c + (x[1] || 0)), p = T / A | 0, p > 1 ? (p >= c && (p = c - 1), g = e(L, p, c), v = g.length, S = x.length, u = t(g, x, v, S), u == 1 && (p--, n(g, j < v ? M : L, v, c))) : (p == 0 && (u = p = 1), g = L.slice()), v = g.length, v < S && g.unshift(0), n(x, g, S, c), u == -1 && (S = x.length, u = t(L, x, j, S), u < 1 && (p++, n(x, j < S ? M : L, S, c))), S = x.length) : u === 0 && (p++, x = [0]), b[f++] = p, u && x[0] ? x[S++] = I[O] || 0 : (x = [I[O]], S = 1);
 				while ((O++ < k || x[0] !== void 0) && E--);
 				h = x[0] !== void 0;
 			}
 			b[0] || b.shift();
 		}
-		if (m == 1) y.e = d, c = h;
+		if (m == 1) y.e = d, l = h;
 		else {
 			for (f = 1, p = b[0]; p >= 10; p /= 10) f++;
-			y.e = f + d * m - 1, P(y, s ? a + y.e + 1 : a, o, h);
+			y.e = f + d * m - 1, F(y, s ? a + y.e + 1 : a, o, h);
 		}
 		return y;
 	};
 })();
-function P(e, t, n, r) {
-	var i, a, o, s, c, l, d, f, p, m = e.constructor;
+function F(e, t, n, r) {
+	var i, a, o, s, c, l, u, f, p, m = e.constructor;
 	out: if (t != null) {
 		if (f = e.d, !f) return e;
 		for (i = 1, s = f[0]; s >= 10; s /= 10) i++;
-		if (a = t - i, a < 0) a += C, o = t, d = f[p = 0], c = d / _(10, i - o - 1) % 10 | 0;
-		else if (p = Math.ceil((a + 1) / C), s = f.length, p >= s) if (r) {
+		if (a = t - i, a < 0) a += w, o = t, u = f[p = 0], c = u / v(10, i - o - 1) % 10 | 0;
+		else if (p = Math.ceil((a + 1) / w), s = f.length, p >= s) if (r) {
 			for (; s++ <= p;) f.push(0);
-			d = c = 0, i = 1, a %= C, o = a - C + 1;
+			u = c = 0, i = 1, a %= w, o = a - w + 1;
 		} else break out;
 		else {
-			for (d = s = f[p], i = 1; s >= 10; s /= 10) i++;
-			a %= C, o = a - C + i, c = o < 0 ? 0 : d / _(10, i - o - 1) % 10 | 0;
+			for (u = s = f[p], i = 1; s >= 10; s /= 10) i++;
+			a %= w, o = a - w + i, c = o < 0 ? 0 : u / v(10, i - o - 1) % 10 | 0;
 		}
-		if (r = r || t < 0 || f[p + 1] !== void 0 || (o < 0 ? d : d % _(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 ? d / _(10, i - o) : 0 : f[p - 1]) % 10 & 1 || n == (e.s < 0 ? 8 : 7)), t < 1 || !f[0]) return f.length = 0, l ? (t -= e.e + 1, f[0] = _(10, (C - t % C) % C), e.e = -t || 0) : f[0] = e.e = 0, e;
-		if (a == 0 ? (f.length = p, s = 1, p--) : (f.length = p + 1, s = _(10, C - a), f[p] = o > 0 ? (d / _(10, i - o) % _(10, o) | 0) * s : 0), l) for (;;) if (p == 0) {
+		if (r = r || t < 0 || f[p + 1] !== void 0 || (o < 0 ? u : u % v(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 / v(10, i - o) : 0 : f[p - 1]) % 10 & 1 || n == (e.s < 0 ? 8 : 7)), t < 1 || !f[0]) return f.length = 0, l ? (t -= e.e + 1, f[0] = v(10, (w - t % w) % w), e.e = -t || 0) : f[0] = e.e = 0, e;
+		if (a == 0 ? (f.length = p, s = 1, p--) : (f.length = p + 1, s = v(10, w - a), f[p] = o > 0 ? (u / v(10, i - o) % v(10, o) | 0) * s : 0), l) for (;;) if (p == 0) {
 			for (a = 1, o = f[0]; o >= 10; o /= 10) a++;
 			for (o = f[0] += s, s = 1; o >= 10; o /= 10) s++;
-			a != s && (e.e++, f[0] == S && (f[0] = 1));
+			a != s && (e.e++, f[0] == C && (f[0] = 1));
 			break;
 		} else {
-			if (f[p] += s, f[p] != S) break;
+			if (f[p] += s, f[p] != C) break;
 			f[p--] = 0, s = 1;
 		}
 		for (a = f.length; f[--a] === 0;) f.pop();
 	}
-	return u && (e.e > m.maxE ? (e.d = null, e.e = NaN) : e.e < m.minE && (e.e = 0, e.d = [0])), e;
+	return d && (e.e > m.maxE ? (e.d = null, e.e = NaN) : e.e < m.minE && (e.e = 0, e.d = [0])), e;
 }
-function F(e, t, n) {
-	if (!e.isFinite()) return G(e);
-	var r, i = e.e, a = O(e.d), o = a.length;
-	return t ? (n && (r = n - o) > 0 ? a = a.charAt(0) + "." + a.slice(1) + B(r) : o > 1 && (a = a.charAt(0) + "." + a.slice(1)), a = a + (e.e < 0 ? "e" : "e+") + e.e) : i < 0 ? (a = "0." + B(-i - 1) + a, n && (r = n - o) > 0 && (a += B(r))) : i >= o ? (a += B(i + 1 - o), n && (r = n - i - 1) > 0 && (a = a + "." + B(r))) : ((r = i + 1) < o && (a = a.slice(0, r) + "." + a.slice(r)), n && (r = n - o) > 0 && (i + 1 === o && (a += "."), a += B(r))), a;
+function I(e, t, n) {
+	if (!e.isFinite()) return K(e);
+	var r, i = e.e, a = k(e.d), o = a.length;
+	return t ? (n && (r = n - o) > 0 ? a = a.charAt(0) + "." + a.slice(1) + V(r) : o > 1 && (a = a.charAt(0) + "." + a.slice(1)), a = a + (e.e < 0 ? "e" : "e+") + e.e) : i < 0 ? (a = "0." + V(-i - 1) + a, n && (r = n - o) > 0 && (a += V(r))) : i >= o ? (a += V(i + 1 - o), n && (r = n - i - 1) > 0 && (a = a + "." + V(r))) : ((r = i + 1) < o && (a = a.slice(0, r) + "." + a.slice(r)), n && (r = n - o) > 0 && (i + 1 === o && (a += "."), a += V(r))), a;
 }
-function I(e, t) {
+function L(e, t) {
 	var n = e[0];
-	for (t *= C; n >= 10; n /= 10) t++;
+	for (t *= w; n >= 10; n /= 10) t++;
 	return t;
 }
-function L(e, t, n) {
-	if (t > T) throw u = !0, n && (e.precision = n), Error(p);
-	return P(new e(i), t, 1, !0);
-}
 function R(e, t, n) {
-	if (t > E) throw Error(p);
-	return P(new e(a), t, n, !0);
+	if (t > E) throw d = !0, n && (e.precision = n), Error(m);
+	return F(new e(a), t, 1, !0);
+}
+function z(e, t, n) {
+	if (t > D) throw Error(m);
+	return F(new e(o), t, n, !0);
 }
-function z(e) {
-	var t = e.length - 1, n = t * C + 1;
+function B(e) {
+	var t = e.length - 1, n = t * w + 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 B(e) {
+function V(e) {
 	for (var t = ""; e--;) t += "0";
 	return t;
 }
-function ee(e, t, n, r) {
-	var i, a = new e(1), o = Math.ceil(r / C + 4);
-	for (u = !1;;) {
-		if (n % 2 && (a = a.times(t), Z(a.d, o) && (i = !0)), n = g(n / 2), n === 0) {
+function H(e, t, n, r) {
+	var i, a = new e(1), o = Math.ceil(r / w + 4);
+	for (d = !1;;) {
+		if (n % 2 && (a = a.times(t), Q(a.d, o) && (i = !0)), n = _(n / 2), n === 0) {
 			n = a.d.length - 1, i && a.d[n] === 0 && ++a.d[n];
 			break;
 		}
-		t = t.times(t), Z(t.d, o);
+		t = t.times(t), Q(t.d, o);
 	}
-	return u = !0, a;
+	return d = !0, a;
 }
-function V(e) {
+function ee(e) {
 	return e.d[e.d.length - 1] & 1;
 }
-function H(e, t, n) {
+function U(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;
@@ -462,110 +463,110 @@ function H(e, t, n) {
 	}
 	return a;
 }
-function U(e, t) {
-	var n, r, i, a, o, s, c, l = 0, d = 0, f = 0, p = e.constructor, m = p.rounding, h = p.precision;
+function W(e, t) {
+	var n, r, i, a, o, s, c, l = 0, u = 0, f = 0, p = e.constructor, m = p.rounding, h = p.precision;
 	if (!e.d || !e.d[0] || e.e > 17) return new p(e.d ? e.d[0] ? e.s < 0 ? 0 : Infinity : 1 : e.s ? e.s < 0 ? 0 : e : NaN);
-	for (t == null ? (u = !1, c = h) : c = t, s = new p(.03125); e.e > -2;) e = e.times(s), f += 5;
-	for (r = Math.log(_(2, f)) / Math.LN10 * 2 + 5 | 0, c += r, n = a = o = new p(1), p.precision = c;;) {
-		if (a = P(a.times(e), c, 1), n = n.times(++d), s = o.plus(N(a, n, c, 1)), O(s.d).slice(0, c) === O(o.d).slice(0, c)) {
-			for (i = f; i--;) o = P(o.times(o), c, 1);
-			if (t == null) if (l < 3 && A(o.d, c - r, m, l)) p.precision = c += 10, n = a = s = new p(1), d = 0, l++;
-			else return P(o, p.precision = h, m, u = !0);
+	for (t == null ? (d = !1, c = h) : c = t, s = new p(.03125); e.e > -2;) e = e.times(s), f += 5;
+	for (r = Math.log(v(2, f)) / Math.LN10 * 2 + 5 | 0, c += r, n = a = o = new p(1), p.precision = c;;) {
+		if (a = F(a.times(e), c, 1), n = n.times(++u), s = o.plus(P(a, n, c, 1)), k(s.d).slice(0, c) === k(o.d).slice(0, c)) {
+			for (i = f; i--;) o = F(o.times(o), c, 1);
+			if (t == null) if (l < 3 && j(o.d, c - r, m, l)) p.precision = c += 10, n = a = s = new p(1), u = 0, l++;
+			else return F(o, p.precision = h, m, d = !0);
 			else return p.precision = h, o;
 		}
 		o = s;
 	}
 }
-function W(e, t) {
-	var n, r, i, a, o, s, c, l, d, f, p, m = 1, h = 10, g = e, _ = g.d, v = g.constructor, y = v.rounding, b = v.precision;
+function G(e, t) {
+	var n, r, i, a, o, s, c, l, u, f, p, m = 1, h = 10, g = e, _ = g.d, v = g.constructor, y = v.rounding, b = v.precision;
 	if (g.s < 0 || !_ || !_[0] || !g.e && _[0] == 1 && _.length == 1) return new v(_ && !_[0] ? -Infinity : g.s == 1 ? _ ? 0 : g : NaN);
-	if (t == null ? (u = !1, d = b) : d = t, v.precision = d += h, n = O(_), r = n.charAt(0), Math.abs(a = g.e) < 0x5543df729c000) {
-		for (; r < 7 && r != 1 || r == 1 && n.charAt(1) > 3;) g = g.times(e), n = O(g.d), r = n.charAt(0), m++;
+	if (t == null ? (d = !1, u = b) : u = t, v.precision = u += h, n = k(_), r = n.charAt(0), Math.abs(a = g.e) < 0x5543df729c000) {
+		for (; r < 7 && r != 1 || r == 1 && n.charAt(1) > 3;) g = g.times(e), n = k(g.d), r = n.charAt(0), m++;
 		a = g.e, r > 1 ? (g = new v("0." + n), a++) : g = new v(r + "." + n.slice(1));
-	} else return l = L(v, d + 2, b).times(a + ""), g = W(new v(r + "." + n.slice(1)), d - h).plus(l), v.precision = b, t == null ? P(g, b, y, u = !0) : g;
-	for (f = g, c = o = g = N(g.minus(1), g.plus(1), d, 1), p = P(g.times(g), d, 1), i = 3;;) {
-		if (o = P(o.times(p), d, 1), l = c.plus(N(o, new v(i), d, 1)), O(l.d).slice(0, d) === O(c.d).slice(0, d)) if (c = c.times(2), a !== 0 && (c = c.plus(L(v, d + 2, b).times(a + ""))), c = N(c, new v(m), d, 1), t == null) if (A(c.d, d - h, y, s)) v.precision = d += h, l = o = g = N(f.minus(1), f.plus(1), d, 1), p = P(g.times(g), d, 1), i = s = 1;
-		else return P(c, v.precision = b, y, u = !0);
+	} else return l = R(v, u + 2, b).times(a + ""), g = G(new v(r + "." + n.slice(1)), u - h).plus(l), v.precision = b, t == null ? F(g, b, y, d = !0) : g;
+	for (f = g, c = o = g = P(g.minus(1), g.plus(1), u, 1), p = F(g.times(g), u, 1), i = 3;;) {
+		if (o = F(o.times(p), u, 1), l = c.plus(P(o, new v(i), u, 1)), k(l.d).slice(0, u) === k(c.d).slice(0, u)) if (c = c.times(2), a !== 0 && (c = c.plus(R(v, u + 2, b).times(a + ""))), c = P(c, new v(m), u, 1), t == null) if (j(c.d, u - h, y, s)) v.precision = u += h, l = o = g = P(f.minus(1), f.plus(1), u, 1), p = F(g.times(g), u, 1), i = s = 1;
+		else return F(c, v.precision = b, y, d = !0);
 		else return v.precision = b, c;
 		c = l, i += 2;
 	}
 }
-function G(e) {
+function K(e) {
 	return String(e.s * e.s / 0);
 }
-function K(e, t) {
+function q(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) % C, n < 0 && (r += C), r < i) {
-			for (r && e.d.push(+t.slice(0, r)), i -= C; r < i;) e.d.push(+t.slice(r, r += C));
-			t = t.slice(r), r = C - t.length;
+		if (i -= r, e.e = n = n - r - 1, e.d = [], r = (n + 1) % w, n < 0 && (r += w), r < i) {
+			for (r && e.d.push(+t.slice(0, r)), i -= w; r < i;) e.d.push(+t.slice(r, r += w));
+			t = t.slice(r), r = w - t.length;
 		} else r -= i;
 		for (; r--;) t += "0";
-		e.d.push(+t), u && (e.e > e.constructor.maxE ? (e.d = null, e.e = NaN) : e.e < e.constructor.minE && (e.e = 0, e.d = [0]));
+		e.d.push(+t), d && (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 te(e, t) {
-	var n, r, i, a, o, c, l, d, p;
+	var n, r, i, a, o, s, l, u, f;
 	if (t.indexOf("_") > -1) {
-		if (t = t.replace(/(\d)_(?=\d)/g, "$1"), x.test(t)) return K(e, t);
+		if (t = t.replace(/(\d)_(?=\d)/g, "$1"), S.test(t)) return q(e, t);
 	} else if (t === "Infinity" || t === "NaN") return +t || (e.s = NaN), e.e = NaN, e.d = null, e;
-	if (y.test(t)) n = 16, t = t.toLowerCase();
-	else if (v.test(t)) n = 2;
-	else if (b.test(t)) n = 8;
-	else throw Error(f + t);
-	for (a = t.search(/p/i), a > 0 ? (l = +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(".", ""), c = t.length, a = c - a, i = ee(r, new r(n), a, a * 2)), d = j(t, n, S), p = d.length - 1, a = p; d[a] === 0; --a) d.pop();
-	return a < 0 ? new r(e.s * 0) : (e.e = I(d, p), e.d = d, u = !1, o && (e = N(e, i, c * 4)), l && (e = e.times(Math.abs(l) < 54 ? _(2, l) : s.pow(2, l))), u = !0, e);
+	if (b.test(t)) n = 16, t = t.toLowerCase();
+	else if (y.test(t)) n = 2;
+	else if (x.test(t)) n = 8;
+	else throw Error(p + t);
+	for (a = t.search(/p/i), a > 0 ? (l = +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 = H(r, new r(n), a, a * 2)), u = M(t, n, C), f = u.length - 1, a = f; u[a] === 0; --a) u.pop();
+	return a < 0 ? new r(e.s * 0) : (e.e = L(u, f), e.d = u, d = !1, o && (e = P(e, i, s * 4)), l && (e = e.times(Math.abs(l) < 54 ? v(2, l) : c.pow(2, l))), d = !0, e);
 }
 function ne(e, t) {
 	var n, r = t.d.length;
-	if (r < 3) return t.isZero() ? t : q(e, 2, t, t);
-	n = 1.4 * Math.sqrt(r), n = n > 16 ? 16 : n | 0, t = t.times(1 / J(5, n)), t = q(e, 2, t, t);
+	if (r < 3) return t.isZero() ? t : J(e, 2, t, t);
+	n = 1.4 * Math.sqrt(r), n = n > 16 ? 16 : n | 0, t = t.times(1 / Y(5, n)), t = J(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 q(e, t, n, r, i) {
-	var a, o, s, c, l = 1, d = e.precision, f = Math.ceil(d / C);
-	for (u = !1, c = n.times(n), s = new e(r);;) {
-		if (o = N(s.times(c), new e(t++ * t++), d, 1), s = i ? r.plus(o) : r.minus(o), r = N(o.times(c), new e(t++ * t++), d, 1), o = s.plus(r), o.d[f] !== void 0) {
+function J(e, t, n, r, i) {
+	var a, o, s, c, l = 1, u = e.precision, f = Math.ceil(u / w);
+	for (d = !1, c = n.times(n), s = new e(r);;) {
+		if (o = P(s.times(c), new e(t++ * t++), u, 1), s = i ? r.plus(o) : r.minus(o), r = P(o.times(c), new e(t++ * t++), u, 1), o = s.plus(r), o.d[f] !== void 0) {
 			for (a = f; o.d[a] === s.d[a] && a--;);
 			if (a == -1) break;
 		}
 		a = s, s = r, r = o, o = a, l++;
 	}
-	return u = !0, o.d.length = f + 1, o;
+	return d = !0, o.d.length = f + 1, o;
 }
-function J(e, t) {
+function Y(e, t) {
 	for (var n = e; --t;) n *= e;
 	return n;
 }
-function Y(e, t) {
-	var n, r = t.s < 0, i = R(e, e.precision, 1), a = i.times(.5);
-	if (t = t.abs(), t.lte(a)) return l = r ? 4 : 1, t;
-	if (n = t.divToInt(i), n.isZero()) l = r ? 3 : 2;
+function X(e, t) {
+	var n, r = t.s < 0, i = z(e, e.precision, 1), a = i.times(.5);
+	if (t = t.abs(), t.lte(a)) return u = r ? 4 : 1, t;
+	if (n = t.divToInt(i), n.isZero()) u = r ? 3 : 2;
 	else {
-		if (t = t.minus(n.times(i)), t.lte(a)) return l = V(n) ? r ? 2 : 3 : r ? 4 : 1, t;
-		l = V(n) ? r ? 1 : 4 : r ? 3 : 2;
+		if (t = t.minus(n.times(i)), t.lte(a)) return u = ee(n) ? r ? 2 : 3 : r ? 4 : 1, t;
+		u = ee(n) ? r ? 1 : 4 : r ? 3 : 2;
 	}
 	return t.minus(i).abs();
 }
-function X(e, t, i, a) {
-	var o, s, l, u, d, f, p, m, h, g = e.constructor, _ = i !== void 0;
-	if (_ ? (k(i, 1, n), a === void 0 ? a = g.rounding : k(a, 0, 8)) : (i = g.precision, a = g.rounding), !e.isFinite()) p = G(e);
+function Z(e, t, n, a) {
+	var o, s, c, u, d, f, p, m, h, g = e.constructor, _ = n !== void 0;
+	if (_ ? (A(n, 1, r), a === void 0 ? a = g.rounding : A(a, 0, 8)) : (n = g.precision, a = g.rounding), !e.isFinite()) p = K(e);
 	else {
-		for (p = F(e), l = p.indexOf("."), _ ? (o = 2, t == 16 ? i = i * 4 - 3 : t == 8 && (i = i * 3 - 2)) : o = t, l >= 0 && (p = p.replace(".", ""), h = new g(1), h.e = p.length - l, h.d = j(F(h), 10, o), h.e = h.d.length), m = j(p, 10, o), s = d = m.length; m[--d] == 0;) m.pop();
+		for (p = I(e), c = p.indexOf("."), _ ? (o = 2, t == 16 ? n = n * 4 - 3 : t == 8 && (n = n * 3 - 2)) : o = t, c >= 0 && (p = p.replace(".", ""), h = new g(1), h.e = p.length - c, h.d = M(I(h), 10, o), h.e = h.d.length), m = M(p, 10, o), s = d = m.length; m[--d] == 0;) m.pop();
 		if (!m[0]) p = _ ? "0p+0" : "0";
 		else {
-			if (l < 0 ? s-- : (e = new g(e), e.d = m, e.e = s, e = N(e, h, i, a, 0, o), m = e.d, s = e.e, f = c), l = m[i], u = o / 2, f ||= m[i + 1] !== void 0, f = a < 4 ? (l !== void 0 || f) && (a === 0 || a === (e.s < 0 ? 3 : 2)) : l > u || l === u && (a === 4 || f || a === 6 && m[i - 1] & 1 || a === (e.s < 0 ? 8 : 7)), m.length = i, f) for (; ++m[--i] > o - 1;) m[i] = 0, i || (++s, m.unshift(1));
+			if (c < 0 ? s-- : (e = new g(e), e.d = m, e.e = s, e = P(e, h, n, a, 0, o), m = e.d, s = e.e, f = l), c = m[n], u = o / 2, f ||= m[n + 1] !== void 0, f = a < 4 ? (c !== void 0 || f) && (a === 0 || a === (e.s < 0 ? 3 : 2)) : c > u || c === u && (a === 4 || f || a === 6 && m[n - 1] & 1 || a === (e.s < 0 ? 8 : 7)), m.length = n, f) for (; ++m[--n] > o - 1;) m[n] = 0, n || (++s, m.unshift(1));
 			for (d = m.length; !m[d - 1]; --d);
-			for (l = 0, p = ""; l < d; l++) p += r.charAt(m[l]);
+			for (c = 0, p = ""; c < d; c++) p += i.charAt(m[c]);
 			if (_) {
 				if (d > 1) if (t == 16 || t == 8) {
-					for (l = t == 16 ? 4 : 3, --d; d % l; d++) p += "0";
-					for (m = j(p, o, t), d = m.length; !m[d - 1]; --d);
-					for (l = 1, p = "1."; l < d; l++) p += r.charAt(m[l]);
+					for (c = t == 16 ? 4 : 3, --d; d % c; d++) p += "0";
+					for (m = M(p, o, t), d = m.length; !m[d - 1]; --d);
+					for (c = 1, p = "1."; c < d; c++) p += i.charAt(m[c]);
 				} else p = p.charAt(0) + "." + p.slice(1);
 				p = p + (s < 0 ? "p" : "p+") + s;
 			} else if (s < 0) {
@@ -578,7 +579,7 @@ function X(e, t, i, a) {
 	}
 	return e.s < 0 ? "-" + p : p;
 }
-function Z(e, t) {
+function Q(e, t) {
 	if (e.length > t) return e.length = t, !0;
 }
 function re(e) {
@@ -608,48 +609,48 @@ function ue(e) {
 function de(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 = R(this, a, 1).times(t.s > 0 ? .25 : .75), n.s = e.s) : !t.d || e.isZero() ? (n = t.s < 0 ? R(this, r, i) : new this(0), n.s = e.s) : !e.d || t.isZero() ? (n = R(this, a, 1).times(.5), n.s = e.s) : t.s < 0 ? (this.precision = a, this.rounding = 1, n = this.atan(N(e, t, a, 1)), t = R(this, a, 1), this.precision = r, this.rounding = i, n = e.s < 0 ? n.minus(t) : n.plus(t)) : n = this.atan(N(e, t, a, 1)), n;
+	return !e.s || !t.s ? n = new this(NaN) : !e.d && !t.d ? (n = z(this, a, 1).times(t.s > 0 ? .25 : .75), n.s = e.s) : !t.d || e.isZero() ? (n = t.s < 0 ? z(this, r, i) : new this(0), n.s = e.s) : !e.d || t.isZero() ? (n = z(this, a, 1).times(.5), n.s = e.s) : t.s < 0 ? (this.precision = a, this.rounding = 1, n = this.atan(P(e, t, a, 1)), t = z(this, a, 1), this.precision = r, this.rounding = i, n = e.s < 0 ? n.minus(t) : n.plus(t)) : n = this.atan(P(e, t, a, 1)), n;
 }
 function fe(e) {
 	return new this(e).cbrt();
 }
 function pe(e) {
-	return P(e = new this(e), e.e + 1, 2);
+	return F(e = new this(e), e.e + 1, 2);
 }
 function me(e, t, n) {
 	return new this(e).clamp(t, n);
 }
-function he(r) {
-	if (!r || typeof r != "object") throw Error(d + "Object expected");
-	var i, a, s, c = r.defaults === !0, l = [
+function he(e) {
+	if (!e || typeof e != "object") throw Error(f + "Object expected");
+	var i, a, o, c = e.defaults === !0, l = [
 		"precision",
 		1,
-		n,
+		r,
 		"rounding",
 		0,
 		8,
 		"toExpNeg",
-		-t,
+		-n,
 		0,
 		"toExpPos",
 		0,
-		t,
+		n,
 		"maxE",
 		0,
-		t,
+		n,
 		"minE",
-		-t,
+		-n,
 		0,
 		"modulo",
 		0,
 		9
 	];
-	for (i = 0; i < l.length; i += 3) if (a = l[i], c && (this[a] = o[a]), (s = r[a]) !== void 0) if (g(s) === s && s >= l[i + 1] && s <= l[i + 2]) this[a] = s;
-	else throw Error(f + a + ": " + s);
-	if (a = "crypto", c && (this[a] = o[a]), (s = r[a]) !== void 0) if (s === !0 || s === !1 || s === 0 || s === 1) if (s) if (!e(crypto) && crypto && (crypto.getRandomValues || crypto.randomBytes)) this[a] = !0;
-	else throw Error(m);
+	for (i = 0; i < l.length; i += 3) if (a = l[i], c && (this[a] = s[a]), (o = e[a]) !== void 0) if (_(o) === o && o >= l[i + 1] && o <= l[i + 2]) this[a] = o;
+	else throw Error(p + a + ": " + o);
+	if (a = "crypto", c && (this[a] = s[a]), (o = e[a]) !== void 0) if (o === !0 || o === !1 || o === 0 || o === 1) if (o) if (!t(crypto) && crypto && (crypto.getRandomValues || crypto.randomBytes)) this[a] = !0;
+	else throw Error(h);
 	else this[a] = !1;
-	else throw Error(f + a + ": " + s);
+	else throw Error(p + a + ": " + o);
 	return this;
 }
 function ge(e) {
@@ -658,36 +659,36 @@ function ge(e) {
 function _e(e) {
 	return new this(e).cosh();
 }
-function Q(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, $(e)) {
-			a.s = e.s, u ? !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);
+function $(t) {
+	var n, r, i;
+	function a(e) {
+		var t, n, r, i = this;
+		if (!(i instanceof a)) return new a(e);
+		if (i.constructor = a, Se(e)) {
+			i.s = e.s, d ? !e.d || e.e > a.maxE ? (i.e = NaN, i.d = null) : e.e < a.minE ? (i.e = 0, i.d = [0]) : (i.e = e.e, i.d = e.d.slice()) : (i.e = e.e, i.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];
+				i.s = 1 / e < 0 ? -1 : 1, i.e = 0, i.d = [0];
 				return;
 			}
-			if (e < 0 ? (e = -e, a.s = -1) : a.s = 1, e === ~~e && e < 1e7) {
+			if (e < 0 ? (e = -e, i.s = -1) : i.s = 1, e === ~~e && e < 1e7) {
 				for (t = 0, n = e; n >= 10; n /= 10) t++;
-				u ? 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]);
+				d ? t > a.maxE ? (i.e = NaN, i.d = null) : t < a.minE ? (i.e = 0, i.d = [0]) : (i.e = t, i.d = [e]) : (i.e = t, i.d = [e]);
 				return;
 			}
 			if (e * 0 != 0) {
-				e || (a.s = NaN), a.e = NaN, a.d = null;
+				e || (i.s = NaN), i.e = NaN, i.d = null;
 				return;
 			}
-			return K(a, e.toString());
+			return q(i, 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), x.test(e) ? K(a, e) : te(a, e);
-		if (r === "bigint") return e < 0 ? (e = -e, a.s = -1) : a.s = 1, K(a, e.toString());
-		throw Error(f + e);
+		if (r === "string") return (n = e.charCodeAt(0)) === 45 ? (e = e.slice(1), i.s = -1) : (n === 43 && (e = e.slice(1)), i.s = 1), S.test(e) ? q(i, e) : te(i, e);
+		if (r === "bigint") return e < 0 ? (e = -e, i.s = -1) : i.s = 1, q(i, e.toString());
+		throw Error(p + e);
 	}
-	if (i.prototype = D, 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 = he, i.clone = Q, i.isDecimal = $, i.abs = re, i.acos = ie, i.acosh = ae, i.add = oe, i.asin = se, i.asinh = ce, i.atan = le, i.atanh = ue, i.atan2 = de, i.cbrt = fe, i.ceil = pe, i.clamp = me, i.cos = ge, i.cosh = _e, i.div = ve, i.exp = ye, i.floor = be, i.hypot = xe, i.ln = Se, i.log = Ce, i.log10 = Te, i.log2 = we, i.max = Ee, i.min = De, i.mod = Oe, i.mul = ke, i.pow = Ae, i.random = je, i.round = Me, i.sign = Ne, i.sin = Pe, i.sinh = Fe, i.sqrt = Ie, i.sub = Le, i.sum = Re, i.tan = ze, i.tanh = Be, i.trunc = Ve, e === void 0 && (e = {}), e && e.defaults !== !0) for (r = [
+	if (a.prototype = O, a.ROUND_UP = 0, a.ROUND_DOWN = 1, a.ROUND_CEIL = 2, a.ROUND_FLOOR = 3, a.ROUND_HALF_UP = 4, a.ROUND_HALF_DOWN = 5, a.ROUND_HALF_EVEN = 6, a.ROUND_HALF_CEIL = 7, a.ROUND_HALF_FLOOR = 8, a.EUCLID = 9, a.config = a.set = he, a.clone = $, a.isDecimal = Se, a.abs = re, a.acos = ie, a.acosh = ae, a.add = oe, a.asin = se, a.asinh = ce, a.atan = le, a.atanh = ue, a.atan2 = de, a.cbrt = fe, a.ceil = pe, a.clamp = me, a.cos = ge, a.cosh = _e, a.div = ve, a.exp = ye, a.floor = be, a.hypot = xe, a.ln = Ce, a.log = we, a.log10 = Ee, a.log2 = Te, a.max = De, a.min = Oe, a.mod = ke, a.mul = Ae, a.pow = je, a.random = Me, a.round = Ne, a.sign = Pe, a.sin = Fe, a.sinh = Ie, a.sqrt = Le, a.sub = Re, a.sum = ze, a.tan = Be, a.tanh = Ve, a.trunc = He, t === void 0 && (t = {}), t && t.defaults !== !0) for (i = [
 		"precision",
 		"rounding",
 		"toExpNeg",
@@ -696,8 +697,8 @@ function Q(e) {
 		"minE",
 		"modulo",
 		"crypto"
-	], t = 0; t < r.length;) Object.prototype.hasOwnProperty.call(e, n = r[t++]) || (e[n] = this[n]);
-	return i.config(e), i;
+	], n = 0; n < i.length;) e(t, r = i[n++]) || (t[r] = this[r]);
+	return a.config(t), a;
 }
 function ve(e, t) {
 	return new this(e).div(t);
@@ -706,98 +707,98 @@ function ye(e) {
 	return new this(e).exp();
 }
 function be(e) {
-	return P(e = new this(e), e.e + 1, 3);
+	return F(e = new this(e), e.e + 1, 3);
 }
 function xe() {
 	var e, t, n = new this(0);
-	for (u = !1, e = 0; e < arguments.length;) if (t = new this(arguments[e++]), t.d) n.d && (n = n.plus(t.times(t)));
+	for (d = !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 u = !0, new this(Infinity);
+		if (t.s) return d = !0, new this(Infinity);
 		n = t;
 	}
-	return u = !0, n.sqrt();
-}
-function $(e) {
-	return e instanceof s || e?.toStringTag === h || !1;
+	return d = !0, n.sqrt();
 }
 function Se(e) {
+	return e instanceof c || e?.toStringTag === g || !1;
+}
+function Ce(e) {
 	return new this(e).ln();
 }
-function Ce(e, t) {
+function we(e, t) {
 	return new this(e).log(t);
 }
-function we(e) {
+function Te(e) {
 	return new this(e).log(2);
 }
-function Te(e) {
+function Ee(e) {
 	return new this(e).log(10);
 }
-function Ee() {
-	return H(this, arguments, -1);
-}
 function De() {
-	return H(this, arguments, 1);
+	return U(this, arguments, -1);
 }
-function Oe(e, t) {
-	return new this(e).mod(t);
+function Oe() {
+	return U(this, arguments, 1);
 }
 function ke(e, t) {
-	return new this(e).mul(t);
+	return new this(e).mod(t);
 }
 function Ae(e, t) {
+	return new this(e).mul(t);
+}
+function je(e, t) {
 	return new this(e).pow(t);
 }
-function je(e) {
-	var t, r, i, a, o = 0, s = new this(1), c = [];
-	if (e === void 0 ? e = this.precision : k(e, 1, n), i = Math.ceil(e / C), !this.crypto) for (; o < i;) c[o++] = Math.random() * 1e7 | 0;
+function Me(e) {
+	var t, n, i, a, o = 0, s = new this(1), c = [];
+	if (e === void 0 ? e = this.precision : A(e, 1, r), i = Math.ceil(e / w), !this.crypto) for (; o < i;) c[o++] = Math.random() * 1e7 | 0;
 	else if (crypto.getRandomValues) for (t = crypto.getRandomValues(new Uint32Array(i)); o < i;) a = t[o], a >= 429e7 ? t[o] = crypto.getRandomValues(new Uint32Array(1))[0] : c[o++] = a % 1e7;
 	else if (crypto.randomBytes) {
 		for (t = crypto.randomBytes(i *= 4); o < i;) a = t[o] + (t[o + 1] << 8) + (t[o + 2] << 16) + ((t[o + 3] & 127) << 24), a >= 214e7 ? crypto.randomBytes(4).copy(t, o) : (c.push(a % 1e7), o += 4);
 		o = i / 4;
-	} else throw Error(m);
-	for (i = c[--o], e %= C, i && e && (a = _(10, C - e), c[o] = (i / a | 0) * a); c[o] === 0; o--) c.pop();
-	if (o < 0) r = 0, c = [0];
+	} else throw Error(h);
+	for (i = c[--o], e %= w, i && e && (a = v(10, w - e), c[o] = (i / a | 0) * a); c[o] === 0; o--) c.pop();
+	if (o < 0) n = 0, c = [0];
 	else {
-		for (r = -1; c[0] === 0; r -= C) c.shift();
+		for (n = -1; c[0] === 0; n -= w) c.shift();
 		for (i = 1, a = c[0]; a >= 10; a /= 10) i++;
-		i < C && (r -= C - i);
+		i < w && (n -= w - i);
 	}
-	return s.e = r, s.d = c, s;
-}
-function Me(e) {
-	return P(e = new this(e), e.e + 1, this.rounding);
+	return s.e = n, s.d = c, s;
 }
 function Ne(e) {
-	return e = new this(e), e.d ? e.d[0] ? e.s : 0 * e.s : e.s || NaN;
+	return F(e = new this(e), e.e + 1, this.rounding);
 }
 function Pe(e) {
-	return new this(e).sin();
+	return e = new this(e), e.d ? e.d[0] ? e.s : 0 * e.s : e.s || NaN;
 }
 function Fe(e) {
-	return new this(e).sinh();
+	return new this(e).sin();
 }
 function Ie(e) {
+	return new this(e).sinh();
+}
+function Le(e) {
 	return new this(e).sqrt();
 }
-function Le(e, t) {
+function Re(e, t) {
 	return new this(e).sub(t);
 }
-function Re() {
+function ze() {
 	var e = 0, t = arguments, n = new this(t[e]);
-	for (u = !1; n.s && ++e < t.length;) n = n.plus(t[e]);
-	return u = !0, P(n, this.precision, this.rounding);
+	for (d = !1; n.s && ++e < t.length;) n = n.plus(t[e]);
+	return d = !0, F(n, this.precision, this.rounding);
 }
-function ze(e) {
+function Be(e) {
 	return new this(e).tan();
 }
-function Be(e) {
+function Ve(e) {
 	return new this(e).tanh();
 }
-function Ve(e) {
-	return P(e = new this(e), e.e + 1, 1);
+function He(e) {
+	return F(e = new this(e), e.e + 1, 1);
 }
-s = Q(o), s.prototype.constructor = s, s.default = s.Decimal = s, i = new s(i), a = new s(a);
-var He = s;
+c = $(s), c.prototype.constructor = c, c.default = c.Decimal = c, a = new c(a), o = new c(o);
+var Ue = c;
 //#endregion
-export { s as Decimal, He as default };
+export { c as Decimal, Ue as default };
 /* 独立思考，明辨是非 */