Alternatives and similar repositories for patl

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

• ned14 / nedtries
  A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit f…
  ☆275Updated 4 years ago
• chaelim / HAMT
  Hash Array Mapped Trie (C++ Templates)
  ☆125Updated 2 years ago
• yandex / mms
  Memory-mapped storage library
  ☆76Updated 9 years ago
• icnc / icnc
  Intel(R) Concurrent Collections for C++
  ☆116Updated 2 years ago
• philsquared / hash_trie
  A persistent hash array-mapped trie for C++
  ☆91Updated 2 years ago
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆313Updated 4 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆51Updated 11 years ago
• mackstann / hash-table-shootout
  A benchmark of some prominent C/C++ hash table implementations
  ☆105Updated 6 years ago
• preshing / CompareIntegerMaps
  Generates benchmark data for two different data structures, then renders some graphs.
  ☆112Updated 6 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆29Updated 3 years ago
• smilingthax / cttrie
  Compile-time TRIE based string matcher (C++11)
  ☆52Updated 6 years ago
• jll63 / yomm11
  Open multi-methods for C++11
  ☆117Updated 7 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆119Updated 8 years ago
• evgeny-panasyuk / stack_unwinding
  The stack_unwinding is a small header only C++ library which supplies primitive(class unwinding_indicator) to determining when object des…
  ☆87Updated 9 years ago
• Manu343726 / Turbo
  C++11 metaprogramming library
  ☆112Updated 9 years ago
• BoostGSoC13 / boost.afio
  HISTORICAL INTEREST ONLY: Post peer review AFIO v2 rewrite is now at https://github.com/ned14/boost.afio
  ☆47Updated 9 years ago
• LoopPerfect / valuable
  A C++ smart-pointer with value-semantics 💎
  ☆131Updated 6 years ago
• wichtounet / btrees
  C++ implementation of concurrent Binary Search Trees
  ☆72Updated 10 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆64Updated last year
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆69Updated 4 years ago
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆142Updated 6 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆125Updated last year
• 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
• duckie / named_types
  A C++14/17 implementation of named tuples
  ☆71Updated last year
• lemire / Concise
  C++ implementation of Concise and WAH compressed bitsets
  ☆20Updated 8 years ago
• schulmar / Templar
  Visualization tool for Templight C++ template debugger traces
  ☆90Updated 6 years ago
• Kolkir / cpptask
  Lightweight approach to expressing task stealing and balanced parallelism in a C++ programs.
  ☆73Updated 9 years ago
• rollbear / prio_queue
  C++14 cache friendly B-heap priority queue
  ☆106Updated last month
• lemire / rollinghashcpp
  Rolling Hash C++ Library
  ☆188Updated last year
• zvelo / cmph
  C Minimal Perfect Hashing Library
  ☆86Updated 8 years ago