lang-database 1.1.1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
@@ -0,0 +1,2479 @@
1
+ "use strict";
2
+ var __defProp = Object.defineProperty;
3
+ var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
4
+ var __getOwnPropNames = Object.getOwnPropertyNames;
5
+ var __hasOwnProp = Object.prototype.hasOwnProperty;
6
+ var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
7
+ var __export = (target, all) => {
8
+ for (var name in all)
9
+ __defProp(target, name, { get: all[name], enumerable: true });
10
+ };
11
+ var __copyProps = (to, from, except, desc) => {
12
+ if (from && typeof from === "object" || typeof from === "function") {
13
+ for (let key of __getOwnPropNames(from))
14
+ if (!__hasOwnProp.call(to, key) && key !== except)
15
+ __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
16
+ }
17
+ return to;
18
+ };
19
+ var __toCommonJS = (mod2) => __copyProps(__defProp({}, "__esModule", { value: true }), mod2);
20
+
21
+ // src/runtime/index-browser.ts
22
+ var index_browser_exports = {};
23
+ __export(index_browser_exports, {
24
+ Decimal: () => decimal_default,
25
+ makeStrictEnum: () => makeStrictEnum,
26
+ objectEnumValues: () => objectEnumValues
27
+ });
28
+ module.exports = __toCommonJS(index_browser_exports);
29
+
30
+ // src/runtime/object-enums.ts
31
+ var secret = Symbol();
32
+ var representations = /* @__PURE__ */ new WeakMap();
33
+ var ObjectEnumValue = class {
34
+ constructor(arg) {
35
+ if (arg === secret) {
36
+ representations.set(this, `Prisma.${this._getName()}`);
37
+ } else {
38
+ representations.set(this, `new Prisma.${this._getNamespace()}.${this._getName()}()`);
39
+ }
40
+ }
41
+ _getName() {
42
+ return this.constructor.name;
43
+ }
44
+ toString() {
45
+ return representations.get(this);
46
+ }
47
+ };
48
+ __name(ObjectEnumValue, "ObjectEnumValue");
49
+ var NullTypesEnumValue = class extends ObjectEnumValue {
50
+ _getNamespace() {
51
+ return "NullTypes";
52
+ }
53
+ };
54
+ __name(NullTypesEnumValue, "NullTypesEnumValue");
55
+ var DbNull = class extends NullTypesEnumValue {
56
+ };
57
+ __name(DbNull, "DbNull");
58
+ var JsonNull = class extends NullTypesEnumValue {
59
+ };
60
+ __name(JsonNull, "JsonNull");
61
+ var AnyNull = class extends NullTypesEnumValue {
62
+ };
63
+ __name(AnyNull, "AnyNull");
64
+ var objectEnumValues = {
65
+ classes: {
66
+ DbNull,
67
+ JsonNull,
68
+ AnyNull
69
+ },
70
+ instances: {
71
+ DbNull: new DbNull(secret),
72
+ JsonNull: new JsonNull(secret),
73
+ AnyNull: new AnyNull(secret)
74
+ }
75
+ };
76
+
77
+ // src/runtime/strictEnum.ts
78
+ var allowList = /* @__PURE__ */ new Set([
79
+ "toJSON",
80
+ "asymmetricMatch",
81
+ Symbol.iterator,
82
+ Symbol.toStringTag,
83
+ Symbol.isConcatSpreadable,
84
+ Symbol.toPrimitive
85
+ ]);
86
+ function makeStrictEnum(definition) {
87
+ return new Proxy(definition, {
88
+ get(target, property) {
89
+ if (property in target) {
90
+ return target[property];
91
+ }
92
+ if (allowList.has(property)) {
93
+ return void 0;
94
+ }
95
+ throw new TypeError(`Invalid enum value: ${String(property)}`);
96
+ }
97
+ });
98
+ }
99
+ __name(makeStrictEnum, "makeStrictEnum");
100
+
101
+ // ../../node_modules/.pnpm/decimal.js@10.4.0/node_modules/decimal.js/decimal.mjs
102
+ var EXP_LIMIT = 9e15;
103
+ var MAX_DIGITS = 1e9;
104
+ var NUMERALS = "0123456789abcdef";
105
+ var LN10 = "2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058";
106
+ var PI = "3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789";
107
+ var DEFAULTS = {
108
+ precision: 20,
109
+ rounding: 4,
110
+ modulo: 1,
111
+ toExpNeg: -7,
112
+ toExpPos: 21,
113
+ minE: -EXP_LIMIT,
114
+ maxE: EXP_LIMIT,
115
+ crypto: false
116
+ };
117
+ var inexact;
118
+ var quadrant;
119
+ var external = true;
120
+ var decimalError = "[DecimalError] ";
121
+ var invalidArgument = decimalError + "Invalid argument: ";
122
+ var precisionLimitExceeded = decimalError + "Precision limit exceeded";
123
+ var cryptoUnavailable = decimalError + "crypto unavailable";
124
+ var tag = "[object Decimal]";
125
+ var mathfloor = Math.floor;
126
+ var mathpow = Math.pow;
127
+ var isBinary = /^0b([01]+(\.[01]*)?|\.[01]+)(p[+-]?\d+)?$/i;
128
+ var isHex = /^0x([0-9a-f]+(\.[0-9a-f]*)?|\.[0-9a-f]+)(p[+-]?\d+)?$/i;
129
+ var isOctal = /^0o([0-7]+(\.[0-7]*)?|\.[0-7]+)(p[+-]?\d+)?$/i;
130
+ var isDecimal = /^(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i;
131
+ var BASE = 1e7;
132
+ var LOG_BASE = 7;
133
+ var MAX_SAFE_INTEGER = 9007199254740991;
134
+ var LN10_PRECISION = LN10.length - 1;
135
+ var PI_PRECISION = PI.length - 1;
136
+ var P = { toStringTag: tag };
137
+ P.absoluteValue = P.abs = function() {
138
+ var x = new this.constructor(this);
139
+ if (x.s < 0)
140
+ x.s = 1;
141
+ return finalise(x);
142
+ };
143
+ P.ceil = function() {
144
+ return finalise(new this.constructor(this), this.e + 1, 2);
145
+ };
146
+ P.clampedTo = P.clamp = function(min2, max2) {
147
+ var k, x = this, Ctor = x.constructor;
148
+ min2 = new Ctor(min2);
149
+ max2 = new Ctor(max2);
150
+ if (!min2.s || !max2.s)
151
+ return new Ctor(NaN);
152
+ if (min2.gt(max2))
153
+ throw Error(invalidArgument + max2);
154
+ k = x.cmp(min2);
155
+ return k < 0 ? min2 : x.cmp(max2) > 0 ? max2 : new Ctor(x);
156
+ };
157
+ P.comparedTo = P.cmp = function(y) {
158
+ var i, j, xdL, ydL, x = this, xd = x.d, yd = (y = new x.constructor(y)).d, xs = x.s, ys = y.s;
159
+ if (!xd || !yd) {
160
+ return !xs || !ys ? NaN : xs !== ys ? xs : xd === yd ? 0 : !xd ^ xs < 0 ? 1 : -1;
161
+ }
162
+ if (!xd[0] || !yd[0])
163
+ return xd[0] ? xs : yd[0] ? -ys : 0;
164
+ if (xs !== ys)
165
+ return xs;
166
+ if (x.e !== y.e)
167
+ return x.e > y.e ^ xs < 0 ? 1 : -1;
168
+ xdL = xd.length;
169
+ ydL = yd.length;
170
+ for (i = 0, j = xdL < ydL ? xdL : ydL; i < j; ++i) {
171
+ if (xd[i] !== yd[i])
172
+ return xd[i] > yd[i] ^ xs < 0 ? 1 : -1;
173
+ }
174
+ return xdL === ydL ? 0 : xdL > ydL ^ xs < 0 ? 1 : -1;
175
+ };
176
+ P.cosine = P.cos = function() {
177
+ var pr, rm, x = this, Ctor = x.constructor;
178
+ if (!x.d)
179
+ return new Ctor(NaN);
180
+ if (!x.d[0])
181
+ return new Ctor(1);
182
+ pr = Ctor.precision;
183
+ rm = Ctor.rounding;
184
+ Ctor.precision = pr + Math.max(x.e, x.sd()) + LOG_BASE;
185
+ Ctor.rounding = 1;
186
+ x = cosine(Ctor, toLessThanHalfPi(Ctor, x));
187
+ Ctor.precision = pr;
188
+ Ctor.rounding = rm;
189
+ return finalise(quadrant == 2 || quadrant == 3 ? x.neg() : x, pr, rm, true);
190
+ };
191
+ P.cubeRoot = P.cbrt = function() {
192
+ var e, m, n, r, rep, s, sd, t, t3, t3plusx, x = this, Ctor = x.constructor;
193
+ if (!x.isFinite() || x.isZero())
194
+ return new Ctor(x);
195
+ external = false;
196
+ s = x.s * mathpow(x.s * x, 1 / 3);
197
+ if (!s || Math.abs(s) == 1 / 0) {
198
+ n = digitsToString(x.d);
199
+ e = x.e;
200
+ if (s = (e - n.length + 1) % 3)
201
+ n += s == 1 || s == -2 ? "0" : "00";
202
+ s = mathpow(n, 1 / 3);
203
+ e = mathfloor((e + 1) / 3) - (e % 3 == (e < 0 ? -1 : 2));
204
+ if (s == 1 / 0) {
205
+ n = "5e" + e;
206
+ } else {
207
+ n = s.toExponential();
208
+ n = n.slice(0, n.indexOf("e") + 1) + e;
209
+ }
210
+ r = new Ctor(n);
211
+ r.s = x.s;
212
+ } else {
213
+ r = new Ctor(s.toString());
214
+ }
215
+ sd = (e = Ctor.precision) + 3;
216
+ for (; ; ) {
217
+ t = r;
218
+ t3 = t.times(t).times(t);
219
+ t3plusx = t3.plus(x);
220
+ r = divide(t3plusx.plus(x).times(t), t3plusx.plus(t3), sd + 2, 1);
221
+ if (digitsToString(t.d).slice(0, sd) === (n = digitsToString(r.d)).slice(0, sd)) {
222
+ n = n.slice(sd - 3, sd + 1);
223
+ if (n == "9999" || !rep && n == "4999") {
224
+ if (!rep) {
225
+ finalise(t, e + 1, 0);
226
+ if (t.times(t).times(t).eq(x)) {
227
+ r = t;
228
+ break;
229
+ }
230
+ }
231
+ sd += 4;
232
+ rep = 1;
233
+ } else {
234
+ if (!+n || !+n.slice(1) && n.charAt(0) == "5") {
235
+ finalise(r, e + 1, 1);
236
+ m = !r.times(r).times(r).eq(x);
237
+ }
238
+ break;
239
+ }
240
+ }
241
+ }
242
+ external = true;
243
+ return finalise(r, e, Ctor.rounding, m);
244
+ };
245
+ P.decimalPlaces = P.dp = function() {
246
+ var w, d = this.d, n = NaN;
247
+ if (d) {
248
+ w = d.length - 1;
249
+ n = (w - mathfloor(this.e / LOG_BASE)) * LOG_BASE;
250
+ w = d[w];
251
+ if (w)
252
+ for (; w % 10 == 0; w /= 10)
253
+ n--;
254
+ if (n < 0)
255
+ n = 0;
256
+ }
257
+ return n;
258
+ };
259
+ P.dividedBy = P.div = function(y) {
260
+ return divide(this, new this.constructor(y));
261
+ };
262
+ P.dividedToIntegerBy = P.divToInt = function(y) {
263
+ var x = this, Ctor = x.constructor;
264
+ return finalise(divide(x, new Ctor(y), 0, 1, 1), Ctor.precision, Ctor.rounding);
265
+ };
266
+ P.equals = P.eq = function(y) {
267
+ return this.cmp(y) === 0;
268
+ };
269
+ P.floor = function() {
270
+ return finalise(new this.constructor(this), this.e + 1, 3);
271
+ };
272
+ P.greaterThan = P.gt = function(y) {
273
+ return this.cmp(y) > 0;
274
+ };
275
+ P.greaterThanOrEqualTo = P.gte = function(y) {
276
+ var k = this.cmp(y);
277
+ return k == 1 || k === 0;
278
+ };
279
+ P.hyperbolicCosine = P.cosh = function() {
280
+ var k, n, pr, rm, len, x = this, Ctor = x.constructor, one = new Ctor(1);
281
+ if (!x.isFinite())
282
+ return new Ctor(x.s ? 1 / 0 : NaN);
283
+ if (x.isZero())
284
+ return one;
285
+ pr = Ctor.precision;
286
+ rm = Ctor.rounding;
287
+ Ctor.precision = pr + Math.max(x.e, x.sd()) + 4;
288
+ Ctor.rounding = 1;
289
+ len = x.d.length;
290
+ if (len < 32) {
291
+ k = Math.ceil(len / 3);
292
+ n = (1 / tinyPow(4, k)).toString();
293
+ } else {
294
+ k = 16;
295
+ n = "2.3283064365386962890625e-10";
296
+ }
297
+ x = taylorSeries(Ctor, 1, x.times(n), new Ctor(1), true);
298
+ var cosh2_x, i = k, d8 = new Ctor(8);
299
+ for (; i--; ) {
300
+ cosh2_x = x.times(x);
301
+ x = one.minus(cosh2_x.times(d8.minus(cosh2_x.times(d8))));
302
+ }
303
+ return finalise(x, Ctor.precision = pr, Ctor.rounding = rm, true);
304
+ };
305
+ P.hyperbolicSine = P.sinh = function() {
306
+ var k, pr, rm, len, x = this, Ctor = x.constructor;
307
+ if (!x.isFinite() || x.isZero())
308
+ return new Ctor(x);
309
+ pr = Ctor.precision;
310
+ rm = Ctor.rounding;
311
+ Ctor.precision = pr + Math.max(x.e, x.sd()) + 4;
312
+ Ctor.rounding = 1;
313
+ len = x.d.length;
314
+ if (len < 3) {
315
+ x = taylorSeries(Ctor, 2, x, x, true);
316
+ } else {
317
+ k = 1.4 * Math.sqrt(len);
318
+ k = k > 16 ? 16 : k | 0;
319
+ x = x.times(1 / tinyPow(5, k));
320
+ x = taylorSeries(Ctor, 2, x, x, true);
321
+ var sinh2_x, d5 = new Ctor(5), d16 = new Ctor(16), d20 = new Ctor(20);
322
+ for (; k--; ) {
323
+ sinh2_x = x.times(x);
324
+ x = x.times(d5.plus(sinh2_x.times(d16.times(sinh2_x).plus(d20))));
325
+ }
326
+ }
327
+ Ctor.precision = pr;
328
+ Ctor.rounding = rm;
329
+ return finalise(x, pr, rm, true);
330
+ };
331
+ P.hyperbolicTangent = P.tanh = function() {
332
+ var pr, rm, x = this, Ctor = x.constructor;
333
+ if (!x.isFinite())
334
+ return new Ctor(x.s);
335
+ if (x.isZero())
336
+ return new Ctor(x);
337
+ pr = Ctor.precision;
338
+ rm = Ctor.rounding;
339
+ Ctor.precision = pr + 7;
340
+ Ctor.rounding = 1;
341
+ return divide(x.sinh(), x.cosh(), Ctor.precision = pr, Ctor.rounding = rm);
342
+ };
343
+ P.inverseCosine = P.acos = function() {
344
+ var halfPi, x = this, Ctor = x.constructor, k = x.abs().cmp(1), pr = Ctor.precision, rm = Ctor.rounding;
345
+ if (k !== -1) {
346
+ return k === 0 ? x.isNeg() ? getPi(Ctor, pr, rm) : new Ctor(0) : new Ctor(NaN);
347
+ }
348
+ if (x.isZero())
349
+ return getPi(Ctor, pr + 4, rm).times(0.5);
350
+ Ctor.precision = pr + 6;
351
+ Ctor.rounding = 1;
352
+ x = x.asin();
353
+ halfPi = getPi(Ctor, pr + 4, rm).times(0.5);
354
+ Ctor.precision = pr;
355
+ Ctor.rounding = rm;
356
+ return halfPi.minus(x);
357
+ };
358
+ P.inverseHyperbolicCosine = P.acosh = function() {
359
+ var pr, rm, x = this, Ctor = x.constructor;
360
+ if (x.lte(1))
361
+ return new Ctor(x.eq(1) ? 0 : NaN);
362
+ if (!x.isFinite())
363
+ return new Ctor(x);
364
+ pr = Ctor.precision;
365
+ rm = Ctor.rounding;
366
+ Ctor.precision = pr + Math.max(Math.abs(x.e), x.sd()) + 4;
367
+ Ctor.rounding = 1;
368
+ external = false;
369
+ x = x.times(x).minus(1).sqrt().plus(x);
370
+ external = true;
371
+ Ctor.precision = pr;
372
+ Ctor.rounding = rm;
373
+ return x.ln();
374
+ };
375
+ P.inverseHyperbolicSine = P.asinh = function() {
376
+ var pr, rm, x = this, Ctor = x.constructor;
377
+ if (!x.isFinite() || x.isZero())
378
+ return new Ctor(x);
379
+ pr = Ctor.precision;
380
+ rm = Ctor.rounding;
381
+ Ctor.precision = pr + 2 * Math.max(Math.abs(x.e), x.sd()) + 6;
382
+ Ctor.rounding = 1;
383
+ external = false;
384
+ x = x.times(x).plus(1).sqrt().plus(x);
385
+ external = true;
386
+ Ctor.precision = pr;
387
+ Ctor.rounding = rm;
388
+ return x.ln();
389
+ };
390
+ P.inverseHyperbolicTangent = P.atanh = function() {
391
+ var pr, rm, wpr, xsd, x = this, Ctor = x.constructor;
392
+ if (!x.isFinite())
393
+ return new Ctor(NaN);
394
+ if (x.e >= 0)
395
+ return new Ctor(x.abs().eq(1) ? x.s / 0 : x.isZero() ? x : NaN);
396
+ pr = Ctor.precision;
397
+ rm = Ctor.rounding;
398
+ xsd = x.sd();
399
+ if (Math.max(xsd, pr) < 2 * -x.e - 1)
400
+ return finalise(new Ctor(x), pr, rm, true);
401
+ Ctor.precision = wpr = xsd - x.e;
402
+ x = divide(x.plus(1), new Ctor(1).minus(x), wpr + pr, 1);
403
+ Ctor.precision = pr + 4;
404
+ Ctor.rounding = 1;
405
+ x = x.ln();
406
+ Ctor.precision = pr;
407
+ Ctor.rounding = rm;
408
+ return x.times(0.5);
409
+ };
410
+ P.inverseSine = P.asin = function() {
411
+ var halfPi, k, pr, rm, x = this, Ctor = x.constructor;
412
+ if (x.isZero())
413
+ return new Ctor(x);
414
+ k = x.abs().cmp(1);
415
+ pr = Ctor.precision;
416
+ rm = Ctor.rounding;
417
+ if (k !== -1) {
418
+ if (k === 0) {
419
+ halfPi = getPi(Ctor, pr + 4, rm).times(0.5);
420
+ halfPi.s = x.s;
421
+ return halfPi;
422
+ }
423
+ return new Ctor(NaN);
424
+ }
425
+ Ctor.precision = pr + 6;
426
+ Ctor.rounding = 1;
427
+ x = x.div(new Ctor(1).minus(x.times(x)).sqrt().plus(1)).atan();
428
+ Ctor.precision = pr;
429
+ Ctor.rounding = rm;
430
+ return x.times(2);
431
+ };
432
+ P.inverseTangent = P.atan = function() {
433
+ var i, j, k, n, px, t, r, wpr, x2, x = this, Ctor = x.constructor, pr = Ctor.precision, rm = Ctor.rounding;
434
+ if (!x.isFinite()) {
435
+ if (!x.s)
436
+ return new Ctor(NaN);
437
+ if (pr + 4 <= PI_PRECISION) {
438
+ r = getPi(Ctor, pr + 4, rm).times(0.5);
439
+ r.s = x.s;
440
+ return r;
441
+ }
442
+ } else if (x.isZero()) {
443
+ return new Ctor(x);
444
+ } else if (x.abs().eq(1) && pr + 4 <= PI_PRECISION) {
445
+ r = getPi(Ctor, pr + 4, rm).times(0.25);
446
+ r.s = x.s;
447
+ return r;
448
+ }
449
+ Ctor.precision = wpr = pr + 10;
450
+ Ctor.rounding = 1;
451
+ k = Math.min(28, wpr / LOG_BASE + 2 | 0);
452
+ for (i = k; i; --i)
453
+ x = x.div(x.times(x).plus(1).sqrt().plus(1));
454
+ external = false;
455
+ j = Math.ceil(wpr / LOG_BASE);
456
+ n = 1;
457
+ x2 = x.times(x);
458
+ r = new Ctor(x);
459
+ px = x;
460
+ for (; i !== -1; ) {
461
+ px = px.times(x2);
462
+ t = r.minus(px.div(n += 2));
463
+ px = px.times(x2);
464
+ r = t.plus(px.div(n += 2));
465
+ if (r.d[j] !== void 0)
466
+ for (i = j; r.d[i] === t.d[i] && i--; )
467
+ ;
468
+ }
469
+ if (k)
470
+ r = r.times(2 << k - 1);
471
+ external = true;
472
+ return finalise(r, Ctor.precision = pr, Ctor.rounding = rm, true);
473
+ };
474
+ P.isFinite = function() {
475
+ return !!this.d;
476
+ };
477
+ P.isInteger = P.isInt = function() {
478
+ return !!this.d && mathfloor(this.e / LOG_BASE) > this.d.length - 2;
479
+ };
480
+ P.isNaN = function() {
481
+ return !this.s;
482
+ };
483
+ P.isNegative = P.isNeg = function() {
484
+ return this.s < 0;
485
+ };
486
+ P.isPositive = P.isPos = function() {
487
+ return this.s > 0;
488
+ };
489
+ P.isZero = function() {
490
+ return !!this.d && this.d[0] === 0;
491
+ };
492
+ P.lessThan = P.lt = function(y) {
493
+ return this.cmp(y) < 0;
494
+ };
495
+ P.lessThanOrEqualTo = P.lte = function(y) {
496
+ return this.cmp(y) < 1;
497
+ };
498
+ P.logarithm = P.log = function(base) {
499
+ var isBase10, d, denominator, k, inf, num, sd, r, arg = this, Ctor = arg.constructor, pr = Ctor.precision, rm = Ctor.rounding, guard = 5;
500
+ if (base == null) {
501
+ base = new Ctor(10);
502
+ isBase10 = true;
503
+ } else {
504
+ base = new Ctor(base);
505
+ d = base.d;
506
+ if (base.s < 0 || !d || !d[0] || base.eq(1))
507
+ return new Ctor(NaN);
508
+ isBase10 = base.eq(10);
509
+ }
510
+ d = arg.d;
511
+ if (arg.s < 0 || !d || !d[0] || arg.eq(1)) {
512
+ return new Ctor(d && !d[0] ? -1 / 0 : arg.s != 1 ? NaN : d ? 0 : 1 / 0);
513
+ }
514
+ if (isBase10) {
515
+ if (d.length > 1) {
516
+ inf = true;
517
+ } else {
518
+ for (k = d[0]; k % 10 === 0; )
519
+ k /= 10;
520
+ inf = k !== 1;
521
+ }
522
+ }
523
+ external = false;
524
+ sd = pr + guard;
525
+ num = naturalLogarithm(arg, sd);
526
+ denominator = isBase10 ? getLn10(Ctor, sd + 10) : naturalLogarithm(base, sd);
527
+ r = divide(num, denominator, sd, 1);
528
+ if (checkRoundingDigits(r.d, k = pr, rm)) {
529
+ do {
530
+ sd += 10;
531
+ num = naturalLogarithm(arg, sd);
532
+ denominator = isBase10 ? getLn10(Ctor, sd + 10) : naturalLogarithm(base, sd);
533
+ r = divide(num, denominator, sd, 1);
534
+ if (!inf) {
535
+ if (+digitsToString(r.d).slice(k + 1, k + 15) + 1 == 1e14) {
536
+ r = finalise(r, pr + 1, 0);
537
+ }
538
+ break;
539
+ }
540
+ } while (checkRoundingDigits(r.d, k += 10, rm));
541
+ }
542
+ external = true;
543
+ return finalise(r, pr, rm);
544
+ };
545
+ P.minus = P.sub = function(y) {
546
+ var d, e, i, j, k, len, pr, rm, xd, xe, xLTy, yd, x = this, Ctor = x.constructor;
547
+ y = new Ctor(y);
548
+ if (!x.d || !y.d) {
549
+ if (!x.s || !y.s)
550
+ y = new Ctor(NaN);
551
+ else if (x.d)
552
+ y.s = -y.s;
553
+ else
554
+ y = new Ctor(y.d || x.s !== y.s ? x : NaN);
555
+ return y;
556
+ }
557
+ if (x.s != y.s) {
558
+ y.s = -y.s;
559
+ return x.plus(y);
560
+ }
561
+ xd = x.d;
562
+ yd = y.d;
563
+ pr = Ctor.precision;
564
+ rm = Ctor.rounding;
565
+ if (!xd[0] || !yd[0]) {
566
+ if (yd[0])
567
+ y.s = -y.s;
568
+ else if (xd[0])
569
+ y = new Ctor(x);
570
+ else
571
+ return new Ctor(rm === 3 ? -0 : 0);
572
+ return external ? finalise(y, pr, rm) : y;
573
+ }
574
+ e = mathfloor(y.e / LOG_BASE);
575
+ xe = mathfloor(x.e / LOG_BASE);
576
+ xd = xd.slice();
577
+ k = xe - e;
578
+ if (k) {
579
+ xLTy = k < 0;
580
+ if (xLTy) {
581
+ d = xd;
582
+ k = -k;
583
+ len = yd.length;
584
+ } else {
585
+ d = yd;
586
+ e = xe;
587
+ len = xd.length;
588
+ }
589
+ i = Math.max(Math.ceil(pr / LOG_BASE), len) + 2;
590
+ if (k > i) {
591
+ k = i;
592
+ d.length = 1;
593
+ }
594
+ d.reverse();
595
+ for (i = k; i--; )
596
+ d.push(0);
597
+ d.reverse();
598
+ } else {
599
+ i = xd.length;
600
+ len = yd.length;
601
+ xLTy = i < len;
602
+ if (xLTy)
603
+ len = i;
604
+ for (i = 0; i < len; i++) {
605
+ if (xd[i] != yd[i]) {
606
+ xLTy = xd[i] < yd[i];
607
+ break;
608
+ }
609
+ }
610
+ k = 0;
611
+ }
612
+ if (xLTy) {
613
+ d = xd;
614
+ xd = yd;
615
+ yd = d;
616
+ y.s = -y.s;
617
+ }
618
+ len = xd.length;
619
+ for (i = yd.length - len; i > 0; --i)
620
+ xd[len++] = 0;
621
+ for (i = yd.length; i > k; ) {
622
+ if (xd[--i] < yd[i]) {
623
+ for (j = i; j && xd[--j] === 0; )
624
+ xd[j] = BASE - 1;
625
+ --xd[j];
626
+ xd[i] += BASE;
627
+ }
628
+ xd[i] -= yd[i];
629
+ }
630
+ for (; xd[--len] === 0; )
631
+ xd.pop();
632
+ for (; xd[0] === 0; xd.shift())
633
+ --e;
634
+ if (!xd[0])
635
+ return new Ctor(rm === 3 ? -0 : 0);
636
+ y.d = xd;
637
+ y.e = getBase10Exponent(xd, e);
638
+ return external ? finalise(y, pr, rm) : y;
639
+ };
640
+ P.modulo = P.mod = function(y) {
641
+ var q, x = this, Ctor = x.constructor;
642
+ y = new Ctor(y);
643
+ if (!x.d || !y.s || y.d && !y.d[0])
644
+ return new Ctor(NaN);
645
+ if (!y.d || x.d && !x.d[0]) {
646
+ return finalise(new Ctor(x), Ctor.precision, Ctor.rounding);
647
+ }
648
+ external = false;
649
+ if (Ctor.modulo == 9) {
650
+ q = divide(x, y.abs(), 0, 3, 1);
651
+ q.s *= y.s;
652
+ } else {
653
+ q = divide(x, y, 0, Ctor.modulo, 1);
654
+ }
655
+ q = q.times(y);
656
+ external = true;
657
+ return x.minus(q);
658
+ };
659
+ P.naturalExponential = P.exp = function() {
660
+ return naturalExponential(this);
661
+ };
662
+ P.naturalLogarithm = P.ln = function() {
663
+ return naturalLogarithm(this);
664
+ };
665
+ P.negated = P.neg = function() {
666
+ var x = new this.constructor(this);
667
+ x.s = -x.s;
668
+ return finalise(x);
669
+ };
670
+ P.plus = P.add = function(y) {
671
+ var carry, d, e, i, k, len, pr, rm, xd, yd, x = this, Ctor = x.constructor;
672
+ y = new Ctor(y);
673
+ if (!x.d || !y.d) {
674
+ if (!x.s || !y.s)
675
+ y = new Ctor(NaN);
676
+ else if (!x.d)
677
+ y = new Ctor(y.d || x.s === y.s ? x : NaN);
678
+ return y;
679
+ }
680
+ if (x.s != y.s) {
681
+ y.s = -y.s;
682
+ return x.minus(y);
683
+ }
684
+ xd = x.d;
685
+ yd = y.d;
686
+ pr = Ctor.precision;
687
+ rm = Ctor.rounding;
688
+ if (!xd[0] || !yd[0]) {
689
+ if (!yd[0])
690
+ y = new Ctor(x);
691
+ return external ? finalise(y, pr, rm) : y;
692
+ }
693
+ k = mathfloor(x.e / LOG_BASE);
694
+ e = mathfloor(y.e / LOG_BASE);
695
+ xd = xd.slice();
696
+ i = k - e;
697
+ if (i) {
698
+ if (i < 0) {
699
+ d = xd;
700
+ i = -i;
701
+ len = yd.length;
702
+ } else {
703
+ d = yd;
704
+ e = k;
705
+ len = xd.length;
706
+ }
707
+ k = Math.ceil(pr / LOG_BASE);
708
+ len = k > len ? k + 1 : len + 1;
709
+ if (i > len) {
710
+ i = len;
711
+ d.length = 1;
712
+ }
713
+ d.reverse();
714
+ for (; i--; )
715
+ d.push(0);
716
+ d.reverse();
717
+ }
718
+ len = xd.length;
719
+ i = yd.length;
720
+ if (len - i < 0) {
721
+ i = len;
722
+ d = yd;
723
+ yd = xd;
724
+ xd = d;
725
+ }
726
+ for (carry = 0; i; ) {
727
+ carry = (xd[--i] = xd[i] + yd[i] + carry) / BASE | 0;
728
+ xd[i] %= BASE;
729
+ }
730
+ if (carry) {
731
+ xd.unshift(carry);
732
+ ++e;
733
+ }
734
+ for (len = xd.length; xd[--len] == 0; )
735
+ xd.pop();
736
+ y.d = xd;
737
+ y.e = getBase10Exponent(xd, e);
738
+ return external ? finalise(y, pr, rm) : y;
739
+ };
740
+ P.precision = P.sd = function(z) {
741
+ var k, x = this;
742
+ if (z !== void 0 && z !== !!z && z !== 1 && z !== 0)
743
+ throw Error(invalidArgument + z);
744
+ if (x.d) {
745
+ k = getPrecision(x.d);
746
+ if (z && x.e + 1 > k)
747
+ k = x.e + 1;
748
+ } else {
749
+ k = NaN;
750
+ }
751
+ return k;
752
+ };
753
+ P.round = function() {
754
+ var x = this, Ctor = x.constructor;
755
+ return finalise(new Ctor(x), x.e + 1, Ctor.rounding);
756
+ };
757
+ P.sine = P.sin = function() {
758
+ var pr, rm, x = this, Ctor = x.constructor;
759
+ if (!x.isFinite())
760
+ return new Ctor(NaN);
761
+ if (x.isZero())
762
+ return new Ctor(x);
763
+ pr = Ctor.precision;
764
+ rm = Ctor.rounding;
765
+ Ctor.precision = pr + Math.max(x.e, x.sd()) + LOG_BASE;
766
+ Ctor.rounding = 1;
767
+ x = sine(Ctor, toLessThanHalfPi(Ctor, x));
768
+ Ctor.precision = pr;
769
+ Ctor.rounding = rm;
770
+ return finalise(quadrant > 2 ? x.neg() : x, pr, rm, true);
771
+ };
772
+ P.squareRoot = P.sqrt = function() {
773
+ var m, n, sd, r, rep, t, x = this, d = x.d, e = x.e, s = x.s, Ctor = x.constructor;
774
+ if (s !== 1 || !d || !d[0]) {
775
+ return new Ctor(!s || s < 0 && (!d || d[0]) ? NaN : d ? x : 1 / 0);
776
+ }
777
+ external = false;
778
+ s = Math.sqrt(+x);
779
+ if (s == 0 || s == 1 / 0) {
780
+ n = digitsToString(d);
781
+ if ((n.length + e) % 2 == 0)
782
+ n += "0";
783
+ s = Math.sqrt(n);
784
+ e = mathfloor((e + 1) / 2) - (e < 0 || e % 2);
785
+ if (s == 1 / 0) {
786
+ n = "5e" + e;
787
+ } else {
788
+ n = s.toExponential();
789
+ n = n.slice(0, n.indexOf("e") + 1) + e;
790
+ }
791
+ r = new Ctor(n);
792
+ } else {
793
+ r = new Ctor(s.toString());
794
+ }
795
+ sd = (e = Ctor.precision) + 3;
796
+ for (; ; ) {
797
+ t = r;
798
+ r = t.plus(divide(x, t, sd + 2, 1)).times(0.5);
799
+ if (digitsToString(t.d).slice(0, sd) === (n = digitsToString(r.d)).slice(0, sd)) {
800
+ n = n.slice(sd - 3, sd + 1);
801
+ if (n == "9999" || !rep && n == "4999") {
802
+ if (!rep) {
803
+ finalise(t, e + 1, 0);
804
+ if (t.times(t).eq(x)) {
805
+ r = t;
806
+ break;
807
+ }
808
+ }
809
+ sd += 4;
810
+ rep = 1;
811
+ } else {
812
+ if (!+n || !+n.slice(1) && n.charAt(0) == "5") {
813
+ finalise(r, e + 1, 1);
814
+ m = !r.times(r).eq(x);
815
+ }
816
+ break;
817
+ }
818
+ }
819
+ }
820
+ external = true;
821
+ return finalise(r, e, Ctor.rounding, m);
822
+ };
823
+ P.tangent = P.tan = function() {
824
+ var pr, rm, x = this, Ctor = x.constructor;
825
+ if (!x.isFinite())
826
+ return new Ctor(NaN);
827
+ if (x.isZero())
828
+ return new Ctor(x);
829
+ pr = Ctor.precision;
830
+ rm = Ctor.rounding;
831
+ Ctor.precision = pr + 10;
832
+ Ctor.rounding = 1;
833
+ x = x.sin();
834
+ x.s = 1;
835
+ x = divide(x, new Ctor(1).minus(x.times(x)).sqrt(), pr + 10, 0);
836
+ Ctor.precision = pr;
837
+ Ctor.rounding = rm;
838
+ return finalise(quadrant == 2 || quadrant == 4 ? x.neg() : x, pr, rm, true);
839
+ };
840
+ P.times = P.mul = function(y) {
841
+ var carry, e, i, k, r, rL, t, xdL, ydL, x = this, Ctor = x.constructor, xd = x.d, yd = (y = new Ctor(y)).d;
842
+ y.s *= x.s;
843
+ if (!xd || !xd[0] || !yd || !yd[0]) {
844
+ return new Ctor(!y.s || xd && !xd[0] && !yd || yd && !yd[0] && !xd ? NaN : !xd || !yd ? y.s / 0 : y.s * 0);
845
+ }
846
+ e = mathfloor(x.e / LOG_BASE) + mathfloor(y.e / LOG_BASE);
847
+ xdL = xd.length;
848
+ ydL = yd.length;
849
+ if (xdL < ydL) {
850
+ r = xd;
851
+ xd = yd;
852
+ yd = r;
853
+ rL = xdL;
854
+ xdL = ydL;
855
+ ydL = rL;
856
+ }
857
+ r = [];
858
+ rL = xdL + ydL;
859
+ for (i = rL; i--; )
860
+ r.push(0);
861
+ for (i = ydL; --i >= 0; ) {
862
+ carry = 0;
863
+ for (k = xdL + i; k > i; ) {
864
+ t = r[k] + yd[i] * xd[k - i - 1] + carry;
865
+ r[k--] = t % BASE | 0;
866
+ carry = t / BASE | 0;
867
+ }
868
+ r[k] = (r[k] + carry) % BASE | 0;
869
+ }
870
+ for (; !r[--rL]; )
871
+ r.pop();
872
+ if (carry)
873
+ ++e;
874
+ else
875
+ r.shift();
876
+ y.d = r;
877
+ y.e = getBase10Exponent(r, e);
878
+ return external ? finalise(y, Ctor.precision, Ctor.rounding) : y;
879
+ };
880
+ P.toBinary = function(sd, rm) {
881
+ return toStringBinary(this, 2, sd, rm);
882
+ };
883
+ P.toDecimalPlaces = P.toDP = function(dp, rm) {
884
+ var x = this, Ctor = x.constructor;
885
+ x = new Ctor(x);
886
+ if (dp === void 0)
887
+ return x;
888
+ checkInt32(dp, 0, MAX_DIGITS);
889
+ if (rm === void 0)
890
+ rm = Ctor.rounding;
891
+ else
892
+ checkInt32(rm, 0, 8);
893
+ return finalise(x, dp + x.e + 1, rm);
894
+ };
895
+ P.toExponential = function(dp, rm) {
896
+ var str, x = this, Ctor = x.constructor;
897
+ if (dp === void 0) {
898
+ str = finiteToString(x, true);
899
+ } else {
900
+ checkInt32(dp, 0, MAX_DIGITS);
901
+ if (rm === void 0)
902
+ rm = Ctor.rounding;
903
+ else
904
+ checkInt32(rm, 0, 8);
905
+ x = finalise(new Ctor(x), dp + 1, rm);
906
+ str = finiteToString(x, true, dp + 1);
907
+ }
908
+ return x.isNeg() && !x.isZero() ? "-" + str : str;
909
+ };
910
+ P.toFixed = function(dp, rm) {
911
+ var str, y, x = this, Ctor = x.constructor;
912
+ if (dp === void 0) {
913
+ str = finiteToString(x);
914
+ } else {
915
+ checkInt32(dp, 0, MAX_DIGITS);
916
+ if (rm === void 0)
917
+ rm = Ctor.rounding;
918
+ else
919
+ checkInt32(rm, 0, 8);
920
+ y = finalise(new Ctor(x), dp + x.e + 1, rm);
921
+ str = finiteToString(y, false, dp + y.e + 1);
922
+ }
923
+ return x.isNeg() && !x.isZero() ? "-" + str : str;
924
+ };
925
+ P.toFraction = function(maxD) {
926
+ var d, d0, d1, d2, e, k, n, n0, n1, pr, q, r, x = this, xd = x.d, Ctor = x.constructor;
927
+ if (!xd)
928
+ return new Ctor(x);
929
+ n1 = d0 = new Ctor(1);
930
+ d1 = n0 = new Ctor(0);
931
+ d = new Ctor(d1);
932
+ e = d.e = getPrecision(xd) - x.e - 1;
933
+ k = e % LOG_BASE;
934
+ d.d[0] = mathpow(10, k < 0 ? LOG_BASE + k : k);
935
+ if (maxD == null) {
936
+ maxD = e > 0 ? d : n1;
937
+ } else {
938
+ n = new Ctor(maxD);
939
+ if (!n.isInt() || n.lt(n1))
940
+ throw Error(invalidArgument + n);
941
+ maxD = n.gt(d) ? e > 0 ? d : n1 : n;
942
+ }
943
+ external = false;
944
+ n = new Ctor(digitsToString(xd));
945
+ pr = Ctor.precision;
946
+ Ctor.precision = e = xd.length * LOG_BASE * 2;
947
+ for (; ; ) {
948
+ q = divide(n, d, 0, 1, 1);
949
+ d2 = d0.plus(q.times(d1));
950
+ if (d2.cmp(maxD) == 1)
951
+ break;
952
+ d0 = d1;
953
+ d1 = d2;
954
+ d2 = n1;
955
+ n1 = n0.plus(q.times(d2));
956
+ n0 = d2;
957
+ d2 = d;
958
+ d = n.minus(q.times(d2));
959
+ n = d2;
960
+ }
961
+ d2 = divide(maxD.minus(d0), d1, 0, 1, 1);
962
+ n0 = n0.plus(d2.times(n1));
963
+ d0 = d0.plus(d2.times(d1));
964
+ n0.s = n1.s = x.s;
965
+ r = divide(n1, d1, e, 1).minus(x).abs().cmp(divide(n0, d0, e, 1).minus(x).abs()) < 1 ? [n1, d1] : [n0, d0];
966
+ Ctor.precision = pr;
967
+ external = true;
968
+ return r;
969
+ };
970
+ P.toHexadecimal = P.toHex = function(sd, rm) {
971
+ return toStringBinary(this, 16, sd, rm);
972
+ };
973
+ P.toNearest = function(y, rm) {
974
+ var x = this, Ctor = x.constructor;
975
+ x = new Ctor(x);
976
+ if (y == null) {
977
+ if (!x.d)
978
+ return x;
979
+ y = new Ctor(1);
980
+ rm = Ctor.rounding;
981
+ } else {
982
+ y = new Ctor(y);
983
+ if (rm === void 0) {
984
+ rm = Ctor.rounding;
985
+ } else {
986
+ checkInt32(rm, 0, 8);
987
+ }
988
+ if (!x.d)
989
+ return y.s ? x : y;
990
+ if (!y.d) {
991
+ if (y.s)
992
+ y.s = x.s;
993
+ return y;
994
+ }
995
+ }
996
+ if (y.d[0]) {
997
+ external = false;
998
+ x = divide(x, y, 0, rm, 1).times(y);
999
+ external = true;
1000
+ finalise(x);
1001
+ } else {
1002
+ y.s = x.s;
1003
+ x = y;
1004
+ }
1005
+ return x;
1006
+ };
1007
+ P.toNumber = function() {
1008
+ return +this;
1009
+ };
1010
+ P.toOctal = function(sd, rm) {
1011
+ return toStringBinary(this, 8, sd, rm);
1012
+ };
1013
+ P.toPower = P.pow = function(y) {
1014
+ var e, k, pr, r, rm, s, x = this, Ctor = x.constructor, yn = +(y = new Ctor(y));
1015
+ if (!x.d || !y.d || !x.d[0] || !y.d[0])
1016
+ return new Ctor(mathpow(+x, yn));
1017
+ x = new Ctor(x);
1018
+ if (x.eq(1))
1019
+ return x;
1020
+ pr = Ctor.precision;
1021
+ rm = Ctor.rounding;
1022
+ if (y.eq(1))
1023
+ return finalise(x, pr, rm);
1024
+ e = mathfloor(y.e / LOG_BASE);
1025
+ if (e >= y.d.length - 1 && (k = yn < 0 ? -yn : yn) <= MAX_SAFE_INTEGER) {
1026
+ r = intPow(Ctor, x, k, pr);
1027
+ return y.s < 0 ? new Ctor(1).div(r) : finalise(r, pr, rm);
1028
+ }
1029
+ s = x.s;
1030
+ if (s < 0) {
1031
+ if (e < y.d.length - 1)
1032
+ return new Ctor(NaN);
1033
+ if ((y.d[e] & 1) == 0)
1034
+ s = 1;
1035
+ if (x.e == 0 && x.d[0] == 1 && x.d.length == 1) {
1036
+ x.s = s;
1037
+ return x;
1038
+ }
1039
+ }
1040
+ k = mathpow(+x, yn);
1041
+ e = k == 0 || !isFinite(k) ? mathfloor(yn * (Math.log("0." + digitsToString(x.d)) / Math.LN10 + x.e + 1)) : new Ctor(k + "").e;
1042
+ if (e > Ctor.maxE + 1 || e < Ctor.minE - 1)
1043
+ return new Ctor(e > 0 ? s / 0 : 0);
1044
+ external = false;
1045
+ Ctor.rounding = x.s = 1;
1046
+ k = Math.min(12, (e + "").length);
1047
+ r = naturalExponential(y.times(naturalLogarithm(x, pr + k)), pr);
1048
+ if (r.d) {
1049
+ r = finalise(r, pr + 5, 1);
1050
+ if (checkRoundingDigits(r.d, pr, rm)) {
1051
+ e = pr + 10;
1052
+ r = finalise(naturalExponential(y.times(naturalLogarithm(x, e + k)), e), e + 5, 1);
1053
+ if (+digitsToString(r.d).slice(pr + 1, pr + 15) + 1 == 1e14) {
1054
+ r = finalise(r, pr + 1, 0);
1055
+ }
1056
+ }
1057
+ }
1058
+ r.s = s;
1059
+ external = true;
1060
+ Ctor.rounding = rm;
1061
+ return finalise(r, pr, rm);
1062
+ };
1063
+ P.toPrecision = function(sd, rm) {
1064
+ var str, x = this, Ctor = x.constructor;
1065
+ if (sd === void 0) {
1066
+ str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);
1067
+ } else {
1068
+ checkInt32(sd, 1, MAX_DIGITS);
1069
+ if (rm === void 0)
1070
+ rm = Ctor.rounding;
1071
+ else
1072
+ checkInt32(rm, 0, 8);
1073
+ x = finalise(new Ctor(x), sd, rm);
1074
+ str = finiteToString(x, sd <= x.e || x.e <= Ctor.toExpNeg, sd);
1075
+ }
1076
+ return x.isNeg() && !x.isZero() ? "-" + str : str;
1077
+ };
1078
+ P.toSignificantDigits = P.toSD = function(sd, rm) {
1079
+ var x = this, Ctor = x.constructor;
1080
+ if (sd === void 0) {
1081
+ sd = Ctor.precision;
1082
+ rm = Ctor.rounding;
1083
+ } else {
1084
+ checkInt32(sd, 1, MAX_DIGITS);
1085
+ if (rm === void 0)
1086
+ rm = Ctor.rounding;
1087
+ else
1088
+ checkInt32(rm, 0, 8);
1089
+ }
1090
+ return finalise(new Ctor(x), sd, rm);
1091
+ };
1092
+ P.toString = function() {
1093
+ var x = this, Ctor = x.constructor, str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);
1094
+ return x.isNeg() && !x.isZero() ? "-" + str : str;
1095
+ };
1096
+ P.truncated = P.trunc = function() {
1097
+ return finalise(new this.constructor(this), this.e + 1, 1);
1098
+ };
1099
+ P.valueOf = P.toJSON = function() {
1100
+ var x = this, Ctor = x.constructor, str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);
1101
+ return x.isNeg() ? "-" + str : str;
1102
+ };
1103
+ function digitsToString(d) {
1104
+ var i, k, ws, indexOfLastWord = d.length - 1, str = "", w = d[0];
1105
+ if (indexOfLastWord > 0) {
1106
+ str += w;
1107
+ for (i = 1; i < indexOfLastWord; i++) {
1108
+ ws = d[i] + "";
1109
+ k = LOG_BASE - ws.length;
1110
+ if (k)
1111
+ str += getZeroString(k);
1112
+ str += ws;
1113
+ }
1114
+ w = d[i];
1115
+ ws = w + "";
1116
+ k = LOG_BASE - ws.length;
1117
+ if (k)
1118
+ str += getZeroString(k);
1119
+ } else if (w === 0) {
1120
+ return "0";
1121
+ }
1122
+ for (; w % 10 === 0; )
1123
+ w /= 10;
1124
+ return str + w;
1125
+ }
1126
+ __name(digitsToString, "digitsToString");
1127
+ function checkInt32(i, min2, max2) {
1128
+ if (i !== ~~i || i < min2 || i > max2) {
1129
+ throw Error(invalidArgument + i);
1130
+ }
1131
+ }
1132
+ __name(checkInt32, "checkInt32");
1133
+ function checkRoundingDigits(d, i, rm, repeating) {
1134
+ var di, k, r, rd;
1135
+ for (k = d[0]; k >= 10; k /= 10)
1136
+ --i;
1137
+ if (--i < 0) {
1138
+ i += LOG_BASE;
1139
+ di = 0;
1140
+ } else {
1141
+ di = Math.ceil((i + 1) / LOG_BASE);
1142
+ i %= LOG_BASE;
1143
+ }
1144
+ k = mathpow(10, LOG_BASE - i);
1145
+ rd = d[di] % k | 0;
1146
+ if (repeating == null) {
1147
+ if (i < 3) {
1148
+ if (i == 0)
1149
+ rd = rd / 100 | 0;
1150
+ else if (i == 1)
1151
+ rd = rd / 10 | 0;
1152
+ r = rm < 4 && rd == 99999 || rm > 3 && rd == 49999 || rd == 5e4 || rd == 0;
1153
+ } else {
1154
+ r = (rm < 4 && rd + 1 == k || rm > 3 && rd + 1 == k / 2) && (d[di + 1] / k / 100 | 0) == mathpow(10, i - 2) - 1 || (rd == k / 2 || rd == 0) && (d[di + 1] / k / 100 | 0) == 0;
1155
+ }
1156
+ } else {
1157
+ if (i < 4) {
1158
+ if (i == 0)
1159
+ rd = rd / 1e3 | 0;
1160
+ else if (i == 1)
1161
+ rd = rd / 100 | 0;
1162
+ else if (i == 2)
1163
+ rd = rd / 10 | 0;
1164
+ r = (repeating || rm < 4) && rd == 9999 || !repeating && rm > 3 && rd == 4999;
1165
+ } else {
1166
+ r = ((repeating || rm < 4) && rd + 1 == k || !repeating && rm > 3 && rd + 1 == k / 2) && (d[di + 1] / k / 1e3 | 0) == mathpow(10, i - 3) - 1;
1167
+ }
1168
+ }
1169
+ return r;
1170
+ }
1171
+ __name(checkRoundingDigits, "checkRoundingDigits");
1172
+ function convertBase(str, baseIn, baseOut) {
1173
+ var j, arr = [0], arrL, i = 0, strL = str.length;
1174
+ for (; i < strL; ) {
1175
+ for (arrL = arr.length; arrL--; )
1176
+ arr[arrL] *= baseIn;
1177
+ arr[0] += NUMERALS.indexOf(str.charAt(i++));
1178
+ for (j = 0; j < arr.length; j++) {
1179
+ if (arr[j] > baseOut - 1) {
1180
+ if (arr[j + 1] === void 0)
1181
+ arr[j + 1] = 0;
1182
+ arr[j + 1] += arr[j] / baseOut | 0;
1183
+ arr[j] %= baseOut;
1184
+ }
1185
+ }
1186
+ }
1187
+ return arr.reverse();
1188
+ }
1189
+ __name(convertBase, "convertBase");
1190
+ function cosine(Ctor, x) {
1191
+ var k, len, y;
1192
+ if (x.isZero())
1193
+ return x;
1194
+ len = x.d.length;
1195
+ if (len < 32) {
1196
+ k = Math.ceil(len / 3);
1197
+ y = (1 / tinyPow(4, k)).toString();
1198
+ } else {
1199
+ k = 16;
1200
+ y = "2.3283064365386962890625e-10";
1201
+ }
1202
+ Ctor.precision += k;
1203
+ x = taylorSeries(Ctor, 1, x.times(y), new Ctor(1));
1204
+ for (var i = k; i--; ) {
1205
+ var cos2x = x.times(x);
1206
+ x = cos2x.times(cos2x).minus(cos2x).times(8).plus(1);
1207
+ }
1208
+ Ctor.precision -= k;
1209
+ return x;
1210
+ }
1211
+ __name(cosine, "cosine");
1212
+ var divide = function() {
1213
+ function multiplyInteger(x, k, base) {
1214
+ var temp, carry = 0, i = x.length;
1215
+ for (x = x.slice(); i--; ) {
1216
+ temp = x[i] * k + carry;
1217
+ x[i] = temp % base | 0;
1218
+ carry = temp / base | 0;
1219
+ }
1220
+ if (carry)
1221
+ x.unshift(carry);
1222
+ return x;
1223
+ }
1224
+ __name(multiplyInteger, "multiplyInteger");
1225
+ function compare(a, b, aL, bL) {
1226
+ var i, r;
1227
+ if (aL != bL) {
1228
+ r = aL > bL ? 1 : -1;
1229
+ } else {
1230
+ for (i = r = 0; i < aL; i++) {
1231
+ if (a[i] != b[i]) {
1232
+ r = a[i] > b[i] ? 1 : -1;
1233
+ break;
1234
+ }
1235
+ }
1236
+ }
1237
+ return r;
1238
+ }
1239
+ __name(compare, "compare");
1240
+ function subtract(a, b, aL, base) {
1241
+ var i = 0;
1242
+ for (; aL--; ) {
1243
+ a[aL] -= i;
1244
+ i = a[aL] < b[aL] ? 1 : 0;
1245
+ a[aL] = i * base + a[aL] - b[aL];
1246
+ }
1247
+ for (; !a[0] && a.length > 1; )
1248
+ a.shift();
1249
+ }
1250
+ __name(subtract, "subtract");
1251
+ return function(x, y, pr, rm, dp, base) {
1252
+ var cmp, e, i, k, logBase, more, prod, prodL, q, qd, rem, remL, rem0, sd, t, xi, xL, yd0, yL, yz, Ctor = x.constructor, sign2 = x.s == y.s ? 1 : -1, xd = x.d, yd = y.d;
1253
+ if (!xd || !xd[0] || !yd || !yd[0]) {
1254
+ return new Ctor(
1255
+ !x.s || !y.s || (xd ? yd && xd[0] == yd[0] : !yd) ? NaN : xd && xd[0] == 0 || !yd ? sign2 * 0 : sign2 / 0
1256
+ );
1257
+ }
1258
+ if (base) {
1259
+ logBase = 1;
1260
+ e = x.e - y.e;
1261
+ } else {
1262
+ base = BASE;
1263
+ logBase = LOG_BASE;
1264
+ e = mathfloor(x.e / logBase) - mathfloor(y.e / logBase);
1265
+ }
1266
+ yL = yd.length;
1267
+ xL = xd.length;
1268
+ q = new Ctor(sign2);
1269
+ qd = q.d = [];
1270
+ for (i = 0; yd[i] == (xd[i] || 0); i++)
1271
+ ;
1272
+ if (yd[i] > (xd[i] || 0))
1273
+ e--;
1274
+ if (pr == null) {
1275
+ sd = pr = Ctor.precision;
1276
+ rm = Ctor.rounding;
1277
+ } else if (dp) {
1278
+ sd = pr + (x.e - y.e) + 1;
1279
+ } else {
1280
+ sd = pr;
1281
+ }
1282
+ if (sd < 0) {
1283
+ qd.push(1);
1284
+ more = true;
1285
+ } else {
1286
+ sd = sd / logBase + 2 | 0;
1287
+ i = 0;
1288
+ if (yL == 1) {
1289
+ k = 0;
1290
+ yd = yd[0];
1291
+ sd++;
1292
+ for (; (i < xL || k) && sd--; i++) {
1293
+ t = k * base + (xd[i] || 0);
1294
+ qd[i] = t / yd | 0;
1295
+ k = t % yd | 0;
1296
+ }
1297
+ more = k || i < xL;
1298
+ } else {
1299
+ k = base / (yd[0] + 1) | 0;
1300
+ if (k > 1) {
1301
+ yd = multiplyInteger(yd, k, base);
1302
+ xd = multiplyInteger(xd, k, base);
1303
+ yL = yd.length;
1304
+ xL = xd.length;
1305
+ }
1306
+ xi = yL;
1307
+ rem = xd.slice(0, yL);
1308
+ remL = rem.length;
1309
+ for (; remL < yL; )
1310
+ rem[remL++] = 0;
1311
+ yz = yd.slice();
1312
+ yz.unshift(0);
1313
+ yd0 = yd[0];
1314
+ if (yd[1] >= base / 2)
1315
+ ++yd0;
1316
+ do {
1317
+ k = 0;
1318
+ cmp = compare(yd, rem, yL, remL);
1319
+ if (cmp < 0) {
1320
+ rem0 = rem[0];
1321
+ if (yL != remL)
1322
+ rem0 = rem0 * base + (rem[1] || 0);
1323
+ k = rem0 / yd0 | 0;
1324
+ if (k > 1) {
1325
+ if (k >= base)
1326
+ k = base - 1;
1327
+ prod = multiplyInteger(yd, k, base);
1328
+ prodL = prod.length;
1329
+ remL = rem.length;
1330
+ cmp = compare(prod, rem, prodL, remL);
1331
+ if (cmp == 1) {
1332
+ k--;
1333
+ subtract(prod, yL < prodL ? yz : yd, prodL, base);
1334
+ }
1335
+ } else {
1336
+ if (k == 0)
1337
+ cmp = k = 1;
1338
+ prod = yd.slice();
1339
+ }
1340
+ prodL = prod.length;
1341
+ if (prodL < remL)
1342
+ prod.unshift(0);
1343
+ subtract(rem, prod, remL, base);
1344
+ if (cmp == -1) {
1345
+ remL = rem.length;
1346
+ cmp = compare(yd, rem, yL, remL);
1347
+ if (cmp < 1) {
1348
+ k++;
1349
+ subtract(rem, yL < remL ? yz : yd, remL, base);
1350
+ }
1351
+ }
1352
+ remL = rem.length;
1353
+ } else if (cmp === 0) {
1354
+ k++;
1355
+ rem = [0];
1356
+ }
1357
+ qd[i++] = k;
1358
+ if (cmp && rem[0]) {
1359
+ rem[remL++] = xd[xi] || 0;
1360
+ } else {
1361
+ rem = [xd[xi]];
1362
+ remL = 1;
1363
+ }
1364
+ } while ((xi++ < xL || rem[0] !== void 0) && sd--);
1365
+ more = rem[0] !== void 0;
1366
+ }
1367
+ if (!qd[0])
1368
+ qd.shift();
1369
+ }
1370
+ if (logBase == 1) {
1371
+ q.e = e;
1372
+ inexact = more;
1373
+ } else {
1374
+ for (i = 1, k = qd[0]; k >= 10; k /= 10)
1375
+ i++;
1376
+ q.e = i + e * logBase - 1;
1377
+ finalise(q, dp ? pr + q.e + 1 : pr, rm, more);
1378
+ }
1379
+ return q;
1380
+ };
1381
+ }();
1382
+ function finalise(x, sd, rm, isTruncated) {
1383
+ var digits, i, j, k, rd, roundUp, w, xd, xdi, Ctor = x.constructor;
1384
+ out:
1385
+ if (sd != null) {
1386
+ xd = x.d;
1387
+ if (!xd)
1388
+ return x;
1389
+ for (digits = 1, k = xd[0]; k >= 10; k /= 10)
1390
+ digits++;
1391
+ i = sd - digits;
1392
+ if (i < 0) {
1393
+ i += LOG_BASE;
1394
+ j = sd;
1395
+ w = xd[xdi = 0];
1396
+ rd = w / mathpow(10, digits - j - 1) % 10 | 0;
1397
+ } else {
1398
+ xdi = Math.ceil((i + 1) / LOG_BASE);
1399
+ k = xd.length;
1400
+ if (xdi >= k) {
1401
+ if (isTruncated) {
1402
+ for (; k++ <= xdi; )
1403
+ xd.push(0);
1404
+ w = rd = 0;
1405
+ digits = 1;
1406
+ i %= LOG_BASE;
1407
+ j = i - LOG_BASE + 1;
1408
+ } else {
1409
+ break out;
1410
+ }
1411
+ } else {
1412
+ w = k = xd[xdi];
1413
+ for (digits = 1; k >= 10; k /= 10)
1414
+ digits++;
1415
+ i %= LOG_BASE;
1416
+ j = i - LOG_BASE + digits;
1417
+ rd = j < 0 ? 0 : w / mathpow(10, digits - j - 1) % 10 | 0;
1418
+ }
1419
+ }
1420
+ isTruncated = isTruncated || sd < 0 || xd[xdi + 1] !== void 0 || (j < 0 ? w : w % mathpow(10, digits - j - 1));
1421
+ roundUp = rm < 4 ? (rd || isTruncated) && (rm == 0 || rm == (x.s < 0 ? 3 : 2)) : rd > 5 || rd == 5 && (rm == 4 || isTruncated || rm == 6 && (i > 0 ? j > 0 ? w / mathpow(10, digits - j) : 0 : xd[xdi - 1]) % 10 & 1 || rm == (x.s < 0 ? 8 : 7));
1422
+ if (sd < 1 || !xd[0]) {
1423
+ xd.length = 0;
1424
+ if (roundUp) {
1425
+ sd -= x.e + 1;
1426
+ xd[0] = mathpow(10, (LOG_BASE - sd % LOG_BASE) % LOG_BASE);
1427
+ x.e = -sd || 0;
1428
+ } else {
1429
+ xd[0] = x.e = 0;
1430
+ }
1431
+ return x;
1432
+ }
1433
+ if (i == 0) {
1434
+ xd.length = xdi;
1435
+ k = 1;
1436
+ xdi--;
1437
+ } else {
1438
+ xd.length = xdi + 1;
1439
+ k = mathpow(10, LOG_BASE - i);
1440
+ xd[xdi] = j > 0 ? (w / mathpow(10, digits - j) % mathpow(10, j) | 0) * k : 0;
1441
+ }
1442
+ if (roundUp) {
1443
+ for (; ; ) {
1444
+ if (xdi == 0) {
1445
+ for (i = 1, j = xd[0]; j >= 10; j /= 10)
1446
+ i++;
1447
+ j = xd[0] += k;
1448
+ for (k = 1; j >= 10; j /= 10)
1449
+ k++;
1450
+ if (i != k) {
1451
+ x.e++;
1452
+ if (xd[0] == BASE)
1453
+ xd[0] = 1;
1454
+ }
1455
+ break;
1456
+ } else {
1457
+ xd[xdi] += k;
1458
+ if (xd[xdi] != BASE)
1459
+ break;
1460
+ xd[xdi--] = 0;
1461
+ k = 1;
1462
+ }
1463
+ }
1464
+ }
1465
+ for (i = xd.length; xd[--i] === 0; )
1466
+ xd.pop();
1467
+ }
1468
+ if (external) {
1469
+ if (x.e > Ctor.maxE) {
1470
+ x.d = null;
1471
+ x.e = NaN;
1472
+ } else if (x.e < Ctor.minE) {
1473
+ x.e = 0;
1474
+ x.d = [0];
1475
+ }
1476
+ }
1477
+ return x;
1478
+ }
1479
+ __name(finalise, "finalise");
1480
+ function finiteToString(x, isExp, sd) {
1481
+ if (!x.isFinite())
1482
+ return nonFiniteToString(x);
1483
+ var k, e = x.e, str = digitsToString(x.d), len = str.length;
1484
+ if (isExp) {
1485
+ if (sd && (k = sd - len) > 0) {
1486
+ str = str.charAt(0) + "." + str.slice(1) + getZeroString(k);
1487
+ } else if (len > 1) {
1488
+ str = str.charAt(0) + "." + str.slice(1);
1489
+ }
1490
+ str = str + (x.e < 0 ? "e" : "e+") + x.e;
1491
+ } else if (e < 0) {
1492
+ str = "0." + getZeroString(-e - 1) + str;
1493
+ if (sd && (k = sd - len) > 0)
1494
+ str += getZeroString(k);
1495
+ } else if (e >= len) {
1496
+ str += getZeroString(e + 1 - len);
1497
+ if (sd && (k = sd - e - 1) > 0)
1498
+ str = str + "." + getZeroString(k);
1499
+ } else {
1500
+ if ((k = e + 1) < len)
1501
+ str = str.slice(0, k) + "." + str.slice(k);
1502
+ if (sd && (k = sd - len) > 0) {
1503
+ if (e + 1 === len)
1504
+ str += ".";
1505
+ str += getZeroString(k);
1506
+ }
1507
+ }
1508
+ return str;
1509
+ }
1510
+ __name(finiteToString, "finiteToString");
1511
+ function getBase10Exponent(digits, e) {
1512
+ var w = digits[0];
1513
+ for (e *= LOG_BASE; w >= 10; w /= 10)
1514
+ e++;
1515
+ return e;
1516
+ }
1517
+ __name(getBase10Exponent, "getBase10Exponent");
1518
+ function getLn10(Ctor, sd, pr) {
1519
+ if (sd > LN10_PRECISION) {
1520
+ external = true;
1521
+ if (pr)
1522
+ Ctor.precision = pr;
1523
+ throw Error(precisionLimitExceeded);
1524
+ }
1525
+ return finalise(new Ctor(LN10), sd, 1, true);
1526
+ }
1527
+ __name(getLn10, "getLn10");
1528
+ function getPi(Ctor, sd, rm) {
1529
+ if (sd > PI_PRECISION)
1530
+ throw Error(precisionLimitExceeded);
1531
+ return finalise(new Ctor(PI), sd, rm, true);
1532
+ }
1533
+ __name(getPi, "getPi");
1534
+ function getPrecision(digits) {
1535
+ var w = digits.length - 1, len = w * LOG_BASE + 1;
1536
+ w = digits[w];
1537
+ if (w) {
1538
+ for (; w % 10 == 0; w /= 10)
1539
+ len--;
1540
+ for (w = digits[0]; w >= 10; w /= 10)
1541
+ len++;
1542
+ }
1543
+ return len;
1544
+ }
1545
+ __name(getPrecision, "getPrecision");
1546
+ function getZeroString(k) {
1547
+ var zs = "";
1548
+ for (; k--; )
1549
+ zs += "0";
1550
+ return zs;
1551
+ }
1552
+ __name(getZeroString, "getZeroString");
1553
+ function intPow(Ctor, x, n, pr) {
1554
+ var isTruncated, r = new Ctor(1), k = Math.ceil(pr / LOG_BASE + 4);
1555
+ external = false;
1556
+ for (; ; ) {
1557
+ if (n % 2) {
1558
+ r = r.times(x);
1559
+ if (truncate(r.d, k))
1560
+ isTruncated = true;
1561
+ }
1562
+ n = mathfloor(n / 2);
1563
+ if (n === 0) {
1564
+ n = r.d.length - 1;
1565
+ if (isTruncated && r.d[n] === 0)
1566
+ ++r.d[n];
1567
+ break;
1568
+ }
1569
+ x = x.times(x);
1570
+ truncate(x.d, k);
1571
+ }
1572
+ external = true;
1573
+ return r;
1574
+ }
1575
+ __name(intPow, "intPow");
1576
+ function isOdd(n) {
1577
+ return n.d[n.d.length - 1] & 1;
1578
+ }
1579
+ __name(isOdd, "isOdd");
1580
+ function maxOrMin(Ctor, args, ltgt) {
1581
+ var y, x = new Ctor(args[0]), i = 0;
1582
+ for (; ++i < args.length; ) {
1583
+ y = new Ctor(args[i]);
1584
+ if (!y.s) {
1585
+ x = y;
1586
+ break;
1587
+ } else if (x[ltgt](y)) {
1588
+ x = y;
1589
+ }
1590
+ }
1591
+ return x;
1592
+ }
1593
+ __name(maxOrMin, "maxOrMin");
1594
+ function naturalExponential(x, sd) {
1595
+ var denominator, guard, j, pow2, sum2, t, wpr, rep = 0, i = 0, k = 0, Ctor = x.constructor, rm = Ctor.rounding, pr = Ctor.precision;
1596
+ if (!x.d || !x.d[0] || x.e > 17) {
1597
+ return new Ctor(x.d ? !x.d[0] ? 1 : x.s < 0 ? 0 : 1 / 0 : x.s ? x.s < 0 ? 0 : x : 0 / 0);
1598
+ }
1599
+ if (sd == null) {
1600
+ external = false;
1601
+ wpr = pr;
1602
+ } else {
1603
+ wpr = sd;
1604
+ }
1605
+ t = new Ctor(0.03125);
1606
+ while (x.e > -2) {
1607
+ x = x.times(t);
1608
+ k += 5;
1609
+ }
1610
+ guard = Math.log(mathpow(2, k)) / Math.LN10 * 2 + 5 | 0;
1611
+ wpr += guard;
1612
+ denominator = pow2 = sum2 = new Ctor(1);
1613
+ Ctor.precision = wpr;
1614
+ for (; ; ) {
1615
+ pow2 = finalise(pow2.times(x), wpr, 1);
1616
+ denominator = denominator.times(++i);
1617
+ t = sum2.plus(divide(pow2, denominator, wpr, 1));
1618
+ if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum2.d).slice(0, wpr)) {
1619
+ j = k;
1620
+ while (j--)
1621
+ sum2 = finalise(sum2.times(sum2), wpr, 1);
1622
+ if (sd == null) {
1623
+ if (rep < 3 && checkRoundingDigits(sum2.d, wpr - guard, rm, rep)) {
1624
+ Ctor.precision = wpr += 10;
1625
+ denominator = pow2 = t = new Ctor(1);
1626
+ i = 0;
1627
+ rep++;
1628
+ } else {
1629
+ return finalise(sum2, Ctor.precision = pr, rm, external = true);
1630
+ }
1631
+ } else {
1632
+ Ctor.precision = pr;
1633
+ return sum2;
1634
+ }
1635
+ }
1636
+ sum2 = t;
1637
+ }
1638
+ }
1639
+ __name(naturalExponential, "naturalExponential");
1640
+ function naturalLogarithm(y, sd) {
1641
+ var c, c0, denominator, e, numerator, rep, sum2, t, wpr, x1, x2, n = 1, guard = 10, x = y, xd = x.d, Ctor = x.constructor, rm = Ctor.rounding, pr = Ctor.precision;
1642
+ if (x.s < 0 || !xd || !xd[0] || !x.e && xd[0] == 1 && xd.length == 1) {
1643
+ return new Ctor(xd && !xd[0] ? -1 / 0 : x.s != 1 ? NaN : xd ? 0 : x);
1644
+ }
1645
+ if (sd == null) {
1646
+ external = false;
1647
+ wpr = pr;
1648
+ } else {
1649
+ wpr = sd;
1650
+ }
1651
+ Ctor.precision = wpr += guard;
1652
+ c = digitsToString(xd);
1653
+ c0 = c.charAt(0);
1654
+ if (Math.abs(e = x.e) < 15e14) {
1655
+ while (c0 < 7 && c0 != 1 || c0 == 1 && c.charAt(1) > 3) {
1656
+ x = x.times(y);
1657
+ c = digitsToString(x.d);
1658
+ c0 = c.charAt(0);
1659
+ n++;
1660
+ }
1661
+ e = x.e;
1662
+ if (c0 > 1) {
1663
+ x = new Ctor("0." + c);
1664
+ e++;
1665
+ } else {
1666
+ x = new Ctor(c0 + "." + c.slice(1));
1667
+ }
1668
+ } else {
1669
+ t = getLn10(Ctor, wpr + 2, pr).times(e + "");
1670
+ x = naturalLogarithm(new Ctor(c0 + "." + c.slice(1)), wpr - guard).plus(t);
1671
+ Ctor.precision = pr;
1672
+ return sd == null ? finalise(x, pr, rm, external = true) : x;
1673
+ }
1674
+ x1 = x;
1675
+ sum2 = numerator = x = divide(x.minus(1), x.plus(1), wpr, 1);
1676
+ x2 = finalise(x.times(x), wpr, 1);
1677
+ denominator = 3;
1678
+ for (; ; ) {
1679
+ numerator = finalise(numerator.times(x2), wpr, 1);
1680
+ t = sum2.plus(divide(numerator, new Ctor(denominator), wpr, 1));
1681
+ if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum2.d).slice(0, wpr)) {
1682
+ sum2 = sum2.times(2);
1683
+ if (e !== 0)
1684
+ sum2 = sum2.plus(getLn10(Ctor, wpr + 2, pr).times(e + ""));
1685
+ sum2 = divide(sum2, new Ctor(n), wpr, 1);
1686
+ if (sd == null) {
1687
+ if (checkRoundingDigits(sum2.d, wpr - guard, rm, rep)) {
1688
+ Ctor.precision = wpr += guard;
1689
+ t = numerator = x = divide(x1.minus(1), x1.plus(1), wpr, 1);
1690
+ x2 = finalise(x.times(x), wpr, 1);
1691
+ denominator = rep = 1;
1692
+ } else {
1693
+ return finalise(sum2, Ctor.precision = pr, rm, external = true);
1694
+ }
1695
+ } else {
1696
+ Ctor.precision = pr;
1697
+ return sum2;
1698
+ }
1699
+ }
1700
+ sum2 = t;
1701
+ denominator += 2;
1702
+ }
1703
+ }
1704
+ __name(naturalLogarithm, "naturalLogarithm");
1705
+ function nonFiniteToString(x) {
1706
+ return String(x.s * x.s / 0);
1707
+ }
1708
+ __name(nonFiniteToString, "nonFiniteToString");
1709
+ function parseDecimal(x, str) {
1710
+ var e, i, len;
1711
+ if ((e = str.indexOf(".")) > -1)
1712
+ str = str.replace(".", "");
1713
+ if ((i = str.search(/e/i)) > 0) {
1714
+ if (e < 0)
1715
+ e = i;
1716
+ e += +str.slice(i + 1);
1717
+ str = str.substring(0, i);
1718
+ } else if (e < 0) {
1719
+ e = str.length;
1720
+ }
1721
+ for (i = 0; str.charCodeAt(i) === 48; i++)
1722
+ ;
1723
+ for (len = str.length; str.charCodeAt(len - 1) === 48; --len)
1724
+ ;
1725
+ str = str.slice(i, len);
1726
+ if (str) {
1727
+ len -= i;
1728
+ x.e = e = e - i - 1;
1729
+ x.d = [];
1730
+ i = (e + 1) % LOG_BASE;
1731
+ if (e < 0)
1732
+ i += LOG_BASE;
1733
+ if (i < len) {
1734
+ if (i)
1735
+ x.d.push(+str.slice(0, i));
1736
+ for (len -= LOG_BASE; i < len; )
1737
+ x.d.push(+str.slice(i, i += LOG_BASE));
1738
+ str = str.slice(i);
1739
+ i = LOG_BASE - str.length;
1740
+ } else {
1741
+ i -= len;
1742
+ }
1743
+ for (; i--; )
1744
+ str += "0";
1745
+ x.d.push(+str);
1746
+ if (external) {
1747
+ if (x.e > x.constructor.maxE) {
1748
+ x.d = null;
1749
+ x.e = NaN;
1750
+ } else if (x.e < x.constructor.minE) {
1751
+ x.e = 0;
1752
+ x.d = [0];
1753
+ }
1754
+ }
1755
+ } else {
1756
+ x.e = 0;
1757
+ x.d = [0];
1758
+ }
1759
+ return x;
1760
+ }
1761
+ __name(parseDecimal, "parseDecimal");
1762
+ function parseOther(x, str) {
1763
+ var base, Ctor, divisor, i, isFloat, len, p, xd, xe;
1764
+ if (str.indexOf("_") > -1) {
1765
+ str = str.replace(/(\d)_(?=\d)/g, "$1");
1766
+ if (isDecimal.test(str))
1767
+ return parseDecimal(x, str);
1768
+ } else if (str === "Infinity" || str === "NaN") {
1769
+ if (!+str)
1770
+ x.s = NaN;
1771
+ x.e = NaN;
1772
+ x.d = null;
1773
+ return x;
1774
+ }
1775
+ if (isHex.test(str)) {
1776
+ base = 16;
1777
+ str = str.toLowerCase();
1778
+ } else if (isBinary.test(str)) {
1779
+ base = 2;
1780
+ } else if (isOctal.test(str)) {
1781
+ base = 8;
1782
+ } else {
1783
+ throw Error(invalidArgument + str);
1784
+ }
1785
+ i = str.search(/p/i);
1786
+ if (i > 0) {
1787
+ p = +str.slice(i + 1);
1788
+ str = str.substring(2, i);
1789
+ } else {
1790
+ str = str.slice(2);
1791
+ }
1792
+ i = str.indexOf(".");
1793
+ isFloat = i >= 0;
1794
+ Ctor = x.constructor;
1795
+ if (isFloat) {
1796
+ str = str.replace(".", "");
1797
+ len = str.length;
1798
+ i = len - i;
1799
+ divisor = intPow(Ctor, new Ctor(base), i, i * 2);
1800
+ }
1801
+ xd = convertBase(str, base, BASE);
1802
+ xe = xd.length - 1;
1803
+ for (i = xe; xd[i] === 0; --i)
1804
+ xd.pop();
1805
+ if (i < 0)
1806
+ return new Ctor(x.s * 0);
1807
+ x.e = getBase10Exponent(xd, xe);
1808
+ x.d = xd;
1809
+ external = false;
1810
+ if (isFloat)
1811
+ x = divide(x, divisor, len * 4);
1812
+ if (p)
1813
+ x = x.times(Math.abs(p) < 54 ? mathpow(2, p) : Decimal.pow(2, p));
1814
+ external = true;
1815
+ return x;
1816
+ }
1817
+ __name(parseOther, "parseOther");
1818
+ function sine(Ctor, x) {
1819
+ var k, len = x.d.length;
1820
+ if (len < 3) {
1821
+ return x.isZero() ? x : taylorSeries(Ctor, 2, x, x);
1822
+ }
1823
+ k = 1.4 * Math.sqrt(len);
1824
+ k = k > 16 ? 16 : k | 0;
1825
+ x = x.times(1 / tinyPow(5, k));
1826
+ x = taylorSeries(Ctor, 2, x, x);
1827
+ var sin2_x, d5 = new Ctor(5), d16 = new Ctor(16), d20 = new Ctor(20);
1828
+ for (; k--; ) {
1829
+ sin2_x = x.times(x);
1830
+ x = x.times(d5.plus(sin2_x.times(d16.times(sin2_x).minus(d20))));
1831
+ }
1832
+ return x;
1833
+ }
1834
+ __name(sine, "sine");
1835
+ function taylorSeries(Ctor, n, x, y, isHyperbolic) {
1836
+ var j, t, u, x2, i = 1, pr = Ctor.precision, k = Math.ceil(pr / LOG_BASE);
1837
+ external = false;
1838
+ x2 = x.times(x);
1839
+ u = new Ctor(y);
1840
+ for (; ; ) {
1841
+ t = divide(u.times(x2), new Ctor(n++ * n++), pr, 1);
1842
+ u = isHyperbolic ? y.plus(t) : y.minus(t);
1843
+ y = divide(t.times(x2), new Ctor(n++ * n++), pr, 1);
1844
+ t = u.plus(y);
1845
+ if (t.d[k] !== void 0) {
1846
+ for (j = k; t.d[j] === u.d[j] && j--; )
1847
+ ;
1848
+ if (j == -1)
1849
+ break;
1850
+ }
1851
+ j = u;
1852
+ u = y;
1853
+ y = t;
1854
+ t = j;
1855
+ i++;
1856
+ }
1857
+ external = true;
1858
+ t.d.length = k + 1;
1859
+ return t;
1860
+ }
1861
+ __name(taylorSeries, "taylorSeries");
1862
+ function tinyPow(b, e) {
1863
+ var n = b;
1864
+ while (--e)
1865
+ n *= b;
1866
+ return n;
1867
+ }
1868
+ __name(tinyPow, "tinyPow");
1869
+ function toLessThanHalfPi(Ctor, x) {
1870
+ var t, isNeg = x.s < 0, pi = getPi(Ctor, Ctor.precision, 1), halfPi = pi.times(0.5);
1871
+ x = x.abs();
1872
+ if (x.lte(halfPi)) {
1873
+ quadrant = isNeg ? 4 : 1;
1874
+ return x;
1875
+ }
1876
+ t = x.divToInt(pi);
1877
+ if (t.isZero()) {
1878
+ quadrant = isNeg ? 3 : 2;
1879
+ } else {
1880
+ x = x.minus(t.times(pi));
1881
+ if (x.lte(halfPi)) {
1882
+ quadrant = isOdd(t) ? isNeg ? 2 : 3 : isNeg ? 4 : 1;
1883
+ return x;
1884
+ }
1885
+ quadrant = isOdd(t) ? isNeg ? 1 : 4 : isNeg ? 3 : 2;
1886
+ }
1887
+ return x.minus(pi).abs();
1888
+ }
1889
+ __name(toLessThanHalfPi, "toLessThanHalfPi");
1890
+ function toStringBinary(x, baseOut, sd, rm) {
1891
+ var base, e, i, k, len, roundUp, str, xd, y, Ctor = x.constructor, isExp = sd !== void 0;
1892
+ if (isExp) {
1893
+ checkInt32(sd, 1, MAX_DIGITS);
1894
+ if (rm === void 0)
1895
+ rm = Ctor.rounding;
1896
+ else
1897
+ checkInt32(rm, 0, 8);
1898
+ } else {
1899
+ sd = Ctor.precision;
1900
+ rm = Ctor.rounding;
1901
+ }
1902
+ if (!x.isFinite()) {
1903
+ str = nonFiniteToString(x);
1904
+ } else {
1905
+ str = finiteToString(x);
1906
+ i = str.indexOf(".");
1907
+ if (isExp) {
1908
+ base = 2;
1909
+ if (baseOut == 16) {
1910
+ sd = sd * 4 - 3;
1911
+ } else if (baseOut == 8) {
1912
+ sd = sd * 3 - 2;
1913
+ }
1914
+ } else {
1915
+ base = baseOut;
1916
+ }
1917
+ if (i >= 0) {
1918
+ str = str.replace(".", "");
1919
+ y = new Ctor(1);
1920
+ y.e = str.length - i;
1921
+ y.d = convertBase(finiteToString(y), 10, base);
1922
+ y.e = y.d.length;
1923
+ }
1924
+ xd = convertBase(str, 10, base);
1925
+ e = len = xd.length;
1926
+ for (; xd[--len] == 0; )
1927
+ xd.pop();
1928
+ if (!xd[0]) {
1929
+ str = isExp ? "0p+0" : "0";
1930
+ } else {
1931
+ if (i < 0) {
1932
+ e--;
1933
+ } else {
1934
+ x = new Ctor(x);
1935
+ x.d = xd;
1936
+ x.e = e;
1937
+ x = divide(x, y, sd, rm, 0, base);
1938
+ xd = x.d;
1939
+ e = x.e;
1940
+ roundUp = inexact;
1941
+ }
1942
+ i = xd[sd];
1943
+ k = base / 2;
1944
+ roundUp = roundUp || xd[sd + 1] !== void 0;
1945
+ roundUp = rm < 4 ? (i !== void 0 || roundUp) && (rm === 0 || rm === (x.s < 0 ? 3 : 2)) : i > k || i === k && (rm === 4 || roundUp || rm === 6 && xd[sd - 1] & 1 || rm === (x.s < 0 ? 8 : 7));
1946
+ xd.length = sd;
1947
+ if (roundUp) {
1948
+ for (; ++xd[--sd] > base - 1; ) {
1949
+ xd[sd] = 0;
1950
+ if (!sd) {
1951
+ ++e;
1952
+ xd.unshift(1);
1953
+ }
1954
+ }
1955
+ }
1956
+ for (len = xd.length; !xd[len - 1]; --len)
1957
+ ;
1958
+ for (i = 0, str = ""; i < len; i++)
1959
+ str += NUMERALS.charAt(xd[i]);
1960
+ if (isExp) {
1961
+ if (len > 1) {
1962
+ if (baseOut == 16 || baseOut == 8) {
1963
+ i = baseOut == 16 ? 4 : 3;
1964
+ for (--len; len % i; len++)
1965
+ str += "0";
1966
+ xd = convertBase(str, base, baseOut);
1967
+ for (len = xd.length; !xd[len - 1]; --len)
1968
+ ;
1969
+ for (i = 1, str = "1."; i < len; i++)
1970
+ str += NUMERALS.charAt(xd[i]);
1971
+ } else {
1972
+ str = str.charAt(0) + "." + str.slice(1);
1973
+ }
1974
+ }
1975
+ str = str + (e < 0 ? "p" : "p+") + e;
1976
+ } else if (e < 0) {
1977
+ for (; ++e; )
1978
+ str = "0" + str;
1979
+ str = "0." + str;
1980
+ } else {
1981
+ if (++e > len)
1982
+ for (e -= len; e--; )
1983
+ str += "0";
1984
+ else if (e < len)
1985
+ str = str.slice(0, e) + "." + str.slice(e);
1986
+ }
1987
+ }
1988
+ str = (baseOut == 16 ? "0x" : baseOut == 2 ? "0b" : baseOut == 8 ? "0o" : "") + str;
1989
+ }
1990
+ return x.s < 0 ? "-" + str : str;
1991
+ }
1992
+ __name(toStringBinary, "toStringBinary");
1993
+ function truncate(arr, len) {
1994
+ if (arr.length > len) {
1995
+ arr.length = len;
1996
+ return true;
1997
+ }
1998
+ }
1999
+ __name(truncate, "truncate");
2000
+ function abs(x) {
2001
+ return new this(x).abs();
2002
+ }
2003
+ __name(abs, "abs");
2004
+ function acos(x) {
2005
+ return new this(x).acos();
2006
+ }
2007
+ __name(acos, "acos");
2008
+ function acosh(x) {
2009
+ return new this(x).acosh();
2010
+ }
2011
+ __name(acosh, "acosh");
2012
+ function add(x, y) {
2013
+ return new this(x).plus(y);
2014
+ }
2015
+ __name(add, "add");
2016
+ function asin(x) {
2017
+ return new this(x).asin();
2018
+ }
2019
+ __name(asin, "asin");
2020
+ function asinh(x) {
2021
+ return new this(x).asinh();
2022
+ }
2023
+ __name(asinh, "asinh");
2024
+ function atan(x) {
2025
+ return new this(x).atan();
2026
+ }
2027
+ __name(atan, "atan");
2028
+ function atanh(x) {
2029
+ return new this(x).atanh();
2030
+ }
2031
+ __name(atanh, "atanh");
2032
+ function atan2(y, x) {
2033
+ y = new this(y);
2034
+ x = new this(x);
2035
+ var r, pr = this.precision, rm = this.rounding, wpr = pr + 4;
2036
+ if (!y.s || !x.s) {
2037
+ r = new this(NaN);
2038
+ } else if (!y.d && !x.d) {
2039
+ r = getPi(this, wpr, 1).times(x.s > 0 ? 0.25 : 0.75);
2040
+ r.s = y.s;
2041
+ } else if (!x.d || y.isZero()) {
2042
+ r = x.s < 0 ? getPi(this, pr, rm) : new this(0);
2043
+ r.s = y.s;
2044
+ } else if (!y.d || x.isZero()) {
2045
+ r = getPi(this, wpr, 1).times(0.5);
2046
+ r.s = y.s;
2047
+ } else if (x.s < 0) {
2048
+ this.precision = wpr;
2049
+ this.rounding = 1;
2050
+ r = this.atan(divide(y, x, wpr, 1));
2051
+ x = getPi(this, wpr, 1);
2052
+ this.precision = pr;
2053
+ this.rounding = rm;
2054
+ r = y.s < 0 ? r.minus(x) : r.plus(x);
2055
+ } else {
2056
+ r = this.atan(divide(y, x, wpr, 1));
2057
+ }
2058
+ return r;
2059
+ }
2060
+ __name(atan2, "atan2");
2061
+ function cbrt(x) {
2062
+ return new this(x).cbrt();
2063
+ }
2064
+ __name(cbrt, "cbrt");
2065
+ function ceil(x) {
2066
+ return finalise(x = new this(x), x.e + 1, 2);
2067
+ }
2068
+ __name(ceil, "ceil");
2069
+ function clamp(x, min2, max2) {
2070
+ return new this(x).clamp(min2, max2);
2071
+ }
2072
+ __name(clamp, "clamp");
2073
+ function config(obj) {
2074
+ if (!obj || typeof obj !== "object")
2075
+ throw Error(decimalError + "Object expected");
2076
+ var i, p, v, useDefaults = obj.defaults === true, ps = [
2077
+ "precision",
2078
+ 1,
2079
+ MAX_DIGITS,
2080
+ "rounding",
2081
+ 0,
2082
+ 8,
2083
+ "toExpNeg",
2084
+ -EXP_LIMIT,
2085
+ 0,
2086
+ "toExpPos",
2087
+ 0,
2088
+ EXP_LIMIT,
2089
+ "maxE",
2090
+ 0,
2091
+ EXP_LIMIT,
2092
+ "minE",
2093
+ -EXP_LIMIT,
2094
+ 0,
2095
+ "modulo",
2096
+ 0,
2097
+ 9
2098
+ ];
2099
+ for (i = 0; i < ps.length; i += 3) {
2100
+ if (p = ps[i], useDefaults)
2101
+ this[p] = DEFAULTS[p];
2102
+ if ((v = obj[p]) !== void 0) {
2103
+ if (mathfloor(v) === v && v >= ps[i + 1] && v <= ps[i + 2])
2104
+ this[p] = v;
2105
+ else
2106
+ throw Error(invalidArgument + p + ": " + v);
2107
+ }
2108
+ }
2109
+ if (p = "crypto", useDefaults)
2110
+ this[p] = DEFAULTS[p];
2111
+ if ((v = obj[p]) !== void 0) {
2112
+ if (v === true || v === false || v === 0 || v === 1) {
2113
+ if (v) {
2114
+ if (typeof crypto != "undefined" && crypto && (crypto.getRandomValues || crypto.randomBytes)) {
2115
+ this[p] = true;
2116
+ } else {
2117
+ throw Error(cryptoUnavailable);
2118
+ }
2119
+ } else {
2120
+ this[p] = false;
2121
+ }
2122
+ } else {
2123
+ throw Error(invalidArgument + p + ": " + v);
2124
+ }
2125
+ }
2126
+ return this;
2127
+ }
2128
+ __name(config, "config");
2129
+ function cos(x) {
2130
+ return new this(x).cos();
2131
+ }
2132
+ __name(cos, "cos");
2133
+ function cosh(x) {
2134
+ return new this(x).cosh();
2135
+ }
2136
+ __name(cosh, "cosh");
2137
+ function clone(obj) {
2138
+ var i, p, ps;
2139
+ function Decimal2(v) {
2140
+ var e, i2, t, x = this;
2141
+ if (!(x instanceof Decimal2))
2142
+ return new Decimal2(v);
2143
+ x.constructor = Decimal2;
2144
+ if (isDecimalInstance(v)) {
2145
+ x.s = v.s;
2146
+ if (external) {
2147
+ if (!v.d || v.e > Decimal2.maxE) {
2148
+ x.e = NaN;
2149
+ x.d = null;
2150
+ } else if (v.e < Decimal2.minE) {
2151
+ x.e = 0;
2152
+ x.d = [0];
2153
+ } else {
2154
+ x.e = v.e;
2155
+ x.d = v.d.slice();
2156
+ }
2157
+ } else {
2158
+ x.e = v.e;
2159
+ x.d = v.d ? v.d.slice() : v.d;
2160
+ }
2161
+ return;
2162
+ }
2163
+ t = typeof v;
2164
+ if (t === "number") {
2165
+ if (v === 0) {
2166
+ x.s = 1 / v < 0 ? -1 : 1;
2167
+ x.e = 0;
2168
+ x.d = [0];
2169
+ return;
2170
+ }
2171
+ if (v < 0) {
2172
+ v = -v;
2173
+ x.s = -1;
2174
+ } else {
2175
+ x.s = 1;
2176
+ }
2177
+ if (v === ~~v && v < 1e7) {
2178
+ for (e = 0, i2 = v; i2 >= 10; i2 /= 10)
2179
+ e++;
2180
+ if (external) {
2181
+ if (e > Decimal2.maxE) {
2182
+ x.e = NaN;
2183
+ x.d = null;
2184
+ } else if (e < Decimal2.minE) {
2185
+ x.e = 0;
2186
+ x.d = [0];
2187
+ } else {
2188
+ x.e = e;
2189
+ x.d = [v];
2190
+ }
2191
+ } else {
2192
+ x.e = e;
2193
+ x.d = [v];
2194
+ }
2195
+ return;
2196
+ } else if (v * 0 !== 0) {
2197
+ if (!v)
2198
+ x.s = NaN;
2199
+ x.e = NaN;
2200
+ x.d = null;
2201
+ return;
2202
+ }
2203
+ return parseDecimal(x, v.toString());
2204
+ } else if (t !== "string") {
2205
+ throw Error(invalidArgument + v);
2206
+ }
2207
+ if ((i2 = v.charCodeAt(0)) === 45) {
2208
+ v = v.slice(1);
2209
+ x.s = -1;
2210
+ } else {
2211
+ if (i2 === 43)
2212
+ v = v.slice(1);
2213
+ x.s = 1;
2214
+ }
2215
+ return isDecimal.test(v) ? parseDecimal(x, v) : parseOther(x, v);
2216
+ }
2217
+ __name(Decimal2, "Decimal");
2218
+ Decimal2.prototype = P;
2219
+ Decimal2.ROUND_UP = 0;
2220
+ Decimal2.ROUND_DOWN = 1;
2221
+ Decimal2.ROUND_CEIL = 2;
2222
+ Decimal2.ROUND_FLOOR = 3;
2223
+ Decimal2.ROUND_HALF_UP = 4;
2224
+ Decimal2.ROUND_HALF_DOWN = 5;
2225
+ Decimal2.ROUND_HALF_EVEN = 6;
2226
+ Decimal2.ROUND_HALF_CEIL = 7;
2227
+ Decimal2.ROUND_HALF_FLOOR = 8;
2228
+ Decimal2.EUCLID = 9;
2229
+ Decimal2.config = Decimal2.set = config;
2230
+ Decimal2.clone = clone;
2231
+ Decimal2.isDecimal = isDecimalInstance;
2232
+ Decimal2.abs = abs;
2233
+ Decimal2.acos = acos;
2234
+ Decimal2.acosh = acosh;
2235
+ Decimal2.add = add;
2236
+ Decimal2.asin = asin;
2237
+ Decimal2.asinh = asinh;
2238
+ Decimal2.atan = atan;
2239
+ Decimal2.atanh = atanh;
2240
+ Decimal2.atan2 = atan2;
2241
+ Decimal2.cbrt = cbrt;
2242
+ Decimal2.ceil = ceil;
2243
+ Decimal2.clamp = clamp;
2244
+ Decimal2.cos = cos;
2245
+ Decimal2.cosh = cosh;
2246
+ Decimal2.div = div;
2247
+ Decimal2.exp = exp;
2248
+ Decimal2.floor = floor;
2249
+ Decimal2.hypot = hypot;
2250
+ Decimal2.ln = ln;
2251
+ Decimal2.log = log;
2252
+ Decimal2.log10 = log10;
2253
+ Decimal2.log2 = log2;
2254
+ Decimal2.max = max;
2255
+ Decimal2.min = min;
2256
+ Decimal2.mod = mod;
2257
+ Decimal2.mul = mul;
2258
+ Decimal2.pow = pow;
2259
+ Decimal2.random = random;
2260
+ Decimal2.round = round;
2261
+ Decimal2.sign = sign;
2262
+ Decimal2.sin = sin;
2263
+ Decimal2.sinh = sinh;
2264
+ Decimal2.sqrt = sqrt;
2265
+ Decimal2.sub = sub;
2266
+ Decimal2.sum = sum;
2267
+ Decimal2.tan = tan;
2268
+ Decimal2.tanh = tanh;
2269
+ Decimal2.trunc = trunc;
2270
+ if (obj === void 0)
2271
+ obj = {};
2272
+ if (obj) {
2273
+ if (obj.defaults !== true) {
2274
+ ps = ["precision", "rounding", "toExpNeg", "toExpPos", "maxE", "minE", "modulo", "crypto"];
2275
+ for (i = 0; i < ps.length; )
2276
+ if (!obj.hasOwnProperty(p = ps[i++]))
2277
+ obj[p] = this[p];
2278
+ }
2279
+ }
2280
+ Decimal2.config(obj);
2281
+ return Decimal2;
2282
+ }
2283
+ __name(clone, "clone");
2284
+ function div(x, y) {
2285
+ return new this(x).div(y);
2286
+ }
2287
+ __name(div, "div");
2288
+ function exp(x) {
2289
+ return new this(x).exp();
2290
+ }
2291
+ __name(exp, "exp");
2292
+ function floor(x) {
2293
+ return finalise(x = new this(x), x.e + 1, 3);
2294
+ }
2295
+ __name(floor, "floor");
2296
+ function hypot() {
2297
+ var i, n, t = new this(0);
2298
+ external = false;
2299
+ for (i = 0; i < arguments.length; ) {
2300
+ n = new this(arguments[i++]);
2301
+ if (!n.d) {
2302
+ if (n.s) {
2303
+ external = true;
2304
+ return new this(1 / 0);
2305
+ }
2306
+ t = n;
2307
+ } else if (t.d) {
2308
+ t = t.plus(n.times(n));
2309
+ }
2310
+ }
2311
+ external = true;
2312
+ return t.sqrt();
2313
+ }
2314
+ __name(hypot, "hypot");
2315
+ function isDecimalInstance(obj) {
2316
+ return obj instanceof Decimal || obj && obj.toStringTag === tag || false;
2317
+ }
2318
+ __name(isDecimalInstance, "isDecimalInstance");
2319
+ function ln(x) {
2320
+ return new this(x).ln();
2321
+ }
2322
+ __name(ln, "ln");
2323
+ function log(x, y) {
2324
+ return new this(x).log(y);
2325
+ }
2326
+ __name(log, "log");
2327
+ function log2(x) {
2328
+ return new this(x).log(2);
2329
+ }
2330
+ __name(log2, "log2");
2331
+ function log10(x) {
2332
+ return new this(x).log(10);
2333
+ }
2334
+ __name(log10, "log10");
2335
+ function max() {
2336
+ return maxOrMin(this, arguments, "lt");
2337
+ }
2338
+ __name(max, "max");
2339
+ function min() {
2340
+ return maxOrMin(this, arguments, "gt");
2341
+ }
2342
+ __name(min, "min");
2343
+ function mod(x, y) {
2344
+ return new this(x).mod(y);
2345
+ }
2346
+ __name(mod, "mod");
2347
+ function mul(x, y) {
2348
+ return new this(x).mul(y);
2349
+ }
2350
+ __name(mul, "mul");
2351
+ function pow(x, y) {
2352
+ return new this(x).pow(y);
2353
+ }
2354
+ __name(pow, "pow");
2355
+ function random(sd) {
2356
+ var d, e, k, n, i = 0, r = new this(1), rd = [];
2357
+ if (sd === void 0)
2358
+ sd = this.precision;
2359
+ else
2360
+ checkInt32(sd, 1, MAX_DIGITS);
2361
+ k = Math.ceil(sd / LOG_BASE);
2362
+ if (!this.crypto) {
2363
+ for (; i < k; )
2364
+ rd[i++] = Math.random() * 1e7 | 0;
2365
+ } else if (crypto.getRandomValues) {
2366
+ d = crypto.getRandomValues(new Uint32Array(k));
2367
+ for (; i < k; ) {
2368
+ n = d[i];
2369
+ if (n >= 429e7) {
2370
+ d[i] = crypto.getRandomValues(new Uint32Array(1))[0];
2371
+ } else {
2372
+ rd[i++] = n % 1e7;
2373
+ }
2374
+ }
2375
+ } else if (crypto.randomBytes) {
2376
+ d = crypto.randomBytes(k *= 4);
2377
+ for (; i < k; ) {
2378
+ n = d[i] + (d[i + 1] << 8) + (d[i + 2] << 16) + ((d[i + 3] & 127) << 24);
2379
+ if (n >= 214e7) {
2380
+ crypto.randomBytes(4).copy(d, i);
2381
+ } else {
2382
+ rd.push(n % 1e7);
2383
+ i += 4;
2384
+ }
2385
+ }
2386
+ i = k / 4;
2387
+ } else {
2388
+ throw Error(cryptoUnavailable);
2389
+ }
2390
+ k = rd[--i];
2391
+ sd %= LOG_BASE;
2392
+ if (k && sd) {
2393
+ n = mathpow(10, LOG_BASE - sd);
2394
+ rd[i] = (k / n | 0) * n;
2395
+ }
2396
+ for (; rd[i] === 0; i--)
2397
+ rd.pop();
2398
+ if (i < 0) {
2399
+ e = 0;
2400
+ rd = [0];
2401
+ } else {
2402
+ e = -1;
2403
+ for (; rd[0] === 0; e -= LOG_BASE)
2404
+ rd.shift();
2405
+ for (k = 1, n = rd[0]; n >= 10; n /= 10)
2406
+ k++;
2407
+ if (k < LOG_BASE)
2408
+ e -= LOG_BASE - k;
2409
+ }
2410
+ r.e = e;
2411
+ r.d = rd;
2412
+ return r;
2413
+ }
2414
+ __name(random, "random");
2415
+ function round(x) {
2416
+ return finalise(x = new this(x), x.e + 1, this.rounding);
2417
+ }
2418
+ __name(round, "round");
2419
+ function sign(x) {
2420
+ x = new this(x);
2421
+ return x.d ? x.d[0] ? x.s : 0 * x.s : x.s || NaN;
2422
+ }
2423
+ __name(sign, "sign");
2424
+ function sin(x) {
2425
+ return new this(x).sin();
2426
+ }
2427
+ __name(sin, "sin");
2428
+ function sinh(x) {
2429
+ return new this(x).sinh();
2430
+ }
2431
+ __name(sinh, "sinh");
2432
+ function sqrt(x) {
2433
+ return new this(x).sqrt();
2434
+ }
2435
+ __name(sqrt, "sqrt");
2436
+ function sub(x, y) {
2437
+ return new this(x).sub(y);
2438
+ }
2439
+ __name(sub, "sub");
2440
+ function sum() {
2441
+ var i = 0, args = arguments, x = new this(args[i]);
2442
+ external = false;
2443
+ for (; x.s && ++i < args.length; )
2444
+ x = x.plus(args[i]);
2445
+ external = true;
2446
+ return finalise(x, this.precision, this.rounding);
2447
+ }
2448
+ __name(sum, "sum");
2449
+ function tan(x) {
2450
+ return new this(x).tan();
2451
+ }
2452
+ __name(tan, "tan");
2453
+ function tanh(x) {
2454
+ return new this(x).tanh();
2455
+ }
2456
+ __name(tanh, "tanh");
2457
+ function trunc(x) {
2458
+ return finalise(x = new this(x), x.e + 1, 1);
2459
+ }
2460
+ __name(trunc, "trunc");
2461
+ P[Symbol.for("nodejs.util.inspect.custom")] = P.toString;
2462
+ P[Symbol.toStringTag] = "Decimal";
2463
+ var Decimal = P.constructor = clone(DEFAULTS);
2464
+ LN10 = new Decimal(LN10);
2465
+ PI = new Decimal(PI);
2466
+ var decimal_default = Decimal;
2467
+ // Annotate the CommonJS export names for ESM import in node:
2468
+ 0 && (module.exports = {
2469
+ Decimal,
2470
+ makeStrictEnum,
2471
+ objectEnumValues
2472
+ });
2473
+ /*!
2474
+ * decimal.js v10.4.0
2475
+ * An arbitrary-precision Decimal type for JavaScript.
2476
+ * https://github.com/MikeMcl/decimal.js
2477
+ * Copyright (c) 2022 Michael Mclaughlin <M8ch88l@gmail.com>
2478
+ * MIT Licence
2479
+ */