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