A Deque is a DOUBLE-ended queue, and as such,
users will expect no directional "bias" while accessing the collection.
For example, elements can be removed sequentially from either end of the collection.
However, this is not true of the iterator. Only a forward iterator is provided.
This was a design oversight. Early adopters of the new Deque classes are
surprised at the missing reverse iteration capability.