Alternatives and similar repositories for string-sorting:

Users that are interested in string-sorting are comparing it to the libraries listed below

• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆77Updated last month
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆50Updated 10 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆98Updated 2 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆63Updated 10 months ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• bingmann / parallel-string-sorting
  Collection of Parallel String Sorting Algorithms including Parallel Super Scalar String Sample Sort and Parallel Multiway LCP-Mergesort
  ☆33Updated last year
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆29Updated 3 years ago
• fjtapia / sort_parallel
  ☆13Updated 2 years ago
• fast-pack / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆53Updated last year
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆59Updated 3 years ago
• mklarqvist / StormBitmaps
  Fast algorithms for computing XX^T for binary matrices
  ☆14Updated 5 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(…
  ☆49Updated 11 months ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 12 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆45Updated 6 years ago
• simongog / sdsl
  Succinct Data Structure Library
  ☆106Updated 11 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year
• tarsa / SortingAlgorithmsBenchmark
  ☆15Updated 10 years ago
• schani / linbin
  Linear vs binary search benchmark
  ☆40Updated 5 years ago
• preshing / CompareIntegerMaps
  Generates benchmark data for two different data structures, then renders some graphs.
  ☆112Updated 5 years ago
• voutcn / kxsort
  Fast in-place radix sort with STL-like API
  ☆46Updated 8 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆116Updated 8 years ago
• genericsimd / generic_simd
  Generic SIMD intrinsic to allow for portable SIMD intrinsic programming
  ☆42Updated 11 years ago
• andralex / MedianOfNinthers
  ☆49Updated 5 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• noporpoise / jelly-hash
  Low memory multithreaded hash table
  ☆24Updated 10 years ago