| 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283 | 
#ifndef BOOST_MPL_REMOVE_IF_HPP_INCLUDED#define BOOST_MPL_REMOVE_IF_HPP_INCLUDED// Copyright Aleksey Gurtovoy 2000-2004// Copyright David Abrahams 2003-2004//// Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt)//// See http://www.boost.org/libs/mpl for documentation.// $Id$// $Date$// $Revision$#include <boost/mpl/fold.hpp>#include <boost/mpl/reverse_fold.hpp>#include <boost/mpl/eval_if.hpp>#include <boost/mpl/identity.hpp>#include <boost/mpl/protect.hpp>#include <boost/mpl/lambda.hpp>#include <boost/mpl/apply.hpp>#include <boost/mpl/aux_/inserter_algorithm.hpp>namespace boost { namespace mpl {namespace aux {template< typename Pred, typename InsertOp > struct remove_if_helper{    template< typename Sequence, typename U > struct apply    {        typedef typename eval_if<              typename apply1<Pred,U>::type            , identity<Sequence>            , apply2<InsertOp,Sequence,U>            >::type type;    };};template<      typename Sequence    , typename Predicate    , typename Inserter    >struct remove_if_impl    : fold<          Sequence        , typename Inserter::state        , protect< aux::remove_if_helper<              typename lambda<Predicate>::type            , typename Inserter::operation            > >        >{};template<      typename Sequence    , typename Predicate    , typename Inserter    >struct reverse_remove_if_impl    : reverse_fold<          Sequence        , typename Inserter::state        , protect< aux::remove_if_helper<              typename lambda<Predicate>::type            , typename Inserter::operation            > >        >{};} // namespace auxBOOST_MPL_AUX_INSERTER_ALGORITHM_DEF(3, remove_if)}}#endif // BOOST_MPL_REMOVE_IF_HPP_INCLUDED
 |