Speed accessing a std::vector by iterator vs by operator[]/index?

by

The performance difference is likely negligable or none (the compiler might optimise them to be identical); you should worry about other things, like whether your program is correct (a slow but correct program is better than a fast and incorrect program). There are other advantages to using iterators though, such as being able to change the underlying container to one with no operator[] without modifying your loops. See this question for more.

const_iterators will most likely have none, or negligable, performance difference compared to ordinary iterators. They are designed to improve the correctness of your program by preventing modifying things that shouldn’t be modified, not for performance. The same goes for the const keyword in general.

In short, optimisation should not be a concern of yours until two things have happened: 1) you have noticed it runs too slowly and 2) you have profiled the bottlenecks. For 1), if it ran ten times slower than it could, but is only ever run once and takes 0.1ms, who cares? For 2), make sure it’s definitely the bottleneck, otherwise optimising it will have nearly no measurable effect on performance!

Related Contents:

  1. What’s faster, iterating an STL vector with vector::iterator or with at()?
  2. Sorting a vector in descending order
  3. Is std::vector so much slower than plain arrays?
  4. C++ STL Vectors: Get iterator from index?
  5. What is the difference between cbegin and begin for vector?
  6. What happens if you increment an iterator that is equal to the end iterator of an STL container
  7. What’s the benefit of std::back_inserter over std::inserter?
  8. Using C++ vector::insert() to add to end of vector
  9. Convert iterator to pointer?
  10. What is the most efficient way to append one std::vector to the end of another?
  11. Concatenating two std::vectors
  12. How do I erase an element from std::vector by index?
  13. Why can’t I make a vector of references?
  14. What’s the most efficient way to erase duplicates and sort a vector?
  15. vector vs. list in STL
  16. How do I print the elements of a C++ vector in GDB?
  17. Thou shalt not inherit from std::vector
  18. Why use non-member begin and end functions in C++11?
  19. What does iterator->second mean?
  20. How to get std::vector pointer to the raw data?
  21. What is the difference between const_iterator and non-const iterator in the C++ STL?
  22. Is it more efficient to copy a vector by reserving and copying, or by creating and swapping? [duplicate]
  23. what is the difference between const_iterator and iterator? [duplicate]
  24. What happens if you call erase() on a map element while iterating from begin to end?
  25. Iterating C++ vector from the end to the beginning
  26. How to navigate through a vector using iterators? (C++)
  27. How to overload std::swap()
  28. Erasing elements from a vector
  29. Initial capacity of vector in C++
  30. Alternative to vector
  31. std::vector::resize() vs. std::vector::reserve()
  32. Why would I prefer using vector to deque
  33. What is an iterator’s default value?
  34. Looking for C++ STL-like vector class but using stack storage
  35. iterate vector, remove certain items as I go
  36. Checking if an iterator is valid
  37. Constant-sized vector
  38. Removing item from vector while iterating?
  39. How to change a particular element of a C++ STL vector
  40. Delete all items from a c++ std::vector
  41. Replace an element into a specific position of a vector
  42. how portable is end iterator decrement?
  43. Why is “!=” used with iterators instead of “
  44. How do I sort a std::vector by the values of a different std::vector? [duplicate]
  45. Is there a sorted container in the STL?
  46. STL vectors with uninitialized storage?
  47. Cleaning up an STL list/vector of pointers
  48. How are iterators and pointers related?
  49. C++ vector that *doesn’t* initialize its members?
  50. Why emplace_back is faster than push_back?

Leave a Comment