mklarqvist / positional-popcountLinks
Fast C functions for the computing the positional popcount (pospopcnt).
☆55Updated 5 years ago
Alternatives and similar repositories for positional-popcount
Users that are interested in positional-popcount are comparing it to the libraries listed below
Sorting:
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- Vectorized version of the PCG random number generator☆83Updated 5 months ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- benchmarking positional population count☆15Updated last year
- A benchmark for sorting algorithms☆61Updated 4 years ago
- For details, see the blog post:☆32Updated last year
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- Fast Hash Functions Using AES Intrinsics☆82Updated 6 years ago
- Fast random number generators: Vectorized (SIMD) version of xorshift128+☆118Updated 5 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- Bloom-filter based minimal perfect hash function library☆266Updated last month
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- 8-bit Xor Filter in C99☆61Updated 5 years ago
- A simple bitset library in C☆135Updated 6 months ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- C library to compute the Hamming weight of arrays☆48Updated 6 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated 11 months ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- Bitset Sort, a faster std::sort replacement.☆78Updated 3 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆19Updated last month
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆54Updated last year
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- ☆39Updated 4 years ago
- C library implementing the ridiculously fast CLHash hashing function☆280Updated last year
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago