Package unordered_dense: Information

Source package: unordered_dense

Version: 4.8.1-alt1

Build time:  Nov 3, 2025, 04:10 PM in the task #399122

Category: Development/C++

Gear: https://git.altlinux.org/gears/u/unordered_dense.git?a=tree;hb=3…

Home page: https://github.com/martinus/unordered_dense

VCS: https://github.com/martinus/unordered_dense

License: MIT

Summary: A fast & densely stored hashmap and hashset based on robin-hood backward shift deletion for C++17 and later.

Description: 

A fast & densely stored hashmap and hashset based on robin-hood backward shift deletion for C++17 and later.

The classes ankerl::unordered_dense::map and ankerl::unordered_dense::set are (almost) drop-in replacements of std::unordered_map and std::unordered_set. While they don't have as strong iterator / reference stability guaranties, they are typically much faster.

Additionally, there are ankerl::unordered_dense::segmented_map and ankerl::unordered_dense::segmented_set with lower peak memory usage. and stable iterator/references on insert.

List of RPM packages built from this SRPM:
libunordered_dense-devel (x86_64, i586, aarch64)

Maintainer: Nazarov Denis

ACL:
Nazarov Denis
@everybody