std::sort(range(c));
Unlike
std::sort(c.begin(), c.end();
Do you expect the following standard to provide range overload for standard algorithms?
Boost range iterators are something similar, and Bjarne Stroustrup iseq(), mentioned in TC ++ PL3e, is also the same idea. I looked at the last draft that I could find , but did not see the range overloads mentioned above.
iseq()
The History page provides a partial answer.
std. , . , , - . , . . , , , . . , , - , . , .
std
, , . , / , . , .
, , , , Range. , , .