deque (double-ended queue)
-------------------------

template < class T, class Allocator = allocator<T> > class deque;

*** support random access ***

*** not necessarily to have all its elements in contiguous storage locations ***

Iterators
---------
begin()
end()
rbegin()
rend()


Capacity
--------
empty()
size()
resize()
max_size()

Access
------
operator[]
at()
front()
end()

Modifier
--------
assign()
push_back()
push_front()
pop_back()
pop_front()
insert()
erase()
swap()
clear()

Allocator
---------
get_allocator()