Alternatives and similar repositories for string-sorting:

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

• fclaude / libcds2
  Compact Data Structures Library
  ☆98Updated 2 years ago
• fjtapia / sort_parallel
  ☆13Updated 2 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆76Updated 6 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆63Updated 9 months ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 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
  ☆50Updated 10 years ago
• Manu343726 / Polyop
  Overridable universal operator overloading for C++14
  ☆20Updated 10 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 7 years ago
• philsquared / hash_trie
  A persistent hash array-mapped trie for C++
  ☆91Updated last year
• lemire / SIMDIntersections
  Vectorized intersections (research code)
  ☆14Updated 8 years ago
• lemire / Concise
  C++ implementation of Concise and WAH compressed bitsets
  ☆20Updated 7 years ago
• tarsa / SortingAlgorithmsBenchmark
  ☆15Updated 10 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆116Updated 8 years ago
• schani / linbin
  Linear vs binary search benchmark
  ☆40Updated 5 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago
• LEW21 / yieldxx
  Prettiest C++ generator/coroutine implementation.
  ☆14Updated 9 years ago
• bingmann / parallel-string-sorting
  Collection of Parallel String Sorting Algorithms including Parallel Super Scalar String Sample Sort and Parallel Multiway LCP-Mergesort
  ☆32Updated last year
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated 2 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
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• nicolaprezza / BWTIL
  BWT Text Indexing Library: a set of tools to work with BWT-based text indexes
  ☆25Updated 2 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 10 months ago
• executors / futures
  A proposal for a futures programming model for ISO C++
  ☆22Updated 6 years ago
• preshing / CompareIntegerMaps
  Generates benchmark data for two different data structures, then renders some graphs.
  ☆112Updated 5 years ago
• pacxx / pacxx-llvm
  Programming Accelerators with C++ (PACXX)
  ☆58Updated 7 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆29Updated 2 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆45Updated 6 years ago
• BoostGSoC13 / boost.afio
  HISTORICAL INTEREST ONLY: Post peer review AFIO v2 rewrite is now at https://github.com/ned14/boost.afio
  ☆46Updated 8 years ago
• stxxl / foxxll
  FOundation of stXXl and thriLL
  ☆14Updated last year