STL remove doesn’t work as expected?

by

Actually std::remove doesn’t remove the item from the container. Quoted from here

Remove removes from the range [first, last) all elements that are equal to value. That is, remove returns an iterator new_last such that the range [first, new_last) contains no elements equal to value. The iterators in the range [new_last, last) are all still dereferenceable, but the elements that they point to are unspecified. Remove is stable, meaning that the relative order of elements that are not equal to value is unchanged.`

That is, std::remove works with a pair of iterators only and does not know anything about the container which actually contains the items. In fact, it’s not possible for std::remove to know the underlying container, because there is no way it can go from a pair of iterators to discover about the container to which the iterators belong. So std::remove doesn’t really remove the items, simply because it cannot. The only way to actually remove an item from a container is to invoke a member function on that container.

So if you want to remove the items, then use Erase-Remove Idiom:

 v.erase(std::remove(v.begin(), v.end(), 10), v.end());

The erase-remove idiom is so common and useful is that std::list has added another member function called list::remove which produces the same effect as that of the erase-remove idiom.

 std::list<int> l;
 //...
 l.remove(10); //it "actually" removes all elements with value 10!

That means, you don’t need to use erase-remove idiom when you work with std::list. You can directly call its member function list::remove.

More Related Contents:

  1. push_back vs emplace_back
  2. Concatenating two std::vectors
  3. What really is a deque in STL?
  4. Template Specialization VS Function Overloading
  5. Is std::vector or boost::vector thread safe?
  6. Iteration over std::vector: unsigned vs signed index variable
  7. A proper way to create a matrix in c++
  8. Why does C++ allow an integer to be assigned to a string?
  9. std::vector, default construction, C++11 and breaking changes
  10. Why is value taking setter member functions not recommended in Herb Sutter’s CppCon 2014 talk (Back to Basics: Modern C++ Style)?
  11. Initial capacity of vector in C++
  12. std::vector iterator invalidation
  13. Non-copyable elements in vector
  14. How to pretty-print STL containers in GDB?
  15. How to make elements of vector unique? (remove non adjacent duplicates)
  16. How can I use Standard Library (STL) classes in my dll interface or ABI?
  17. std::vector removing elements which fulfill some conditions
  18. How can std::make_heap be implemented while making at most 3N comparisons?
  19. What is the right approach when using STL container for median calculation?
  20. Is there support in C++/STL for sorting objects by attribute?
  21. Copying std::vector: prefer assignment or std::copy?
  22. Why is a C++ Vector called a Vector? [closed]
  23. Why there is no std::copy_if algorithm?
  24. Types of iterator : Output vs. Input vs. Forward vs. Random Access Iterator
  25. C++ STL: Array vs Vector: Raw element accessing performance
  26. How can I copy one map into another using std::copy?
  27. stl container with std::unique_ptr’s vs boost::ptr_container
  28. STL map containing references does not compile
  29. C++ priority_queue with lambda comparator error
  30. How to cheaply assign C-style array to std::vector?

Leave a Comment