@phensley/decimal
Advanced tools
Comparing version 1.0.4 to 1.0.5
@@ -313,3 +313,3 @@ import { add, divide, multiply, subtract, trimLeadingZeros, DivMod } from './math'; | ||
} | ||
var _b = divide(u.data, v.data, true), q = _b[0], rem = _b[1]; | ||
var _b = divide(u.data, v.data), q = _b[0], rem = _b[1]; | ||
w = Decimal.fromRaw(sign, exp, q, 0); | ||
@@ -371,3 +371,3 @@ w.trim(); | ||
} | ||
var _a = divide(u.data, v.data, true), qd = _a[0], rd = _a[1]; | ||
var _a = divide(u.data, v.data), qd = _a[0], rd = _a[1]; | ||
var q = new Decimal(ZERO); | ||
@@ -374,0 +374,0 @@ q.data = qd; |
@@ -27,3 +27,3 @@ /** | ||
*/ | ||
export declare const divide: (uc: number[], vc: number[], remainder: boolean) => [number[], number[]]; | ||
export declare const divide: (uc: number[], vc: number[]) => [number[], number[]]; | ||
/** | ||
@@ -30,0 +30,0 @@ * Starting at the end of the array, remove all contiguous zeros except |
@@ -118,3 +118,3 @@ import { POWERS10 } from './types'; | ||
*/ | ||
export var divide = function (uc, vc, remainder) { | ||
export var divide = function (uc, vc) { | ||
var n = vc.length; | ||
@@ -199,14 +199,11 @@ var m = uc.length - n; | ||
// D8. Unnormalize remainder. | ||
if (remainder) { | ||
k = 0; | ||
var r = new Array(n); | ||
r.fill(0); | ||
for (var i = n - 1; i >= 0; i--) { | ||
p = u[i] + (k * 10000000 /* RADIX */); | ||
r[i] = (p / d) | 0; | ||
k = p - r[i] * d; | ||
} | ||
return [q, r]; | ||
k = 0; | ||
var r = new Array(n); | ||
r.fill(0); | ||
for (var i = n - 1; i >= 0; i--) { | ||
p = u[i] + (k * 10000000 /* RADIX */); | ||
r[i] = (p / d) | 0; | ||
k = p - r[i] * d; | ||
} | ||
return [q, []]; | ||
return [q, r]; | ||
}; | ||
@@ -213,0 +210,0 @@ /** |
@@ -315,3 +315,3 @@ "use strict"; | ||
} | ||
var _b = math_1.divide(u.data, v.data, true), q = _b[0], rem = _b[1]; | ||
var _b = math_1.divide(u.data, v.data), q = _b[0], rem = _b[1]; | ||
w = Decimal.fromRaw(sign, exp, q, 0); | ||
@@ -373,3 +373,3 @@ w.trim(); | ||
} | ||
var _a = math_1.divide(u.data, v.data, true), qd = _a[0], rd = _a[1]; | ||
var _a = math_1.divide(u.data, v.data), qd = _a[0], rd = _a[1]; | ||
var q = new Decimal(ZERO); | ||
@@ -376,0 +376,0 @@ q.data = qd; |
@@ -27,3 +27,3 @@ /** | ||
*/ | ||
export declare const divide: (uc: number[], vc: number[], remainder: boolean) => [number[], number[]]; | ||
export declare const divide: (uc: number[], vc: number[]) => [number[], number[]]; | ||
/** | ||
@@ -30,0 +30,0 @@ * Starting at the end of the array, remove all contiguous zeros except |
@@ -120,3 +120,3 @@ "use strict"; | ||
*/ | ||
exports.divide = function (uc, vc, remainder) { | ||
exports.divide = function (uc, vc) { | ||
var n = vc.length; | ||
@@ -201,14 +201,11 @@ var m = uc.length - n; | ||
// D8. Unnormalize remainder. | ||
if (remainder) { | ||
k = 0; | ||
var r = new Array(n); | ||
r.fill(0); | ||
for (var i = n - 1; i >= 0; i--) { | ||
p = u[i] + (k * 10000000 /* RADIX */); | ||
r[i] = (p / d) | 0; | ||
k = p - r[i] * d; | ||
} | ||
return [q, r]; | ||
k = 0; | ||
var r = new Array(n); | ||
r.fill(0); | ||
for (var i = n - 1; i >= 0; i--) { | ||
p = u[i] + (k * 10000000 /* RADIX */); | ||
r[i] = (p / d) | 0; | ||
k = p - r[i] * d; | ||
} | ||
return [q, []]; | ||
return [q, r]; | ||
}; | ||
@@ -215,0 +212,0 @@ /** |
{ | ||
"name": "@phensley/decimal", | ||
"version": "1.0.4", | ||
"version": "1.0.5", | ||
"description": "Arbitrary precision decimal math", | ||
@@ -68,3 +68,3 @@ "main": "lib/index.js", | ||
}, | ||
"gitHead": "e1fcac03aa42e09bb40d806eba5299b562addc62" | ||
"gitHead": "0e62205779ab1c474b7336bc4217c0c3afad1cae" | ||
} |
Sorry, the diff of this file is not supported yet
Sorry, the diff of this file is not supported yet
Sorry, the diff of this file is not supported yet
Sorry, the diff of this file is not supported yet
258270
4593