Alternatives and similar repositories for libcds2

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

• fclaude / libcds
  Compact Data Structures Library
  ☆129Updated 11 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆121Updated 8 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆65Updated last year
• ot / succinct
  A collection of succinct data structures
  ☆211Updated last year
• simongog / sdsl
  Succinct Data Structure Library
  ☆108Updated 12 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated last year
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated last year
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆125Updated last month
• 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
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆270Updated 5 months ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆85Updated last year
• vigna / sux
  Succinct data structures in C/C++
  ☆92Updated last year
• fanf2 / qp
  qp tries and crit-bit tries
  ☆122Updated 3 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆108Updated 8 years ago
• dcjones / hat-trie
  An efficient trie implementation.
  ☆255Updated 5 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆49Updated 7 years ago
• lemire / StronglyUniversalStringHashing
  Benchmark showing the we can randomly hash strings very quickly with good universality
  ☆139Updated 10 months ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆24Updated 5 years ago
• fsaintjacques / libtwiddle
  bit & sketches data structures
  ☆60Updated 7 years ago
• ot / ds2i
  A library of inverted index data structures
  ☆151Updated 3 years ago
• simdhash / clhash
  C library implementing the ridiculously fast CLHash hashing function
  ☆281Updated last year
• zvelo / cmph
  C Minimal Perfect Hashing Library
  ☆88Updated 8 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆55Updated 8 years ago
• mackstann / hash-table-shootout
  A benchmark of some prominent C/C++ hash table implementations
  ☆105Updated 6 years ago
• jsnell / parallel-xxhash
  Compute xxHash hash codes for 8 keys in parallel
  ☆47Updated 6 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆55Updated 5 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆110Updated 9 years ago
• rantala / string-sorting
  A collection of string sorting algorithms
  ☆55Updated 3 years ago