Crate collections [−] [src]
: library is unlikely to be stabilized with the current layout and name, use std::collections instead
See std::collections for a detailed discussion of collections in Rust.
A priority queue implemented with a binary heap.
A module for working with borrowed data.
A pointer type for heap allocation.
Utilities for formatting and printing strings
A doubly-linked list with owned nodes.
A dynamically-sized view into a contiguous sequence,
Unicode string slices
An owned, growable string that enforces that its contents are valid UTF-8.
A growable list type with heap-allocated contents, written
VecDeque is a double-ended queue, which is implemented with the help of a growing ring buffer.
A structure for holding a set of enum variants.
A simple map based on a vector for small integer keys. Space requirements are O(highest integer key).
Use the syntax described in
A map based on a B-Tree.
A set based on a B-Tree.
An implementation of a set using a bit vector as an underlying representation for holding unsigned numerical elements.
The bitvector type.
An endpoint of a range of keys.