Alternatives and similar repositories for LookupTables

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

• trolando / lace
  Lace - implementation of work-stealing in C
  ☆53Updated 3 months ago
• stgatilov / linear-vs-binary-search
  Comparing linear and binary searches
  ☆41Updated 5 years ago
• komrad36 / SortingNetworks
  Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compil…
  ☆52Updated 4 years ago
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆70Updated last year
• wjakob / dset
  Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank
  ☆67Updated 10 years ago
• cleeus / hashx4
  A collection of SIMD optimized general purpose hash functions
  ☆47Updated 10 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆69Updated 4 years ago
• rusnikola / lfsmr
  Hyaline Reclamation (PLDI '21, PODC '19)
  ☆23Updated 4 years ago
• goodell / cppmem
  totally unofficial git repo containing sources for the CppMem tool available at http://svr-pes20-cppmem.cl.cam.ac.uk/cppmem/help.html and…
  ☆26Updated 12 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆18Updated 7 years ago
• rurban / perl-hash-stats
  Counting the collisions with perl hash tables per function
  ☆12Updated 6 years ago
• genericsimd / generic_simd
  Generic SIMD intrinsic to allow for portable SIMD intrinsic programming
  ☆41Updated 11 years ago
• pavelkryukov / AoAoAoTT
  Interchangeable AoS and SoA containers
  ☆25Updated 3 years ago
• Morwenn / poplar-heap
  make_heap and sort_heap for a poplar heap with O(1) extra memory
  ☆41Updated last year
• waywardgeek / datadraw
  ☆42Updated 2 years ago
• google-research / automemcpy
  ☆22Updated 3 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago
• schani / michael-alloc
  Lock-free allocator as described by Maged M. Michael, 2004
  ☆47Updated 12 years ago
• nadavrot / fast_log
  A fast implementation of log() and exp()
  ☆53Updated 2 years ago
• skarupke / two_bit_mutex
  Mutexes that only use two bits. Either stored in a byte, or in the bottom bits of a pointer
  ☆25Updated 2 years ago
• cmuparlay / flock
  Library for lock-free locks
  ☆83Updated 2 years ago
• dotnwat / persistent-rbtree
  Persistent red-black tree in C++
  ☆30Updated last month
• iains / clang-cxx20-modules
  Experimental patches to implement missing C++20 modules features for the clang/LLVM toolchain.
  ☆23Updated 3 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆84Updated 8 months ago
• mars-research / DRAMHiT
  ☆31Updated 3 weeks ago
• f18m / boost-intrusive-pool
  A C++ memory pool that is Boost-friendly and performance oriented (zero-malloc).
  ☆23Updated 2 months ago
• shaovoon / floatbench
  String to Float Benchmark
  ☆19Updated 7 years ago
• aklomp / missing-sse-intrinsics
  Polyfill some holes in the SSE intrinsics set
  ☆50Updated 3 years ago