Alternatives and similar repositories for bitsetsort

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

• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆156Updated 5 months ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• lemire / despacer
  C library to remove white space from strings as fast as possible
  ☆154Updated 10 months ago
• dragontamer / AESRand
  Random Number Generator based on hardware-accelerated AES instructions
  ☆59Updated 6 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆30Updated 2 years ago
• google / hashtable-benchmarks
  ☆107Updated last year
• skeeto / xf8
  8-bit Xor Filter in C99
  ☆61Updated 5 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆119Updated 8 years ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆67Updated 4 years ago
• smilingthax / cttrie
  Compile-time TRIE based string matcher (C++11)
  ☆52Updated 6 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆84Updated last year
• WojciechMula / base64-avx512
  Code for paper "Base64 encoding and decoding at almost the speed of a memory copy"
  ☆204Updated 5 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆51Updated 11 years ago
• backtrace-labs / dynamic_flag
  A C library for runtime-flippable feature flags on Linux/x86-64, with negligible overhead in the common case
  ☆73Updated 2 years ago
• backtrace-labs / poireau
  Poireau: a sampling allocation debugger
  ☆99Updated 3 years ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆60Updated 4 years ago
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆310Updated 4 years ago
• 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 / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆117Updated 4 years ago
• pramalhe / CX
  A Wait-Free Universal Construct for Large Objects
  ☆97Updated 5 years ago
• ips4o / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆121Updated 5 months ago
• senderista / hashtable-benchmarks
  An Evaluation of Linear Probing Hashtable Algorithms
  ☆32Updated last year
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆279Updated 6 months ago
• abolz / Drachennest
  Different algorithms for converting binary to decimal floating-point numbers
  ☆121Updated 2 years ago
• komrad36 / SortingNetworks
  Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compil…
  ☆46Updated 4 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago
• vnmakarov / mum-hash
  Hashing functions and PRNGs based on them
  ☆162Updated 5 months ago