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

A double-ended queue 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

Drain | A draining iterator over the elements of a `VecDeque`.
IntoIter | An owning iterator over the elements of a `VecDeque`.
Iter | An iterator over the elements of a `VecDeque`.
IterMut | A mutable iterator over the elements of a `VecDeque`.
VecDeque | A double-ended queue implemented with a growable ring buffer.

# Help

## Keyboard Shortcuts

`?`
  Show this help dialog
`S`
  Focus the search field
`↑`
  Move up in search results
`↓`
  Move down in search results
`↹`
  Switch tab
`⏎`
  Go to active search result
`+`
  Expand all sections
`-`
  Collapse 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`)

Search multiple things at once by splitting your query with comma (e.g., `str,u8` or `String,struct:Vec,test`)