mklarqvist / StormBitmaps

Related projects ⓘ

Alternatives and complementary repositories for StormBitmaps

• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆28Updated last year
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 4 years ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆17Updated last year
• Const-me / MemoryAccessCosts
  ☆13Updated 6 years ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆30Updated last year
• lemire / SIMDIntersections
  Vectorized intersections (research code)
  ☆14Updated 7 years ago
• lemire / backward_multiplication
  Multiplying... backward?
  ☆13Updated 4 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆17Updated 6 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 8 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆48Updated 3 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆25Updated 5 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(…
  ☆49Updated 7 months ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 4 years ago
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆12Updated 8 months ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆62Updated 5 months ago
• richardstartin / splitmap
  Parallel boolean circuit evaluation
  ☆19Updated 6 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆27Updated 2 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated last year
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆81Updated 5 years ago
• blu / ascii_pruner
  Pruning of blanks from an ASCII stream - musings in AMD64 and ARM64
  ☆9Updated 3 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆31Updated 11 months ago
• mavam / compbench
  Benchmark and visualization of various compression algorithms
  ☆23Updated 8 years ago
• nicola-gigante / bitvector
  A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …
  ☆22Updated 2 years ago
• geofflangdale / smh
  Shuffle-based predicate matcher and all-round branch free swiss army chainsaw
  ☆17Updated 6 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆51Updated 7 years ago
• stg7 / haesni
  haesni is a small hash function using aes-ni for fast string hashing
  ☆16Updated 6 years ago
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 11 years ago
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆52Updated 6 years ago