C++ Double Ended Queues

Constructors	create new deques
Operators	compare and assign deques
assign()	set the values of the deque
at()	returns a specific element
back()	returns the last element
begin()	returns an iterator to the first element
clear()	remove all elements
empty()	true if the deque is empty
end()	returns an iterator to the end of the queue
erase()	removes an element
front()	returns the first element
get_allocator()	returns the deque's allocator
insert()	insert elements into the deque
max_size()	returns the maximum elements that the deque can hold
pop_back()	removes the last element
pop_front()	removes the first element
push_back()	add an element to the end of the deque
push_front()	add an element to the front of the deque
rbegin()	returns a reverse iterator to the end of the deque
rend()	returns a reverse iterator to the beginning of the deque
resize()	change the size of the deque
size()	return the number of elements in the deque
swap()	swap one deque with another