google / zuckerliLinks
☆28Updated 2 years ago
Alternatives and similar repositories for zuckerli
Users that are interested in zuckerli are comparing it to the libraries listed below
Sorting:
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- Some variations on Lemire's Fast Random Integer Generation in an Interval☆15Updated 5 years ago
- A proof-of-concept for a fast regex matcher using lossy NFA matching on SIMD☆12Updated 5 years ago
- Quick sort code using AVX2 instructions☆69Updated 7 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Multiplying... backward?☆13Updated 4 years ago
- measure entropy of memory allocators☆12Updated 3 years ago
- SIMDized check which bytes are in a set☆28Updated 6 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆30Updated last month
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- A vectorized single header hash function.☆19Updated 6 months ago
- ☆36Updated 4 years ago
- Support for ternary logic in SSE, XOP, AVX2 and x86 programs☆31Updated 4 months ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 2 years ago
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆38Updated 4 years ago
- The space of memory management research and systems produced by the PLASMA lab (https://plasma-umass.org).☆20Updated 4 years ago
- 8-bit Xor Filter in C99☆61Updated 5 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- Learned Monotone Minimal Perfect Hashing☆27Updated last month
- A self-contained, header-only, implementation of memory-mapped files in C++ for fast integration into larger projects.☆26Updated 9 months ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆26Updated 5 years ago
- Sequence data structure with efficient random access insert and erase☆13Updated last year
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- Bloom filter alternative (C++)☆18Updated 6 years ago
- Dictionary-based compression for inverted indexes.☆23Updated 6 years ago
- A rethinking of the C time library☆10Updated 3 months ago
- A small DFA for under 16 states☆51Updated 6 years ago