Alternatives and similar repositories for string-sorting

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

• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆80Updated 3 months ago
• lemire / Concise
  C++ implementation of Concise and WAH compressed bitsets
  ☆20Updated 8 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆100Updated 3 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
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• stxxl / foxxll
  FOundation of stXXl and thriLL
  ☆14Updated last year
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆64Updated last year
• schani / linbin
  Linear vs binary search benchmark
  ☆40Updated 5 years ago
• voutcn / kxsort
  Fast in-place radix sort with STL-like API
  ☆47Updated 8 years ago
• tarsa / SortingAlgorithmsBenchmark
  ☆16Updated 11 years ago
• lemire / SIMDIntersections
  Vectorized intersections (research code)
  ☆16Updated 8 years ago
• fjtapia / sort_parallel
  ☆13Updated last month
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆56Updated 2 years ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆60Updated 4 years ago
• dominikkempa / fsais
  External memory suffix array construction using inducing
  ☆11Updated 4 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆119Updated 8 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆51Updated 11 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
  ☆54Updated last year
• mackstann / hash-table-shootout
  A benchmark of some prominent C/C++ hash table implementations
  ☆105Updated 6 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
• stgatilov / linear-vs-binary-search
  Comparing linear and binary searches
  ☆41Updated 5 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆47Updated 6 years ago
• michaelvlach / ADbHash
  Really fast C++ hash table
  ☆14Updated 7 years ago
• nicolaprezza / BWTIL
  BWT Text Indexing Library: a set of tools to work with BWT-based text indexes
  ☆25Updated 3 years ago