From: Thorsten Ottosen (nesotto_at_[hidden])
Date: 2004-06-06 00:12:51
"David Abrahams" <dave_at_[hidden]> wrote in message news:uhdtpqogn.fsf_at_boost-consulting.com...
| > I'm not sure I understand. Could you give an example?
| It sounds like you're saying that algorithms that traffic in ranges
| shouldn't also deal in iterators (I could be mistaken), but it seems
| to me that for some algorithms (e.g. lower_bound), operating on a
| range and returning an iterator is just right.
yeah, I'm saying that algorithms that traffic in ranges (eg vector<T>) and return iterator pairs should
range< vector<T> >
iterator_range< typename iterator_of< vector<T> >::type >
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk