bonitao / cmph

Related projects ⓘ

Alternatives and complementary repositories for cmph

• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 4 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆31Updated 11 months ago
• gerben-s / quicksort-blog-post
  ☆39Updated 3 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 …
  ☆21Updated 2 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated last year
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• mikekazakov / eytzinger
  Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
  ☆30Updated 7 years ago
• ByteHamster / SicHash
  A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.
  ☆15Updated last week
• ademakov / Oroch
  A C++ library for integer array compression
  ☆27Updated 2 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆28Updated last year
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆62Updated 5 months ago
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆12Updated 8 months ago
• jermp / mm_file
  A self-contained, header-only, implementation of memory-mapped files in C++ for fast integration into larger projects.
  ☆25Updated 3 months ago
• lemire / Concise
  C++ implementation of Concise and WAH compressed bitsets
  ☆21Updated 7 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.
  ☆26Updated this week
• shaovoon / floatbench
  String to Float Benchmark
  ☆19Updated 6 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 4 years ago
• jermp / psds
  Efficient Prefix-Sum data structures in C++.
  ☆25Updated last year
• fix8mt / fiber
  C++20 fiber implementation with similar interface to std::thread, header-only / x86_64 / Linux only / stackful / built-in scheduler / thr…
  ☆23Updated last month
• WojciechMula / man-intrinsics
  Create man pages from information used by Intel Intrinsics Guide and optionally uops.info
  ☆43Updated 3 years ago
• ashvardanian / HashTableBenchmark
  A simple cross-platform speed & memory-efficiency benchmark for the most common hash-table implementations in the C++ world
  ☆11Updated last year
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆37Updated 8 months ago
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆30Updated last year
• PatwinchIR / ultra-sort
  DSL for SIMD Sorting on AVX2 & AVX512
  ☆29Updated 5 years ago
• tarsa / SortingAlgorithmsBenchmark
  ☆15Updated 10 years ago
• vreverdy / bit-algorithms
  An exploratory implementation of bit overloads of the C++ standard algorithms
  ☆18Updated 3 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆75Updated 5 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 2 months ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆59Updated 3 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆60Updated 9 months ago