{"maintainers":[{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"}],"keywords":["array","duplicate","unique","uniq","remove","sort","in","place","no","copy"],"dist-tags":{"latest":"1.0.1"},"author":{"name":"Mikola Lysenko"},"description":"Removes duplicates from a sorted array in place","readme":"uniq\n====\nRemoves all duplicates from an array in place.\n\nUsage\n=====\nFirst install using npm:\n\n    npm install uniq\n    \nThen use it as follows:\n\n```javascript\n\nvar arr = [1, 1, 2, 2, 3, 5]\n\nrequire(\"uniq\")(arr)\nconsole.log(arr)\n\n//Prints:\n//\n//  1,2,3,5\n//\n```\n\n## `require(\"uniq\")(array[, compare, sorted])`\nRemoves all duplicates from a sorted array in place.\n\n* `array` is the array to remove items from\n* `compare` is an optional comparison function that returns 0 when two items are equal, and something non-zero when they are different.  If unspecified, then the default equals will be used.\n* `sorted` if true, then assume array is already sorted\n\n**Returns:** A reference to `array`\n\n**Time Complexity:** `O(array.length * log(arra.length))` or `O(array.length)` if `sorted`\n\n\n## Why use this instead of underscore.uniq[ue]?\nA few reasons:\n\n* This library updates the array in place without making an extra copy (and so it is faster for large arrays)\n* It also accepts a custom comparison function so you can remove duplicates from arrays containing object\n* It is more modular in the sense that it doesn't come with a bazillion other utility grab bag functions.\n\n# Credits\n(c) 2013 Mikola Lysenko. MIT License\n","repository":{"type":"git","url":"git://github.com/mikolalysenko/uniq.git"},"users":{"supawaza":true,"pedroparra":true,"modao":true,"nickeltobias":true,"cfleschhut":true,"tobiasnickel":true,"benjaminaaron":true,"cslater":true,"klombomb":true,"nichoth":true,"bapinney":true,"diegorbaquero":true,"mrdain":true},"bugs":{"url":"https://github.com/mikolalysenko/uniq/issues"},"license":"MIT","versions":{"0.0.0":{"name":"uniq","version":"0.0.0","description":"Removes duplicates from a sorted array in place","main":"uniq.js","directories":{"test":"test"},"dependencies":{},"devDependencies":{"tap":"~0.4.0"},"scripts":{"test":"tap test/*.js"},"repository":{"type":"git","url":"git://github.com/mikolalysenko/uniq.git"},"keywords":["array","duplicate","unique","uniq","remove","sort","in","place","no","copy"],"author":{"name":"Mikola Lysenko"},"license":"MIT","gitHead":"e9828cfcb97e25a351f95b39fdf3c31876ff3985","_id":"uniq@0.0.0","dist":{"shasum":"cd8a2595661f6372f46077c03968d4d02c589d5b","tarball":"http://nexus.dui88.com:8081/nexus/content/groups/npm-all/uniq/-/uniq-0.0.0.tgz"},"_from":".","_npmVersion":"1.2.14","_npmUser":{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"},"maintainers":[{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"}]},"0.0.2":{"name":"uniq","version":"0.0.2","description":"Removes duplicates from a sorted array in place","main":"uniq.js","directories":{"test":"test"},"dependencies":{},"devDependencies":{"tap":"~0.4.0"},"scripts":{"test":"tap test/*.js"},"repository":{"type":"git","url":"git://github.com/mikolalysenko/uniq.git"},"keywords":["array","duplicate","unique","uniq","remove","sort","in","place","no","copy"],"author":{"name":"Mikola Lysenko"},"license":"MIT","gitHead":"e9828cfcb97e25a351f95b39fdf3c31876ff3985","_id":"uniq@0.0.2","dist":{"shasum":"614e868ba288651d351262369317acc43b901823","tarball":"http://nexus.dui88.com:8081/nexus/content/groups/npm-all/uniq/-/uniq-0.0.2.tgz"},"_from":".","_npmVersion":"1.2.14","_npmUser":{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"},"maintainers":[{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"}]},"1.0.0":{"name":"uniq","version":"1.0.0","description":"Removes duplicates from a sorted array in place","main":"uniq.js","directories":{"test":"test"},"dependencies":{},"devDependencies":{"tape":"^2.12.3"},"scripts":{"test":"tape test/*.js"},"repository":{"type":"git","url":"git://github.com/mikolalysenko/uniq.git"},"keywords":["array","duplicate","unique","uniq","remove","sort","in","place","no","copy"],"author":{"name":"Mikola Lysenko"},"license":"MIT","gitHead":"e9828cfcb97e25a351f95b39fdf3c31876ff3985","bugs":{"url":"https://github.com/mikolalysenko/uniq/issues"},"homepage":"https://github.com/mikolalysenko/uniq","_id":"uniq@1.0.0","dist":{"shasum":"43c3987e15b9168c0672ea044c5248a6530fa88c","tarball":"http://nexus.dui88.com:8081/nexus/content/groups/npm-all/uniq/-/uniq-1.0.0.tgz"},"_from":".","_npmVersion":"1.4.3","_npmUser":{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"},"maintainers":[{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"}]},"1.0.1":{"name":"uniq","version":"1.0.1","description":"Removes duplicates from a sorted array in place","main":"uniq.js","directories":{"test":"test"},"dependencies":{},"devDependencies":{"tape":"^2.12.3"},"scripts":{"test":"tape test/*.js"},"repository":{"type":"git","url":"git://github.com/mikolalysenko/uniq.git"},"keywords":["array","duplicate","unique","uniq","remove","sort","in","place","no","copy"],"author":{"name":"Mikola Lysenko"},"license":"MIT","gitHead":"e9828cfcb97e25a351f95b39fdf3c31876ff3985","bugs":{"url":"https://github.com/mikolalysenko/uniq/issues"},"homepage":"https://github.com/mikolalysenko/uniq","_id":"uniq@1.0.1","dist":{"shasum":"b31c5ae8254844a3a8281541ce2b04b865a734ff","tarball":"http://nexus.dui88.com:8081/nexus/content/groups/npm-all/uniq/-/uniq-1.0.1.tgz"},"_from":".","_npmVersion":"1.4.3","_npmUser":{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"},"maintainers":[{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"}]}},"name":"uniq","time":{"modified":"2017-05-24T19:26:38.937Z","created":"2013-03-24T14:46:48.969Z","0.0.0":"2013-03-24T14:46:50.077Z","0.0.2":"2013-03-31T02:52:34.961Z","1.0.0":"2014-04-29T01:02:39.921Z","1.0.1":"2014-05-25T21:15:56.656Z"},"readmeFilename":"README.md","homepage":"https://github.com/mikolalysenko/uniq"}