1ykos / patchmapLinks
A fast and memory efficient hashmap using sorting to resolve collisions
☆43Updated 5 years ago
Alternatives and similar repositories for patchmap
Users that are interested in patchmap are comparing it to the libraries listed below
Sorting:
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Updated 6 years ago
- Vectorized version of the PCG random number generator☆87Updated 3 weeks ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 6 years ago
- For details, see the blog post:☆35Updated 2 years ago
- Fast random number generators: Vectorized (SIMD) version of xorshift128+☆122Updated 5 years ago
- An exploratory implementation of bit overloads of the C++ standard algorithms☆18Updated 4 years ago
- Variant on Wang Yi's wyhash with 32-bit output, using at most 64-bit math☆26Updated 6 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Updated 3 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆21Updated 4 months ago
- A hash table implementation using Robin Hood Linear Probing☆52Updated 11 years ago
- C++ reimplementation of https://github.com/emilk/drop-merge-sort☆21Updated 4 years ago
- Fast Hash Functions Using AES Intrinsics☆85Updated 6 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆121Updated 8 years ago
- A benchmark for sorting algorithms☆63Updated 4 years ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆31Updated last week
- benchmarking positional population count☆17Updated 3 months ago
- ☆20Updated 3 weeks ago
- ☆39Updated 5 years ago
- Popular hash table implementation benchmarks☆27Updated 8 years ago
- Bitset Sort, a faster std::sort replacement.☆79Updated 4 years ago
- haesni is a small hash function using aes-ni for fast string hashing☆19Updated 7 years ago
- ☆13Updated 9 years ago
- Low memory multithreaded hash table☆24Updated 10 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Updated 3 years ago
- A persistent hash array-mapped trie for C++☆92Updated 2 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆66Updated last year
- A simple bitset library in C☆144Updated 3 weeks ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆68Updated 2 years ago
- ☆27Updated 3 months ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆166Updated last year