1ykos / patchmapLinks
A fast and memory efficient hashmap using sorting to resolve collisions
☆43Updated 4 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 5 years ago
- Vectorized version of the PCG random number generator☆83Updated 6 months ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆46Updated 5 years ago
- benchmarking positional population count☆15Updated last year
- Variant on Wang Yi's wyhash with 32-bit output, using at most 64-bit math☆26Updated 6 years ago
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- An exploratory implementation of bit overloads of the C++ standard algorithms☆18Updated 4 years ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- Fast random number generators: Vectorized (SIMD) version of xorshift128+☆119Updated 5 years ago
- Fast Hash Functions Using AES Intrinsics☆83Updated 6 years ago
- For details, see the blog post:☆33Updated last year
- ☆39Updated 4 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- A simple bitset library in C☆137Updated 7 months ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆19Updated 2 months ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- A persistent hash array-mapped trie for C++☆91Updated 2 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆53Updated last year
- A benchmark for sorting algorithms☆61Updated 4 years ago
- C++ reimplementation of https://github.com/emilk/drop-merge-sort☆21Updated 3 years ago
- Effective Memory Reclamation☆61Updated 5 years ago
- Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++☆33Updated 8 years ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆164Updated 8 months ago
- Yet another C++ text formatting library.☆71Updated 9 months ago
- ☆20Updated 3 years ago
- haesni is a small hash function using aes-ni for fast string hashing☆19Updated 6 years ago
- ☆109Updated last year
- Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.☆135Updated 6 years ago