contain-rs / trie
An ordered map and set based on a trie.
☆29Updated 4 years ago
Related projects ⓘ
Alternatives and complementary repositories for trie
- ☆10Updated 8 years ago
- Ordered iterators☆11Updated 4 years ago
- A structure for holding a set of enum variants☆20Updated 5 years ago
- A deque implemented as a hybrid linked-list-of-arrays☆10Updated 9 years ago
- A map backed by a vector☆25Updated 8 months ago
- A Raw utility for managing contiguous heap allocations☆11Updated 8 years ago
- An ordered map and set based on a binary search tree.☆14Updated 9 years ago
- Concurrent work-stealing deque☆46Updated 6 years ago
- A double-ended priority queue implemented with an interval heap.☆15Updated 7 years ago
- Take a reference and get back a slice of length one☆26Updated 3 years ago
- ☆25Updated 9 years ago
- obsolete since rust 1.35.0 doesn't need it anymore☆10Updated 3 years ago
- Data for timing rustc☆18Updated 4 years ago
- A dynamically typed value with fast downcasting.☆26Updated 8 years ago
- A small crate to provide space-efficient Option<_> replacements☆37Updated last week
- Asynchronous file I/O for Tokio☆48Updated 4 months ago
- Safe atomic Box types for Rust☆22Updated last year
- The peano numbers implemented in Rust's type system.☆24Updated 8 years ago
- Experimental comparators for collections to be generic over☆16Updated 6 months ago
- A simple map based on a vector for small integer keys☆63Updated last year
- raw bindings for git://git.kernel.dk/liburing☆17Updated 4 years ago
- Unix Domain Sockets for mio☆28Updated 4 years ago
- ☆13Updated 6 years ago
- Proof of concept of procedural macro input parsed by LALRPOP☆51Updated last year
- An immutable singly-linked list, as seen in basically every functional language☆28Updated last year
- dynamic smart pointers☆31Updated 5 years ago
- I/O and binary data encoding for Rust☆38Updated 9 years ago