Available on crate feature
mtls
only.Expand description
A double-ended queue (deque) implemented with a growable ring buffer.
This queue has O(1) amortized inserts and removals from both ends of the container. It also has O(1) indexing like a vector. The contained elements are not required to be copyable, and the queue will be sendable if the contained type is sendable.
Structs§
- A draining iterator over the elements of a
VecDeque
. - An owning iterator over the elements of a
VecDeque
. - An iterator over the elements of a
VecDeque
. - A mutable iterator over the elements of a
VecDeque
. - A double-ended queue implemented with a growable ring buffer.