Alternatives and similar repositories for libcubwt:

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

• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• nadavrot / fast_log
  A fast implementation of log() and exp()
  ☆53Updated 2 years ago
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆31Updated last year
• zwegner / zp7
  ZP7: Zach's Peppy Parallel-Prefix-Popcountin' PEXT/PDEP Polyfill
  ☆50Updated 6 months ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• renzibei / fph-table
  Flash Perfect Hash Table: an implementation of a dynamic perfect hash table, extremely fast for lookup
  ☆42Updated last year
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year
• skeeto / xf8
  8-bit Xor Filter in C99
  ☆61Updated 5 years ago
• komrad36 / FastArrayOps
  Extremely fast x86 / AVX2 assembly implementations of common operations for linear arrays: checking whether array contains element, findi…
  ☆37Updated 3 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 6 months ago
• dougallj / zlib-dougallj
  Experimental fork of zlib with performance improvements
  ☆35Updated last year
• stgatilov / linear-vs-binary-search
  Comparing linear and binary searches
  ☆39Updated 4 years ago
• eloj / radix-sorting
  Radix sorting from the ground up
  ☆36Updated last year
• WojciechMula / ternary-logic
  Support for ternary logic in SSE, XOP, AVX2 and x86 programs
  ☆31Updated 2 months ago
• loxxous / rans-tricks
  rans optimized tricks
  ☆24Updated 6 years ago
• nauful / NLZM
  Dictionary compressor with nibbled ANS and optimal parsing
  ☆25Updated 11 months ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 years ago
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆37Updated last year
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆39Updated 4 years ago
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆14Updated last year
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆76Updated last week
• WojciechMula / simd-byte-lookup
  SIMDized check which bytes are in a set
  ☆28Updated 6 years ago
• WojciechMula / simd-heap
  ☆10Updated last month
• nadavrot / bistra
  Bistra is a domain-specific language designed to generate high-performance kernels (such as GEMMs, convolutions, etc). The program is des…
  ☆6Updated last year
• corsix / fast-crc32
  Fast CRC32 implementations
  ☆70Updated last year
• nicola-gigante / bitvector
  A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …
  ☆26Updated 2 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• kfjahnke / zimt
  header-only C++ template library to process n-dimensional arrays with multithreaded SIMD code
  ☆41Updated 2 months ago
• jermp / dint
  Dictionary-based compression for inverted indexes.
  ☆23Updated 5 years ago