{"_id":"robust-product","_rev":"7-7cc62e9e9fc042b0c6add99ab104df1a","name":"robust-product","description":"Exactly multiplies two non-overlapping increasing sequences","dist-tags":{"latest":"1.0.0"},"versions":{"0.0.0":{"name":"robust-product","version":"0.0.0","description":"Exactly multiplies two non-overlapping increasing sequences","main":"product.js","directories":{"test":"test"},"dependencies":{"robust-scale":"~0.0.3","robust-sum":"~0.0.2"},"devDependencies":{"tap":"~0.4.4","tape":"~1.1.1"},"scripts":{"test":"tap test/*.js"},"repository":{"type":"git","url":"git://github.com/mikolalysenko/robust-product.git"},"keywords":["exact","arithmetic","float"],"author":{"name":"Mikola Lysenko"},"license":"MIT","bugs":{"url":"https://github.com/mikolalysenko/robust-product/issues"},"_id":"robust-product@0.0.0","dist":{"shasum":"fcb2711f7c58c26ad792872e6bf36ca53af7b077","tarball":"https://registry.npmjs.org/robust-product/-/robust-product-0.0.0.tgz","integrity":"sha512-sUjrkMHfao1P0DhBulYqjov6hohbfaxXJMr5IFn9NaT7uNc5uveN5asVHh91dPSfYmt3prYSSiiIuS+yUvNcWA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDwEjF515/2vsOKe/YvWk3nCbil1ZpJ+5KcZMM8tMlKAAIgFwvaeJhYSybzNLAwN3Ma1ZZm2GPpaRP6FcrGQ9UaMuk="}]},"_from":".","_npmVersion":"1.3.8","_npmUser":{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"},"maintainers":[{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"}]},"1.0.0":{"name":"robust-product","version":"1.0.0","description":"Exactly multiplies two non-overlapping increasing sequences","main":"product.js","directories":{"test":"test"},"dependencies":{"robust-scale":"^1.0.0","robust-sum":"^1.0.0"},"devDependencies":{"tape":"^2.12.3"},"scripts":{"test":"tape test/*.js"},"repository":{"type":"git","url":"git://github.com/mikolalysenko/robust-product.git"},"keywords":["exact","arithmetic","float"],"author":{"name":"Mikola Lysenko"},"license":"MIT","bugs":{"url":"https://github.com/mikolalysenko/robust-product/issues"},"homepage":"https://github.com/mikolalysenko/robust-product","_id":"robust-product@1.0.0","dist":{"shasum":"685250007cdbba7cf1de75bff6d2927011098abe","tarball":"https://registry.npmjs.org/robust-product/-/robust-product-1.0.0.tgz","integrity":"sha512-7ww6m+ICW6Dt7ylHVy1aeeNwTfMXfh2BHqHVNE+CHvrU9sI97Vb6uHnid0MN3I9afTI5DXOB7q4SQa2fxuo2Gw==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCvukfcs6erZVaBklBVN78v0uGtwY/nO7IBRCepOVcRFAIhANBn8aTFr0WYDjbKnL2eF4lZZhPu+DpYrTkTQ8peDY3n"}]},"_from":".","_npmVersion":"1.4.3","_npmUser":{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"},"maintainers":[{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"}]}},"readme":"robust-product\n==============\nComputes the product of two non-overlapping increasing sequences exactly.\n\n## Install\n\n    npm install robust-product\n\n## Example\n\n```javascript\nvar robustProduct = require(\"robust-product\")\n\nvar a = [ Math.pow(2, -50), Math.pow(2, 50) ]\n\nvar b = robustProduct(a,a)\n\n//Now:\n//\n//    b == [ Math.pow(2, -100), 2.0, Math.pow(2, 100) ]\n//\n```\n\n## API\n\n### `require(\"robust-product\")(a, b)`\nMultiplies `a` and `b` together exactly.\n\n* `a`, `b` are both non-overlapping increasing sequences\n\n**Returns** A non-overlapping increasing sequence representing the product of `a` and `b`\n\n## Credits\n(c) 2013 Mikola Lysenko. MIT License","maintainers":[{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"}],"time":{"modified":"2022-06-26T13:47:31.898Z","created":"2013-10-05T22:55:23.618Z","0.0.0":"2013-10-05T22:55:24.945Z","1.0.0":"2014-04-28T22:30:17.877Z"},"author":{"name":"Mikola Lysenko"},"repository":{"type":"git","url":"git://github.com/mikolalysenko/robust-product.git"},"homepage":"https://github.com/mikolalysenko/robust-product","keywords":["exact","arithmetic","float"],"bugs":{"url":"https://github.com/mikolalysenko/robust-product/issues"},"license":"MIT","readmeFilename":"README.md"}