On Tue, Aug 26, 2008 at 4:08 PM, Nat Goodspeed <nat@lindenlab.com> wrote:
Apologies if I'm overlooking something obvious, or if this is a FAQ.

Has anyone published a suite of wrappers for common STL algorithms that accept Boost.Range instances instead of iterator pairs? Or must we each write our own? Seems like redundant effort...

I asked the very same question just a few weeks back! The answer is Boost.RangeEx.

http://boost-sandbox.sourceforge.net/libs/range_ex/doc/html/index.html

- Rob.