# Module std::collections::vec_deque 1.0.0 [−] [src]

VecDeque is a double-ended queue, which is implemented with the help of a growing 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

Drain | A draining VecDeque iterator
IntoIter | A by-value VecDeque iterator
Iter | `VecDeque` iterator.
IterMut | `VecDeque` mutable iterator.
VecDeque | `VecDeque` is a growable ring buffer, which can be used as a double-ended queue efficiently.
PlaceBack | [ Experimental ] A place for insertion at the back of a `VecDeque`.
PlaceFront | [ Experimental ] A place for insertion at the front of a `VecDeque`.

# Help

## Keyboard Shortcuts

?
  Show this help dialog
S
  Focus the search field
⇤
  Move up in search results
⇥
  Move down in search results
⏎
  Go to active search result
+
  Collapse/expand all sections

## Search Tricks

Prefix searches with a type followed by a colon (e.g. `fn:`) to restrict the search to a given type.

Accepted types are: `fn`, `mod`, `struct`, `enum`, `trait`, `type`, `macro`, and `const`.

Search functions by type signature (e.g. `vec -> usize` or `* -> vec`)