{"name":"diff-sequences","version":"29.3.1","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":"^14.15.0 || ^16.10.0 || >=18.0.0"},"main":"./build/index.js","types":"./build/index.d.ts","exports":{".":{"types":"./build/index.d.ts","default":"./build/index.js"},"./package.json":"./package.json"},"devDependencies":{"@fast-check/jest":"^1.3.0","benchmark":"^2.1.4","diff":"^5.0.0"},"publishConfig":{"access":"public"},"gitHead":"05deb8393c4ad71e19be2567b704dfd3a2ab5fc9","bugs":{"url":"https://github.com/facebook/jest/issues"},"homepage":"https://github.com/facebook/jest#readme","_id":"diff-sequences@29.3.1","_nodeVersion":"16.17.0","_npmVersion":"lerna/1.11.3/node@v16.17.0+x64 (darwin)","dist":{"shasum":"104b5b95fe725932421a9c6e5b4bef84c3f2249e","size":11433,"noattachment":false,"key":"/diff-sequences/-/diff-sequences-29.3.1.tgz","tarball":"http://registry.cnpm.dingdandao.com/diff-sequences/download/diff-sequences-29.3.1.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_29.3.1_1667948179328_0.7857559123306008"},"_hasShrinkwrap":false,"_cnpmcore_publish_time":"2022-11-08T22:57:50.988Z","publish_time":1667948179533,"_cnpm_publish_time":1667948179533,"dist-tags":{"latest":"29.6.3","next":"30.0.0-alpha.7"}}