Alternatives and similar repositories for radix

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

• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆118Updated 8 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆77Updated 3 months ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆100Updated 2 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆51Updated 11 years ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆60Updated 4 years ago
• schani / linbin
  Linear vs binary search benchmark
  ☆40Updated 5 years ago
• 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 3 years ago
• skeeto / xf8
  8-bit Xor Filter in C99
  ☆61Updated 5 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆29Updated 3 years ago
• Lazin / Syncope
  Synchronization library for C++11
  ☆17Updated 8 years ago
• rantala / string-sorting
  A collection of string sorting algorithms
  ☆55Updated 3 years ago
• graphitemaster / libintrusive
  Intrusive data structures for C
  ☆58Updated 7 years ago
• greg7mdp / sho
  Small Hash Optimization - an optimization for when you have many small hash maps - similar to LLVM's small vector optimization.
  ☆39Updated 7 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆63Updated last year
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆37Updated last year
• 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
• dryman / hash_bench
  Popular hash table implementation benchmarks
  ☆27Updated 7 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆53Updated 7 years ago
• noporpoise / jelly-hash
  Low memory multithreaded hash table
  ☆24Updated 10 years ago
• skarupke / radix_sort
  ☆12Updated 8 years ago
• stryku / ctai
  compile time assembly interpreter
  ☆85Updated 7 years ago
• voutcn / kxsort
  Fast in-place radix sort with STL-like API
  ☆46Updated 8 years ago
• adrian17 / cpp-drop-merge-sort
  C++ reimplementation of https://github.com/emilk/drop-merge-sort
  ☆21Updated 3 years ago
• mackstann / hash-table-shootout
  A benchmark of some prominent C/C++ hash table implementations
  ☆105Updated 6 years ago
• noporpoise / carrays
  Algorithms that work on generic C arrays
  ☆11Updated 8 years ago
• KrishnaAchuthan / curry
  Support for Currying and Function Composition in C++
  ☆61Updated 9 years ago
• gnzlbg / scattered
  C++ Scattered Containers
  ☆67Updated 7 years ago