Alternatives and similar repositories for cmph

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

• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 years ago
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆30Updated last year
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 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
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• mikekazakov / eytzinger
  Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
  ☆32Updated 8 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆29Updated 3 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 9 months 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 3 years ago
• jermp / mm_file
  A self-contained, header-only, implementation of memory-mapped files in C++ for fast integration into larger projects.
  ☆26Updated 10 months ago
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆38Updated 4 years ago
• jermp / psds
  Efficient Prefix-Sum data structures in C++.
  ☆26Updated last year
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• vigna / sux
  Succinct data structures in C/C++
  ☆89Updated 8 months ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆66Updated 4 years ago
• lemire / Concise
  C++ implementation of Concise and WAH compressed bitsets
  ☆20Updated 8 years ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆60Updated 4 years ago
• WojciechMula / ternarylogiccli
  CLI utilty to work out proper constants for vpternlogic instruction
  ☆13Updated 2 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
• timlindeberg / rapidjson-LLDB-Formatters
  Provides LLDB data formatters for the rapidjson library
  ☆11Updated 2 years ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 2 years ago
• WojciechMula / simd-byte-lookup
  SIMDized check which bytes are in a set
  ☆28Updated 6 years ago
• tarsa / SortingAlgorithmsBenchmark
  ☆16Updated 11 years ago
• rurban / nbperf
  Improved NetBSD's Perfect Hash Generation Tool v3
  ☆20Updated last year
• WojciechMula / ternary-logic
  Support for ternary logic in SSE, XOP, AVX2 and x86 programs
  ☆31Updated 5 months ago
• schani / linbin
  Linear vs binary search benchmark
  ☆40Updated 5 years ago
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 12 years ago