The crucial difference I had in mind, is that those from C++ work in-place.
Returning a new collection as a result poses no problem for either of those
languages. Writing specialized version for each collection is also possible,
but with STL you don&#x27;t have to do that.<p>Maybe it would be possible to implement those algorithms in Rust in terms of
ranges like in D, instead of iterators? I will have to try and see.