Re: [boost] Interval Library and comparison operators

From: David Abrahams (dave_at_[hidden])
Date: 2002-09-05 20:40:43

From: "Sylvain Pion" <pion_at_[hidden]>

>
> So it would be for applications that don't care about the actual order in
the
> container.  It means it would just use the set/map as a dictionnary, like
a
> hash table for example, just to test if an element is there or not, i.e.
where
> the traversal order of the container does not matter to the application.
>
> BUT, (that's what David Abrahams already noted, if I understood him
correctly)

I didn't say the preceding, though I would agree with it. I definitely
didn't say the following, and have no opinion on whether it's true...

> the should be a high similarity between std::set<interval<double> > and
> std::set<double>.
> They should behave roughly the same, at least when the intervals don't
overlap.

...though it sounds plausible.

-----------------------------------------------------------
           David Abrahams * Boost Consulting
dave_at_[hidden] * http://www.boost-consulting.com