{"_id":"intersect","_rev":"160768","name":"intersect","description":"Find the intersection of two arrays","dist-tags":{"latest":"1.0.1"},"maintainers":[{"name":"juliangruber","email":"julian@juliangruber.com"}],"time":{"modified":"2021-06-03T11:39:59.000Z","created":"2013-04-11T07:53:15.712Z","1.0.1":"2015-03-10T07:13:46.285Z","1.0.0":"2015-03-06T10:36:58.203Z","0.1.0":"2013-11-25T20:13:18.970Z","0.0.3":"2013-04-16T06:34:15.342Z","0.0.2":"2013-04-16T06:31:49.471Z","0.0.1":"2013-04-16T06:25:12.609Z","0.0.0":"2013-04-11T07:53:15.712Z"},"users":{"itonyyo":true,"ramiroespada":true},"author":{"name":"Julian Gruber","email":"mail@juliangruber.com","url":"http://juliangruber.com"},"repository":{"type":"git","url":"git://github.com/juliangruber/intersect.git"},"versions":{"1.0.1":{"name":"intersect","description":"Find the intersection of two arrays","version":"1.0.1","repository":{"type":"git","url":"git://github.com/juliangruber/intersect.git"},"homepage":"https://github.com/juliangruber/intersect","main":"index.js","scripts":{"test":"tape test/*.js"},"dependencies":{},"devDependencies":{"tape":"~2.3.0"},"keywords":["intersect","array"],"author":{"name":"Julian Gruber","email":"mail@juliangruber.com","url":"http://juliangruber.com"},"license":"MIT","testling":{"files":"test/*.js","browsers":["ie/6..latest","chrome/20..latest","firefox/10..latest","safari/5.0.5..latest","opera/11.0..latest","iphone/6","ipad/6"]},"gitHead":"0a48f9fa15a8cba97a2e381984042a8f4c392d8a","bugs":{"url":"https://github.com/juliangruber/intersect/issues"},"_id":"intersect@1.0.1","_shasum":"332650e10854d8c0ac58c192bdc27a8bf7e7a30c","_from":".","_npmVersion":"2.6.1","_nodeVersion":"0.10.36","_npmUser":{"name":"juliangruber","email":"julian@juliangruber.com"},"maintainers":[{"name":"juliangruber","email":"julian@juliangruber.com"}],"dist":{"shasum":"332650e10854d8c0ac58c192bdc27a8bf7e7a30c","size":2864,"noattachment":false,"key":"/intersect/-/intersect-1.0.1.tgz","tarball":"http://registry.cnpm.dingdandao.com/intersect/download/intersect-1.0.1.tgz"},"directories":{},"publish_time":1425971626285,"_cnpm_publish_time":1425971626285,"_hasShrinkwrap":false},"1.0.0":{"name":"intersect","description":"Find the intersection of two arrays","version":"1.0.0","repository":{"type":"git","url":"git://github.com/juliangruber/intersect.git"},"homepage":"https://github.com/juliangruber/intersect","main":"index.js","scripts":{"test":"tape test/*.js"},"dependencies":{},"devDependencies":{"tape":"~2.3.0"},"keywords":["intersect","array"],"author":{"name":"Julian Gruber","email":"mail@juliangruber.com","url":"http://juliangruber.com"},"license":"MIT","testling":{"files":"test/*.js","browsers":["ie/6..latest","chrome/20..latest","firefox/10..latest","safari/5.0.5..latest","opera/11.0..latest","iphone/6","ipad/6"]},"gitHead":"cbc27a317837bb6aa98ce37be06a418cce707308","bugs":{"url":"https://github.com/juliangruber/intersect/issues"},"_id":"intersect@1.0.0","_shasum":"1b7dc695c1255aa154445cdfb18c30071a0b3ef4","_from":".","_npmVersion":"2.6.1","_nodeVersion":"0.10.36","_npmUser":{"name":"juliangruber","email":"julian@juliangruber.com"},"maintainers":[{"name":"juliangruber","email":"julian@juliangruber.com"}],"dist":{"shasum":"1b7dc695c1255aa154445cdfb18c30071a0b3ef4","size":2817,"noattachment":false,"key":"/intersect/-/intersect-1.0.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/intersect/download/intersect-1.0.0.tgz"},"directories":{},"publish_time":1425638218203,"_cnpm_publish_time":1425638218203,"_hasShrinkwrap":false},"0.1.0":{"name":"intersect","description":"Find the intersection of two arrays","version":"0.1.0","repository":{"type":"git","url":"git://github.com/juliangruber/intersect.git"},"homepage":"https://github.com/juliangruber/intersect","main":"index.js","scripts":{"test":"tape test/*.js"},"dependencies":{},"devDependencies":{"tape":"~2.3.0"},"keywords":["intersect","array"],"author":{"name":"Julian Gruber","email":"mail@juliangruber.com","url":"http://juliangruber.com"},"license":"MIT","testling":{"files":"test/*.js","browsers":["ie/6..latest","chrome/20..latest","firefox/10..latest","safari/5.0.5..latest","opera/11.0..latest","iphone/6","ipad/6"]},"readmeFilename":"README.md","bugs":{"url":"https://github.com/juliangruber/intersect/issues"},"_id":"intersect@0.1.0","dist":{"shasum":"01a651345bd55a7be50ae2f0f7257f8ba1142ccb","size":2026,"noattachment":false,"key":"/intersect/-/intersect-0.1.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/intersect/download/intersect-0.1.0.tgz"},"_from":".","_npmVersion":"1.3.11","_npmUser":{"name":"juliangruber","email":"julian@juliangruber.com"},"maintainers":[{"name":"juliangruber","email":"julian@juliangruber.com"}],"directories":{},"publish_time":1385410398970,"_cnpm_publish_time":1385410398970,"_hasShrinkwrap":false},"0.0.3":{"name":"intersect","description":"Find the intersection of two arrays","version":"0.0.3","repository":{"type":"git","url":"git://github.com/juliangruber/intersect.git"},"homepage":"https://github.com/juliangruber/intersect","main":"index.js","scripts":{"test":"tape test/*.js"},"dependencies":{},"devDependencies":{"tape":"~0.3.3"},"keywords":["interset","array"],"author":{"name":"Julian Gruber","email":"mail@juliangruber.com","url":"http://juliangruber.com"},"license":"MIT","testling":{"files":"test/*.js","browsers":["ie/6..latest","chrome/20..latest","firefox/10..latest","safari/5.0.5..latest","opera/11.0..latest","iphone/6","ipad/6"]},"readmeFilename":"README.md","_id":"intersect@0.0.3","dist":{"shasum":"c1a4a5e5eac6ede4af7504cc07e0ada7bc9f4920","size":1714,"noattachment":false,"key":"/intersect/-/intersect-0.0.3.tgz","tarball":"http://registry.cnpm.dingdandao.com/intersect/download/intersect-0.0.3.tgz"},"_from":".","_npmVersion":"1.2.14","_npmUser":{"name":"juliangruber","email":"julian@juliangruber.com"},"maintainers":[{"name":"juliangruber","email":"julian@juliangruber.com"}],"directories":{},"publish_time":1366094055342,"_cnpm_publish_time":1366094055342,"_hasShrinkwrap":false},"0.0.2":{"name":"intersect","description":"Find the intersection of two arrays","version":"0.0.2","repository":{"type":"git","url":"git://github.com/juliangruber/intersect.git"},"homepage":"https://github.com/juliangruber/intersect","main":"index.js","scripts":{"test":"tape test/*.js"},"dependencies":{},"devDependencies":{"tape":"~0.3.3"},"keywords":["interset","array"],"author":{"name":"Julian Gruber","email":"mail@juliangruber.com","url":"http://juliangruber.com"},"license":"MIT","testling":{"files":"test/*.js","browsers":["ie/6..latest","chrome/20..latest","firefox/10..latest","safari/5.0.5..latest","opera/11.0..latest","iphone/6","ipad/6"]},"readmeFilename":"README.md","_id":"intersect@0.0.2","dist":{"shasum":"a1498cf5f5d57aca7bcfad97a0cae7842873a8d5","size":1708,"noattachment":false,"key":"/intersect/-/intersect-0.0.2.tgz","tarball":"http://registry.cnpm.dingdandao.com/intersect/download/intersect-0.0.2.tgz"},"_from":".","_npmVersion":"1.2.14","_npmUser":{"name":"juliangruber","email":"julian@juliangruber.com"},"maintainers":[{"name":"juliangruber","email":"julian@juliangruber.com"}],"directories":{},"publish_time":1366093909471,"_cnpm_publish_time":1366093909471,"_hasShrinkwrap":false},"0.0.1":{"name":"intersect","description":"Find the intersection of two arrays","version":"0.0.1","repository":{"type":"git","url":"git://github.com/juliangruber/intersect.git"},"homepage":"https://github.com/juliangruber/intersect","main":"index.js","scripts":{"test":"tape test/*.js"},"dependencies":{},"devDependencies":{"tape":"~0.3.3"},"keywords":["interset","array"],"author":{"name":"Julian Gruber","email":"mail@juliangruber.com","url":"http://juliangruber.com"},"license":"MIT","testling":{"files":"test/*.js","browsers":["ie/6..latest","chrome/20..latest","firefox/10..latest","safari/5.0.5..latest","opera/11.0..latest","iphone/6","ipad/6"]},"readmeFilename":"README.md","_id":"intersect@0.0.1","dist":{"shasum":"4169d7976fdc8317095764484b71f8ea3a65c927","size":1670,"noattachment":false,"key":"/intersect/-/intersect-0.0.1.tgz","tarball":"http://registry.cnpm.dingdandao.com/intersect/download/intersect-0.0.1.tgz"},"_from":".","_npmVersion":"1.2.14","_npmUser":{"name":"juliangruber","email":"julian@juliangruber.com"},"maintainers":[{"name":"juliangruber","email":"julian@juliangruber.com"}],"directories":{},"publish_time":1366093512609,"_cnpm_publish_time":1366093512609,"_hasShrinkwrap":false},"0.0.0":{"name":"intersect","description":"Find the intersection of two arrays","version":"0.0.0","repository":{"type":"git","url":"git://github.com/juliangruber/intersect.git"},"homepage":"https://github.com/juliangruber/intersect","main":"index.js","scripts":{"test":"tap test/*.js"},"dependencies":{},"devDependencies":{"tap":"*"},"keywords":["interset","array"],"author":{"name":"Julian Gruber","email":"mail@juliangruber.com","url":"http://juliangruber.com"},"license":"MIT","readmeFilename":"README.md","_id":"intersect@0.0.0","dist":{"shasum":"951af1c32a3014ce774035f164fe483f9bc3c46e","size":1480,"noattachment":false,"key":"/intersect/-/intersect-0.0.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/intersect/download/intersect-0.0.0.tgz"},"_from":".","_npmVersion":"1.2.14","_npmUser":{"name":"juliangruber","email":"julian@juliangruber.com"},"maintainers":[{"name":"juliangruber","email":"julian@juliangruber.com"}],"directories":{},"publish_time":1365666795712,"_cnpm_publish_time":1365666795712,"_hasShrinkwrap":false}},"readme":"\n# intersect\n\n[![build status](https://secure.travis-ci.org/juliangruber/intersect.svg)](http://travis-ci.org/juliangruber/intersect)\n[![downloads](https://img.shields.io/npm/dm/intersect.svg)](https://www.npmjs.org/package/intersect)\n\n[![browser support](https://ci.testling.com/juliangruber/intersect.png)](https://ci.testling.com/juliangruber/intersect)\n\n## Usage\n\n```js\nvar intersect = require('intersect');\n\nvar a = ['foo', 'bar', 'baz'];\nvar b = ['nope', 'bar', 'baz'];\n\nconsole.log(intersect(a, b));\n// => ['bar', 'baz']\n```\n\n## Installation\n\nWith [npm](http://npmjs.org) do\n\n```bash\n$ npm install intersect\n```\n\nWith [component](https://github.com/component/component) do\n\n```bash\n$ component install juliangruber/intersect\n```\n\n## API\n\n### intersect(a, b)\n\nFind the intersection of arrays `a` and `b`. The individual arrays are expected to be sets, i.e. there's no duplicate elements in them.\n\n### intersect(arrays)\n\nYou can also pass an array of arrays as a single argument, to get the intersection of `n` arrays.\n\n### intersect.big(a, b)\n\nThis module contains an alternative intersection algorithm by @minuteman3, better suited for intersecting big arrays.\n\nThe implementations *might* compare like this, depending on your host environment:\n\n![graph of intersect](http://minuteman3.github.io/minuteman3/graph.svg)\n\n## License\n\n(MIT)\n\nCopyright (c) 2013 Julian Gruber <julian@juliangruber.com>\n\nPermission is hereby granted, free of charge, to any person obtaining a copy of\nthis software and associated documentation files (the \"Software\"), to deal in\nthe Software without restriction, including without limitation the rights to\nuse, copy, modify, merge, publish, distribute, sublicense, and/or sell copies\nof the Software, and to permit persons to whom the Software is furnished to do\nso, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n","_attachments":{},"homepage":"https://github.com/juliangruber/intersect","bugs":{"url":"https://github.com/juliangruber/intersect/issues"},"license":"MIT"}