Alternatives and similar repositories for bitsetsort:

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

• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆68Updated 7 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆38Updated 4 years ago
• google / hashtable-benchmarks
  ☆106Updated last year
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆117Updated 8 years ago
• WojciechMula / base64-avx512
  Code for paper "Base64 encoding and decoding at almost the speed of a memory copy"
  ☆204Updated 5 years ago
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆155Updated 3 months ago
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• dragontamer / AESRand
  Random Number Generator based on hardware-accelerated AES instructions
  ☆57Updated 6 years ago
• backtrace-labs / poireau
  Poireau: a sampling allocation debugger
  ☆87Updated 3 years ago
• lemire / despacer
  C library to remove white space from strings as fast as possible
  ☆152Updated 8 months ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆60Updated 4 years ago
• KholdStare / qnd-integer-parsing-experiments
  Quick 'n' Dirty benchmarks for various integer parsing methods in C++
  ☆40Updated 4 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆52Updated 7 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 years ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆65Updated 4 years ago
• pramalhe / CX
  A Wait-Free Universal Construct for Large Objects
  ☆96Updated 5 years ago
• stryku / ctai
  compile time assembly interpreter
  ☆85Updated 7 years ago
• SaschaWitt / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆162Updated 3 months ago
• skeeto / xf8
  8-bit Xor Filter in C99
  ☆61Updated 5 years ago
• smilingthax / cttrie
  Compile-time TRIE based string matcher (C++11)
  ☆53Updated 6 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 8 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆50Updated 10 years ago
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆308Updated 4 years ago
• danlark1 / miniselect
  Selection and partial sorting algorithms
  ☆136Updated last month
• lemire / testingmlp
  Testing memory-level parallelism
  ☆68Updated last year
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆173Updated 5 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago