2009/11/10 James Porter <porterj@alum.rit.edu>
Andrei Alexandrescu wrote:
My article with a draft name "Iterators Must Go (Ahead)" is now published on InformIt and mentioned on reddit.com. Due to the vagaries of posting time and reddit dynamics, the article didn't stay long on reddit's programming page so it got very few views and comments.
Something I have wondered since listening to the lecture (online) from BoostCon, is how the interaction between ranges and containers is designed. For instance, how does std::container<T>::insert and erase look? How would the following example from the SGI STL doc be written in, say, D's standard library (I did search the D documentation, but couldn't find the answer). std::vector<int> v; v.push_back(...); v.erase(v.begin(), std::find(v.begin(), v.end(), X)); Sorry if this is already covered, I would very much be interested in reading further on this topic. Thanks, Christian