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
- Fast compressed trie dictionary library☆70Updated last year
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- C++ implementation of a fast and memory efficient hash map and hash set specialized for strings☆183Updated last year
- For details, see the blog post:☆33Updated last year
- Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++☆33Updated 8 years ago
- Efficient Prefix-Sum data structures in C++.☆26Updated 2 years ago
- Succinct data structures in C/C++☆88Updated 11 months ago
- C++14 cache friendly B-heap priority queue☆106Updated last week
- Compact Tree Representation☆16Updated 8 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆35Updated 7 months ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- A persistent hash array-mapped trie for C++☆91Updated 2 years ago
- C++ implementations of indexing mechanisms, including a Hilbert-curve geohash based spatial index and a linear hashing table, for disk or…☆78Updated 4 years ago
- 🚀 Fast C/C++ bit population count library☆350Updated last year
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆46Updated 5 years ago
- Transpose: SIMD Integer+Floating Point Compression Filter☆62Updated 5 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- BitMagic Library☆428Updated last month
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- Fast in-place radix sort with STL-like API☆47Updated 8 years ago
- C++ implementation of Concise and WAH compressed bitsets☆20Updated 8 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Looking into the performance of heaps, starting with the Min-Max Heap☆69Updated 4 years ago
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆40Updated 5 years ago
- A C++ library for integer array compression☆29Updated 3 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