Docs.rs
Releases
Rust
The Rust Programming Language
The Book
Standard Library API Reference
Rust by Example
Crates.io
The Cargo Guide
About Docs.rs
Releases
Crates from Andrew Paseltiner
Recent
Stars
Recent Failures
Failures By Stars
Activity
Queue
Andrew Paseltiner
linked-hash-map-0.5.3
A HashMap wrapper that holds key-value pairs in insertion order
79
vec_map-0.8.2
A simple map based on a vector for small integer keys
30
eclectic-0.12.0
Experimental collection traits.
22
trie-0.2.1
An ordered map and set based on a trie.
15
bst-0.0.1
An ordered map and set based on a binary search tree.
10
interval-heap-0.0.5
A double-ended priority queue implemented with an interval heap
10
linear-map-1.2.0
A map implemented by searching linearly in a vector.
10
compare-0.1.0
Experimental comparators for collections to be generic over
9
ordered_iter-0.1.2
Ordered iterators.
6
tree-0.4.1
An ordered map and set based on a binary search tree.
4
stable_bst-0.2.0
An ordered map and set based on a binary search tree. Works with stable Rust 1.9.0.
4
hashmap2-0.2.0
Fork of Rust Nightly's HashMap
2
pairing-heap-0.1.0
A priority queue based on a pairing heap.
2
binomial-heap-0.2.0
A priority queue based on a binomial heap.
1
skew-heap-0.2.0
A priority queue based on a skew heap.
1
terminal-linked-hash-map-0.1.0
A fork of linked-hash-map that builds on stable in exchange for not allowing custom hashers.
0