stgatilov / linear-vs-binary-search
Comparing linear and binary searches
☆39Updated 4 years ago
Alternatives and similar repositories for linear-vs-binary-search:
Users that are interested in linear-vs-binary-search are comparing it to the libraries listed below
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆31Updated last year
- AVX512F and AVX2 versions of quick sort☆105Updated 7 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆52Updated last year
- benchmarking positional population count☆14Updated last year
- Fastest Histogram Construction☆70Updated 3 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 7 years ago
- ☆39Updated 4 years ago
- SIMDized check which bytes are in a set☆28Updated 6 years ago
- A hash table implementation using Robin Hood Linear Probing☆50Updated 10 years ago
- For details, see the blog post:☆32Updated last year
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- Random Number Generator based on hardware-accelerated AES instructions☆56Updated 5 years ago
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆38Updated 4 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- Fast open addressing hash table☆41Updated last year
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- Generic SIMD intrinsic to allow for portable SIMD intrinsic programming☆42Updated 11 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- A collection of SIMD optimized general purpose hash functions☆44Updated 10 years ago
- SIMD sorting network generator and very basic tester☆16Updated 2 years ago
- String map implementation through Fast Succinct Trie☆21Updated 3 years ago
- A Wait-Free Universal Construct for Large Objects☆96Updated 5 years ago
- C++ Scattered Containers☆67Updated 7 years ago
- Looking into the performance of heaps, starting with the Min-Max Heap☆65Updated 4 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Support for ternary logic in SSE, XOP, AVX2 and x86 programs☆31Updated 2 months ago
- Small Hash Optimization - an optimization for when you have many small hash maps - similar to LLVM's small vector optimization.☆39Updated 7 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago