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
• ot / succinct
  A collection of succinct data structures
  ☆211Updated 2 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆66Updated last year
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆121Updated 8 years ago
• simongog / sdsl
  Succinct Data Structure Library
  ☆109Updated 12 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated 2 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆115Updated last month
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆58Updated 3 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆127Updated 2 months ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆86Updated 2 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• rantala / string-sorting
  A collection of string sorting algorithms
  ☆55Updated 4 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆24Updated 5 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆93Updated last year
• nicolaprezza / BWTIL
  BWT Text Indexing Library: a set of tools to work with BWT-based text indexes
  ☆25Updated 3 years ago
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆274Updated 6 months ago
• fanf2 / qp
  qp tries and crit-bit tries
  ☆124Updated 3 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆51Updated 7 years ago
• dcjones / hat-trie
  An efficient trie implementation.
  ☆255Updated 5 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆109Updated 8 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆101Updated last month
• splatlab / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆15Updated 7 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
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆144Updated 6 years ago
• preshing / CompareIntegerMaps
  Generates benchmark data for two different data structures, then renders some graphs.
  ☆112Updated 6 years ago
• mackstann / hash-table-shootout
  A benchmark of some prominent C/C++ hash table implementations
  ☆104Updated 6 years ago
• ot / ds2i
  A library of inverted index data structures
  ☆151Updated 3 years ago
• fsaintjacques / libtwiddle
  bit & sketches data structures
  ☆60Updated 7 years ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 3 years ago