Alternatives and similar repositories for unmanaged-ctrie

Users that are interested in unmanaged-ctrie are comparing it to the libraries listed below

• mthom / managed-ctrie
  Garbage collected concurrent hash tries.
  ☆19Updated 8 years ago
• jaroslov / coro
  C++1y coroutine library.
  ☆17Updated 7 years ago
• chaelim / HAMT
  Hash Array Mapped Trie (C++ Templates)
  ☆125Updated 2 years ago
• bretthall / Wyatt-STM
  Software transactional memory system developed at Wyatt Technology
  ☆29Updated 6 years ago
• mthom / on-the-fly-gc
  Concurrent mark-sweep garbage collector for accurate garbage collection of language runtimes in C++ 1x.
  ☆35Updated 8 years ago
• senderista / hashtable-benchmarks
  An Evaluation of Linear Probing Hashtable Algorithms
  ☆32Updated last year
• backtrace-labs / dynamic_flag
  A C library for runtime-flippable feature flags on Linux/x86-64, with negligible overhead in the common case
  ☆76Updated 3 years ago
• pramalhe / CX
  A Wait-Free Universal Construct for Large Objects
  ☆96Updated 5 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆84Updated 8 months ago
• lemire / backward_multiplication
  Multiplying... backward?
  ☆14Updated 5 years ago
• appnexus / acf
  An-source C library developed and used at AppNexus.
  ☆111Updated 5 years ago
• LoopPerfect / conduit
  High Performance Streams Based on Coroutine TS ⚡
  ☆150Updated 6 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 6 years ago
• celtera / ahsohtoa
  Structure-of-array synthesis in C++20
  ☆81Updated 3 years ago
• LiveAsynchronousVisualizedArchitecture / lava
  Live Asynchronous Visualized Architecture
  ☆98Updated 6 years ago
• rurban / perl-hash-stats
  Counting the collisions with perl hash tables per function
  ☆12Updated 6 years ago
• oluwatimilehin / anchors
  C++ library for incremental computing
  ☆23Updated 3 years ago
• stephenrkell / libcrunch
  A dynamically safe implementation of C, using your existing C compiler. Tolerates idiomatic C code pretty well. Not perfect... yet.
  ☆105Updated last year
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆84Updated last year
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆31Updated 2 years ago
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆39Updated last year
• hypirion / c-rrb
  RRB-tree implemented as a library in C.
  ☆171Updated 11 years ago
• shaovoon / floatbench
  String to Float Benchmark
  ☆19Updated 7 years ago
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆158Updated last week
• waywardgeek / datadraw
  ☆42Updated 2 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• facebookarchive / Rseq
  Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations
  ☆38Updated 6 years ago
• kirkshoop / transducer
  transducers in C++ 14
  ☆40Updated 11 years ago
• smilingthax / cttrie
  Compile-time TRIE based string matcher (C++11)
  ☆52Updated 6 years ago