Re: Using unique with std::map

In article
<d55b24f6-150f-4185-9ee4-b1f246f0d9aa@c65g2000hsa.googlegroups.com>,
Vitaly <vperlin@yahoo.com> wrote:


   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! ]