|  | Home | Libraries | People | FAQ | More | 
template<class Container, class Pred> Container& remove_erase_if(Container& target, Pred pred);
            remove_erase_if removes
            the elements x that satisfy
            pred(x)
            from the container. This is in contrast to the erase
            algorithm which merely rearranges elements.
          
            Defined in the header file boost/range/algorithm_ext/erase.hpp
          
Container supports
                erase of an iterator range.
              Pred is a model of
                the Predicate Concept.
              
            Linear. Proportional to distance(target)s.