Alternatives and similar repositories for programmingishard

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

• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆108Updated 8 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆30Updated 2 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
• fast-pack / dictionary
  High-performance dictionary coding
  ☆106Updated 8 years ago
• dw / csvmonkey
  Header-only vectorized, lazy-decoding, zero-copy CSV file parser
  ☆99Updated last year
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆119Updated 8 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 years ago
• fsaintjacques / jitmap
  LLVM-jitted bitmaps
  ☆27Updated 5 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago
• fanf2 / hg64
  a 64-bit histogram / quantile sketch
  ☆59Updated 8 months ago
• jarulraj / postgresql-cpp
  C++11 port of the PostgreSQL DBMS
  ☆69Updated 9 years ago
• fsaintjacques / libtwiddle
  bit & sketches data structures
  ☆60Updated 6 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 5 years ago
• mit-pdos / perflock
  RWMutex for sharing of multicore machines.
  ☆17Updated 6 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆84Updated last year
• fanf2 / qp
  qp tries and crit-bit tries
  ☆121Updated 3 years ago
• Sable / HorsePower
  Optimizing database queries with array programming
  ☆20Updated 5 years ago
• AlexKashuba / SQLite_JIT
  ☆27Updated 7 years ago
• wangyi-fudan / wyHLL
  The dream accurate approximate set cardinality estimator based on 3-bit HyperLogLog. More accurate than Redis HyperLogLog.
  ☆55Updated 4 years ago
• fclaude / libcds
  Compact Data Structures Library
  ☆128Updated 11 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆18Updated 6 years ago
• eloraiby / tcpm
  Tiny Cooperative Process Management Library/Embedded Bounded Queue Actor Model (C11)
  ☆40Updated 6 years ago
• senderista / hashtable-benchmarks
  An Evaluation of Linear Probing Hashtable Algorithms
  ☆32Updated last year
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆52Updated 7 years ago
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆42Updated 8 years ago
• facebookarchive / Rseq
  Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations
  ☆37Updated 6 years ago
• jhellerstein / arugula
  a small C++ lattice library
  ☆15Updated 5 years ago