Alternatives and similar repositories for poplar-trie:

Users that are interested in poplar-trie are comparing it to the libraries listed below

• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 7 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 last year
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 11 years ago
• mikekazakov / eytzinger
  Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
  ☆31Updated 7 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 2 years ago
• jermp / psds
  Efficient Prefix-Sum data structures in C++.
  ☆25Updated last year
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆65Updated 4 years ago
• philsquared / hash_trie
  A persistent hash array-mapped trie for C++
  ☆91Updated last year
• romange / gaia
  C++ framework for rapid server development
  ☆77Updated last year
• ademakov / Oroch
  A C++ library for integer array compression
  ☆28Updated 2 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated 2 years ago
• Tessil / array-hash
  C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
  ☆177Updated 4 months ago
• kampersanda / xcdat
  Fast compressed trie dictionary library
  ☆67Updated 5 months ago
• koeppl / separate_chaining
  Hash table with separate chaining layout
  ☆9Updated 3 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆26Updated 5 years ago
• pasta-toolbox / bit_vector
  Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.
  ☆29Updated 3 months ago
• boostorg / unordered
  Boost.org unordered module
  ☆66Updated 3 weeks ago
• lorenzhs / ssssort
  Super Scalar Sample Sort in modern C++
  ☆20Updated 4 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 7 years ago
• executors / futures
  A proposal for a futures programming model for ISO C++
  ☆22Updated 6 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆64Updated last year
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 2 years ago
• pubby / flat
  Flat containers for C++
  ☆59Updated 2 years ago
• powturbo / Turbo-Transpose
  Transpose: SIMD Integer+Floating Point Compression Filter
  ☆59Updated 5 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• tudocomp / compact_sparse_hash
  A blend of the compact and sparse hash table implementations.
  ☆12Updated 3 years ago
• david-grs / static_any
  generic stack-based container
  ☆105Updated 6 years ago