Alternatives and similar repositories for fastops

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

• danlark1 / miniselect
  Selection and partial sorting algorithms
  ☆137Updated 2 months 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
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆66Updated 4 years ago
• google / hashtable-benchmarks
  ☆106Updated last year
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• powturbo / Turbo-Transpose
  Transpose: SIMD Integer+Floating Point Compression Filter
  ☆61Updated 5 years ago
• WojciechMula / sse4-strstr
  SIMD (SWAR/SSE/SSE4/AVX2/AVX512F/ARM Neon) of Karp-Rabin algorithm's modification
  ☆253Updated 3 years ago
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆37Updated last year
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆54Updated 7 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆89Updated 8 months ago
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆172Updated 5 years ago
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆58Updated 3 years ago
• mikekazakov / eytzinger
  Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
  ☆32Updated 8 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆29Updated 3 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• Tessil / array-hash
  C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
  ☆178Updated 8 months ago
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆309Updated 4 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
• 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
• rollbear / prio_queue
  C++14 cache friendly B-heap priority queue
  ☆105Updated 4 years ago
• Bazist / HArray
  Fastest Trie structure (Linux & Windows)
  ☆92Updated 2 years ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆117Updated 4 years ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆278Updated 5 months ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year
• romange / gaia
  C++ framework for rapid server development
  ☆77Updated last year
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• powturbo / Turbo-Base64
  Turbo Base64 - Fastest Base64 SIMD:SSE/AVX2/AVX512/Neon/Altivec - Faster than memcpy!
  ☆305Updated last year
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 8 years ago
• Begun / lockfree-malloc
  The world's first Web-scale memory allocator
  ☆107Updated 6 years ago