Boost logo

Boost Users :

From: Joaquín Mª López Muñoz (joaquin_at_[hidden])
Date: 2005-07-14 01:05:39

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?


Joaquín M López Muñoz
Telefónica, Investigación y Desarrollo

Boost-users list run by williamkempf at, kalb at, bjorn.karlsson at, gregod at, wekempf at