preshing/junction
Concurrent data structures in C++ observed · 2026-08-28
Health v2 · maintenance only
69/100
- Activity 82
- 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: 3866
- days_rel: n/a
- days_push: 109
- n_releases_24m: 0
Adoption not part of the score
1459 stars · 160 forks observed · 2026-08-28
What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded
Junction is a C++ library of concurrent data structures, offering several lock-free concurrent hash map implementations such as ConcurrentMap_Leapfrog and ConcurrentMap_Grampa. It builds with CMake and depends on the Turf library.
Use cases
- use a lock-free concurrent hash map in C++
- share a hash map across multiple threads safely
- high-performance concurrent key-value lookups
- replace mutex-protected std::unordered_map in multithreaded code
- benchmark concurrent map implementations
When to choose
- you need proven lock-free hash maps in a C++ project
- your build already uses CMake
- you need fine-grained control over concurrency trade-offs across map variants
When to avoid
- you need general-purpose containers beyond hash maps
- you want a header-only drop-in with no dependencies (Turf is required)
- your project uses a different build system and you dislike vendoring sources
Facets
library · maturity maintenance
concurrency database developer-tools performance developer-tools cpp cross-platform windows concurrent-hash-map lock-free data-structures cmake algorithms linux macos
1 source
- readme: https://github.com/preshing/junction · fetched 2026-08-28 · 083a8239bf87
Member repositories
| Repository | Role | Health v2 |
|---|---|---|
| preshing/junction | main | 69 |
For agents
markdown · JSON · MCP: product_card(name="preshing/junction")
Data as of 2026-08-30T08:39:29.467469+00:00 · Report a problem