WojciechMula / simd-searchLinks
Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
☆52Updated 8 years ago
Alternatives and similar repositories for simd-search
Users that are interested in simd-search are comparing it to the libraries listed below
Sorting:
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆46Updated 5 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- Fast Hash Functions Using AES Intrinsics☆83Updated 6 years ago
- Fast decoder for VByte-compressed integers☆125Updated last year
- C library to compute the Hamming weight of arrays☆48Updated 6 years ago
- High-performance dictionary coding☆106Updated 8 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- C library to pack and unpack short arrays of integers as fast as possible☆91Updated 2 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Vectorized version of the PCG random number generator☆83Updated 6 months ago
- Very low-overhead timer/counter interfaces for C on Intel 64 processors.☆134Updated 5 years ago
- A benchmark for sorting algorithms☆61Updated 4 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year
- qp tries and crit-bit tries☆121Updated 3 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆53Updated last year
- Succinct data structures in C/C++☆88Updated 11 months ago
- benchmarking positional population count☆15Updated last year
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Updated 5 years ago
- Compute xxHash hash codes for 8 keys in parallel☆46Updated 6 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆63Updated last year
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- Lock-free multithreaded memory allocation☆108Updated 8 years ago
- Fast random number generators: Vectorized (SIMD) version of xorshift128+☆119Updated 5 years ago