{"name":"diff-sequences","version":"29.4.3","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":"a49c88610e49a3242576160740a32a2fe11161e1","bugs":{"url":"https://github.com/facebook/jest/issues"},"homepage":"https://github.com/facebook/jest#readme","_id":"diff-sequences@29.4.3","_nodeVersion":"18.14.0","_npmVersion":"lerna/1.13.0/node@v18.14.0+arm64 (darwin)","dist":{"shasum":"9314bc1fabe09267ffeca9cbafc457d8499a13f2","size":11414,"noattachment":false,"key":"/diff-sequences/-/diff-sequences-29.4.3.tgz","tarball":"http://registry.cnpm.dingdandao.com/diff-sequences/download/diff-sequences-29.4.3.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.4.3_1676462236317_0.9159740967010261"},"_hasShrinkwrap":false,"_cnpmcore_publish_time":"2023-02-15T11:57:16.478Z","publish_time":1676462236478,"_cnpm_publish_time":1676462236478,"dist-tags":{"latest":"29.6.3","next":"30.0.0-alpha.7"}}