6 Jun
2004
6 Jun
'04
3:13 a.m.
"David Abrahams" <dave@boost-consulting.com> wrote in message news:ur7stqvrd.fsf@boost-consulting.com... | "Thorsten Ottosen" <nesotto@cs.auc.dk> writes: | | > My current view is that Boost.Range should contain both itarator_range<> and range<>, | > but that range-based algorithms should use range<> | | If I understand you correctly, it sounds a bit rigid. Would you not | provide a range-based lower_bound as a matter of principle, or what? I'm not sure I understand. Could you give an example? (remark: range<> would be less flexible than iterator_range<> since its template parameter is an ExternalRange, but it would provide a higher abstraction level. ) -Thorsten