kampersanda / poplar-trieLinks
C++17 implementation of memory-efficient dynamic tries
☆58Updated 3 years ago
Alternatives and similar repositories for poplar-trie
Users that are interested in poplar-trie are comparing it to the libraries listed below
Sorting:
- 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
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Succinct data structures in C/C++☆88Updated last year
- Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++☆33Updated 8 years ago
- A persistent hash array-mapped trie for C++☆91Updated 2 years ago
- C++ implementation of a fast and memory efficient hash map and hash set specialized for strings☆183Updated last year
- Fast compressed trie dictionary library☆71Updated last year
- For details, see the blog post:☆34Updated last year
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Updated 8 months ago
- A C++ library for integer array compression☆29Updated 3 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Compact Tree Representation☆16Updated 8 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- BitMagic Library☆429Updated last month
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆46Updated 5 years ago
- Super Scalar Sample Sort in modern C++☆21Updated 5 years ago
- Fast random number generators: Vectorized (SIMD) version of xorshift128+☆119Updated 5 years ago
- ☆13Updated 5 months ago
- Efficient Prefix-Sum data structures in C++.☆26Updated 2 years ago
- Vectorized version of the PCG random number generator☆83Updated 7 months ago
- An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!☆129Updated 2 years ago
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- Transpose: SIMD Integer+Floating Point Compression Filter☆62Updated 5 years ago
- Fast in-place radix sort with STL-like API☆48Updated 8 years ago
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆40Updated 5 years ago