Alternatives and similar repositories for bitvector:

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

• 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 3 weeks 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
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆48Updated 3 years ago
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆58Updated 3 years ago
• WojciechMula / ternarylogiccli
  CLI utilty to work out proper constants for vpternlogic instruction
  ☆13Updated 2 years ago
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆14Updated last year
• WojciechMula / man-intrinsics
  Create man pages from information used by Intel Intrinsics Guide and optionally uops.info
  ☆45Updated 4 months ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• adrian17 / cpp-drop-merge-sort
  C++ reimplementation of https://github.com/emilk/drop-merge-sort
  ☆21Updated 3 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆45Updated 6 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆26Updated 5 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 8 months ago
• InstLatx64 / AVX512_PopCnt
  AVX512 population count routines
  ☆22Updated 5 years ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 2 years ago
• vreverdy / bit-algorithms
  An exploratory implementation of bit overloads of the C++ standard algorithms
  ☆18Updated 4 years ago
• intel / Immintrin-debug
  immintrin_dbg.h is an include file, a wrapper around immintrin.h. It implements most of AVX, AVX2, AVX-512 vector intrinsics to enable so…
  ☆57Updated 2 years ago
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆51Updated 6 years ago
• mettienne / tiered-vector
  Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…
  ☆50Updated last year
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆56Updated 2 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• silentbicycle / skiparray
  unrolled skip list library for C
  ☆21Updated 5 years ago
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 12 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆52Updated 7 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆38Updated 4 years ago