Alternatives and similar repositories for patl:

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

• lemire / Concise
  C++ implementation of Concise and WAH compressed bitsets
  ☆20Updated 7 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆28Updated 2 years ago
• BoostGSoC13 / boost.afio
  HISTORICAL INTEREST ONLY: Post peer review AFIO v2 rewrite is now at https://github.com/ned14/boost.afio
  ☆46Updated 8 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago
• fast-pack / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆51Updated 11 months ago
• smilingthax / cttrie
  Compile-time TRIE based string matcher (C++11)
  ☆51Updated 5 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆45Updated 6 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆121Updated 8 months ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆116Updated 7 years ago
• philsquared / hash_trie
  A persistent hash array-mapped trie for C++
  ☆91Updated last year
• preshing / CompareIntegerMaps
  Generates benchmark data for two different data structures, then renders some graphs.
  ☆112Updated 5 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆26Updated 5 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(…
  ☆49Updated 9 months ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated 2 years ago
• yandex / mms
  Memory-mapped storage library
  ☆76Updated 8 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• ronmrdechai / Pie
  Provide an idiomatic C++ interface to CPython's C API.
  ☆27Updated 7 years ago
• schani / linbin
  Linear vs binary search benchmark
  ☆40Updated 5 years ago
• lysevi / nkvdb
  nkvdb - is a numeric time-series database.
  ☆35Updated 7 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆63Updated 8 months ago
• erichkeane / const_expr_string
  An entirely const_expr string class in C++. Similar to string_view, most useful for compile-time constants
  ☆22Updated 9 years ago
• google / hashing-demo
  Sample implementation of a proposed C++ hashing framework
  ☆29Updated 9 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆64Updated last year
• yet-another-user / pimpl
  The C++ Pimpl Idiom Again!
  ☆36Updated 6 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆50Updated 10 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆75Updated 6 years ago
• pacxx / pacxx-llvm
  Programming Accelerators with C++ (PACXX)
  ☆58Updated 7 years ago
• duckie / named_types
  A C++14/17 implementation of named tuples
  ☆70Updated 5 months ago
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆14Updated 11 months ago
• jtomschroeder / lambda
  λ → C++ library for functional programming
  ☆37Updated 8 years ago