forked from lapo-luchini/asn1js
-
Notifications
You must be signed in to change notification settings - Fork 0
/
int10.js
106 lines (97 loc) · 2.99 KB
/
int10.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
// Big integer base-10 printing library
// Copyright (c) 2008-2024 Lapo Luchini <[email protected]>
// Permission to use, copy, modify, and/or distribute this software for any
// purpose with or without fee is hereby granted, provided that the above
// copyright notice and this permission notice appear in all copies.
//
// THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
let max = 10000000000000; // biggest 10^n integer that can still fit 2^53 when multiplied by 256
export class Int10 {
/**
* Arbitrary length base-10 value.
* @param {number} value - Optional initial value (will be 0 otherwise).
*/
constructor(value) {
this.buf = [+value || 0];
}
/**
* Multiply value by m and add c.
* @param {number} m - multiplier, must be < =256
* @param {number} c - value to add
*/
mulAdd(m, c) {
// assert(m <= 256)
let b = this.buf,
l = b.length,
i, t;
for (i = 0; i < l; ++i) {
t = b[i] * m + c;
if (t < max)
c = 0;
else {
c = 0|(t / max);
t -= c * max;
}
b[i] = t;
}
if (c > 0)
b[i] = c;
}
/**
* Subtract value.
* @param {number} c - value to subtract
*/
sub(c) {
let b = this.buf,
l = b.length,
i, t;
for (i = 0; i < l; ++i) {
t = b[i] - c;
if (t < 0) {
t += max;
c = 1;
} else
c = 0;
b[i] = t;
}
while (b[b.length - 1] === 0)
b.pop();
}
/**
* Convert to decimal string representation.
* @param {*} base - optional value, only value accepted is 10
*/
toString(base) {
if ((base || 10) != 10)
throw 'only base 10 is supported';
let b = this.buf,
s = b[b.length - 1].toString();
for (let i = b.length - 2; i >= 0; --i)
s += (max + b[i]).toString().substring(1);
return s;
}
/**
* Convert to Number value representation.
* Will probably overflow 2^53 and thus become approximate.
*/
valueOf() {
let b = this.buf,
v = 0;
for (let i = b.length - 1; i >= 0; --i)
v = v * max + b[i];
return v;
}
/**
* Return value as a simple Number (if it is <= 10000000000000), or return this.
*/
simplify() {
let b = this.buf;
return (b.length == 1) ? b[0] : this;
}
}