contain-rs / interval-heap
A double-ended priority queue implemented with an interval heap.
☆15Updated 7 years ago
Related projects ⓘ
Alternatives and complementary repositories for interval-heap
- 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
- ☆10Updated 8 years ago
- An ordered map and set based on a binary search tree.☆14Updated 9 years ago
- A Raw utility for managing contiguous heap allocations☆11Updated 8 years ago
- A map backed by a vector☆25Updated 8 months ago
- Experimental comparators for collections to be generic over☆16Updated 6 months ago
- Unix Domain Sockets for mio☆28Updated 4 years ago
- allows you to run multiple cargo commands in a row☆20Updated 7 years ago
- obsolete since rust 1.35.0 doesn't need it anymore☆10Updated 3 years ago
- Brotli encoders/decoers for Rust☆28Updated 2 years ago
- Data for timing rustc☆18Updated 4 years ago
- A service implemented by a closure☆11Updated 7 years ago
- An ordered map and set based on a trie.☆29Updated 4 years ago
- Concurrent work-stealing deque☆46Updated 6 years ago
- Faster, more flexible and more correct alternative to core::fmt☆39Updated 4 years ago
- A static files server helper for the tide web framework (not production ready)☆10Updated 4 years ago
- Pluralization handling in Rust☆36Updated 2 years ago
- VFS used by rust-analyzer☆17Updated 4 years ago
- Website for async-std☆23Updated last year
- Tracking Rust and WebAssembly sizes over time☆10Updated 5 years ago
- A library for extracting and validating links.☆22Updated 3 months ago
- To futures-lite as futures-lite is to futures: smaller.☆53Updated 6 months ago
- A MPMC channel based on the two lock queue algorithm☆16Updated 7 years ago
- Home for rls2.0 working group☆13Updated 5 years ago
- Data structures used by the RLS and Rust compiler☆10Updated 5 years ago
- An implementation of thread pools which can be used with Rust futures☆11Updated 7 years ago