Hashmap and hashset based on robin-hood backward shift deletion
The provided classes, `ankerl::unordered_dense::map` and
`ankerl::unordered_dense::set`, are an (almost) drop-in replacements
for `std::unordered_map` and `std::unordered_set`, respectively.
While they do not have as strong iterator / reference stability
guarantees, they are typically faster than libstdc++'s.
`ankerl::unordered_dense::segmented_map` and
`ankerl::unordered_dense::segmented_set` are offered. These have
lower peak memory usage and stable references (but unstable
iterators) on insert.
Paths come from the repository package-file index for the observed builds. They describe archive/package associations, not every file that will exist on a running system after maintainer scripts, alternatives, generated state, diversions, or installation choices.
Each row is recorded package-index metadata for one version, architecture, suite, and repository. Names, URLs, and sizes are source-reported; a link is a potentially mutable retrieval location, not an OpenFactory redistribution claim or proof that OpenFactory retained the artifact bytes.