contain-rs / trie
An ordered map and set based on a trie.
☆28Updated 4 years ago
Alternatives and similar repositories for trie
Users that are interested in trie are comparing it to the libraries listed below
Sorting:
- ☆9Updated 9 years ago
- A double-ended priority queue implemented with an interval heap.☆17Updated 7 years ago
- A structure for holding a set of enum variants☆19Updated 6 years ago
- A Raw utility for managing contiguous heap allocations☆10Updated 8 years ago
- A deque implemented as a hybrid linked-list-of-arrays☆9Updated 9 years ago
- Proof of concept of procedural macro input parsed by LALRPOP☆52Updated 2 years ago
- A map backed by a vector☆24Updated last year
- Ordered iterators☆10Updated 4 years ago
- Concurrent work-stealing deque☆47Updated 6 years ago
- A dynamically typed value with fast downcasting.☆28Updated 9 years ago
- Take a reference and get back a slice of length one☆25Updated 4 years ago
- Fast json encoder in rust, that encodes the structure of JSON values in their types☆83Updated 2 years ago
- obsolete since rust 1.35.0 doesn't need it anymore☆10Updated 3 years ago
- A small crate to provide space-efficient Option<_> replacements☆37Updated 2 months ago
- software transactional memory in rust☆13Updated 3 years ago
- ☆25Updated 10 years ago
- Experimental comparators for collections to be generic over☆15Updated last year
- Utilities for concurrent programming☆37Updated 6 years ago
- A simple map based on a vector for small integer keys☆63Updated 5 months ago
- Rust library providing a specialized byte slice type for performing vectored I/O operations.☆52Updated 5 years ago
- I/O and binary data encoding for Rust☆38Updated 9 years ago
- Utilities building on top of Rust's async primitives.☆23Updated 5 years ago
- Data for timing rustc☆18Updated 4 years ago
- dynamic smart pointers☆31Updated 6 years ago
- [ARCHIVED] development moved into main actix repo☆38Updated 5 years ago
- An implementation of thread pools which can be used with Rust futures☆11Updated 8 years ago
- An ordered map and set based on a binary search tree.☆14Updated 10 years ago
- Flexible, stand-alone benchmarking☆18Updated 7 years ago
- Faster, more flexible and more correct alternative to core::fmt☆40Updated 4 years ago
- An experimental columnar arena☆43Updated 6 months ago