How to remove constness of const_iterator?

by

There is a solution with constant time complexity in C++11: for any sequence, associative, or unordered associative container (including all of the Standard Library containers), you can call the range-erase member function with an empty range:

template <typename Container, typename ConstIterator>
typename Container::iterator remove_constness(Container& c, ConstIterator it)
{
    return c.erase(it, it);
}

The range-erase member functions have a pair of const_iterator parameters, but they return an iterator. Because an empty range is provided, the call to erase does not change the contents of the container.

Hat tip to Howard Hinnant and Jon Kalb for this trick.

More Related Contents:

  1. Are const_iterators faster?
  2. what is the difference between const_iterator and iterator? [duplicate]
  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. What happens if you call erase() on a map element while iterating from begin to end?
  7. How to correctly implement custom iterators and const_iterators?
  8. Removing item from vector while iterating?
  9. comparing iterators from different containers
  10. Why use non-member begin and end functions in C++11?
  11. Sorting a vector in descending order
  12. How are iterators and pointers related?
  13. What’s faster, iterating an STL vector with vector::iterator or with at()?
  14. What is the difference between const_iterator and non-const iterator in the C++ STL?
  15. What is an iterator’s default value?
  16. Custom Iterator in C++
  17. Why is “!=” used with iterators instead of “
  18. how portable is end iterator decrement?
  19. Can std::begin work with array parameters and if so, how?
  20. Checking if an iterator is valid
  21. How does std::copy work with stream iterators
  22. Why does a push_back on an std::list change a reverse iterator initialized with rbegin?
  23. Can raw pointers be used instead of iterators with STL algorithms for containers with linear storage?
  24. What happens if you increment an iterator that is equal to the end iterator of an STL container
  25. What is the reason behind cbegin/cend?
  26. How to check that the passed Iterator is a random access iterator?
  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