{"_id":"robust-sum","_rev":"11-1758702b5b9f73c06a824d8a85899e31","name":"robust-sum","description":"Evaluates the sum of two nonoverlapping increasing sequences of floats","dist-tags":{"latest":"1.0.0"},"versions":{"0.0.0":{"name":"robust-sum","version":"0.0.0","description":"Evaluates the sum of two nonoverlapping increasing sequences of floats","main":"robust-sum.js","directories":{"test":"test"},"dependencies":{"two-sum":"~0.1.0","binary-merge":"~0.0.0"},"devDependencies":{"tape":"~1.1.0"},"scripts":{"test":"tap test/*.js"},"repository":{"type":"git","url":"git://github.com/mikolalysenko/robust-sum.git"},"keywords":["robust","sum","float","exact","nonoverlapping","shewchuk"],"author":{"name":"Mikola Lysenko"},"license":"MIT","bugs":{"url":"https://github.com/mikolalysenko/robust-sum/issues"},"_id":"robust-sum@0.0.0","dist":{"shasum":"d23581cb08e14ad07cdae84a03edbb938afae7ce","tarball":"https://registry.npmjs.org/robust-sum/-/robust-sum-0.0.0.tgz","integrity":"sha512-evrcTqjwkK+TIznAfDLvNLWdGtfon8BZDYFOJoxzwzA1xMp05lroSjQ974Xj6LX1gAAOeczveDnqCgKEHMJh+w==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDq9R8hxIqMdwZSC8rMN6V8SfIpj8BENb8T5ILSz6MN2AIgOx7+czHrcncf9ZgjfrDIPf+gDAG7yDMtHVCJVH83I1s="}]},"_from":".","_npmVersion":"1.3.8","_npmUser":{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"},"maintainers":[{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"}]},"0.0.2":{"name":"robust-sum","version":"0.0.2","description":"Evaluates the sum of two nonoverlapping increasing sequences of floats","main":"robust-sum.js","directories":{"test":"test"},"dependencies":{"two-sum":"~0.1.0","binary-merge":"~0.0.0"},"devDependencies":{"tape":"~1.1.0"},"scripts":{"test":"tap test/*.js"},"repository":{"type":"git","url":"git://github.com/mikolalysenko/robust-sum.git"},"keywords":["robust","sum","float","exact","nonoverlapping","shewchuk"],"author":{"name":"Mikola Lysenko"},"license":"MIT","bugs":{"url":"https://github.com/mikolalysenko/robust-sum/issues"},"_id":"robust-sum@0.0.2","dist":{"shasum":"71cb87b8971da1b1f7db46bd4efe9b6bd6b59264","tarball":"https://registry.npmjs.org/robust-sum/-/robust-sum-0.0.2.tgz","integrity":"sha512-fY5xA+eR4KKKa3YPer7FUHcYvfcf5osa1+4AeoUnmC6ab/uZMbAX6bAtZpA/40nFxWDtrnkyvLmscPj3FU6Xeg==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDC68leOUEW6/smWW2th4jkqP3r1tvrh3Tg5CNbTj1g7QIgHihJjg4qtvrGKvmTod4g25mXXzNB/0Rtq+2E4mi9PUE="}]},"_from":".","_npmVersion":"1.3.8","_npmUser":{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"},"maintainers":[{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"}]},"0.0.3":{"name":"robust-sum","version":"0.0.3","description":"Evaluates the sum of two nonoverlapping increasing sequences of floats","main":"robust-sum.js","directories":{"test":"test"},"dependencies":{"two-sum":"~0.1.0","binary-merge":"~0.0.0"},"devDependencies":{"tape":"~1.1.0"},"scripts":{"test":"tap test/*.js"},"repository":{"type":"git","url":"git://github.com/mikolalysenko/robust-sum.git"},"keywords":["robust","sum","float","exact","nonoverlapping","shewchuk"],"author":{"name":"Mikola Lysenko"},"license":"MIT","bugs":{"url":"https://github.com/mikolalysenko/robust-sum/issues"},"_id":"robust-sum@0.0.3","dist":{"shasum":"034dc293881a2629657a41f744b9871cad08d4be","tarball":"https://registry.npmjs.org/robust-sum/-/robust-sum-0.0.3.tgz","integrity":"sha512-/6QlaI29yN3JZS6w8WkA2765oIRb/bkSsyNyAHSTmb4r+mt4QF0kPZXQeOrNBUyfrbaP9cXc2kmNunonBeFDGg==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIGcJOaHDJr6R+/I3d393Z9e8U8RrkMrCVkl1Mky16UoMAiAGL+ciHMvmcsbgVdGBRDqunIborKpaQkxGDz2QUKnQkA=="}]},"_from":".","_npmVersion":"1.3.8","_npmUser":{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"},"maintainers":[{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"}]},"1.0.0":{"name":"robust-sum","version":"1.0.0","description":"Evaluates the sum of two nonoverlapping increasing sequences of floats","main":"robust-sum.js","directories":{"test":"test"},"dependencies":{},"devDependencies":{"tape":"^2.12.3","validate-robust-sequence":"^1.0.0"},"scripts":{"test":"tap test/*.js"},"repository":{"type":"git","url":"git://github.com/mikolalysenko/robust-sum.git"},"keywords":["robust","sum","float","exact","nonoverlapping","shewchuk"],"author":{"name":"Mikola Lysenko"},"license":"MIT","bugs":{"url":"https://github.com/mikolalysenko/robust-sum/issues"},"homepage":"https://github.com/mikolalysenko/robust-sum","_id":"robust-sum@1.0.0","dist":{"shasum":"16646e525292b4d25d82757a286955e0bbfa53d9","tarball":"https://registry.npmjs.org/robust-sum/-/robust-sum-1.0.0.tgz","integrity":"sha512-AvLExwpaqUqD1uwLU6MwzzfRdaI6VEZsyvQ3IAQ0ZJ08v1H+DTyqskrf2ZJyh0BDduFVLN7H04Zmc+qTiahhAw==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIBw+haeVFeD2XFqV28C03ctkBRlLzok0w8b1nwETbiWLAiBTIpGbG9OXdF4OdnBDBFo0IMyaqfEv9+8tgE78uUJ4lA=="}]},"_from":".","_npmVersion":"1.4.3","_npmUser":{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"},"maintainers":[{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"}]}},"readme":"robust-sum\n==========\nComputes the sum of two increasing non-overlapping sequences of floats as an increasing non-overlapping sequence.  This can be used to perform exact arithmetic calculations on floating point values.\n\nFor more information, see:\n\n* Jonathan Richard Shewchuk, [\"Adaptive precision floating-point arithmetic and fast robust geometric predicates\"](http://www.cs.cmu.edu/afs/cs/project/quake/public/papers/robust-arithmetic.ps). 1997\n\n## Install\n\n\t\tnpm install robust-sum\n\n## Example\n\n```javascript\nvar robustSum = require(\"robust-sum\")\n\nvar seq = robustSum([1, 64], [1e-64, 1e64])\nconsole.log(\"result = \", seq)\n```\n\n## API\n\n### `require(\"robust-sum\")(a, b)`\nComputes the sum of two non-overlapping increasing sequences of floats exactly as a non-overlapping increasing sequence of floats.\n\n* `a` is a non-overlapping sequence of floats that is increasing in magnitude\n* `b` is a non-overlapping sequence of floats that is increasing magnitude\n\n**Returns** A non-overlapping increasing sequence that encodes the result of `a+b`\n\n## Credits\nBased on JRS' robust geometric predicates for floating point arithmetic.\n\nImplementation (c) 2013 Mikola Lysenko. MIT License","maintainers":[{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"}],"time":{"modified":"2022-06-26T13:47:38.903Z","created":"2013-09-18T17:19:05.754Z","0.0.0":"2013-09-18T17:19:21.818Z","0.0.2":"2013-09-19T20:03:22.166Z","0.0.3":"2013-10-23T16:16:46.226Z","1.0.0":"2014-04-28T21:39:13.555Z"},"author":{"name":"Mikola Lysenko"},"repository":{"type":"git","url":"git://github.com/mikolalysenko/robust-sum.git"},"homepage":"https://github.com/mikolalysenko/robust-sum","keywords":["robust","sum","float","exact","nonoverlapping","shewchuk"],"bugs":{"url":"https://github.com/mikolalysenko/robust-sum/issues"},"license":"MIT","readmeFilename":"README.md"}