Re: [Boost-users] Container/Algorithm question

From: Elisha Berns (e.berns_at_[hidden])
Date: 2005-07-14 11:57:37

Thanks for the code sample, I'll take a look at it and try it out.  

And yes, those type of pairs you mention below are valid, basically any
non-repeating pair is valid except for one case where both pair members
are identical.  But that can be eliminated before insertion by a simple
compare ( (first != second) ).

Elisha

> Elisha Berns ha escrito:
> 
> > Hi,
> >
> > I have some confusion regarding which type of container/algorithm to
use
> > to optimize the lookup (not necessarily the insertion) of unique
pairs
> > where the definition of unique is:
> >
> > Either member of the pair can occur an infinite/unbounded number of
> > times provided the other member of the pair never occurs more than
once:
> > (3,4), (3,5), (3,6), (6,6), (5,6), (4,6)... etc.
> >
> 
> The constraint is not entirely clear to me. Is the following allowed?
> 
> (3,4),(4,3)
> 
> Joaquín M López Muñoz
> Telefónica, Investigación y Desarrollo
> 
> _______________________________________________
> Boost-users mailing list
> Boost-users_at_[hidden]
> http://lists.boost.org/mailman/listinfo.cgi/boost-users