{"name":"diff-sequences","version":"24.0.0-alpha.1","repository":{"type":"git","url":"git+https://github.com/facebook/jest.git"},"license":"MIT","description":"Compare items in two sequences to find a longest common subsequence","keywords":["fast","linear","space","callback","diff"],"main":"build/index.js","gitHead":"4954f46708415174c48a58f296a605fbe1244a31","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.1","_npmVersion":"5.6.0","_nodeVersion":"8.10.0","_npmUser":{"name":"mjesun","email":"mjesun@hotmail.com"},"dist":{"shasum":"0cb8546f71e6a3d157cb92fe4b0a178e36c48f70","size":11062,"noattachment":false,"key":"/diff-sequences/-/diff-sequences-24.0.0-alpha.1.tgz","tarball":"http://registry.cnpm.dingdandao.com/diff-sequences/download/diff-sequences-24.0.0-alpha.1.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"}],"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/diff-sequences_24.0.0-alpha.1_1540222528051_0.5059020296169037"},"_hasShrinkwrap":false,"publish_time":1540222528176,"_cnpm_publish_time":1540222528176,"dist-tags":{"latest":"29.6.3","next":"30.0.0-alpha.7"}}