martinus/robin-hood-hashing
Fast & memory efficient hashtable based on robin hood hashing for C++11/14/17/20 observed · 2026-08-28
Health v2 · maintenance only
10/100
- Activity 0
- Release rhythm 8
- Longevity 100
Flags: archived
How is this computed?
round(0.45*activity + 0.35*rhythm + 0.20*longevity); archived -> min(score, 10) — computed 2026-09-03. Adoption (stars, forks) is never an input.
- gap_med: n/a
- age_days: 4785
- days_rel: n/a
- days_push: 1220
- n_releases_24m: 0
Adoption not part of the score
1621 stars · 153 forks observed · 2026-08-28
What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded
A header-only C++ library providing robin_hood::unordered_map and robin_hood::unordered_set as fast, memory-efficient drop-in replacements for std::unordered_map and std::unordered_set. It is based on robin hood hashing and supports C++11/14/17/20 with no dependencies.
Use cases
- replace std::unordered_map with a faster hashmap
- reduce memory usage of hash tables in C++
- speed up lookups in performance-critical C++ code
- drop-in single-file hashmap for C++11 through C++20
- use a fast unordered_set without dependencies
When to avoid
- you want active development or new features - the author recommends the successor ankerl::unordered_dense
- you need non-standard hash table features beyond map/set semantics
Facets
library · maturity maintenance
caching developer-tools performance developer-tools cpp cross-platform hash-table robin-hood-hashing header-only unordered-map unordered-set stl-replacement single-file no-dependencies algorithms
1 source
- readme: https://github.com/martinus/robin-hood-hashing · fetched 2026-08-28 · 187968e3dd6e
Member repositories
| Repository | Role | Health v2 |
|---|---|---|
| martinus/robin-hood-hashing | main | 10 |
For agents
markdown · JSON · MCP: product_card(name="martinus/robin-hood-hashing")
Data as of 2026-08-30T08:39:29.467469+00:00 · Report a problem