what is the difference between const_iterator and iterator? [duplicate]

by

There is no performance difference.

A const_iterator is an iterator that points to const value (like a const T* pointer); dereferencing it returns a reference to a constant value (const T&) and prevents modification of the referenced value: it enforces const-correctness.

When you have a const reference to the container, you can only get a const_iterator.

Edited: I mentionned “The const_iterator returns constant pointers” which is not accurate, thanks to Brandon for pointing it out.

Edit: For COW objects, getting a non-const iterator (or dereferencing it) will probably trigger the copy. (Some obsolete and now disallowed implementations of std::string use COW.)

More Related Contents:

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

Leave a Comment