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☆119Updated 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
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 5 years ago
- High-performance dictionary coding☆107Updated 8 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 7 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- ☆27Updated 8 years ago
- C library to pack and unpack short arrays of integers as fast as possible☆91Updated 2 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- C library to compute the Hamming weight of arrays☆48Updated 6 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- qp tries and crit-bit tries☆121Updated 3 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 5 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- A benchmark for sorting algorithms☆61Updated 4 years ago
- Fast differential coding functions (using SIMD instructions)☆55Updated 7 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- Feed-forward Bloom filters☆53Updated 14 years ago
- Compact Data Structures Library☆128Updated 11 years ago
- Fast decoder for VByte-compressed integers☆125Updated last year
- bit & sketches data structures☆60Updated 6 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…☆53Updated 12 years ago
- A small DFA for under 16 states☆52Updated 7 years ago
- Succinct data structures in C/C++☆88Updated 11 months ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Updated 5 years ago
- Benchmark showing the we can randomly hash strings very quickly with good universality☆138Updated 8 months ago
- Lock-free multithreaded memory allocation☆108Updated 8 years ago