{"dist":{"shasum":"9bfe256c83c25ef82eb76d36718b8496fe722bb9","tarball":"https://registry.npmjs.org/binary-merge/-/binary-merge-0.0.0.tgz","integrity":"sha512-lIwhI2w7XY0dVIAl8a4HF7zB6xQmOqNKUin2nYBUpK53nhvNH9paggbfJoB5huh7CfDXcaTeyjZRUAgQLNDeVQ==","signatures":[{"sig":"MEYCIQDguCo/pBqGSYSNzE2/wZWQmbbNY5ne1sdPuuC4mo7IwgIhAMhL73El3dSrUD6PxY0IogEssWZCitweiep7RqSh5VtE","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}]},"main":"merge2.js","name":"binary-merge","_from":".","author":{"name":"Mikola Lysenko"},"readme":"binary-merge\n============\n[Merges a pair of sorted arrays.](http://en.wikipedia.org/wiki/Merge_algorithm)\n\nUse\n===\nFirst install via npm:\n\n    npm install binary-merge\n    \nThen you can use the algorithm as follows:\n\n\n```javascript\nvar merge = require(\"binary-merge\")\n\n\nconsole.log(merge([1,3,7], [2,4,6]))\n\n// Prints:\n//\n//    1,2,3,4,6,7\n//\n```\n\nCredits\n=======\n(c) 2013 Mikola Lysenko. MIT License\n","gitHead":"d0437e857a9c9e2f22732b6abed1d49e94623b87","license":"MIT","scripts":{"test":"tap test/*.js"},"_npmUser":{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"},"keywords":["binary","merge","sort","sorting","sorted","array","algorithm"],"repository":{"url":"git://github.com/mikolalysenko/binary-merge.git","type":"git"},"_npmVersion":"1.2.14","description":"2-way merge","directories":{"test":"test"},"maintainers":[{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"}],"dependencies":{},"readmeFilename":"README.md","devDependencies":{"tap":"~0.4.1"},"_id":"binary-merge@0.0.0","version":"0.0.0"}