Alternatives and similar repositories for arraylayout

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

• fsaintjacques / libtwiddle
  bit & sketches data structures
  ☆60Updated 7 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆108Updated 8 years ago
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆143Updated 6 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆110Updated 8 years ago
• scivey / xact
  multi-way atomic compare-and-swap with x64/TSX
  ☆86Updated 8 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆120Updated 8 years ago
• lemire / StronglyUniversalStringHashing
  Benchmark showing the we can randomly hash strings very quickly with good universality
  ☆139Updated 10 months ago
• ot / succinct
  A collection of succinct data structures
  ☆211Updated last year
• fclaude / libcds
  Compact Data Structures Library
  ☆129Updated 11 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
• fclaude / libcds2
  Compact Data Structures Library
  ☆101Updated 3 years ago
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆314Updated 4 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• fanf2 / qp
  qp tries and crit-bit tries
  ☆122Updated 3 years ago
• jsnell / parallel-xxhash
  Compute xxHash hash codes for 8 keys in parallel
  ☆47Updated 6 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• simdhash / clhash
  C library implementing the ridiculously fast CLHash hashing function
  ☆280Updated last year
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆125Updated 2 weeks ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated last year
• SaschaWitt / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆164Updated 10 months ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆49Updated 6 years ago
• appnexus / acf
  An-source C library developed and used at AppNexus.
  ☆112Updated 6 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆84Updated 6 years ago
• jfbastien / no-sane-compiler
  No sane compiler would optimize atomics: the presentation
  ☆108Updated 9 years ago
• pramalhe / CX
  A Wait-Free Universal Construct for Large Objects
  ☆96Updated 6 years ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• schani / linbin
  Linear vs binary search benchmark
  ☆41Updated 5 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆55Updated 7 years ago
• vnmakarov / mum-hash
  Hashing functions and PRNGs based on them
  ☆166Updated this week
• 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