{"_id":"robust-compress","_rev":"4-3f5fedaad06111030b3b3d5361b3e2bf","name":"robust-compress","description":"Compress a robust sequence","dist-tags":{"latest":"1.0.0"},"versions":{"1.0.0":{"name":"robust-compress","version":"1.0.0","description":"Compress a robust sequence","main":"compress.js","directories":{"test":"test"},"dependencies":{},"devDependencies":{"robust-scale":"^1.0.2","robust-sequence-to-fixed-point":"^2.0.0","tape":"^2.12.3"},"scripts":{"test":"tape test/*.js"},"repository":{"type":"git","url":"git://github.com/mikolalysenko/robust-compress.git"},"keywords":["robust","predicate","floating","point","normalize","compress"],"author":{"name":"Mikola Lysenko"},"license":"MIT","bugs":{"url":"https://github.com/mikolalysenko/robust-compress/issues"},"homepage":"https://github.com/mikolalysenko/robust-compress","_id":"robust-compress@1.0.0","dist":{"shasum":"4cf62c4b318d8308516012bb8c11752f39329b1b","tarball":"https://registry.npmjs.org/robust-compress/-/robust-compress-1.0.0.tgz","integrity":"sha512-E8btSpQ6zZr7LvRLrLvb+N5rwQ0etUbsXFKv5NQj6TVK6RYT00Qg9iVFvIWR+GxXUvpes7FDN0WfXa3l7wtGOw==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCeKen4P020QakSEz4L8Nx1/pA9yQzvkhzZzf7wfRUcmgIgfjP0bmdpX3r5YGpGJVg88/wlsth9+98ffd1TD1MXtZM="}]},"_from":".","_npmVersion":"1.4.3","_npmUser":{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"},"maintainers":[{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"}]}},"readme":"robust-compress\n===============\nQuickly compress a non-overlapping increasing sequence.  This does not normalize the sequence, but can be useful in some situations.  Based on the algorithm in:\n\nJonathan Shewchuk, [\"Adaptive precision floating-point arithmetic and fast robust predicates for computational geometry\"](http://www.cs.cmu.edu/~quake/robust.html)\n\n# Example\n\n```javascript\nvar compress = require(\"robust-compress\")\n\nvar seq = [1, 2]\n\ncompress(seq)\n\nconsole.log(seq)\n```\n\nOutput:\n\n```javascript\n[ 3 ]\n```\n\n# Install\n\n```\nnpm install robust-compress\n```\n\n# API\n\n#### `require(\"robust-compress\")(seq)`\nApproximately compress a non-overlapping increasing floating point expansion in place.\n\n* `seq` is a robust sequence\n\n**Returns** `seq`\n\n**Note** This method updates `seq` in place\n\n# Credits\n(c) 2014 Mikola Lysenko.  MIT License","maintainers":[{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"}],"time":{"modified":"2022-06-26T13:47:15.892Z","created":"2014-05-06T17:37:09.258Z","1.0.0":"2014-05-06T17:37:09.258Z"},"homepage":"https://github.com/mikolalysenko/robust-compress","keywords":["robust","predicate","floating","point","normalize","compress"],"repository":{"type":"git","url":"git://github.com/mikolalysenko/robust-compress.git"},"author":{"name":"Mikola Lysenko"},"bugs":{"url":"https://github.com/mikolalysenko/robust-compress/issues"},"license":"MIT","readmeFilename":"README.md"}