Alternatives and similar repositories for ips4o

Users that are interested in ips4o are comparing it to the libraries listed below

• ips4o / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆129Updated 10 months ago
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆314Updated 4 years ago
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆268Updated 3 months ago
• TooBiased / growt
  This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…
  ☆116Updated 10 months ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆84Updated last year
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• tlk00 / BitMagic
  BitMagic Library
  ☆433Updated 2 months ago
• simdhash / clhash
  C library implementing the ridiculously fast CLHash hashing function
  ☆280Updated last year
• 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
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆286Updated 2 months ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆50Updated 4 months ago
• fast-pack / streamvbyte
  Fast integer compression in C using the StreamVByte codec
  ☆410Updated 9 months ago
• WojciechMula / sse-popcount
  SIMD (SSE) population count --- http://0x80.pl/articles/sse-popcount.html
  ☆349Updated last year
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year
• geofflangdale / simdcsv
  A fast SIMD parser for CSV files
  ☆158Updated 3 years ago
• ot / succinct
  A collection of succinct data structures
  ☆211Updated last year
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆55Updated 5 years ago
• google / hashtable-benchmarks
  ☆111Updated last year
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆84Updated 6 years ago
• jermp / pthash
  ✈️ PTHash is a fast and compact minimal perfect hash function.
  ☆246Updated this week
• fast-pack / simdcomp
  A simple C library for compressing lists of integers using binary packing
  ☆511Updated 2 years ago
• FastFilter / xor_singleheader
  Header-only binary fuse and xor filter library
  ☆410Updated 2 months ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆120Updated 5 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆108Updated 8 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated last year
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆38Updated 2 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆65Updated last year
• WojciechMula / sse4-strstr
  SIMD (SWAR/SSE/SSE4/AVX2/AVX512F/ARM Neon) of Karp-Rabin algorithm's modification
  ☆261Updated 3 years ago
• pasta-toolbox / bit_vector
  Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.
  ☆32Updated 7 months ago