schani / linbinLinks
Linear vs binary search benchmark
☆41Updated 5 years ago
Alternatives and similar repositories for linbin
Users that are interested in linbin are comparing it to the libraries listed below
Sorting:
- Generates benchmark data for two different data structures, then renders some graphs.☆112Updated 6 years ago
- Vectorized version of the PCG random number generator☆84Updated 8 months ago
- High-performance multicore-scalable data structures and benchmarks☆143Updated 6 years ago
- A benchmark of some prominent C/C++ hash table implementations☆105Updated 6 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- bit & sketches data structures☆60Updated 7 years ago
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- Lock-free multithreaded memory allocation☆109Updated 8 years ago
- Fast decoder for VByte-compressed integers☆125Updated last year
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.☆135Updated 6 years ago
- Demonstration of LLVM's opt-viewer tool☆71Updated 8 years ago
- Comparing linear and binary searches☆41Updated 5 years ago
- A C++ library for integer array compression☆29Updated 3 years ago
- Not Another Range Library☆39Updated 11 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Fastest Histogram Construction☆72Updated 3 years ago
- Lightweight locality-aware user-level threading runtime.☆197Updated last month
- A Fast, Multicore-Scalable, Low-Fragmentation Memory Allocator☆163Updated 4 months ago
- C library to compute the Hamming weight of arrays☆49Updated 6 years ago
- Hashing functions and PRNGs based on them☆165Updated 9 months ago
- Hash Array Mapped Trie (C++ Templates)☆125Updated 2 years ago
- A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit f…☆276Updated 4 years ago
- multi-way atomic compare-and-swap with x64/TSX☆86Updated 8 years ago
- Intel(R) Concurrent Collections for C++☆116Updated 2 years ago
- Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compil…☆52Updated 4 years ago
- compile time assembly interpreter☆86Updated 7 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆46Updated 5 years ago
- Small Hash Optimization - an optimization for when you have many small hash maps - similar to LLVM's small vector optimization.☆39Updated 8 years ago
- Unstable O(n log n) sorting algorithm with O(n) memory☆65Updated 2 years ago