Iteration over std::vector: unsigned vs signed index variable

by

For iterating backwards see this answer.

Iterating forwards is almost identical. Just change the iterators / swap decrement by increment. You should prefer iterators. Some people tell you to use std::size_t as the index variable type. However, that is not portable. Always use the size_type typedef of the container (While you could get away with only a conversion in the forward iterating case, it could actually go wrong all the way in the backward iterating case when using std::size_t, in case std::size_t is wider than what is the typedef of size_type):

Using std::vector

Using iterators

for(std::vector<T>::iterator it = v.begin(); it != v.end(); ++it) {
    /* std::cout << *it; ... */
}

Important is, always use the prefix increment form for iterators whose definitions you don’t know. That will ensure your code runs as generic as possible.

Using Range C++11

for(auto const& value: a) {
     /* std::cout << value; ... */

Using indices

for(std::vector<int>::size_type i = 0; i != v.size(); i++) {
    /* std::cout << v[i]; ... */
}

Using arrays

Using iterators

for(element_type* it = a; it != (a + (sizeof a / sizeof *a)); it++) {
    /* std::cout << *it; ... */
}

Using Range C++11

for(auto const& value: a) {
     /* std::cout << value; ... */

Using indices

for(std::size_t i = 0; i != (sizeof a / sizeof *a); i++) {
    /* std::cout << a[i]; ... */
}

Read in the backward iterating answer what problem the sizeof approach can yield to, though.

More Related Contents:

  1. Signed/unsigned comparisons
  2. What happens if I assign a negative value to an unsigned variable?
  3. How do I deal with “signed/unsigned mismatch” warnings (C4018)?
  4. C++ convert hex string to signed integer
  5. What is the easiest way to initialize a std::vector with hardcoded elements?
  6. How do I specify a pointer to an overloaded function?
  7. How to overload std::swap()
  8. Detecting signed overflow in C/C++
  9. Initializing a static std::map in C++
  10. How do I sort a vector of pairs based on the second element of the pair?
  11. Is there any real risk to deriving from the C++ STL containers?
  12. maximum value of int
  13. How to avoid memory leaks when using a vector of pointers to dynamically allocated objects in C++?
  14. Why is template argument deduction disabled with std::forward?
  15. Is the order of iterating through std::map known (and guaranteed by the standard)?
  16. How to get a random element from a C++ container?
  17. c++ sort keeping track of indices [duplicate]
  18. Multidimensional std::array [duplicate]
  19. Reorder vector using a vector of indices [duplicate]
  20. How to choose between map and unordered_map?
  21. Advantages of std::for_each over for loop
  22. C++ equivalent of StringBuffer/StringBuilder?
  23. Does std::stack expose iterators?
  24. Why does a push_back on an std::list change a reverse iterator initialized with rbegin?
  25. Why is −1 > sizeof(int)?
  26. Using std::map where V has no usable default constructor
  27. Comparing 3 modern c++ ways to convert integral values to strings
  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