Why does a push_back on an std::list change a reverse iterator initialized with rbegin?

by

The standard says that iterators and references remain valid during an insert. It doesn’t say anything about reverse iterators. 🙂

The reverse_iterator returned by rbegin() internally holds the value of end(). After a push_back() this value will obviously not be the same as it was before. I don’t think the standard says what it should be. Obvious alternatives include the previous last element of the list, or that it stays at the end if that is a fixed value (like a sentinel node).

Technical details: The value returned by rend() cannot point before begin(), because that is not valid. So it was decided that rend() should contain the value of begin() and all other reverse iterators be shifted one position further. The operator* compensates for this and accesses the correct element anyway.

First paragraph of 24.5.1 Reverse iterators says:

Class template reverse_iterator is an iterator adaptor that iterates from the end of the sequence defined
by its underlying iterator to the beginning of that sequence. The fundamental relation between a reverse
iterator and its corresponding iterator i is established by the identity:
&*(reverse_iterator(i)) == &*(i - 1).

More Related Contents:

  1. Why use iterators instead of array indices?
  2. Why are Standard iterator ranges [begin, end) instead of [begin, end]?
  3. What happens if you call erase() on a map element while iterating from begin to end?
  4. Removing item from vector while iterating?
  5. comparing iterators from different containers
  6. Why use non-member begin and end functions in C++11?
  7. Sorting a vector in descending order
  8. How are iterators and pointers related?
  9. What’s faster, iterating an STL vector with vector::iterator or with at()?
  10. What is the difference between const_iterator and non-const iterator in the C++ STL?
  11. What is an iterator’s default value?
  12. Custom Iterator in C++
  13. Why is “!=” used with iterators instead of “
  14. how portable is end iterator decrement?
  15. Can std::begin work with array parameters and if so, how?
  16. std::vector iterator invalidation
  17. Checking if an iterator is valid
  18. How does std::copy work with stream iterators
  19. Can raw pointers be used instead of iterators with STL algorithms for containers with linear storage?
  20. How to remove constness of const_iterator?
  21. What happens if you increment an iterator that is equal to the end iterator of an STL container
  22. Are const_iterators faster?
  23. How to check that the passed Iterator is a random access iterator?
  24. Do STL iterators guarantee validity after collection was changed?
  25. Incrementing iterators: Is ++it more efficient than it++? [duplicate]
  26. what is the difference between const_iterator and iterator? [duplicate]
  27. How to increment an iterator by 2?
  28. Types of iterator : Output vs. Input vs. Forward vs. Random Access Iterator
  29. iterator for 2d vector
  30. How can I copy one map into another using std::copy?

Leave a Comment