forked from lapo-luchini/asn1js
-
Notifications
You must be signed in to change notification settings - Fork 0
/
int10.js
70 lines (61 loc) · 2.1 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
// Big integer base-10 printing library
// Copyright (c) 2014 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.
/*jshint browser: true, strict: true, immed: true, latedef: true, undef: true, regexdash: false */
(function () {
"use strict";
var max = 10000000000000; // biggest integer that can still fit 2^53 when multiplied by 256
function Int10(value) {
this.buf = [+value || 0];
}
Int10.prototype.mulAdd = function (m, c) {
// assert(m <= 256)
var 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;
};
Int10.prototype.toString = function (base) {
if ((base || 10) != 10)
throw 'only base 10 is supported';
var b = this.buf,
s = b[b.length - 1].toString();
for (var i = b.length - 2; i >= 0; --i)
s += (max + b[i]).toString().substring(1);
return s;
};
Int10.prototype.valueOf = function () {
var b = this.buf,
v = 0;
for (var i = b.length - 1; i >= 0; --i)
v = v * max + b[i];
return v;
};
Int10.prototype.simplify = function () {
var b = this.buf;
return (b.length == 1) ? b[0] : this;
};
// export globals
if (typeof module !== 'undefined') { module.exports = Int10; } else { window.Int10 = Int10; }
})();