mettienne / tiered-vectorLinks
Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(1) and insertion and deletion in time O(n^ε) for ε > 0 while using o(n) extra space.
☆50Updated last year
Alternatives and similar repositories for tiered-vector
Users that are interested in tiered-vector are comparing it to the libraries listed below
Sorting:
- A fast implementation for varbyte 32bit/64bit integer compression☆121Updated 8 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 6 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆65Updated last year
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- qp tries and crit-bit tries☆122Updated 3 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- Compact Data Structures Library☆101Updated 3 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 7 years ago
- Fast differential coding functions (using SIMD instructions)☆55Updated 8 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆43Updated 9 years ago
- ☆27Updated 8 years ago
- Experiments with array layouts for comparison-based searching☆85Updated last year
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- High-performance dictionary coding☆108Updated 8 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- C library to pack and unpack short arrays of integers as fast as possible☆91Updated 2 years ago
- A benchmark for sorting algorithms☆62Updated 4 years ago
- Feed-forward Bloom filters☆53Updated 14 years ago
- Fast decoder for VByte-compressed integers☆125Updated last month
- Compact Data Structures Library☆129Updated 11 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Updated 2 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Updated 5 years ago
- bit & sketches data structures☆60Updated 7 years ago
- Compact tries for fixed-width keys☆26Updated 7 years ago
- C library implementing the ridiculously fast CLHash hashing function☆281Updated last year
- Suite of universal indexes for Highly Repetitive Document Collections☆24Updated 5 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago