wahern / phf
Tiny perfect hash library for C, C++, and Lua
☆163Updated 5 years ago
Related projects: ⓘ
- LightweighT Almost Lock-Less Oriented for C++ programs memory allocator☆164Updated 5 years ago
- C++ implementation of a fast and memory efficient hash map and hash set specialized for strings☆176Updated 9 months ago
- Random access array of tightly packed unsigned integers☆158Updated 2 years ago
- 128-bit (64.64) signed fixed-point arithmetic.☆170Updated last month
- A simple bitset library in C☆124Updated 4 months ago
- "Deboostified" version of boost.context (coroutines), Plain and simple C API for context switching. Easy build on multiple platforms.☆87Updated last year
- A hash table implementation using Robin Hood Linear Probing☆50Updated 10 years ago
- Fast integer to ascii / integer to string conversion☆216Updated last year
- LZ77/LZSS designed for SSE based decompression☆134Updated 5 years ago
- An implementation of Seqlock in C++11☆182Updated last month
- Looking into the performance of heaps, starting with the Min-Max Heap☆62Updated 3 years ago
- Bloom-filter based minimal perfect hash function library☆244Updated last year
- RDESTL is library providing small subset of STL functionality, aimed at games development.☆104Updated 3 months ago
- Coroutines/Fibers implementation for x86☆66Updated 8 years ago
- A C/C++ header file for fast 32-bit division remainders (and divisibility tests) on 64-bit hardware.☆297Updated last month
- An implementation of the Judy array, wrapped in a c++ template. Uses Karl Malbrain's implementation, http://code.google.com/p/judyarray/ …☆42Updated 9 years ago
- Robin Hood hash map library☆57Updated 3 years ago
- A C++ pointer bump memory arena implementation☆83Updated 9 years ago
- Fast Concurrent Memoization Map (fcmm) is an almost lock-free concurrent hashmap written in C++11 to be used for memoization in concurren…☆51Updated 6 years ago
- SIMD (SWAR/SSE/SSE4/AVX2/AVX512F/ARM Neon) of Karp-Rabin algorithm's modification☆237Updated 2 years ago
- An open addressing linear probing hash table, tuned for delete heavy workloads☆197Updated 11 months ago
- ☆100Updated this week
- C++14 (and beyond) library features implemented in C++11☆247Updated 7 years ago
- A persistent hash array-mapped trie for C++☆90Updated last year
- Fast random number generators: Vectorized (SIMD) version of xorshift128+☆109Updated 4 years ago
- A cross-platform C function to get the cache line size (in bytes) of the processor, or 0 on failure☆115Updated 2 years ago
- C++14 cache friendly B-heap priority queue☆104Updated 3 years ago
- SIMD (SSE) string functions☆94Updated 7 years ago
- A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit f…☆273Updated 3 years ago
- Hash Array Mapped Trie (C++ Templates)☆122Updated last year