{"name":"@jest/diff-sequences","version":"30.0.0","repository":{"type":"git","url":"https://github.com/jestjs/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":"^18.14.0 || ^20.0.0 || ^22.0.0 || >=24.0.0"},"main":"./build/index.js","types":"./build/index.d.ts","exports":{".":{"types":"./build/index.d.ts","require":"./build/index.js","import":"./build/index.mjs","default":"./build/index.js"},"./package.json":"./package.json"},"devDependencies":{"@fast-check/jest":"^2.1.1","benchmark":"^2.1.4","diff":"^7.0.0"},"publishConfig":{"access":"public"},"gitHead":"a383155cd5af4539b3c447cfa7184462ee32f418","_nodeVersion":"24.1.0","_npmVersion":"lerna/4.3.0/node@v24.1.0+arm64 (darwin)","_id":"@jest/diff-sequences@30.0.0","dist":{"shasum":"402d27d14e9d5161dedfca98bf181018a8931eb1","size":11401,"noattachment":false,"key":"/@jest/diff-sequences/-/@jest/diff-sequences-30.0.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/@jest/diff-sequences/download/@jest/diff-sequences-30.0.0.tgz"},"_npmUser":{"name":"cpojer","email":"christoph.pojer@gmail.com"},"directories":{},"maintainers":[{"name":"aaronabramov","email":""},{"name":"cpojer","email":"christoph.pojer@gmail.com"},{"name":"openjs-operations","email":""},{"name":"rickhanlonii","email":"rickhanlonii@gmail.com"},{"name":"simenb","email":"sbekkhus91@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages-npm-production","tmp":"tmp/diff-sequences_30.0.0_1749521739663_0.2263188657876063"},"_hasShrinkwrap":false,"_cnpmcore_publish_time":"2025-06-10T02:15:39.865Z","publish_time":1749521739865,"_source_registry_name":"default","_cnpm_publish_time":1749521739865,"dist-tags":{"latest":"30.3.0","next":"30.0.0-beta.8"}}