{"name":"diff-sequences","version":"24.2.0","repository":{"type":"git","url":"git+https://github.com/facebook/jest.git","directory":"packages/diff-sequences"},"license":"MIT","description":"Compare items in two sequences to find a longest common subsequence","keywords":["fast","linear","space","callback","diff"],"engines":{"node":">= 6"},"main":"build/index.js","types":"build/index.d.ts","scripts":{"perf":"node --expose-gc perf/index.js"},"devDependencies":{"benchmark":"^2.1.4","diff":"^4.0.1"},"gitHead":"d23f1ef18567763ab0133372e376ae5026a23d4b","bugs":{"url":"https://github.com/facebook/jest/issues"},"homepage":"https://github.com/facebook/jest#readme","_id":"diff-sequences@24.2.0","_nodeVersion":"8.10.0","_npmVersion":"lerna/3.13.1/node@v8.10.0+x64 (darwin)","dist":{"shasum":"605025e678673636d82c49eda94a9cebcbf4b648","size":14242,"noattachment":false,"key":"/diff-sequences/-/diff-sequences-24.2.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/diff-sequences/download/diff-sequences-24.2.0.tgz"},"maintainers":[{"name":"aaronabramov","email":""},{"name":"cpojer","email":"christoph.pojer@gmail.com"},{"name":"davidzilburg","email":""},{"name":"openjs-operations","email":""},{"name":"rickhanlonii","email":"rickhanlonii@gmail.com"},{"name":"rubennorte","email":"rubennorte@gmail.com"},{"name":"scotthovestadt","email":"scott.hovestadt@gmail.com"},{"name":"simenb","email":"sbekkhus91@gmail.com"}],"_npmUser":{"name":"mjesun","email":"mjesun@hotmail.com"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/diff-sequences_24.2.0_1551784963744_0.9274550559945209"},"_hasShrinkwrap":false,"publish_time":1551784963927,"_cnpm_publish_time":1551784963927,"deprecated":"This version was accidentally published and might contain errors. Please use 24.0.0 or a newer release","dist-tags":{"latest":"29.6.3","next":"30.0.0-alpha.7"}}