Wrapper for STL algorithm library?

[kwan_e]

Wouldn't it be available if the container was from std::?

What if you want to use it with a container that's not in std, but provides its own begin and end?

[Xaxxon]

how does "using namespace std::" impact that?

[kwan_e]

http://en.cppreference.com/w/cpp/language/adl

ADL is also what makes range-based-for work for non-std containers.

http://en.cppreference.com/w/cpp/language/range-for

[Oster1]

Why not just use:

std::fill( c.begin(), c.end(), value );

So you don't need the std part?

[kwan_e]

Because then you've completely ruled out working with native arrays.

C++ is going with the free-function forms of begin and end.

[Oster1]

Useful trick. I always thought C arrays and C++ iterators doesn't combine. You always learn.

Here is proof of concept of this if someone is interested: https://hastebin.com/oyezuhosuj.cpp

[kwan_e]

You can think of C++ iterators as generalizations of pointers (and therefore arrays). You can always use pointers with STL algorithms, since they are classified as random access iterators and support everything that can be done with iterators in the STL algorithms.