WojciechMula / simd-byte-lookupLinks
SIMDized check which bytes are in a set
☆28Updated 6 years ago
Alternatives and similar repositories for simd-byte-lookup
Users that are interested in simd-byte-lookup are comparing it to the libraries listed below
Sorting:
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- A small DFA for under 16 states☆51Updated 7 years ago
- Support for ternary logic in SSE, XOP, AVX2 and x86 programs☆31Updated 6 months ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- Random Number Generator based on hardware-accelerated AES instructions☆59Updated 6 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- Shuffle-based predicate matcher and all-round branch free swiss army chainsaw☆17Updated 7 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- Bloom filter alternative (C++)☆18Updated 6 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆16Updated 10 years ago
- Vectorized version of the PCG random number generator☆80Updated 4 months ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- A proof-of-concept for a fast regex matcher using lossy NFA matching on SIMD☆12Updated 6 years ago
- How fast can we shuffle values?☆37Updated last year
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆39Updated 4 years ago
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- NetBSD cdb (constant database) library☆14Updated 6 years ago
- String to Float Benchmark☆19Updated 6 years ago
- Quick 'n' Dirty benchmarks for various integer parsing methods in C++☆40Updated 5 years ago
- benchmarking positional population count☆15Updated last year
- MlpIndex - Extremely fast ordered index via memory level parallelism☆12Updated 6 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- For details, see the blog post:☆32Updated last year
- finding set bits in large bitmaps☆15Updated 9 years ago
- Pruning of blanks from an ASCII stream - musings in AMD64 and ARM64☆10Updated 4 years ago
- Counting the collisions with perl hash tables per function☆12Updated 6 years ago
- Intriman is a documentation generator that retargets the Intel Intrinsics Guide to other documentation formats☆28Updated 3 years ago
- A collection of SIMD optimized general purpose hash functions☆45Updated 10 years ago
- Dictionary-based compression for inverted indexes.☆23Updated 6 years ago