{"_id":"uniqs","_rev":"155932","name":"uniqs","description":"Tiny utility to create unions and de-duplicated lists","dist-tags":{"latest":"2.0.0"},"maintainers":[{"name":"fgnass","email":""}],"time":{"modified":"2021-06-03T11:36:19.000Z","created":"2014-06-01T22:05:39.648Z","2.0.0":"2014-06-03T08:28:57.628Z","1.0.0":"2014-06-01T22:05:39.648Z"},"users":{},"author":{"name":"Felix Gnass","email":"fgnass@gmail.com"},"repository":{"type":"git","url":"git://github.com/fgnass/uniqs.git"},"versions":{"2.0.0":{"name":"uniqs","version":"2.0.0","description":"Tiny utility to create unions and de-duplicated lists","keywords":["unique","uniq","dedupe","union"],"repository":{"type":"git","url":"git://github.com/fgnass/uniqs.git"},"main":"index.js","scripts":{"test":"node test"},"author":{"name":"Felix Gnass","email":"fgnass@gmail.com"},"license":"MIT","bugs":{"url":"https://github.com/fgnass/uniqs/issues"},"homepage":"https://github.com/fgnass/uniqs","_id":"uniqs@2.0.0","_shasum":"ffede4b36b25290696e6e165d4a59edb998e6b02","_from":".","_npmVersion":"1.4.9","_npmUser":{"name":"fgnass","email":"fgnass@gmail.com"},"maintainers":[{"name":"fgnass","email":""}],"dist":{"shasum":"ffede4b36b25290696e6e165d4a59edb998e6b02","size":1343,"noattachment":false,"key":"/uniqs/-/uniqs-2.0.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/uniqs/download/uniqs-2.0.0.tgz"},"directories":{},"publish_time":1401784137628,"_cnpm_publish_time":1401784137628,"_hasShrinkwrap":false},"1.0.0":{"name":"uniqs","version":"1.0.0","description":"Creates a de-duplicated version of a given list","keywords":["unique","uniq","dedupe"],"repository":{"type":"git","url":"git://github.com/fgnass/uniqs.git"},"main":"index.js","scripts":{"test":"node test"},"author":{"name":"Felix Gnass","email":"fgnass@gmail.com"},"license":"MIT","bugs":{"url":"https://github.com/fgnass/uniqs/issues"},"homepage":"https://github.com/fgnass/uniqs","_id":"uniqs@1.0.0","_shasum":"140dcbd7c2e5ea83e46dc3ded92736bc43dc4f22","_from":".","_npmVersion":"1.4.9","_npmUser":{"name":"fgnass","email":"fgnass@gmail.com"},"maintainers":[{"name":"fgnass","email":""}],"dist":{"shasum":"140dcbd7c2e5ea83e46dc3ded92736bc43dc4f22","size":1259,"noattachment":false,"key":"/uniqs/-/uniqs-1.0.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/uniqs/download/uniqs-1.0.0.tgz"},"directories":{},"publish_time":1401660339648,"_cnpm_publish_time":1401660339648,"_hasShrinkwrap":false}},"readme":"[![Build Status](https://travis-ci.org/fgnass/uniqs.svg?branch=master)](https://travis-ci.org/fgnass/uniqs)\n\n### Tiny utility to create unions and de-duplicated lists.\n\nExample:\n\n```js\nvar uniqs = require('uniqs');\n\nvar foo = { foo: 23 };\nvar list = [3, 2, 2, 1, foo, foo];\n\nuniqs(list);\n// => [3, 2, 1, { foo: 23 }]\n```\n\nYou can pass multiple lists to create a union:\n\n```js\nuniqs([2, 1, 1], [2, 3, 3, 4], [4, 3, 2]);\n// => [2, 1, 3, 4]\n```\n\nPassing individual items works too:\n```js\nuniqs(3, 2, 2, [1, 1, 2]);\n// => [3, 2, 1]\n```\n\n### Summary\n\n* Uniqueness is defined based on strict object equality.\n* The lists do not need to be sorted.\n* The resulting array contains the items in the order of their first appearance.\n\n### About\n\nThis package has been written to accompany utilities like\n[flatten](https://npmjs.org/package/flatten) as alternative to full-blown\nlibraries like underscore or lodash.\n\nThe implementation is optimized for simplicity rather than performance and\nlooks like this:\n\n```js\nmodule.exports = function uniqs() {\n  var list = Array.prototype.concat.apply([], arguments);\n  return list.filter(function(item, i) {\n    return i == list.indexOf(item);\n  });\n};\n```\n\n### License\nMIT\n","_attachments":{},"homepage":"https://github.com/fgnass/uniqs","bugs":{"url":"https://github.com/fgnass/uniqs/issues"},"license":"MIT"}