ceph/src/boost/libs/range/doc/reference/algorithm_ext/remove_erase.qbk

   1 [/
   2     Copyright 2010 Neil Groves
   3     Distributed under the Boost Software License, Version 1.0.
   4     (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
   5 /]
   6 [section:remove_erase remove_erase]
   7
   8 [heading Prototype]
   9
  10 ``
  11 template<class Container, class Value>
  12 Container& remove_erase(Container& target,
  13                         const Value& value);
  14 ``
  15
  16 [heading Description]
  17
  18 `remove_erase` actually eliminates the elements equal to `value` from the container. This
  19 is in contrast to the `remove` algorithm which merely rearranges elements.
  20
  21 [heading Definition]
  22
  23 Defined in the header file `boost/range/algorithm_ext/erase.hpp`
  24
  25 [heading Requirements]
  26
  27 # `Container` supports erase of an iterator range.
  28
  29 [heading Complexity]
  30
  31 Linear. Proportional to `distance(target)`s.
  32
  33 [endsect]