← Packages
parallel-hashmap
Header-only hashmap and btree containers for C++
- Current
- 2.0.0
- Candidate
- 2.1.0Stale
- License
- Apache-2.0
Description
The hashmaps and btree provided here are built upon those open sourced by Google in the Abseil library. The hashmaps use closed hashing, where values are stored directly into a memory array, avoiding memory indirections. By using parallel SSE2 instructions, these hashmaps are able to look up items by checking 16 slots in parallel, allowing the implementation to remain fast even when the table is filled up to 87.5% capacity.
Changelog
PR · 2
Checks
| Monitor | Observation | Last checked |
|---|---|---|
Stale Repository refresh: git fetch exited 128 (authentication) | ||
Stale Source last confirmed at 2026-11-10T19:28:57+00:00; repository refresh overdue. | ||
Checked | ||
Checked | ||
Not configured No reliable monitor identity/configuration. | — | |
Not configured No reliable monitor identity/configuration. | — | |
Not configured No reliable monitor identity/configuration. | — | |
Checked Repository query; subpackage and local-patch applicability are not evaluated. | ||
Not configured No reliable monitor identity/configuration. | — |