vigna / suxLinks
Succinct data structures in C/C++
☆88Updated 11 months ago
Alternatives and similar repositories for sux
Users that are interested in sux are comparing it to the libraries listed below
Sorting:
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- ☆109Updated last year
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆54Updated last year
- C++17 implementation of memory-efficient dynamic tries☆58Updated 3 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆47Updated 2 months ago
- C Minimal Perfect Hashing Library☆86Updated 8 years ago
- Fast Approximate Membership Filters (C++)☆281Updated last week
- A fast alternative to the modulo reduction☆311Updated 4 years ago
- Fast random number generators: Vectorized (SIMD) version of xorshift128+☆118Updated 5 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 6 years ago
- This small library enables acceleration of bulk calls of certain math functions on AVX and AVX2 hardware. Currently supported operations …☆87Updated 3 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- A collection of succinct data structures☆209Updated last year
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Bloom-filter based minimal perfect hash function library☆266Updated last month
- Learned Monotone Minimal Perfect Hashing☆27Updated 5 months ago
- For details, see the blog post:☆32Updated last year
- How fast can we shuffle values?☆38Updated last year
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 5 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆31Updated 5 months ago
- Detailed experiments over simdjson for VLDB article (2019) and future work☆21Updated 4 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago