...one of the most highly
regarded and expertly designed C++ library projects in the
world.
— Herb Sutter and Andrei
Alexandrescu, C++
Coding Standards
Front Page / Algorithms / Transformation Algorithms / reverse_remove_if |
template< typename Sequence , typename Pred , typename In = unspecified > struct reverse_remove_if { typedef unspecified type; };
Returns a new sequence that contains all the elements from [begin<Sequence>::type, end<Sequence>::type) range in reverse order except those that satisfy the predicate Pred.
[Note: This wording applies to a no-inserter version(s) of the algorithm. See the Expression semantics subsection for a precise specification of the algorithm's details in all cases — end note]
#include <boost/mpl/remove_if.hpp>
Parameter | Requirement | Description |
---|---|---|
Sequence | Forward Sequence | An original sequence. |
Pred | Unary Lambda Expression | A removal condition. |
In | Inserter | An inserter. |
The semantics of an expression are defined only where they differ from, or are not defined in Reversible Algorithm.
For any Forward Sequence s, and an Inserter in, and an unary Lambda Expression pred:
typedef reverse_remove_if<s,pred,in>::type r;
Return type: | A type. |
---|---|
Semantics: | Equivalent to typedef lambda<pred>::type p; typedef lambda<in::operation>::type op; typedef reverse_fold< s , in::state , eval_if< apply_wrap1<p,_2> , identity<_1> , apply_wrap2<op,_1,_2> > >::type r; |
Linear. Performs exactly size<s>::value applications of pred, and at most size<s>::value insertions.
typedef vector_c<int,1,4,5,2,7,5,3,5>::type numbers; typedef reverse_remove_if< numbers, greater<_,int_<4> > >::type result; BOOST_MPL_ASSERT(( equal< result,vector_c<int,3,2,4,1>,equal_to<_,_> > ));