schani / linbinLinks
Linear vs binary search benchmark
☆40Updated 5 years ago
Alternatives and similar repositories for linbin
Users that are interested in linbin are comparing it to the libraries listed below
Sorting:
- High-performance multicore-scalable data structures and benchmarks☆142Updated 6 years ago
- Generates benchmark data for two different data structures, then renders some graphs.☆112Updated 5 years ago
- bit & sketches data structures☆60Updated 6 years ago
- Vectorized version of the PCG random number generator☆83Updated 5 months ago
- Lock-free multithreaded memory allocation☆108Updated 8 years ago
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- A benchmark of some prominent C/C++ hash table implementations☆105Updated 6 years ago
- Demonstration of LLVM's opt-viewer tool☆71Updated 8 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Comparing linear and binary searches☆41Updated 5 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- A Fast, Multicore-Scalable, Low-Fragmentation Memory Allocator☆163Updated 2 months ago
- Not Another Range Library☆39Updated 11 years ago
- C library to compute the Hamming weight of arrays☆48Updated 6 years ago
- Fast decoder for VByte-compressed integers☆124Updated last year
- Benchmark showing the we can randomly hash strings very quickly with good universality☆137Updated 7 months ago
- multi-way atomic compare-and-swap with x64/TSX☆86Updated 8 years ago
- compile time assembly interpreter☆85Updated 7 years ago
- A C++ library for integer array compression☆29Updated 3 years ago
- finding set bits in large bitmaps☆15Updated 9 years ago
- Intel(R) Concurrent Collections for C++☆116Updated 2 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- Fast and Reliable (but not Secure) Hash☆54Updated 7 years ago
- Non-blocking message passing (a C++14 MPI wrapper)☆18Updated 10 years ago
- Lightweight locality-aware user-level threading runtime.☆193Updated this week
- Fastest Histogram Construction☆70Updated 3 years ago
- ☆13Updated 9 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Updated 5 years ago