kampersanda / poplar-trie
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
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- For details, see the blog post:☆32Updated last year
- C++ Library implementing Compressed String Dictionaries☆46Updated 2 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Succinct data structures in C/C++☆85Updated 5 months ago
- Compact Tree Representation☆16Updated 7 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆52Updated last year
- A C++ library for integer array compression☆29Updated 2 years ago
- C++ implementation of a fast and memory efficient hash map and hash set specialized for strings☆178Updated 5 months ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 2 years ago
- C++ framework for rapid server development☆77Updated last year
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++☆31Updated 7 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆116Updated 8 years ago
- A persistent hash array-mapped trie for C++☆91Updated last year
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆55Updated 2 years ago
- Hash table with separate chaining layout☆9Updated 3 years ago
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆26Updated 5 years ago
- C++ mutex collections, cross-platform header-only C++11 (or later) library.☆121Updated 2 years ago
- String map implementation through Fast Succinct Trie☆21Updated 3 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Efficient Prefix-Sum data structures in C++.☆25Updated last year
- High-performance dictionary coding☆104Updated 7 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 7 years ago
- Fast compressed trie dictionary library☆67Updated 5 months ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 5 years ago
- LZ Double factor Factorization.☆11Updated 8 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago