Computes a non-overlapping sequence representing the sum of two floating point numbers.
Computes the sum of two floating point numbers as a non-overlapping sequence using Knuth's method.
- D.E. Knuth. "The Art of Computer Programming: Seminumerical Algorithms". Volume 2. 1981
npm install two-sum
var twoSum = require"two-sum"//Add two wildly different sized floatsvar result = twoSum1e64 1e-64console.logresult//Prints:// [1e-64, 1e64]
Computes a non-overlapping sequence representing the sum of a and b.
ais a number
bis a number
resultis an optional length 2 array encoding the result of the sum of
Returns A length 2 array representing the non-overlapping sequence encoding the sum of a and b. The first term has smaller magnitude than the second.
Based on an idea from JRS robust geometric predicates paper.
Implementation (c) 2013 Mikola Lysenko. MIT License