Alternatives and similar repositories for patchmap

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

• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆55Updated 6 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆87Updated 3 weeks ago
• tommyettinger / waterhash
  Variant on Wang Yi's wyhash with 32-bit output, using at most 64-bit math
  ☆26Updated 6 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 6 years ago
• ByteHamster / SicHash
  A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.
  ☆21Updated 4 months ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆85Updated 6 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆35Updated 2 years ago
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆31Updated 2 years ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆122Updated 5 years ago
• vreverdy / bit-algorithms
  An exploratory implementation of bit overloads of the C++ standard algorithms
  ☆18Updated 4 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆121Updated 8 years ago
• adrian17 / cpp-drop-merge-sort
  C++ reimplementation of https://github.com/emilk/drop-merge-sort
  ☆21Updated 4 years ago
• stg7 / haesni
  haesni is a small hash function using aes-ni for fast string hashing
  ☆19Updated 7 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆52Updated 11 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆66Updated last year
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆31Updated 3 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆36Updated 3 years ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆63Updated 4 years ago
• mikekazakov / eytzinger
  Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
  ☆33Updated 8 years ago
• bonitao / cmph
  ☆20Updated 3 weeks ago
• lemire / Concise
  C++ implementation of Concise and WAH compressed bitsets
  ☆20Updated 8 years ago
• philsquared / hash_trie
  A persistent hash array-mapped trie for C++
  ☆91Updated 2 years ago
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆38Updated 3 years ago
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆17Updated 3 months ago
• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆70Updated 2 years ago
• PatwinchIR / ultra-sort
  DSL for SIMD Sorting on AVX2 & AVX512
  ☆31Updated 7 years ago
• piperchester / cpp-btree
  Optimized for systems that read and write large blobs.
  ☆12Updated 10 years ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆79Updated 3 years ago