efficient/libcuckoo
A high-performance, concurrent hash table observed · 2026-08-28
Health v2 · maintenance only
75/100
- Activity 95
- Release rhythm 35
- Longevity 100
Flags: no_releases no_license
How is this computed?
round(0.45*activity + 0.35*rhythm + 0.20*longevity); archived -> min(score, 10) — computed 2026-09-02. Adoption (stars, forks) is never an input.
- gap_med: n/a
- age_days: 4626
- days_rel: n/a
- days_push: 33
- n_releases_24m: 0
Adoption not part of the score
1744 stars · 290 forks observed · 2026-08-28
What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded
libcuckoo is a high-performance, compact concurrent hash table implemented in C++ using cuckoo hashing. It is a header-only library that supports multiple concurrent reader and writer threads.
Use cases
- concurrent key-value lookups in a multithreaded C++ application
- high-throughput in-memory hash table for caching
- replace std::unordered_map with a thread-safe alternative
- build a concurrent index or deduplication store
- benchmark concurrent hash table performance
When to choose
- you need a fast, thread-safe hash table in C++ without external dependencies
- your workload has many concurrent readers and writers
- you want a header-only, easily embeddable data structure
When to avoid
- you need a persistent or distributed key-value store
- you only need single-threaded hashing where std::unordered_map suffices
- you need a hash map with rich APIs like ordered iteration or LRU eviction
Facets
library · maturity stable
concurrency caching developer-tools developer-tools performance cpp cross-platform hash-table cuckoo-hashing header-only concurrent-data-structures key-value-store algorithms linux macos
1 source
- readme: https://github.com/efficient/libcuckoo · fetched 2026-08-28 · 61aaa65fc0de
Member repositories
| Repository | Role | Health v2 |
|---|---|---|
| efficient/libcuckoo | main | 75 |
For agents
markdown · JSON · MCP: product_card(name="efficient/libcuckoo")
Data as of 2026-08-30T08:39:29.467469+00:00 · Report a problem