c++ deque vs queue vs stack

by

Moron/Aryabhatta is correct, but a little more detail may be helpful.

Queue and stack are higher level containers than deque, vector, or list. By this, I mean that you can build a queue or stack out of the lower level containers.

For example:

  std::stack<int, std::deque<int> > s;
  std::queue<double, std::list<double> > q;

Will build a stack of ints using a deque as the underlying container and a queue of doubles using a list as the underlying container.

You can think of s as a restricted deque and q as a restricted list.

All that is necessary is that the lower level container implements the methods needed by the higher level container. These are back(), push_back(), and pop_back() for stack and front(), back(), push_back(), and pop_front() for queue.

See stack and queue for more detail.

With respect to the deque, it is much more than a queue where you can insert at both ends. In particular, it has the random access operator[]. This makes it more like a vector, but a vector where you can insert and delete at the beginning with push_front() and pop_front().

See deque for detail.

More Related Contents:

  1. How can I use std::maps with user-defined types as key?
  2. What are the complexity guarantees of the standard containers?
  3. Why use iterators instead of array indices?
  4. Why isn’t vector a STL container?
  5. What’s the best way to iterate over two or more containers simultaneously
  6. Heterogeneous containers in C++
  7. How can I store objects of differing types in a C++ container?
  8. Copy map values to vector in STL [duplicate]
  9. What is an iterator’s default value?
  10. Why does storing references (not pointers) in containers in C++ not work?
  11. Template class with template container
  12. How can I use an array as map value?
  13. What is the right approach when using STL container for median calculation?
  14. Do STL iterators guarantee validity after collection was changed?
  15. General use cases for C++ containers
  16. c++ template class; function with arbitrary container type, how to define it?
  17. C static keyword vs C++ private scope?
  18. Why do (only) some compilers use the same address for identical string literals?
  19. How to create a vector of user defined size but with no predefined values?
  20. How to tell if a lib was compiled with /mt or /md?
  21. GCC std::thread not found in namespace std
  22. c++ global object
  23. Get private data members for non intrusive boost serialization C++
  24. std::getline() reads carriage return \r into the string, how to avoid that?
  25. using extern template (C++11) to avoid instantiation
  26. Finding square root without using sqrt function?
  27. Where can I find an official reference listing the operation of SSE intrinsic functions?
  28. How do I include the string header?
  29. Howto: c++ Function Pointer with default values
  30. Is char default-promoted?

Leave a Comment