%PDF- %PDF-
Direktori : /home/opti/.npm/registry.npmjs.org/array-unique/ |
Current File : /home/opti/.npm/registry.npmjs.org/array-unique/.cache.json |
{"_id":"array-unique","_rev":"17-90fa2c3e850b0292a322ef3bbfa60499","name":"array-unique","time":{"modified":"2018-02-07T18:31:22.178Z","created":"2014-11-30T11:13:25.550Z","0.1.0":"2014-11-30T11:13:25.550Z","0.1.1":"2014-12-02T08:07:45.813Z","0.2.0":"2015-03-11T04:22:47.615Z","0.2.1":"2015-03-25T03:47:09.823Z","0.3.2":"2016-08-01T00:54:49.804Z"},"maintainers":[{"email":"brian.woodward@gmail.com","name":"doowb"},{"email":"github@sellside.com","name":"jonschlinkert"}],"dist-tags":{"latest":"0.3.2"},"description":"Remove duplicate values from an array. Fastest ES5 implementation.","readme":"# array-unique [](https://www.npmjs.com/package/array-unique) [](https://npmjs.org/package/array-unique) [](https://travis-ci.org/jonschlinkert/array-unique)\n\nRemove duplicate values from an array. Fastest ES5 implementation.\n\n## Install\n\nInstall with [npm](https://www.npmjs.com/):\n\n```sh\n$ npm install --save array-unique\n```\n\n## Usage\n\n```js\nvar unique = require('array-unique');\n\nvar arr = ['a', 'b', 'c', 'c'];\nconsole.log(unique(arr)) //=> ['a', 'b', 'c']\nconsole.log(arr) //=> ['a', 'b', 'c']\n\n/* The above modifies the input array. To prevent that at a slight performance cost: */\nvar unique = require(\"array-unique\").immutable;\n\nvar arr = ['a', 'b', 'c', 'c'];\nconsole.log(unique(arr)) //=> ['a', 'b', 'c']\nconsole.log(arr) //=> ['a', 'b', 'c', 'c']\n```\n\n## About\n\n### Related projects\n\n* [arr-diff](https://www.npmjs.com/package/arr-diff): Returns an array with only the unique values from the first array, by excluding all… [more](https://github.com/jonschlinkert/arr-diff) | [homepage](https://github.com/jonschlinkert/arr-diff \"Returns an array with only the unique values from the first array, by excluding all values from additional arrays using strict equality for comparisons.\")\n* [arr-flatten](https://www.npmjs.com/package/arr-flatten): Recursively flatten an array or arrays. This is the fastest implementation of array flatten. | [homepage](https://github.com/jonschlinkert/arr-flatten \"Recursively flatten an array or arrays. This is the fastest implementation of array flatten.\")\n* [arr-map](https://www.npmjs.com/package/arr-map): Faster, node.js focused alternative to JavaScript's native array map. | [homepage](https://github.com/jonschlinkert/arr-map \"Faster, node.js focused alternative to JavaScript's native array map.\")\n* [arr-pluck](https://www.npmjs.com/package/arr-pluck): Retrieves the value of a specified property from all elements in the collection. | [homepage](https://github.com/jonschlinkert/arr-pluck \"Retrieves the value of a specified property from all elements in the collection.\")\n* [arr-reduce](https://www.npmjs.com/package/arr-reduce): Fast array reduce that also loops over sparse elements. | [homepage](https://github.com/jonschlinkert/arr-reduce \"Fast array reduce that also loops over sparse elements.\")\n* [arr-union](https://www.npmjs.com/package/arr-union): Combines a list of arrays, returning a single array with unique values, using strict equality… [more](https://github.com/jonschlinkert/arr-union) | [homepage](https://github.com/jonschlinkert/arr-union \"Combines a list of arrays, returning a single array with unique values, using strict equality for comparisons.\")\n\n### Contributing\n\nPull requests and stars are always welcome. For bugs and feature requests, [please create an issue](../../issues/new).\n\n### Building docs\n\n_(This document was generated by [verb-generate-readme](https://github.com/verbose/verb-generate-readme) (a [verb](https://github.com/verbose/verb) generator), please don't edit the readme directly. Any changes to the readme must be made in [.verb.md](.verb.md).)_\n\nTo generate the readme and API documentation with [verb](https://github.com/verbose/verb):\n\n```sh\n$ npm install -g verb verb-generate-readme && verb\n```\n\n### Running tests\n\nInstall dev dependencies:\n\n```sh\n$ npm install -d && npm test\n```\n\n### Author\n\n**Jon Schlinkert**\n\n* [github/jonschlinkert](https://github.com/jonschlinkert)\n* [twitter/jonschlinkert](http://twitter.com/jonschlinkert)\n\n### License\n\nCopyright © 2016, [Jon Schlinkert](https://github.com/jonschlinkert).\nReleased under the [MIT license](https://github.com/jonschlinkert/array-unique/blob/master/LICENSE).\n\n***\n\n_This file was generated by [verb-generate-readme](https://github.com/verbose/verb-generate-readme), v0.1.28, on July 31, 2016._","versions":{"0.1.1":{"name":"array-unique","description":"Return an array free of duplicate values. Fastest ES5 implementation.","version":"0.1.1","homepage":"https://github.com/jonschlinkert/array-unique","author":{"name":"Jon Schlinkert","url":"https://github.com/jonschlinkert"},"repository":{"type":"git","url":"git://github.com/jonschlinkert/array-unique.git"},"bugs":{"url":"https://github.com/jonschlinkert/array-unique/issues"},"license":{"type":"MIT","url":"https://github.com/jonschlinkert/array-unique/blob/master/LICENSE-MIT"},"main":"index.js","engines":{"node":">=0.10.0"},"scripts":{"test":"mocha -R spec"},"devDependencies":{"mocha":"*","should":"*"},"keywords":[],"_id":"array-unique@0.1.1","_shasum":"b2dc8ec765d306537d7291e0e621e849d2573cf9","_from":".","_npmVersion":"1.4.9","_npmUser":{"name":"jonschlinkert","email":"github@sellside.com"},"maintainers":[{"name":"jonschlinkert","email":"github@sellside.com"}],"dist":{"shasum":"b2dc8ec765d306537d7291e0e621e849d2573cf9","tarball":"https://registry.npmjs.org/array-unique/-/array-unique-0.1.1.tgz"},"directories":{}},"0.2.0":{"name":"array-unique","description":"Return an array free of duplicate values. Fastest ES5 implementation.","version":"0.2.0","homepage":"https://github.com/jonschlinkert/array-unique","author":{"name":"Jon Schlinkert","url":"https://github.com/jonschlinkert"},"repository":{"type":"git","url":"git://github.com/jonschlinkert/array-unique.git"},"bugs":{"url":"https://github.com/jonschlinkert/array-unique/issues"},"license":{"type":"MIT","url":"https://github.com/jonschlinkert/array-unique/blob/master/LICENSE"},"files":["index.js"],"main":"index.js","engines":{"node":">=0.10.0"},"scripts":{"test":"mocha"},"devDependencies":{"array-uniq":"^1.0.2","benchmarked":"^0.1.3","mocha":"*","should":"*"},"gitHead":"36fde8e586fb7cf880b8b3aa6515df889e64ed85","_id":"array-unique@0.2.0","_shasum":"11e98cdbf6ac402c26c227a1bd3c27b9abcdf3b0","_from":".","_npmVersion":"2.5.1","_nodeVersion":"0.12.0","_npmUser":{"name":"jonschlinkert","email":"github@sellside.com"},"maintainers":[{"name":"jonschlinkert","email":"github@sellside.com"}],"dist":{"shasum":"11e98cdbf6ac402c26c227a1bd3c27b9abcdf3b0","tarball":"https://registry.npmjs.org/array-unique/-/array-unique-0.2.0.tgz"},"directories":{}},"0.2.1":{"name":"array-unique","description":"Return an array free of duplicate values. Fastest ES5 implementation.","version":"0.2.1","homepage":"https://github.com/jonschlinkert/array-unique","author":{"name":"Jon Schlinkert","url":"https://github.com/jonschlinkert"},"repository":{"type":"git","url":"git://github.com/jonschlinkert/array-unique.git"},"bugs":{"url":"https://github.com/jonschlinkert/array-unique/issues"},"license":{"type":"MIT","url":"https://github.com/jonschlinkert/array-unique/blob/master/LICENSE"},"files":["index.js"],"main":"index.js","engines":{"node":">=0.10.0"},"scripts":{"test":"mocha"},"devDependencies":{"array-uniq":"^1.0.2","benchmarked":"^0.1.3","mocha":"*","should":"*"},"gitHead":"36fde8e586fb7cf880b8b3aa6515df889e64ed85","_id":"array-unique@0.2.1","_shasum":"a1d97ccafcbc2625cc70fadceb36a50c58b01a53","_from":".","_npmVersion":"2.7.1","_nodeVersion":"1.6.2","_npmUser":{"name":"jonschlinkert","email":"github@sellside.com"},"maintainers":[{"name":"jonschlinkert","email":"github@sellside.com"}],"dist":{"shasum":"a1d97ccafcbc2625cc70fadceb36a50c58b01a53","tarball":"https://registry.npmjs.org/array-unique/-/array-unique-0.2.1.tgz"},"directories":{}},"0.3.2":{"name":"array-unique","description":"Remove duplicate values from an array. Fastest ES5 implementation.","version":"0.3.2","homepage":"https://github.com/jonschlinkert/array-unique","author":{"name":"Jon Schlinkert","url":"https://github.com/jonschlinkert"},"repository":{"type":"git","url":"git+https://github.com/jonschlinkert/array-unique.git"},"bugs":{"url":"https://github.com/jonschlinkert/array-unique/issues"},"license":"MIT","files":["index.js","LICENSE","README.md"],"main":"index.js","engines":{"node":">=0.10.0"},"scripts":{"test":"mocha"},"devDependencies":{"array-uniq":"^1.0.2","benchmarked":"^0.1.3","gulp-format-md":"^0.1.9","mocha":"^2.5.3","should":"^10.0.0"},"keywords":["array","unique"],"verb":{"toc":false,"layout":"default","tasks":["readme"],"plugins":["gulp-format-md"],"related":{"list":["arr-diff","arr-union","arr-flatten","arr-reduce","arr-map","arr-pluck"]},"reflinks":["verb","verb-generate-readme"],"lint":{"reflinks":true}},"gitHead":"d95d18b0d3188fb95d3c6c2bf349b2ed926b563b","_id":"array-unique@0.3.2","_shasum":"a894b75d4bc4f6cd679ef3244a9fd8f46ae2d428","_from":".","_npmVersion":"3.10.3","_nodeVersion":"6.3.0","_npmUser":{"name":"jonschlinkert","email":"github@sellside.com"},"maintainers":[{"name":"jonschlinkert","email":"github@sellside.com"},{"name":"doowb","email":"brian.woodward@gmail.com"}],"dist":{"shasum":"a894b75d4bc4f6cd679ef3244a9fd8f46ae2d428","tarball":"https://registry.npmjs.org/array-unique/-/array-unique-0.3.2.tgz"},"_npmOperationalInternal":{"host":"packages-16-east.internal.npmjs.com","tmp":"tmp/array-unique-0.3.2.tgz_1470012889222_0.35436262167058885"},"directories":{}}},"homepage":"https://github.com/jonschlinkert/array-unique","repository":{"type":"git","url":"git+https://github.com/jonschlinkert/array-unique.git"},"author":{"name":"Jon Schlinkert","url":"https://github.com/jonschlinkert"},"bugs":{"url":"https://github.com/jonschlinkert/array-unique/issues"},"license":"MIT","readmeFilename":"README.md","users":{"vlazar":true,"vonthar":true,"rocket0191":true,"simonja":true},"keywords":["array","unique"],"_attachments":{},"_etag":"W/\"69afcb7500beeda85833fc889e0baeec\"","_lastModified":"Sat, 26 May 2018 17:22:35 GMT"}