About 53 results
Open links in new tab
  1. c++ - What really is a deque in STL? - Stack Overflow

    A deque, short for "double-ended queue," is a versatile data structure in the C++ Standard Template Library (STL). It allows for efficient insertion and deletion of elements at both the front and back ends.

  2. python - queue.Queue vs. collections.deque - Stack Overflow

    I need a queue which multiple threads can put stuff into, and multiple threads may read from. Python has at least two queue classes, queue.Queue and collections.deque, with the former seemingly usi...

  3. java - Why should I use Deque over Stack? - Stack Overflow

    Deque<Integer> stack = new ArrayDeque<>(); I definitely do not want synchronized behavior here as I will be using this datastructure local to a method . Apart from this why should I prefer Deque over …

  4. queue - How Does Deque Work in Python - Stack Overflow

    Jul 31, 2016 · A deque is a generalization of stack and a queue (It is short for "double-ended queue"). Thus, the pop () operation still causes it to act like a stack, just as it would have as a list.

  5. containers - c++ deque vs queue vs stack - Stack Overflow

    Aug 29, 2015 · In deque (double-ended queue) The element can be inserted from the back and removed from the rear (like in stack), but queue only allows removal from the front.

  6. Why would I prefer using vector to deque - Stack Overflow

    Sep 14, 2024 · Since: (I presume) they are both contiguous memory containers; feature wise, deque has almost everything vector has but more, since it is more efficient to insert in the front. Why would …

  7. Why does std::stack use std::deque by default?

    Feb 12, 2015 · Updated based on the Answers below: It appears that the way deque is usually implemented is a variable size array of fixed size arrays. This makes growing faster than a vector …

  8. What's the difference between deque and list STL containers?

    Oct 11, 2018 · Deque: Any insertion or deletion of elements other than at the beginning or end invalidates all pointers, references, and iterators that refer to elements of the deque. List: Inserting …

  9. python: deque vs list performance comparison - Stack Overflow

    May 6, 2014 · In python docs I can see that deque is a special collection highly optimized for poping/adding items from left or right sides. E.g. documentation says: Deques are a generalization of …

  10. Why do we need Deque data structures in the real world?

    A Deque is a double ended queue, allowing inserting and removing from both ends. In real scenario we can attached it to a Ticket purchasing line, It performs like a queue but some time It happens that …