2010-03-28 16:08:35 +00:00
|
|
|
[section:remove_erase remove_erase]
|
|
|
|
|
|
|
|
|
|
[heading Prototype]
|
|
|
|
|
|
|
|
|
|
``
|
2010-04-11 22:05:02 +00:00
|
|
|
template<class Container, class Value>
|
|
|
|
|
Container& remove_erase(Container& target,
|
|
|
|
|
const Value& value);
|
2010-03-28 16:08:35 +00:00
|
|
|
``
|
|
|
|
|
|
|
|
|
|
[heading Description]
|
|
|
|
|
|
2010-04-11 22:05:02 +00:00
|
|
|
`remove_erase` actually eliminates the elements equal to `value` from the container. This
|
2010-03-28 16:08:35 +00:00
|
|
|
is in contrast to the `remove` algorithm which merely rearranges elements.
|
|
|
|
|
|
|
|
|
|
[heading Definition]
|
|
|
|
|
|
|
|
|
|
Defined in the header file `boost/range/algorithm_ext/erase.hpp`
|
|
|
|
|
|
|
|
|
|
[heading Requirements]
|
|
|
|
|
|
|
|
|
|
# `Container` supports erase of an iterator range.
|
|
|
|
|
|
|
|
|
|
[heading Complexity]
|
|
|
|
|
|
|
|
|
|
Linear. Proportional to `distance(target)`s.
|
|
|
|
|
|
|
|
|
|
[endsect]
|
