I have such code :
vector v;
for (int i=0; i<5; i++)
v.push_back(i);
v.erase(find(v.rbegin(), v.rend(),2).base());
This
base()
converts a reverse iterator into the corresponding forward iterator. However, despite its simplicity, this correspondence is not as trivial as one might thing.
When a reverse iterator points at one element, it dereferences the previous one, so the element it physically points to and the element it logically points to are different. In the following diagram, i
is a forward iterator, and ri
is a reverse iterator constructed from i
:
i, *i
|
- 0 1 2 3 4 -
| |
*ri ri
So if ri
logically points to element 2
, it physically points to element 3
. Therefore, when converted to a forward iterator, the resulting iterator will point to element 3
, which is the one that gets removed in your example.
The following small program demonstrates the above behavior:
#include
#include
#include
#include
int main(int argc, char *argv[])
{
std::vector v { 0, 1, 2, 3, 4 };
auto i = find(begin(v), end(v), 2);
std::cout << *i << std::endl; // PRINTS 2
std::reverse_iterator ri(i);
std::cout << *ri << std::endl; // PRINTS 1
}
Here is a live example.