I've been up and down stackoverflow and even the very, very nice Dr. Dobbs article but I can't find a definitive answer to the question.
A section of the answer to the question What are the shortcomings of std::reverse_iterator? says that it might not be possible at all.
std::list::reverse_iterator it = list.rbegin();
while( it != list.rend() )
{
int value=*it;
if( some_cond_met_on(value) )
{
++it;
list.erase( it.base() );
}
else
{
++it;
}
}
PS: I do know there are other alternatives, such as erase_if(), but I'm looking for an answer to this specific question.
It should just be
std::list<int>::reverse_iterator it = list.rbegin();
while( it != list.rend() )
{
int value=*it;
if( some_cond_met_on(value) )
{
++it;
it= reverse_iterator(list.erase(it.base()); // change to this!
}
else
{
++it;
}
}
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With