[−][src]Crate token_deque
A double-ended queue (deque) that allows internal nodes to be removed in addition to the front and the back of the list.
Internally, the deque uses a Vec
, and tracks next, previous,
front, and back elements by index.
As items are removed from the deque, their memory in the Vec
is
put on an internal free list. This free list is used when items
are inserted into the list before the internal Vec
is expanded.
Structs
Deque | A deque that supports removing of nodes not in front or back position, but also nodes in front and back position. |
DrainBack | A draining iterator over the deque starting from the front. It is
constructed from the |
DrainFront | A draining iterator over the deque starting from the front. It is
constructed from the |
IterBack | An iterator over the deque starting from the back. It is
constructed from the |
IterFront | An iterator over the deque starting from the front. It is
constructed from the |
Token | A token representing an item in the |