{"dist":{"shasum":"77b4ce1229345db8744a8be5064063d6072c9678","tarball":"https://registry.npmjs.org/diff-sequences/-/diff-sequences-23.2.0.tgz","fileCount":6,"integrity":"sha512-oHJQ2EqKDLZBi4RNDHh9ueAU0HzDGwX8rPeoTJrhlW0eMwZc/SYqEj02zngiBl7bFyDsaDVRQsPjqxMAL/2Kpg==","signatures":[{"sig":"MEUCIFf5ELSxHxM+wqopq0nVWv0YFY1eHXcAxpjcMTuu3HW4AiEAiRnXNfceGkLQaJCdhziekbXKo2GRkvlSYmqk+qsmuLk=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":43645},"main":"build/index.js","name":"diff-sequences","license":"MIT","_npmUser":{"name":"mjesun","email":"mjesun@hotmail.com"},"keywords":["fast","linear","space","callback","diff"],"repository":{"url":"https://github.com/facebook/jest.git","type":"git"},"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"}],"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/diff-sequences_23.2.0_1529935507744_0.33531794695212747","host":"s3://npm-registry-packages"},"_id":"diff-sequences@23.2.0","version":"23.2.0"}