{
  "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",
  "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",
  "readmeFilename": "README.md",
  "bugs": {
    "url": "https://github.com/fgnass/uniqs/issues"
  },
  "_id": "uniqs@2.0.0",
  "dist": {
    "shasum": "620965c98a129d8b8af453c58f71799d4f8db2eb"
  },
  "_from": "uniqs@^2.0.0",
  "_resolved": "http://registry.npmjs.org/uniqs/-/uniqs-2.0.0.tgz"
}