Alternatives and similar repositories for Concise

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

• philsquared / hash_trie
  A persistent hash array-mapped trie for C++
  ☆92Updated 2 years ago
• fast-pack / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆54Updated last year
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 6 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆35Updated 2 years ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆69Updated 5 years ago
• Tessil / array-hash
  C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
  ☆185Updated 3 months ago
• alasdairmackintosh / google-concurrency-library
  Automatically exported from code.google.com/p/google-concurrency-library
  ☆35Updated 10 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆52Updated 11 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 4 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆30Updated 3 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆93Updated last year
• rollbear / prio_queue
  C++14 cache friendly B-heap priority queue
  ☆109Updated 4 months ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆55Updated 6 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆51Updated 7 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆87Updated 3 weeks ago
• boostorg / boost_unordered_benchmarks
  ☆22Updated 2 months ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 8 years ago
• gpderetta / libtask
  ☆13Updated 9 years ago
• wichtounet / btrees
  C++ implementation of concurrent Binary Search Trees
  ☆72Updated 10 years ago
• mpoeter / emr
  Effective Memory Reclamation
  ☆63Updated 6 years ago
• PatwinchIR / ultra-sort
  DSL for SIMD Sorting on AVX2 & AVX512
  ☆31Updated 7 years ago
• mikekazakov / eytzinger
  Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
  ☆33Updated 8 years ago
• Morwenn / vergesort
  Unstable O(n log n) sorting algorithm with O(n) memory
  ☆67Updated 3 months ago
• greg7mdp / sho
  Small Hash Optimization - an optimization for when you have many small hash maps - similar to LLVM's small vector optimization.
  ☆39Updated 8 years ago
• ssteinberg / shared_futex
  Fast, shared, upgradeable, non-recursive and non-fair mutex
  ☆36Updated 7 years ago
• Donald-Rupin / zab
  C++20 liburing backed coroutine executor and event loop framework.
  ☆66Updated 3 years ago
• tinloaf / ygg
  An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!
  ☆131Updated 2 years ago
• gnzlbg / nmp
  Non-blocking message passing (a C++14 MPI wrapper)
  ☆18Updated 11 years ago
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆17Updated 3 months ago
• mackstann / hash-table-shootout
  A benchmark of some prominent C/C++ hash table implementations
  ☆104Updated 6 years ago