{"dist":{"shasum":"4670544d0b00da0f1c6d31e073d6ab50b61d6598","tarball":"https://registry.npmjs.org/@pnpm/graph-sequencer/-/graph-sequencer-1.1.1.tgz","fileCount":4,"integrity":"sha512-nlLogZV9i8J2z9vw1cHtKAX8Caj3WeYUw63G1ni2ULLwvb+FfRAhdIfDsuce0gUHdOClF/gsKN+7H28yryNlAw==","signatures":[{"sig":"MEQCIB/IlWdoX6GhG8Hqu8HqIE9RcYxMhMchwTXn4mZIk4W7AiAH1+WYVwQ92uHpxcSE7OpmRyie09W6zWFRZMfoLQfQug==","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":9327},"main":"index.js","name":"@pnpm/graph-sequencer","_from":"file:pnpm-graph-sequencer-1.1.1.tgz","license":"MIT","scripts":{"test":"jest"},"_npmUser":{"name":"zkochan","email":"z@kochan.io"},"keywords":["graph","adjacency","list","tasks","priority","priorities","sort","dependencies","topological","topo","sequencer"],"_resolved":"/private/var/folders/g7/5ygp0ncd6qx5g4fn5hpsqq5c0000gn/T/f68df7a4925f7fa428a8995de83dd139/pnpm-graph-sequencer-1.1.1.tgz","_integrity":"sha512-nlLogZV9i8J2z9vw1cHtKAX8Caj3WeYUw63G1ni2ULLwvb+FfRAhdIfDsuce0gUHdOClF/gsKN+7H28yryNlAw==","repository":"pnpm/graph-sequencer","_npmVersion":"8.1.2","description":"Sort items in a graph using a topological sort while resolving cycles with priority groups","directories":{},"maintainers":[{"name":"pnpmuser","email":"publish-bot@pnpm.io"},{"name":"zkochan","email":"z@kochan.io"}],"_nodeVersion":"16.13.2","_hasShrinkwrap":false,"devDependencies":{"jest":"^29.5.0"},"_npmOperationalInternal":{"tmp":"tmp/graph-sequencer_1.1.1_1683376605913_0.035342394602770666","host":"s3://npm-registry-packages"},"_id":"@pnpm/graph-sequencer@1.1.1","version":"1.1.1"}