unique list

[Gary Wessle]

Hi

many times I wanted to have a vector<stringof unique "no duplicate"
entries. say I read words from ifstream and don't want repeated words.
is using a map overkill here? since I will not need map.second() part?

thanks

[Victor Bazarov]

Gary Wessle wrote:

many times I wanted to have a vector<stringof unique "no duplicate"
entries. say I read words from ifstream and don't want repeated words.
is using a map overkill here? since I will not need map.second() part?

Use 'std::set'. No overkill. Once created, copy the entire set to
a 'vector', if you need fast indexed access. Besides, they are going
to be sorted. Dispose of the 'set' when you don't need it any more.

V
--
Please remove capital 'A's when replying by e-mail
I do not respond to top-posted replies, please don't ask

[Mark P]

Victor Bazarov wrote:

Gary Wessle wrote:

>many times I wanted to have a vector<stringof unique "no duplicate"
entries. say I read words from ifstream and don't want repeated words.
is using a map overkill here? since I will not need map.second() part?

Use 'std::set'. No overkill. Once created, copy the entire set to
a 'vector', if you need fast indexed access. Besides, they are going
to be sorted. Dispose of the 'set' when you don't need it any more.

V

Another possibility is to use a vector, followed by std::sort, followed
by std::unique. If performance is important this may (or may not!)
outperform std::set.