{"_id":"two-sum","_rev":"10-728756e914f92f66d15e9a809386c376","name":"two-sum","description":"Computes a non-overlapping sequence representing the sum of two floating point numbers.","dist-tags":{"latest":"1.0.0"},"versions":{"0.0.0":{"name":"two-sum","version":"0.0.0","description":"Computes a non-overlapping sequence representing the sum of two floating point numbers.","main":"two-sum.js","directories":{"test":"test"},"dependencies":{},"devDependencies":{"tape":"~1.1.0"},"scripts":{"test":"tap test/*"},"repository":{"type":"git","url":"git://github.com/mikolalysenko/two-sum.git"},"keywords":["two","sum","floating","point","robust","exact"],"author":{"name":"Mikola Lysenko"},"license":"MIT","bugs":{"url":"https://github.com/mikolalysenko/two-sum/issues"},"_id":"two-sum@0.0.0","dist":{"shasum":"27aebac1db2508b3ce3dbbff9e63389407336997","tarball":"https://registry.npmjs.org/two-sum/-/two-sum-0.0.0.tgz","integrity":"sha512-2h0vKyjpyucMIhNUTdENfc3aZO0EkvUzno5hRNGVqVhGE+UwAbakBAydA5iNkLB7JFQ5GaJUeS5W+21TutvRLg==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDxM2cdystZo+Zjd5Oi2LaVZAoFubTWHTI4946PQ1vX/gIgYK/1H3y5PLCwQOG0ti1pTiQ3sMDivws9FNmvGTk4v2M="}]},"_from":".","_npmVersion":"1.3.8","_npmUser":{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"},"maintainers":[{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"}]},"0.1.0":{"name":"two-sum","version":"0.1.0","description":"Computes a non-overlapping sequence representing the sum of two floating point numbers.","main":"two-sum.js","directories":{"test":"test"},"dependencies":{},"devDependencies":{"tape":"~1.1.0"},"scripts":{"test":"tap test/*"},"repository":{"type":"git","url":"git://github.com/mikolalysenko/two-sum.git"},"keywords":["two","sum","floating","point","robust","exact"],"author":{"name":"Mikola Lysenko"},"license":"MIT","bugs":{"url":"https://github.com/mikolalysenko/two-sum/issues"},"_id":"two-sum@0.1.0","dist":{"shasum":"9bb1e09ffbdde2797909aa4cc1f098e2383b6aa2","tarball":"https://registry.npmjs.org/two-sum/-/two-sum-0.1.0.tgz","integrity":"sha512-qucqWlFtMOllK+3Ta8uBU02t6xEtvro+susMJFw00XzRzuRQySah8mVbEw8l8h/aaPX9N/7l/ROkYOVa5brwoQ==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCpDvOLFREBuEPEyvMNC/RsC7TfpX+4cOT4IYIscUYt4wIgHwjeS4pLF23F9LL3iz2r2+g+wu6NoXa7Jm3AVuawujM="}]},"_from":".","_npmVersion":"1.3.8","_npmUser":{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"},"maintainers":[{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"}]},"1.0.0":{"name":"two-sum","version":"1.0.0","description":"Computes a non-overlapping sequence representing the sum of two floating point numbers.","main":"two-sum.js","directories":{"test":"test"},"dependencies":{},"devDependencies":{"tape":"~1.1.0"},"scripts":{"test":"tap test/*"},"repository":{"type":"git","url":"git://github.com/mikolalysenko/two-sum.git"},"keywords":["two","sum","floating","point","robust","exact"],"author":{"name":"Mikola Lysenko"},"license":"MIT","bugs":{"url":"https://github.com/mikolalysenko/two-sum/issues"},"homepage":"https://github.com/mikolalysenko/two-sum","_id":"two-sum@1.0.0","dist":{"shasum":"31d3f32239e4f731eca9df9155e2b297f008ab64","tarball":"https://registry.npmjs.org/two-sum/-/two-sum-1.0.0.tgz","integrity":"sha512-phP48e8AawgsNUjEY2WvoIWqdie8PoiDZGxTDv70LDr01uX5wLEQbOgSP7Z/B6+SW5oLtbe8qaYX2fKJs3CGTw==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIAKOHHpGDieWYze9qF+ndJLwhL1Kas6NPIowSu15sLTfAiEAjUwDR6U7MRkLkemttqZDOqunJ/D44IBOVwD7vOxawAY="}]},"_from":".","_npmVersion":"1.4.3","_npmUser":{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"},"maintainers":[{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"}]}},"readme":"two-sum\n=======\nComputes the sum of two floating point numbers as a non-overlapping sequence using Knuth's method.\n\n* D.E. Knuth.  \"The Art of Computer Programming: Seminumerical Algorithms\".  Volume 2.  1981\n\n## Install\nUsing npm:\n\n\t\tnpm install two-sum\n\n\n## Example\n\n```javascript\nvar twoSum = require(\"two-sum\")\n\n//Add two wildly different sized floats\nvar result = twoSum(1e64, 1e-64)\nconsole.log(result)\n\n//Prints:\n//  [1e-64, 1e64]\n```\n\n## API\n\n### `require(\"two-sum\")(a, b[, result])`\nComputes a non-overlapping sequence representing the sum of a and b.\n\n* `a` is a number\n* `b` is a number\n* `result` is an optional length 2 array encoding the result of the sum of `a` and `b`\n\n**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.\n\n## Credits\nBased on an idea from JRS robust geometric predicates paper.\n\nImplementation (c) 2013 Mikola Lysenko.  MIT License","maintainers":[{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"}],"time":{"modified":"2022-06-28T00:28:18.985Z","created":"2013-09-18T16:10:34.816Z","0.0.0":"2013-09-18T16:11:07.701Z","0.1.0":"2013-09-18T16:46:54.509Z","1.0.0":"2014-04-27T15:01:16.881Z"},"author":{"name":"Mikola Lysenko"},"repository":{"type":"git","url":"git://github.com/mikolalysenko/two-sum.git"},"homepage":"https://github.com/mikolalysenko/two-sum","keywords":["two","sum","floating","point","robust","exact"],"bugs":{"url":"https://github.com/mikolalysenko/two-sum/issues"},"license":"MIT","readmeFilename":"README.md","users":{"fgribreau":true}}