What are differences between deque and linked list (+vector) implementation for STL queue (OR stack)?

Question

We know that the standard container class templates deque and list can be used to implement queue and +vector to implement stack. But, what are difference between these two implementation, if we always use the same methods to access and also can not access arbitrary elements using at() or [] as we do it with deque (vector).

possible duplicate of STL Containers - diffrence between vector, list and deque — Bo Persson
– Bo Persson, Commented Mar 11, 2012 at 15:57

Michael Burr · Accepted Answer · 2012-03-11 13:39:56Z

6

The container adaptors, such as stack and queue, are implemented using a specific subset of operations - any container that will be used with a particular adaptor must support all of the operations that the adaptor requires.

vector cannot be used with the queue container adaptor because:

Any sequence supporting operations front(), back(), push_back() and pop_front() can be used to instantiate queue.

And vector doesn't support pop_front().

vector, deque or list can be used with stack because all three of these containers support the operations that stack requires:

Any sequence supporting operations back(), push_back() and pop_back() can be used to instantiate stack.

answered Mar 11, 2012 at 13:39

Michael Burr

342k52 gold badges553 silver badges774 bronze badges

Sign up to request clarification or add additional context in comments.

3 Comments

Matthieu M. Over a year ago

Note: vector does not support pop_front because there it cannot (really) be implemented efficiently.

Beibut Amirgaliyev Over a year ago

Excuse me, but I haven't taken an answer for my question. I am not asking you why these containers groupped together. Question is: if i create queue using STL's queue <int> Q, I created queue with name Q which will be implemented using Deque, if I write queue<int, list<int>) QL I use linkedlist implementation. But, what are difference, if you use both of them in the same way and I suggest that time complexity is the same?

Michael Burr Over a year ago

@Beibut: I'm sorry, I guess I didn't understand the question. As far as time complexity goes, the operations the container adapters use are all required to have "amortized constant time" (C++03 23.1.1/12) on the underlying containers. So there's no complexity difference caused by using one container or another. Of course, that doesn't mean the performance will necessarily be the same.

Collectives™ on Stack Overflow

What are differences between deque and linked list (+vector) implementation for STL queue (OR stack)?

1 Answer 1

3 Comments

Your Answer

Linked

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

3 Comments

Your Answer

Sign up or log in

Post as a guest

Linked

Related