{"name":"diff-sequences","version":"26.5.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":">= 10.14.2"},"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","fast-check":"^2.0.0"},"publishConfig":{"access":"public"},"gitHead":"68d1b1b638bc7464c2794a957c1b894de7da2ee3","bugs":{"url":"https://github.com/facebook/jest/issues"},"homepage":"https://github.com/facebook/jest#readme","_id":"diff-sequences@26.5.0","_nodeVersion":"12.18.1","_npmVersion":"lerna/3.22.1/node@v12.18.1+x64 (darwin)","dist":{"shasum":"ef766cf09d43ed40406611f11c6d8d9dd8b2fefd","size":13496,"noattachment":false,"key":"/diff-sequences/-/diff-sequences-26.5.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/diff-sequences/download/diff-sequences-26.5.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":"simenb","email":"sbekkhus91@gmail.com"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/diff-sequences_26.5.0_1601890085902_0.17535582257312332"},"_hasShrinkwrap":false,"publish_time":1601890086060,"_cnpm_publish_time":1601890086060,"dist-tags":{"latest":"29.6.3","next":"30.0.0-alpha.7"}}