Remove Elements Without Surplus

When using algorithms like std::remove() or std::remove_if() from the C++ Standard Library, the elements to be removed are shifted to the end of the container, but the container's size remains unchanged.

To fully remove these elements and adjust the container size, you can use the remove-erase idiom.

Here's how you can do it:

1. Apply the std::remove() or std::remove_if() algorithm to shift the unwanted elements to the end.
2. Use the container's erase() method to remove the surplus elements.

For example, let's remove all occurrences of the number 3 from a std::vector:

1#include <algorithm>
2#include <iostream>
3#include <vector>
4
5int main() {
6  std::vector<int> Source{1, 2, 3, 4, 5, 6};
7
8  // Step 1: Apply std::remove
9  auto NewEnd = std::remove(
10    Source.begin(), Source.end(), 3);
11
12  // Step 2: Erase surplus elements
13  Source.erase(NewEnd, Source.end());
14
15  // Display the result
16  std::cout << "Objects in Source: ";
17  for (auto Num : Source) {
18    std::cout << Num << ", ";
19  }
20}

1Objects in Source: 1, 2, 4, 5, 6,

The std::remove() function reorders the container so that all elements not equal to 3 are moved to the front, and the erase() method removes the unwanted surplus elements from the end.

This method is efficient and commonly used in C++ to manage container sizes properly after removal operations.

Remember, the same concept can be applied to other containers like std::deque or std::list by using their respective erase() methods.