patmorin / arraylayoutLinks
Experiments with array layouts for comparison-based searching
☆85Updated last year
Alternatives and similar repositories for arraylayout
Users that are interested in arraylayout are comparing it to the libraries listed below
Sorting:
- High-performance dictionary coding☆108Updated 8 years ago
- Benchmark showing the we can randomly hash strings very quickly with good universality☆139Updated 10 months ago
- multi-way atomic compare-and-swap with x64/TSX☆85Updated 8 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆121Updated 8 years ago
- Lock-free multithreaded memory allocation☆110Updated 9 years ago
- A collection of succinct data structures☆211Updated last year
- Compact Data Structures Library☆129Updated 11 years ago
- bit & sketches data structures☆60Updated 7 years ago
- High-performance multicore-scalable data structures and benchmarks☆144Updated 6 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- qp tries and crit-bit tries☆122Updated 3 years ago
- A fast alternative to the modulo reduction☆314Updated 4 years ago
- Fast Hash Functions Using AES Intrinsics☆84Updated 6 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- An-source C library developed and used at AppNexus.☆113Updated 6 years ago
- A Wait-Free Universal Construct for Large Objects☆96Updated 6 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- Compact Data Structures Library☆101Updated 3 years ago
- C library to compute the Hamming weight of arrays☆49Updated 7 years ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆164Updated 11 months ago
- Fast decoder for VByte-compressed integers☆125Updated last month
- C library implementing the ridiculously fast CLHash hashing function☆281Updated last year
- Compute xxHash hash codes for 8 keys in parallel☆47Updated 6 years ago
- Fast differential coding functions (using SIMD instructions)☆55Updated 8 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year
- No sane compiler would optimize atomics: the presentation☆108Updated 9 years ago
- ♥ Janusz Brzozowski☆162Updated last year
- Comparing linear and binary searches☆43Updated 5 years ago
- Succinct data structures in C/C++☆92Updated last year
- Linear vs binary search benchmark☆41Updated 6 years ago