What is the best way to access deque's element in C++ STL

c++ stl deque
Lucky Man picture Lucky Man · Jan 23, 2012 · Viewed 12.2k times · Source

I have a deque:

deque<char> My_Deque;
My_Path.push_front('a');
My_Path.push_front('b');
My_Path.push_front('c');
My_Path.push_front('d');
My_Path.push_front('e');

There are such ways to output it.

The first:

deque<char>::iterator It;
for ( It = My_Deque.begin(); It != My_Deque.end(); It++ )
    cout << *It <<  " ";

The second:

for (i=0;i<My_Deque.size();i++) {
    cout << My_Deque[i] <<  " ";
}

What is the best way to access deque's element - through iterator or like this: My_Deque[i]? Has a deque<...> element an array of pointers to each element for fast access to it's data or it provides access to it's random element in consequtive way (like on a picture below)? enter image description here

Answer

Kerrek SB picture Kerrek SB · Jan 23, 2012

Since you asked for "the best way":

for (char c : My_Deque) { std::cout << c <<  " "; }

Related questions

What really is a deque in STL?

I was looking at STL containers and trying to figure what they really are (i.e. the data structure used), and the deque stopped me: I thought at first that it was a double linked list, which would allow insertion …

Read More
What's the difference between deque and list STL containers?

What is the difference between the two? I mean the methods are all the same. So, for a user, they work identically. Is that correct??

Read More
Why would I prefer using vector to deque

Since 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 whould anyone prefer std::vector to std::deque?

Read More