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 implementing Compressed String Dictionaries☆46Updated 3 years ago
- Succinct data structures in C/C++☆92Updated last year
- 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
- Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++☆33Updated 8 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- For details, see the blog post:☆34Updated 2 years ago
- Fast compressed trie dictionary library☆71Updated last year
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Updated 2 years ago
- A persistent hash array-mapped trie for C++☆91Updated 2 years ago
- Compact Tree Representation☆16Updated 8 years ago
- C++ implementation of a fast and memory efficient hash map and hash set specialized for strings☆183Updated last month
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- A C++ library for integer array compression☆30Updated 3 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Updated 10 months ago
- Super Scalar Sample Sort in modern C++☆21Updated 5 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Updated 2 years ago
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆40Updated 5 years ago
- C++ mutex collections, cross-platform header-only C++11 (or later) library.☆124Updated 3 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 4 years ago
- C++14 cache friendly B-heap priority queue☆109Updated 3 months ago
- Looking into the performance of heaps, starting with the Min-Max Heap☆69Updated 4 years ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- Bloom-filter based minimal perfect hash function library☆270Updated 5 months ago
- BitMagic Library☆436Updated 3 months ago
- A blend of the compact and sparse hash table implementations.☆15Updated 4 years ago
- Effective Memory Reclamation☆63Updated 5 years ago
- C++ implementations of indexing mechanisms, including a Hilbert-curve geohash based spatial index and a linear hashing table, for disk or…☆78Updated 5 years ago
- Efficient Prefix-Sum data structures in C++.☆25Updated 2 years ago
- Sample implementation of C++20 atomic_wait/notify☆62Updated 6 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago