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
• huonw / llvmint
  ☆27Updated 10 years ago
• contain-rs / interval-heap
  A double-ended priority queue implemented with an interval heap.
  ☆17Updated 8 years ago
• contain-rs / enum-set
  A structure for holding a set of enum variants
  ☆19Updated 6 years ago
• contain-rs / vec-map
  A simple map based on a vector for small integer keys
  ☆66Updated 10 months ago
• crossbeam-rs / crossbeam-deque
  Concurrent work-stealing deque
  ☆47Updated 6 years ago
• rust-bakery / nom-peg
  PEG parser generator built on top of nom
  ☆70Updated 6 years ago
• nox / inert
  Inert lets you use non-Sync values in Sync context
  ☆16Updated 6 years ago
• indiv0 / lazycell
  Rust library providing a lazily filled Cell
  ☆60Updated 5 years ago
• carllerche / pool
  A pool of reusable values
  ☆51Updated 5 years ago
• lovasoa / json_in_type
  Fast json encoder in rust, that encodes the structure of JSON values in their types
  ☆83Updated 3 years ago
• crossbeam-rs / crossbeam-epoch
  Epoch-based garbage collection
  ☆81Updated 6 years ago
• jFransham / smallstring
  SmallVec-backed stack string optimisation
  ☆44Updated 5 years ago
• llogiq / optional
  A small crate to provide space-efficient Option<_> replacements
  ☆37Updated 7 months ago
• contain-rs / lru-cache
  A cache that holds a limited number of key-value pairs
  ☆83Updated 3 years ago
• nikomatsakis / dogged
  Experimental persistent collections in Rust
  ☆45Updated 8 years ago
• dtolnay / lalrproc
  Proof of concept of procedural macro input parsed by LALRPOP
  ☆52Updated 2 years ago
• contain-rs / bst
  An ordered map and set based on a binary search tree.
  ☆13Updated 10 years ago
• frankmcsherry / columnation
  An experimental columnar arena
  ☆43Updated 11 months ago
• japaric-archived / untry
  Convert `try!()` into `?`s
  ☆34Updated 8 years ago
• contain-rs / linear-map
  A map backed by a vector
  ☆25Updated last year
• fitzgen / intrusive_splay_tree
  An intrusive splay tree implementation that is no-std compatible and free from allocation and moves
  ☆67Updated 6 months ago
• contain-rs / cons-list
  An immutable singly-linked list, as seen in basically every functional language
  ☆29Updated 2 years ago
• Kixunil / fast_fmt
  Faster, more flexible and more correct alternative to core::fmt
  ☆40Updated 5 years ago
• michaelsproul / rust_sequence_trie
  Ergonomic trie data structure
  ☆27Updated 6 years ago
• advancedresearch / tree_mem_sort
  An in-memory topological sort algorithm for trees based on Group Theory
  ☆23Updated 4 years ago
• nikomatsakis / cargo-incremental
  A fuzzing tool for incremental compilation that walks git history
  ☆33Updated 7 years ago
• crossbeam-rs / crossbeam-utils
  Utilities for concurrent programming
  ☆37Updated 6 years ago
• edmundsmith / type-plugs
  Emulating Higher-Kinded Types in Rust via Plug/Unplug. Also, Monads.
  ☆30Updated 6 years ago