Container ?

[Michael]

Hi,

Could you please explain a little bit about the difference between the
following two groups.

group 1: std::vector std::deque std::list
group 2: std::stack std::queue std:riority_queue

I did not see much difference between group1 and group 2. When I just
need group 1? And, when I need group 1 and group 2?

Thanks,
Michael

 

[Victor Bazarov]

Could you please explain a little bit about the difference between the
following two groups.

group 1: std::vector std::deque std::list
group 2: std::stack std::queue std:riority_queue

I did not see much difference between group1 and group 2. When I just
need group 1? And, when I need group 1 and group 2?

Group 1 are containers. Group 2 are container adapters. Group 1 has
container traits: they store, contain, things. Group 2 are wrappers
over any of group 1, they represent a different interface for adding
and removing elements.

V

 

[Michael]

Group 1 are containers. Group 2 are container adapters. Group 1 has
container traits: they store, contain, things. Group 2 are wrappers
over any of group 1, they represent a different interface for adding
and removing elements.

Thanks for your quick reply. However, I think most of time I just need
container. I did not see what benefit I would get if I use container
adapter. Could you please give me an example?

Thanks a lot!
Michael

 

[Victor Bazarov]

Thanks for your quick reply. However, I think most of time I just need
container. I did not see what benefit I would get if I use container
adapter. Could you please give me an example?

If your algorithm calls for FIFO kind of processing of some objects, you
might want to use std::queue. If your algorithm operates in the FILO mode,
look at utilizing std::stack. But this is certainly true: if you have to
ask, you don't need those. When you have the need, you'll know. To find
an example, go to Google and search by the name of the adapter.

V