stg7 / haesni
haesni is a small hash function using aes-ni for fast string hashing
☆16Updated 6 years ago
Alternatives and similar repositories for haesni:
Users that are interested in haesni are comparing it to the libraries listed below
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- qp tries and crit-bit tries☆119Updated 2 years ago
- benchmarking positional population count☆14Updated last year
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆38Updated 4 years ago
- 8-bit Xor Filter in C99☆61Updated 5 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 5 years ago
- ☆39Updated 4 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- For details, see the blog post:☆32Updated last year
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated 11 months ago
- Fast differential coding functions (using SIMD instructions)☆52Updated 7 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- A hash table implementation using Robin Hood Linear Probing☆50Updated 10 years ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- 64-bit PRNG shootout☆16Updated this week
- Branchless UTF-8 decoder☆34Updated 7 years ago
- Random Number Generator based on hardware-accelerated AES instructions☆57Updated 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
- Comparing linear and binary searches☆40Updated 5 years ago
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆16Updated 10 years ago
- Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++☆32Updated 8 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆117Updated 8 years 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
- Quick sort code using AVX2 instructions☆68Updated 7 years ago
- Universe-sliced indexes in C++.☆18Updated 2 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
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Looking into the performance of heaps, starting with the Min-Max Heap☆65Updated 4 years ago