Alternatives and similar repositories for pospopcnt

Users that are interested in pospopcnt are comparing it to the libraries listed below

• pascaldekloe / flit
  fixed-length integer trim
  ☆34Updated 2 years ago
• dgryski / go-mph
  minimal perfect hash functions
  ☆62Updated 3 years ago
• rleiwang / svb
  Faster integer compression in Go with SIMD using StreamVByte codec
  ☆42Updated 2 years ago
• fwessels / simdcsv
  ☆36Updated 4 years ago
• nelz9999 / stream-vbyte-go
  A port of Stream VByte to Go
  ☆35Updated 3 years ago
• demerphq / BeagleHash
  Fast 64 bit evolved hash.
  ☆33Updated 8 years ago
• mettienne / tiered-vector
  Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…
  ☆50Updated last year
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year
• dgryski / go-marvin32
  Assembly-optimized Marvin32 hash function
  ☆12Updated last year
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆61Updated 4 years ago
• efficient / go-cuckoo
  A high-performance, memory-efficient concurrent hash table
  ☆36Updated 11 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• wdamron / x64
  x86-64 instruction encoder in Go
  ☆21Updated 5 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆54Updated 7 years ago
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆51Updated 7 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 8 years ago
• efficient / fast-succinct-trie
  ☆26Updated 8 years ago
• veorq / blabla
  like ChaCha, but 64-bit instead of 32-bit thanks to BLAKE2b's permutation
  ☆15Updated 8 years ago
• dgryski / go-boomphf
  Fast and scalable minimal perfect hashing for massive key sets
  ☆71Updated 5 years ago
• bmkessler / fastdiv
  Fast division, modulus and divisibility checks in Go for divisors known only at runtime.
  ☆117Updated 6 years ago
• kilic / fp
  Nearly generic prime field implementation in Go
  ☆24Updated 5 years ago
• dgryski / go-disco
  discohash
  ☆15Updated 3 years ago
• thanm / dragongo
  LLVM IR generation "middle end" for LLVM-based go compiler.
  ☆18Updated 2 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆119Updated 8 years ago
• aclements / objbrowse
  Interactive object file browser with symbol, source, assembly, and analysis
  ☆23Updated last year
• dgryski / peachpy-examples
  ☆15Updated 8 years ago
• dragontamer / AESRand
  Random Number Generator based on hardware-accelerated AES instructions
  ☆60Updated 6 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 6 years ago
• dgryski / go-wyhash
  wyhash fast non-cryptographic string hash
  ☆35Updated 5 years ago