comparing iterators from different containers

by

If you consider the C++11 standard (n3337):

§ 24.2.1 — [iterator.requirements.general#6]

An iterator j is called reachable from an iterator i if and only if there is a finite sequence of applications of the expression ++i that makes i == j. If j is reachable from i, they refer to elements of the same sequence.

§ 24.2.5 — [forward.iterators#2]

The domain of == for forward iterators is that of iterators over the same underlying sequence.

Given that RandomAccessIterator must satisfy all requirements imposed by ForwardIterator, comparing iterators from different containers is undefined.

The LWG issue #446 talks specifically about this question, and the proposal was to add the following text to the standard (thanks to @Lightness Races in Orbit for bringing it to attention):

The result of directly or indirectly evaluating any comparison function or the binary – operator with two iterator values as arguments that were obtained from two different ranges r1 and r2 (including their past-the-end values) which are not subranges of one common range is undefined, unless explicitly described otherwise.

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. Why use non-member begin and end functions in C++11?
  6. Sorting a vector in descending order
  7. How are iterators and pointers related?
  8. What’s faster, iterating an STL vector with vector::iterator or with at()?
  9. What is the difference between const_iterator and non-const iterator in the C++ STL?
  10. What is an iterator’s default value?
  11. Custom Iterator in C++
  12. Why is “!=” used with iterators instead of “
  13. how portable is end iterator decrement?
  14. Can std::begin work with array parameters and if so, how?
  15. std::vector iterator invalidation
  16. Checking if an iterator is valid
  17. How does std::copy work with stream iterators
  18. Why does a push_back on an std::list change a reverse iterator initialized with rbegin?
  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