How to Erase Elements from a List Using Reverse Iterators in C ?

Converting a Reverse Iterator for Erasing from a List

To delete an element from a list using an erase operation, regular iterators are required. However, when using reverse iterators, a conversion is necessary.

The standard defines a relationship between a reverse iterator (i) and its corresponding regular iterator (i.base()):

&*reverse_iterator(i) == &*(i - 1)

This relationship allows for the conversion of a reverse iterator to a regular iterator by applying an offset to i.base(). Therefore, to erase an element using a reverse iterator, the following code can be used:

m_CursorStack.erase(--(i.base()));

In C 11 and later, two additional options are available for erasing elements with reverse iterators:

1. Unchanged Reverse Iterator

m_CursorStack.erase(std::next(i).base());

2. Advanced Reverse Iterator

std::advance(i, 1);
m_CursorStack.erase(i.base());

These alternatives provide clearer and more concise solutions compared to the initial approach.

The above is the detailed content of How to Erase Elements from a List Using Reverse Iterators in C ?. For more information, please follow other related articles on the PHP Chinese website!