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
  ☆121Updated 8 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆55Updated 5 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆84Updated 10 months ago
• rantala / string-sorting
  A collection of string sorting algorithms
  ☆55Updated 3 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆101Updated 3 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆65Updated last year
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 5 years ago
• lemire / despacer
  C library to remove white space from strings as fast as possible
  ☆156Updated last year
• simdhash / clhash
  C library implementing the ridiculously fast CLHash hashing function
  ☆281Updated last year
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆63Updated 4 years ago
• gpakosz / PackedArray
  Random access array of tightly packed unsigned integers
  ☆171Updated 3 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 6 years ago
• lemire / cbitset
  A simple bitset library in C
  ☆142Updated 10 months ago
• skeeto / xf8
  8-bit Xor Filter in C99
  ☆62Updated 6 years ago
• fclaude / libcds
  Compact Data Structures Library
  ☆129Updated 11 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆51Updated 11 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
• vnmakarov / mum-hash
  Hashing functions and PRNGs based on them
  ☆166Updated last month
• cleeus / hashx4
  A collection of SIMD optimized general purpose hash functions
  ☆47Updated 10 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆30Updated 3 years ago
• wahern / phf
  Tiny perfect hash library for C, C++, and Lua
  ☆169Updated 6 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• preshing / CompareIntegerMaps
  Generates benchmark data for two different data structures, then renders some graphs.
  ☆112Updated 6 years ago
• simongog / sdsl
  Succinct Data Structure Library
  ☆109Updated 12 years ago
• gmarcais / compact_vector
  Bit packed vector of integral values
  ☆28Updated 11 months ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated 2 years ago
• cksystemsgroup / scalloc
  A Fast, Multicore-Scalable, Low-Fragmentation Memory Allocator
  ☆163Updated 6 months ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated 3 weeks ago
• kobalicek / mpsl
  Shader-Like Mathematical Expression JIT Engine for C++ Language
  ☆59Updated 6 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year