Alternatives and similar repositories for cmph:

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

• 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
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆14Updated last year
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 years ago
• jermp / mm_file
  A self-contained, header-only, implementation of memory-mapped files in C++ for fast integration into larger projects.
  ☆26Updated 7 months ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆63Updated 10 months ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆29Updated 3 years ago
• WojciechMula / simd-heap
  ☆10Updated 2 months ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆65Updated 4 years ago
• mikekazakov / eytzinger
  Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
  ☆31Updated 7 years ago
• 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 2 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆50Updated 10 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆87Updated 5 months ago
• shaovoon / floatbench
  String to Float Benchmark
  ☆19Updated 6 years ago
• tommyettinger / waterhash
  Variant on Wang Yi's wyhash with 32-bit output, using at most 64-bit math
  ☆26Updated 5 years ago
• ljestrada / charconvutils
  C++17 sports two low-level character conversion functions, std::from_chars and std::to_chars, but they have a usage model that can be ea…
  ☆8Updated 5 years ago
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆31Updated last year
• jermp / essentials
  Essential C++ utilities.
  ☆15Updated 9 months ago
• Quuxplusone / ring_view
  std::ring_span (SG14, P0059R1)
  ☆46Updated 8 years ago
• WojciechMula / man-intrinsics
  Create man pages from information used by Intel Intrinsics Guide and optionally uops.info
  ☆45Updated 3 months ago
• PatwinchIR / ultra-sort
  DSL for SIMD Sorting on AVX2 & AVX512
  ☆30Updated 6 years ago
• jermp / psds
  Efficient Prefix-Sum data structures in C++.
  ☆25Updated last year
• schani / linbin
  Linear vs binary search benchmark
  ☆41Updated 5 years ago
• lemire / Concise
  C++ implementation of Concise and WAH compressed bitsets
  ☆20Updated 7 years ago
• HowardHinnant / hash_append
  Implementation of hash_append proposal
  ☆69Updated 8 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.
  ☆29Updated 4 months ago