Alternatives and similar repositories for Concise:

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

• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆50Updated 10 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
  ☆52Updated last year
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• ademakov / Oroch
  A C++ library for integer array compression
  ☆29Updated 3 years ago
• ljestrada / charconvutils
  C++17 sports two low-level character conversion functions, std::from_chars and std::to_chars, but they have a usage model that can be ea…
  ☆8Updated 5 years ago
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 12 years ago
• greg7mdp / sho
  Small Hash Optimization - an optimization for when you have many small hash maps - similar to LLVM's small vector optimization.
  ☆39Updated 7 years ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆65Updated 4 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆26Updated 5 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆48Updated 3 years ago
• alasdairmackintosh / google-concurrency-library
  Automatically exported from code.google.com/p/google-concurrency-library
  ☆35Updated 9 years ago
• boostorg / boost_unordered_benchmarks
  ☆18Updated 5 months ago
• jermp / dint
  Dictionary-based compression for inverted indexes.
  ☆23Updated 5 years ago
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆14Updated last year
• nemequ / LZSSE-SIMDe
  LZSSE compression codec ported to SIMDe
  ☆19Updated 4 years ago
• philsquared / hash_trie
  A persistent hash array-mapped trie for C++
  ☆91Updated last year
• erenon / double_ended
  devector and batch_deque containers for C++. See more at: http://erenon.hu/double_ended
  ☆15Updated 7 years ago
• mikekazakov / eytzinger
  Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
  ☆31Updated 7 years ago
• 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 / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆45Updated 6 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• ssteinberg / shared_futex
  Fast, shared, upgradeable, non-recursive and non-fair mutex
  ☆30Updated 6 years ago
• schani / linbin
  Linear vs binary search benchmark
  ☆41Updated 5 years ago
• gpderetta / libtask
  ☆13Updated 8 years ago
• executors / futures
  A proposal for a futures programming model for ISO C++
  ☆22Updated 6 years ago
• KjellKod / lock-free-wait-free-circularfifo
  ☆26Updated last year