{"name":"diff-sequences","version":"27.0.6","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.13.0 || ^12.13.0 || ^14.15.0 || >=15.0.0"},"main":"./build/index.js","types":"./build/index.d.ts","exports":{".":"./build/index.js","./package.json":"./package.json"},"scripts":{"perf":"node --expose-gc perf/index.js"},"devDependencies":{"benchmark":"^2.1.4","diff":"^5.0.0","fast-check":"^2.0.0"},"publishConfig":{"access":"public"},"gitHead":"d257d1c44ba62079bd4307ae78ba226d47c56ac9","bugs":{"url":"https://github.com/facebook/jest/issues"},"homepage":"https://github.com/facebook/jest#readme","_id":"diff-sequences@27.0.6","_nodeVersion":"14.17.1","_npmVersion":"lerna/4.0.0/node@v14.17.1+x64 (darwin)","dist":{"shasum":"3305cb2e55a033924054695cc66019fd7f8e5723","size":13525,"noattachment":false,"key":"/diff-sequences/-/diff-sequences-27.0.6.tgz","tarball":"http://registry.cnpm.dingdandao.com/diff-sequences/download/diff-sequences-27.0.6.tgz"},"_npmUser":{"name":"simenb","email":"sbekkhus91@gmail.com"},"directories":{},"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"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/diff-sequences_27.0.6_1624899930869_0.696743839206365"},"_hasShrinkwrap":false,"publish_time":1624899930968,"_cnpm_publish_time":1624899930968,"dist-tags":{"latest":"29.6.3","next":"30.0.0-alpha.7"}}