
6 Jun
2004
6 Jun
'04
5:12 a.m.
"David Abrahams" <dave@boost-consulting.com> wrote in message news:uhdtpqogn.fsf@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 return range< vector<T> > and not iterator_range< typename iterator_of< vector<T> >::type > br Thorsten