patmorin / arraylayout
Experiments with array layouts for comparison-based searching
☆84Updated 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
- bit & sketches data structures☆60Updated 6 years ago
- Fast differential coding functions (using SIMD instructions)☆52Updated 7 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- C library to compute the Hamming weight of arrays☆45Updated 6 years ago
- High-performance dictionary coding☆104Updated 8 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆117Updated 8 years ago
- Benchmark showing the we can randomly hash strings very quickly with good universality☆136Updated 3 months ago
- High-performance multicore-scalable data structures and benchmarks☆139Updated 5 years ago
- Quick sort code using AVX2 instructions☆68Updated 7 years ago
- A fast alternative to the modulo reduction☆308Updated 4 years ago
- Generates benchmark data for two different data structures, then renders some graphs.☆112Updated 5 years ago
- Fast decoder for VByte-compressed integers☆122Updated 11 months ago
- Lock-free multithreaded memory allocation☆106Updated 8 years ago
- A collection of succinct data structures☆201Updated last year
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.☆133Updated 5 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- Demonstration of LLVM's opt-viewer tool☆71Updated 8 years ago
- Comparing linear and binary searches☆40Updated 5 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Compact Data Structures Library☆98Updated 2 years ago
- The world's first wait-free Software Transactional Memory☆173Updated 5 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- A small DFA for under 16 states☆51Updated 6 years ago
- qp tries and crit-bit tries☆119Updated 2 years ago
- Hash Array Mapped Trie (C++ Templates)☆124Updated 2 years ago
- A very fast scalar implementation for Frame Of Reference integer compression.☆108Updated 9 years ago
- Bitset Sort, a faster std::sort replacement.☆78Updated 3 years ago