Alternatives and similar repositories for arraylayout

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

• scivey / xact
  multi-way atomic compare-and-swap with x64/TSX
  ☆86Updated 8 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆100Updated 3 years ago
• fsaintjacques / libtwiddle
  bit & sketches data structures
  ☆60Updated 6 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆118Updated 8 years ago
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆309Updated 4 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 8 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• appnexus / acf
  An-source C library developed and used at AppNexus.
  ☆110Updated 5 years ago
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆141Updated 5 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆106Updated 8 years ago
• androm3da / optviewer-demo
  Demonstration of LLVM's opt-viewer tool
  ☆71Updated 8 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆56Updated 2 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago
• jsnell / parallel-xxhash
  Compute xxHash hash codes for 8 keys in parallel
  ☆46Updated 6 years ago
• pramalhe / CX
  A Wait-Free Universal Construct for Large Objects
  ☆97Updated 5 years ago
• preshing / CompareIntegerMaps
  Generates benchmark data for two different data structures, then renders some graphs.
  ☆112Updated 5 years ago
• fclaude / libcds
  Compact Data Structures Library
  ☆126Updated 10 years ago
• lemire / StronglyUniversalStringHashing
  Benchmark showing the we can randomly hash strings very quickly with good universality
  ☆137Updated 4 months ago
• chaelim / HAMT
  Hash Array Mapped Trie (C++ Templates)
  ☆124Updated 2 years ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• jfbastien / no-sane-compiler
  No sane compiler would optimize atomics: the presentation
  ☆106Updated 8 years ago
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆51Updated 7 years ago
• stephenrkell / libcrunch
  A dynamically safe implementation of C, using your existing C compiler. Tolerates idiomatic C code pretty well. Not perfect... yet.
  ☆104Updated 9 months ago
• ot / succinct
  A collection of succinct data structures
  ☆203Updated last year
• lysevi / nkvdb
  nkvdb - is a numeric time-series database.
  ☆35Updated 8 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆46Updated 6 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
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆63Updated last year