clausecker / pospopcntLinks
AVX-2 vectorised 8-bit positional popcount for Go
☆23Updated 5 years ago
Alternatives and similar repositories for pospopcnt
Users that are interested in pospopcnt are comparing it to the libraries listed below
Sorting:
- minimal perfect hash functions☆64Updated 4 years ago
- Faster integer compression in Go with SIMD using StreamVByte codec☆43Updated 2 years ago
- ☆37Updated 5 years ago
- fixed-length integer trim☆35Updated 2 years ago
- A small DFA for under 16 states☆53Updated 7 years ago
- Fast 64 bit evolved hash.☆34Updated 8 years ago
- A port of Stream VByte to Go☆35Updated 3 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated 2 years ago
- x86-64 instruction encoder in Go☆22Updated 6 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- Assembly-optimized Marvin32 hash function☆12Updated last year
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 7 years ago
- Interactive object file browser with symbol, source, assembly, and analysis☆22Updated last year
- A Go package for myriad array operations using wavelet trees☆18Updated 9 years ago
- Fast division, modulus and divisibility checks in Go for divisors known only at runtime.☆118Updated 6 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
- Fast and scalable minimal perfect hashing for massive key sets☆72Updated 5 years ago
- A high-performance, memory-efficient concurrent hash table☆36Updated 12 years ago
- wyhash fast non-cryptographic string hash☆37Updated 5 years ago
- SSE-optimized group varint integer encoding☆39Updated 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
- Some basic unsigned 128 bit math and bitwise operations implemented in go☆18Updated 11 years ago
- A benchmark for sorting algorithms☆63Updated 4 years ago
- Go implementation of libhydrogen - a lightweight, easy-to-use crypto library☆24Updated 8 years ago
- Nearly generic prime field implementation in Go☆24Updated 5 years ago
- Positional Population Count for Go☆70Updated last month
- like ChaCha, but 64-bit instead of 32-bit thanks to BLAKE2b's permutation☆16Updated 8 years ago
- A Go library for space-efficient rank/select operations for both sparse and dense bit arrays.☆37Updated 5 years ago
- A Stream VByte implementation in Go leveraging SIMD techniques☆18Updated 4 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago