sl@0: sl@0: #ifndef BOOST_MPL_REPLACE_IF_HPP_INCLUDED sl@0: #define BOOST_MPL_REPLACE_IF_HPP_INCLUDED sl@0: sl@0: // Copyright Aleksey Gurtovoy 2000-2004 sl@0: // Copyright John R. Bandela 2000-2002 sl@0: // Copyright David Abrahams 2003-2004 sl@0: // sl@0: // Distributed under the Boost Software License, Version 1.0. sl@0: // (See accompanying file LICENSE_1_0.txt or copy at sl@0: // http://www.boost.org/LICENSE_1_0.txt) sl@0: // sl@0: // See http://www.boost.org/libs/mpl for documentation. sl@0: sl@0: // $Source: /cvsroot/boost/boost/boost/mpl/replace_if.hpp,v $ sl@0: // $Date: 2004/11/28 01:57:09 $ sl@0: // $Revision: 1.7 $ sl@0: sl@0: #include sl@0: #include sl@0: #include sl@0: #include sl@0: #include sl@0: sl@0: namespace boost { namespace mpl { sl@0: sl@0: namespace aux { sl@0: sl@0: template< typename Predicate, typename T > sl@0: struct replace_if_op sl@0: { sl@0: template< typename U > struct apply sl@0: #if !defined(BOOST_MPL_CFG_NO_NESTED_FORWARDING) sl@0: : if_< sl@0: typename apply1::type sl@0: , T sl@0: , U sl@0: > sl@0: { sl@0: #else sl@0: { sl@0: typedef typename if_< sl@0: typename apply1::type sl@0: , T sl@0: , U sl@0: >::type type; sl@0: #endif sl@0: }; sl@0: }; sl@0: sl@0: sl@0: template< sl@0: typename Sequence sl@0: , typename Predicate sl@0: , typename T sl@0: , typename Inserter sl@0: > sl@0: struct replace_if_impl sl@0: : transform1_impl< sl@0: Sequence sl@0: , protect< aux::replace_if_op > sl@0: , Inserter sl@0: > sl@0: { sl@0: }; sl@0: sl@0: template< sl@0: typename Sequence sl@0: , typename Predicate sl@0: , typename T sl@0: , typename Inserter sl@0: > sl@0: struct reverse_replace_if_impl sl@0: : reverse_transform1_impl< sl@0: Sequence sl@0: , protect< aux::replace_if_op > sl@0: , Inserter sl@0: > sl@0: { sl@0: }; sl@0: sl@0: } // namespace aux sl@0: sl@0: BOOST_MPL_AUX_INSERTER_ALGORITHM_DEF(4, replace_if) sl@0: sl@0: }} sl@0: sl@0: #endif // BOOST_MPL_REPLACE_IF_HPP_INCLUDED