contain-rs / trieLinks
An ordered map and set based on a trie.
☆28Updated 5 years ago
Alternatives and similar repositories for trie
Users that are interested in trie are comparing it to the libraries listed below
Sorting:
- A Raw utility for managing contiguous heap allocations☆10Updated 9 years ago
- ☆27Updated 10 years ago
- Ordered iterators☆10Updated 5 years ago
- A structure for holding a set of enum variants☆19Updated 6 years ago
- Concurrent work-stealing deque☆47Updated 6 years ago
- The peano numbers implemented in Rust's type system.☆24Updated 9 years ago
- Fast json encoder in rust, that encodes the structure of JSON values in their types☆83Updated 3 years ago
- A double-ended priority queue implemented with an interval heap.☆17Updated 8 years ago
- An experimental columnar arena☆43Updated 11 months ago
- A simple map based on a vector for small integer keys☆66Updated 10 months ago
- ☆22Updated 9 years ago
- Rust library providing a lazily filled Cell☆60Updated 5 years ago
- Proof of concept of procedural macro input parsed by LALRPOP☆52Updated 2 years ago
- PEG parser generator built on top of nom☆70Updated 6 years ago
- An in-memory topological sort algorithm for trees based on Group Theory☆23Updated 4 years ago
- Epoch-based garbage collection☆81Updated 6 years ago
- A small crate to provide space-efficient Option<_> replacements☆37Updated 6 months ago
- Ergonomic trie data structure☆27Updated 6 years ago
- A dynamically typed value with fast downcasting.☆28Updated 9 years ago
- ☆40Updated 6 years ago
- ☆30Updated 4 years ago
- A MPMC channel based on the two lock queue algorithm☆15Updated 8 years ago
- Faster, more flexible and more correct alternative to core::fmt☆40Updated 5 years ago
- A map backed by a vector☆25Updated last year
- Convert `try!()` into `?`s☆34Updated 8 years ago
- Experimental persistent collections in Rust☆45Updated 7 years ago
- SmallVec-backed stack string optimisation☆44Updated 5 years ago
- Emulating Higher-Kinded Types in Rust via Plug/Unplug. Also, Monads.☆30Updated 6 years ago
- An intrusive splay tree implementation that is no-std compatible and free from allocation and moves☆67Updated 5 months ago
- A pool of reusable values☆51Updated 5 years ago