Alternatives and similar repositories for art_map

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

• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆45Updated last week
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 2 years ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 2 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆53Updated last year
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆35Updated 2 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 9 months ago
• bhavanajain / concurrent-priority-queues
  Implemented Concurrent Priority Queues using fine grained locking over sequential heap and lockfree skiplist-based
  ☆8Updated 7 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 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.
  ☆30Updated last month
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆27Updated 2 months ago
• gmarcais / compact_vector
  Bit packed vector of integral values
  ☆27Updated 4 months ago
• amplab / succinct-cpp
  Succinct C++
  ☆24Updated 4 years ago
• cmuparlay / parlayhash
  Concurrent Hash Table
  ☆27Updated last month
• L-v-M / async
  ☆20Updated 2 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago
• caetanosauer / fineline-zero
  ☆12Updated 6 years ago
• llersch / cpp_random_distributions
  Additional C++11 Random Distributions
  ☆18Updated last year
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆105Updated 7 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• ByteHamster / SicHash
  A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.
  ☆19Updated 2 months ago
• LPD-EPFL / CLHT
  CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.
  ☆159Updated 3 years ago
• cmuparlay / flock
  Library for lock-free locks
  ☆80Updated last year
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 8 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 3 years ago
• boostorg / boost_unordered_benchmarks
  ☆21Updated 7 months ago
• voutcn / kxsort
  Fast in-place radix sort with STL-like API
  ☆46Updated 8 years ago
• hidva / clayout
  Translate C++/Rust type into C type with the same memory layout
  ☆16Updated 2 years ago