es typically
with methods to add, remove and access elements at both sides of the
underlying data sequence. As such, the deque can also be used to mimic
both stacks and queues."><meta property="og:description" content="Deques are a generalization of stacks and queues typically
with methods to add, remove and access elements at both sides of the
underlying data sequence. As such, the deque can also be used to mimic
both stacks and queues."><meta property="og:image" content="https://github.com/rpahl/container