Alternatives and similar repositories for fastops:

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

• 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
  ☆53Updated last year
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year
• danlark1 / miniselect
  Selection and partial sorting algorithms
  ☆136Updated 2 weeks ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆113Updated 4 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆105Updated 7 years ago
• google / hashtable-benchmarks
  ☆105Updated last year
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆52Updated 7 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
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆65Updated 4 years ago
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆173Updated 5 years ago
• WojciechMula / sse4-strstr
  SIMD (SWAR/SSE/SSE4/AVX2/AVX512F/ARM Neon) of Karp-Rabin algorithm's modification
  ☆248Updated 3 years ago
• powturbo / Turbo-Histogram
  Fastest Histogram Construction
  ☆70Updated 3 years ago
• goldsborough / bloom-cpp
  A header-only bloom filter implementation in C++14.
  ☆13Updated 6 years ago
• WojciechMula / base64simd
  Base64 coding and decoding with SIMD instructions (SSE/AVX2/AVX512F/AVX512BW/AVX512VBMI/ARM Neon)
  ☆163Updated last month
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆275Updated 3 months ago
• Begun / lockfree-malloc
  The world's first Web-scale memory allocator
  ☆106Updated 6 years ago
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆58Updated 3 years ago
• powturbo / Turbo-Transpose
  Transpose: SIMD Integer+Floating Point Compression Filter
  ☆60Updated 5 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆29Updated 3 years ago
• google / dimsum
  Portable C++ SIMD library
  ☆174Updated 5 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆68Updated 7 years ago
• Tessil / array-hash
  C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
  ☆178Updated 6 months ago
• smilingthax / cttrie
  Compile-time TRIE based string matcher (C++11)
  ☆53Updated 5 years ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 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
• reyoung / avx_mathfun
  AVX-optimized sin(), cos(), exp() and log() functions
  ☆123Updated 3 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• berkeley-container-library / bcl
  The Berkeley Container Library
  ☆124Updated last year
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago
• yandex / handystats
  C++ library for collecting user-defined in-process runtime statistics with low overhead
  ☆98Updated 5 years ago