Archives/MikeMcl_decimal.js
1
0
Fork 0
mirror of https://github.com/MikeMcl/decimal.js.git synced 2024-10-27 20:34:12 +00:00
Code Issues Projects Releases Wiki Activity

Re-added older style that only worked for positive numbers, just in case it's faster.

Browse Source
This commit is contained in:
Favian Contreras 2014-12-01 04:55:58 -08:00
parent f7cee42cba
commit c671ef841c
1 changed files with 29 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

30
decimal.js
View File

@ -352,6 +352,12 @@
/*
* n << -n = N
* n << N = N
* 0 << n = N
* N << n = N
* I << n = I <-- Strange concept
*
* Return a new Decimal whose value is this Decimal << n, rounded to precision
* significant digits using rounding mode rounding.
*
@ -2012,6 +2018,28 @@
return str;
}
/* Want to test the speed of this in comparison after testing.
// Reference: http://en.wikipedia.org/wiki/Bitwise_operation#Mathematical_equivalents
function posBitwise(x, y, fn) {
var tmp_external = external,
n = 0,
cap = max(x, y),
Decimal = x['constructor'],
sum = new Decimal(0),
twoPower = Decimal['ONE'];
external = false;
while (twoPower['lte'](cap)) {
var xMod = div( x, twoPower, 0, 1, 1 )['mod'](2)['toNumber']();
var yMod = div( y, twoPower, 0, 1, 1 )['mod'](2)['toNumber']();
sum = sum['plus'](twoPower['times'](fn(xMod, yMod)));
twoPower = twoPower['times'](2);
}
external = tmp_external;
return sum;
}*/
function bitwise(x, y, func) {
var Decimal = x['constructor'];
@ -2285,7 +2313,7 @@
r = r || xc[pr + 1] != null;
if ( rm < 4
? ( i != null || r ) && ( rm == 0 || rm == ( x['s'] < 0 ? 3 : 2 ) )
? ( i != null || r ) && ( rm == 0 || rm == ( sign < 0 ? 3 : 2 ) )
: i > j || i == j && ( rm == 4 || r || rm == 6 && xc[pr - 1] & 1 ||
rm == ( x['s'] < 0 ? 8 : 7 ) ) ) {