{"bugs":{"url":"https://github.com/facebook/jest/issues"},"dist":{"shasum":"48d99ea376fb3f049215ccc8606ff4154f4516bf","tarball":"https://registry.npmjs.org/diff-sequences/-/diff-sequences-22.4.3.tgz","fileCount":3,"integrity":"sha512-sMsQetU9mXqUEYpjCOavAKdEs0w1Qg9sbRlfVbaZUFnkJqm4iEQj0H4nocx8PMT+AnPKJW8C+xzU7LuO0s7c8Q==","signatures":[{"sig":"MEQCIAmGnVn94ZUUhZWXW2SIUxsOt61v5YLIg+ppkcxtImuWAiASqunqh8fTXkJ2dVApuEZaeH8kJsDg6pk1W2X0hWnC4w==","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":42649},"main":"build/index.js","name":"diff-sequences","license":"MIT","_npmUser":{"name":"mjesun","email":"mjesun@hotmail.com"},"homepage":"https://github.com/facebook/jest#readme","keywords":["fast","linear","space","callback","diff"],"repository":{"url":"git+https://github.com/facebook/jest.git","type":"git"},"_npmVersion":"5.5.1","description":"Compare items in two sequences to find a longest common subsequence","directories":{},"maintainers":[{"name":"cpojer","email":"christoph.pojer@gmail.com"},{"name":"mjesun","email":"mjesun@hotmail.com"}],"_nodeVersion":"8.9.1","_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/diff-sequences_22.4.3_1521648478627_0.22926297299456455","host":"s3://npm-registry-packages"},"_id":"diff-sequences@22.4.3","version":"22.4.3"}