What is the past-the-end iterator in STL C++?

by

The functions begin() and end() define a half open range([begin, end)), which means:
The range includes first element but excludes the last element. Hence, the name past the end.

enter image description here

The advantage of an half open range is:

  1. It avoids special handling for empty ranges. For empty ranges, begin() is equal to
    end() .

  2. It makes the end criterion simple for loops that iterate over the elements: The loops simply
    continue as long as end() is not reached

More Related Contents:

  1. c++ push reference node to stl list
  2. Why are Standard iterator ranges [begin, end) instead of [begin, end]?
  3. Why do I get the same sequence for every run with std::random_device with mingw gcc4.8.1?
  4. When vectors are allocated, do they use memory on the heap or the stack?
  5. Nice way to append a vector to itself
  6. In STL maps, is it better to use map::insert than []?
  7. Why use non-member begin and end functions in C++11?
  8. std::fstream doesn’t create file
  9. Where can I get a “useful” C++ binary search algorithm?
  10. Relative performance of std::vector vs. std::list vs. std::slist?
  11. Stack-buffer based STL allocator?
  12. std::sort does not always call std::swap
  13. Is std::vector copying the objects with a push_back?
  14. how-to initialize ‘const std::vector’ like a c array
  15. Is hash_map part of the STL?
  16. How to use std::sort with a vector of structures and compare function?
  17. Why does storing references (not pointers) in containers in C++ not work?
  18. Can std::begin work with array parameters and if so, how?
  19. How to make elements of vector unique? (remove non adjacent duplicates)
  20. How does overloading of const and non-const functions work?
  21. How can I use Standard Library (STL) classes in my dll interface or ABI?
  22. Does boost have a datatype for set operations that is simpler than the STL?
  23. How can i estimate memory usage of std::map?
  24. Memory allocation and deallocation across dll boundaries
  25. STL deque accessing by index is O(1)?
  26. Can std::vector emplace_back copy construct from an element of the vector itself?
  27. what does `using std::swap` inside the body of a class method implementation mean?
  28. error for hash function of pair of ints
  29. STL algorithms: Why no additional interface for containers (additional to iterator pairs)?
  30. Why does (i|o)fstream take a const char* parameter for a file name?

Leave a Comment