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 6 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 5 years ago
- Vectorized version of the PCG random number generator☆84Updated 9 months ago
- benchmarking positional population count☆17Updated 2 months ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- A fast implementation for varbyte 32bit/64bit integer compression☆121Updated 8 years ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated 2 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆65Updated last year
- Fast random number generators: Vectorized (SIMD) version of xorshift128+☆120Updated 5 years ago
- For details, see the blog post:☆34Updated 2 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- A benchmark for sorting algorithms☆62Updated 4 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Updated 2 years ago
- Fast Hash Functions Using AES Intrinsics☆84Updated 6 years ago
- C library to compute the Hamming weight of arrays☆51Updated 7 years ago
- A simple bitset library in C☆141Updated 10 months ago
- A collection of SIMD optimized general purpose hash functions☆47Updated 10 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 8 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- 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
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- A C++ library for integer array compression☆30Updated 3 years ago
- DSL for SIMD Sorting on AVX2 & AVX512☆31Updated 6 years ago
- Bloom-filter based minimal perfect hash function library☆270Updated 5 months 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
- Variant on Wang Yi's wyhash with 32-bit output, using at most 64-bit math☆26Updated 6 years ago
- 8-bit Xor Filter in C99☆62Updated 6 years ago
- A collection of string sorting algorithms☆55Updated 3 years ago