Module std::collections::ring_bufExperimental [-]  [+] [src]

This crate implements a double-ended queue with 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 RingBuf iterator

IntoIter
Iter

RingBuf iterator.

IterMut

RingBuf mutable iterator.

RingBuf

RingBuf is a circular buffer, which can be used as a double-ended queue efficiently.