patmorin / arraylayoutLinks
Experiments with array layouts for comparison-based searching
☆86Updated 2 years ago
Alternatives and similar repositories for arraylayout
Users that are interested in arraylayout are comparing it to the libraries listed below
Sorting:
- Lock-free multithreaded memory allocation☆110Updated 9 years ago
- High-performance dictionary coding☆108Updated 8 years ago
- multi-way atomic compare-and-swap with x64/TSX☆85Updated 9 years ago
- High-performance multicore-scalable data structures and benchmarks☆144Updated 6 years ago
- Benchmark showing the we can randomly hash strings very quickly with good universality☆139Updated last year
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- Fast Hash Functions Using AES Intrinsics☆85Updated 6 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆121Updated 8 years ago
- bit & sketches data structures☆60Updated 7 years ago
- A collection of succinct data structures☆211Updated 2 years ago
- Compact Data Structures Library☆129Updated 11 years ago
- Fast decoder for VByte-compressed integers☆126Updated 2 months ago
- qp tries and crit-bit tries☆124Updated 3 years ago
- A fast alternative to the modulo reduction☆316Updated 4 years ago
- Compact Data Structures Library☆103Updated 3 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated 2 years ago
- Generates benchmark data for two different data structures, then renders some graphs.☆112Updated 6 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 3 years ago
- C library implementing the ridiculously fast CLHash hashing function☆281Updated last year
- Fast differential coding functions (using SIMD instructions)☆55Updated 8 years ago
- Compute xxHash hash codes for 8 keys in parallel☆47Updated 6 years ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆166Updated last year
- C library to compute the Hamming weight of arrays☆51Updated 7 years ago
- A Wait-Free Universal Construct for Large Objects☆96Updated 6 years ago
- No sane compiler would optimize atomics: the presentation☆108Updated 9 years ago
- Hashing functions and PRNGs based on them☆167Updated 2 months ago
- An-source C library developed and used at AppNexus.☆113Updated 6 years ago
- LLVM-jitted bitmaps☆27Updated 5 years ago
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆38Updated 7 years ago
- Hash Array Mapped Trie (C++ Templates)☆125Updated 2 years ago