Alternatives and similar repositories for qp

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

• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆121Updated 8 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 years ago
• agl / critbit
  Critbit trees in C
  ☆334Updated 4 years ago
• simdhash / clhash
  C library implementing the ridiculously fast CLHash hashing function
  ☆281Updated last year
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆110Updated 9 years ago
• rurban / Perfect-Hash
  generate perfect hashes (alpha)
  ☆79Updated 3 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
  ☆109Updated 8 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆86Updated 2 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆55Updated 8 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆126Updated 2 months ago
• fredrikwidlund / libdynamic
  High performance utility library for C
  ☆97Updated 6 months ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆85Updated 6 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 3 years ago
• appnexus / acf
  An-source C library developed and used at AppNexus.
  ☆113Updated 6 years ago
• fastly / uslab
  Lock-free slab allocator / freelist.
  ☆70Updated 10 years ago
• fclaude / libcds
  Compact Data Structures Library
  ☆129Updated 11 years ago
• stg7 / haesni
  haesni is a small hash function using aes-ni for fast string hashing
  ☆19Updated 7 years ago
• coreperf / rejit
  fast SIMD-able JIT regular expression compiler
  ☆197Updated 10 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated 2 years ago
• dcjones / hat-trie
  An efficient trie implementation.
  ☆255Updated 5 years ago
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆159Updated 2 weeks ago
• ot / succinct
  A collection of succinct data structures
  ☆211Updated 2 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆103Updated 3 years ago
• rmind / thmap
  Concurrent trie-hash map library
  ☆94Updated 2 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆66Updated last year
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆317Updated 4 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆92Updated last year
• rmind / libqsbr
  QSBR and EBR library
  ☆135Updated 6 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago