Alternatives and similar repositories for ultra-sort

Users that are interested in ultra-sort are comparing it to the libraries listed below

• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆46Updated 6 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 4 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 8 years ago
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆16Updated 2 months ago
• ssteinberg / shared_futex
  Fast, shared, upgradeable, non-recursive and non-fair mutex
  ☆36Updated 7 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆34Updated 2 years ago
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 12 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 8 years ago
• TooBiased / DySECT
  Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.
  ☆22Updated 3 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆55Updated 5 years ago
• lemire / Concise
  C++ implementation of Concise and WAH compressed bitsets
  ☆20Updated 8 years ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 5 years ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆69Updated 4 years ago
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆41Updated last year
• TooBiased / growt
  This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…
  ☆117Updated 11 months ago
• edanor / umesimd
  UME::SIMD A library for explicit simd vectorization.
  ☆91Updated 7 years ago
• tarsa / SortingAlgorithmsBenchmark
  ☆16Updated 11 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆84Updated 9 months ago
• cmuparlay / parlayhash
  Concurrent Hash Table
  ☆36Updated last month
• 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
• lorenzhs / ssssort
  Super Scalar Sample Sort in modern C++
  ☆21Updated 5 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆51Updated 11 years ago
• tommyettinger / waterhash
  Variant on Wang Yi's wyhash with 32-bit output, using at most 64-bit math
  ☆26Updated 6 years ago
• lemire / counters
  performance counters in C++
  ☆22Updated 2 months ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆288Updated 3 months ago
• renzibei / fph-table
  Flash Perfect Hash Table: an implementation of a dynamic perfect hash table, extremely fast for lookup
  ☆49Updated 2 years ago
• mpoeter / emr
  Effective Memory Reclamation
  ☆63Updated 5 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆30Updated 3 years ago
• rigtorp / isatomic
  Test if AVX vector loads and stores are atomic
  ☆35Updated 5 years ago
• cmuparlay / flock
  Library for lock-free locks
  ☆83Updated 2 years ago