patmorin / arraylayoutLinks
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
Sorting:
- bit & sketches data structures☆60Updated 6 years ago
- High-performance dictionary coding☆105Updated 8 years ago
- Lock-free multithreaded memory allocation☆108Updated 8 years ago
- multi-way atomic compare-and-swap with x64/TSX☆86Updated 8 years ago
- Compact Data Structures Library☆128Updated 11 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- Benchmark showing the we can randomly hash strings very quickly with good universality☆138Updated 7 months ago
- C library to compute the Hamming weight of arrays☆48Updated 6 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- High-performance multicore-scalable data structures and benchmarks☆142Updated 6 years ago
- qp tries and crit-bit tries☆121Updated 3 years ago
- A collection of succinct data structures☆209Updated last year
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- C library implementing the ridiculously fast CLHash hashing function☆281Updated 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
- A fast alternative to the modulo reduction☆311Updated 4 years ago
- Compact Data Structures Library☆101Updated 3 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
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- Compute xxHash hash codes for 8 keys in parallel☆45Updated 6 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 6 years ago
- A Wait-Free Universal Construct for Large Objects☆96Updated 5 years ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆163Updated 7 months ago
- LLVM-jitted bitmaps☆27Updated 5 years ago
- Fast decoder for VByte-compressed integers☆124Updated last year
- Linear vs binary search benchmark☆40Updated 5 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- An-source C library developed and used at AppNexus.☆111Updated 5 years ago
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆37Updated 6 years ago