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:
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- Vectorized version of the PCG random number generator☆80Updated 4 months ago
- Generates benchmark data for two different data structures, then renders some graphs.☆112Updated 5 years ago
- Demonstration of LLVM's opt-viewer tool☆71Updated 8 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- High-performance multicore-scalable data structures and benchmarks☆142Updated 6 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- Lock-free multithreaded memory allocation☆106Updated 8 years ago
- A benchmark of some prominent C/C++ hash table implementations☆105Updated 6 years ago
- Fast and Reliable (but not Secure) Hash☆54Updated 7 years ago
- A C++ library for integer array compression☆29Updated 3 years ago
- Comparing linear and binary searches☆41Updated 5 years ago
- Intel(R) Concurrent Collections for C++☆116Updated 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
- bit & sketches data structures☆60Updated 6 years ago
- Fastest Histogram Construction☆70Updated 3 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- C library to compute the Hamming weight of arrays☆48Updated 6 years ago
- benchmarking positional population count☆15Updated last year
- compile time assembly interpreter☆85Updated 7 years ago
- Not Another Range Library☆39Updated 11 years ago
- Coroutines/Fibers implementation for x86☆65Updated 8 years ago
- ☆13Updated 9 years ago
- Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.☆134Updated 5 years ago
- A persistent hash array-mapped trie for C++☆91Updated 2 years ago
- Benchmark showing the we can randomly hash strings very quickly with good universality☆137Updated 6 months ago
- A Fast, Multicore-Scalable, Low-Fragmentation Memory Allocator☆163Updated last month
- C++ reimplementation of https://github.com/emilk/drop-merge-sort☆21Updated 3 years ago
- A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit f…☆275Updated 3 years ago
- ☆13Updated 3 months ago