parallel-hashmap
Header-only hashmap and btree containers for C++
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.
Для openSUSE Leap 16.0 відсутній офіційний пакунокДистрибутиви
openSUSE Tumbleweed
openSUSE Leap 16.0
openSUSE Leap 15.6
openSUSE Factory RISCV
openSUSE Backports for SLE 15 SP7
openSUSE Backports for SLE 15 SP4
Arch Extra