Alternatives and similar repositories for trie

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

• contain-rs / raw-vec
  A Raw utility for managing contiguous heap allocations
  ☆10Updated 9 years ago
• contain-rs / ordered_iter
  Ordered iterators
  ☆10Updated 5 years ago
• contain-rs / interval-heap
  A double-ended priority queue implemented with an interval heap.
  ☆17Updated 8 years ago
• crossbeam-rs / crossbeam-deque
  Concurrent work-stealing deque
  ☆48Updated 7 years ago
• carllerche / pool
  A pool of reusable values
  ☆51Updated 6 years ago
• contain-rs / vec-map
  A simple map based on a vector for small integer keys
  ☆67Updated last year
• huonw / llvmint
  ☆27Updated 10 years ago
• frankmcsherry / columnation
  An experimental columnar arena
  ☆43Updated last year
• lovasoa / json_in_type
  Fast json encoder in rust, that encodes the structure of JSON values in their types
  ☆83Updated 3 years ago
• carllerche / two-lock-queue
  A MPMC channel based on the two lock queue algorithm
  ☆15Updated 8 years ago
• contain-rs / linear-map
  A map backed by a vector
  ☆26Updated last year
• contain-rs / enum-set
  A structure for holding a set of enum variants
  ☆19Updated 6 years ago
• rust-bakery / nom-peg
  PEG parser generator built on top of nom
  ☆70Updated 6 years ago
• crossbeam-rs / crossbeam-epoch
  Epoch-based garbage collection
  ☆81Updated 7 years ago
• reem / rust-shared-mutex
  A reader-writer lock that can be used with a Condvar.
  ☆29Updated 9 years ago
• nikomatsakis / dogged
  Experimental persistent collections in Rust
  ☆46Updated 8 years ago
• llogiq / optional
  A small crate to provide space-efficient Option<_> replacements
  ☆37Updated 9 months ago
• japaric-archived / untry
  Convert `try!()` into `?`s
  ☆34Updated 8 years ago
• indiv0 / lazycell
  Rust library providing a lazily filled Cell
  ☆61Updated 5 years ago
• async-pidfd / async-pidfd
  Rust crate to use process file descriptors (pidfd) for Linux
  ☆50Updated 7 months ago
• withoutboats / smart
  dynamic smart pointers
  ☆32Updated 6 years ago
• advancedresearch / tree_mem_sort
  An in-memory topological sort algorithm for trees based on Group Theory
  ☆23Updated 4 years ago
• fitzgen / intrusive_splay_tree
  An intrusive splay tree implementation that is no-std compatible and free from allocation and moves
  ☆67Updated 8 months ago
• contain-rs / bst
  An ordered map and set based on a binary search tree.
  ☆13Updated 10 years ago
• seanmonstar / futures-fs
  Access File System operations off-thread, using a Futures.
  ☆69Updated 6 years ago
• Kerollmops / sdset
  Set theory applied on sorted and deduplicated slices.
  ☆47Updated 3 years ago
• dtolnay / lalrproc
  Proof of concept of procedural macro input parsed by LALRPOP
  ☆52Updated 3 years ago
• stbuehler / rust-boxfnonce
  obsolete since rust 1.35.0 doesn't need it anymore
  ☆10Updated 4 years ago
• paholg / peano
  The peano numbers implemented in Rust's type system.
  ☆24Updated 9 years ago
• contain-rs / lru-cache
  A cache that holds a limited number of key-value pairs
  ☆84Updated 3 years ago