|
Boost : |
From: Matthew Austern (austern_at_[hidden])
Date: 2000-11-29 16:05:30
Jeremy Siek wrote:
>
> Instead of "are clearly legal", did you really mean "should clearly be
> legal"?
>
> The current wording of the standard in 25.1.2 does not explicitly talk
> about mixed comparisons, it just has T models EqualityComparable.
No, I meant that, in my opinion, it is already clearly legal.
Or to be more precise about what I'm claiming to be legal:
- It's required that T must be EqualityComparable.
- I don't think it's required that the operator== that find()
uses must be the same one that's used when comparing
one T to another. (This is where I see a difference
between find() and lower_bound(). For lower_bound, the
algorithm requires a relationship between the comparison
used for sorting the list and the comparison used for
the earch.)
--Matt
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk