A Question about std::list

[JustSomeGuy]

Can you access elements of the std::list like they were an array?
eg.
std::list<int> xlist;
int y;
....
y = xlist[10]; // Returns the 10th element of a list.

 

[Ivan Vecerina]

Can you access elements of the std::list like they were an array?
eg.
std::list<int> xlist;
int y;
...
y = xlist[10]; // Returns the 10th element of a list.

No. std::vector and std::deque are the only containers that
provide efficient random-access to their contents.
An equivalent function could be implemented, but it will
require linear time ( O(N) to access the Nth element ).

Cheers,
Ivan

 

[Andrew Koenig]

Can you access elements of the std::list like they were an array?

No. If you wanted, you could write your own function to achieve the same
effect, but it's not generally possible to do so efficiently.

What are you trying to do?

 

[JustSomeGuy]

No. If you wanted, you could write your own function to achieve the same
effect, but it's not generally possible to do so efficiently.

What are you trying to do?

I think the answer I was looking for was to switch to a vector class instead
of the list class.

 

[Ivan Vecerina]

I think the answer I was looking for was to switch to a vector class
instead of the list class.

std::vector should be the default-choice container.

However, depending on the operations that you need to perform
(e.g. adding/removing items, FIFO, sorting, etc), another
standard container (std::deque or even std::set) could be
a better choice.
( The information you have provided does not allow for a definite
recommendation, which is why Andrew asked you for more details. )

Regards,
Ivan

 

[Dfschweiss]

That's what std::vector is for!