--- On Tue, 26/8/08, Robert Jones <robertgbjones@gmail.com> wrote:

From: Robert Jones <robertgbjones@gmail.com> Subject: Re: [Boost-users] [range] STL algorithm wrappers accepting range? To: boost-users@lists.boost.org Date: Tuesday, 26 August, 2008, 4:13 PM 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. _______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

I had a look at that link. Section of it it look incomplete (e.g. User's Guide). Has it not been submitted/accepted to Boost as I can't see it in the main documentation.

On Tue, Aug 26, 2008 at 5:19 PM, Eric Niebler <eric@boost-consulting.com>wrote:

That is the old, incomplete documentation for my old, outdated RangeEx library. There is a newer, better RangeEx library in the Boost File Vault here: http://www.boostpro.com/vault/index.php?directory=Algorithms

Be sure to get Neil Groves' "range_ex.zip" and not my "old_range_ex.zip".

This is not (yet) an official part of Boost, but it's in the review queue. I don't know if the documentation is online anywhere.

Ooops, close! I never can get my head round the sandbox vs the vault. Thanks Eric. - Rob.