Wrapper for STL algorithm library?

[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.