C + + double Ended Queues (bidirectional queue)

a bidirectional queue is similar to a vector, but it allows for quick insertion and deletion of the container's head (as in the tail).

Constructors	Create a new bidirectional queue
Operators	Comparing and assigning bidirectional queues
Assign ()	Set the value of a two-way queue
at ()	Returns the specified element
Back ()	Returns the last element
Begin ()	Returns an iterator that points to the first element
Clear ()	Delete all elements
Empty ()	Returns true if the two-way queue is empty
End ()	Returns an iterator pointing to the tail
Erase ()	Delete an element
Front ()	Returns the first element
Get_allocator ()	Returns the Configurator for two-way queues
Insert ()	Inserting an element into a bidirectional queue
Max_size ()	Returns the maximum number of elements that a two-way queue can hold
Pop_back ()	Delete the trailing element
Pop_front ()	Delete the element of the head
Push_back ()	Add an element to the tail
Push_front ()	Add an element to the head
Rbegin ()	Returns a reverse iterator pointing to the tail
Rend ()	Returns a reverse iterator pointing to the head
Resize ()	Change the size of the two-way queue
Size ()	Returns the number of elements in a two-way queue
Swap ()	And another bidirectional queue interchange element

C + + double Ended Queues (bidirectional queue)