patmorin / arraylayout
Experiments with array layouts for comparison-based searching
☆82Updated last year
Alternatives and similar repositories for arraylayout:
Users that are interested in arraylayout are comparing it to the libraries listed below
- multi-way atomic compare-and-swap with x64/TSX☆86Updated 8 years ago
- Lock-free multithreaded memory allocation☆105Updated 8 years ago
- C library to compute the Hamming weight of arrays☆45Updated 6 years ago
- bit & sketches data structures☆60Updated 6 years ago
- High-performance dictionary coding☆104Updated 7 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆116Updated 8 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- No sane compiler would optimize atomics: the presentation☆106Updated 8 years ago
- Compact Data Structures Library☆98Updated 2 years ago
- Quick sort code using AVX2 instructions☆68Updated 7 years ago
- Benchmark showing the we can randomly hash strings very quickly with good universality☆136Updated last month
- High-performance multicore-scalable data structures and benchmarks☆139Updated 5 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆55Updated 2 years ago
- Linear vs binary search benchmark☆41Updated 5 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- Generates benchmark data for two different data structures, then renders some graphs.☆112Updated 5 years ago
- A collection of succinct data structures☆200Updated last year
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆49Updated 10 months ago
- Fast differential coding functions (using SIMD instructions)☆52Updated 7 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 10 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 7 years ago
- A Wait-Free Universal Construct for Large Objects☆96Updated 5 years ago
- qp tries and crit-bit tries☆119Updated 2 years ago
- Compact Data Structures Library☆124Updated 10 years ago
- Hash Array Mapped Trie (C++ Templates)☆124Updated last year
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 5 years ago
- Fast decoder for VByte-compressed integers☆122Updated 9 months ago