{"name":"diff-sequences","version":"24.0.0-alpha.15","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","scripts":{"perf":"node --expose-gc perf/index.js"},"devDependencies":{"benchmark":"^2.1.4","diff":"^4.0.1"},"gitHead":"28971c5f794330e8acc6861288e6daafcd32238e","readmeFilename":"README.md","bugs":{"url":"https://github.com/facebook/jest/issues"},"homepage":"https://github.com/facebook/jest#readme","_id":"diff-sequences@24.0.0-alpha.15","_nodeVersion":"8.11.3","_npmVersion":"lerna/3.10.5/node@v8.11.3+x64 (darwin)","dist":{"shasum":"29c6aad320390ac8b9f5ba48b99939fc7c4815e7","size":13413,"noattachment":false,"key":"/diff-sequences/-/diff-sequences-24.0.0-alpha.15.tgz","tarball":"http://registry.cnpm.dingdandao.com/diff-sequences/download/diff-sequences-24.0.0-alpha.15.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":"rubennorte","email":"rubennorte@gmail.com"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/diff-sequences_24.0.0-alpha.15_1548352336663_0.6978139683358666"},"_hasShrinkwrap":false,"publish_time":1548352336859,"_cnpm_publish_time":1548352336859,"dist-tags":{"latest":"29.6.3","next":"30.0.0-alpha.7"}}