C++ standard/de facto STL algorithm wrappers.

Question

hello

Are there any standard/de facto standard (boost) wrappers around standard algorithms which work with containers defining begin and end. Let me show you what I mean with the code:

// instead of specifying begin and end
std::copy(vector.begin(), vector.end(), output);
// write as
xxx::copy(vector, output);

I know it can be written easily, but I am looking specifically for something ubiquitous. Thanks.

Answer 1

The only case where I've seen something like this are those algorithms based upon the boost::range library, but even these do not actually modify the standard algorithms like std::copy or std::remove_if -- the algorithm in question needs to be written to take advantage of such a range wrapper.

For an example, see the Boost String Algorithms library.

Answer 2

The next standard will (hopefully!) amend this. In the meantime, take a look at Boost.Range and its various uses although I’m not aware of an interface to the standard algorithms.

Answer 3

There is an extension to the Boost Range library called RangeEx which contains range wrappers for all stl algorithms, plus some new ones.

It has recently been accepted into Boost and so it's not yet in the current "official" release (1.41). Until this changes, you can download the latest version from the Boost Vault.

Don't know if this will ever become part of the C++ standard, but the fact that it's in Boost means that it will be the de facto standard.

Answer 4

I will add my own finding: Adobe source libraries (rangex from boost supersedes algorithms part) ASL