sl@0: sl@0: #ifndef BOOST_MPL_UNIQUE_HPP_INCLUDED sl@0: #define BOOST_MPL_UNIQUE_HPP_INCLUDED sl@0: sl@0: // Copyright Aleksey Gurtovoy 2000-2004 sl@0: // Copyright John R. Bandela 2000-2002 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/unique.hpp,v $ sl@0: // $Date: 2004/09/02 15:40:42 $ sl@0: // $Revision: 1.7 $ sl@0: sl@0: #include sl@0: #include sl@0: #include sl@0: #include sl@0: #include sl@0: #include 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 Operation > sl@0: struct unique_op sl@0: { sl@0: template< typename Pair, typename T > struct apply sl@0: { sl@0: typedef typename Pair::first seq_; sl@0: typedef typename Pair::second prior_; sl@0: typedef typename eval_if< sl@0: and_< is_not_na, apply2 > sl@0: , identity sl@0: , apply2 sl@0: >::type new_seq_; sl@0: sl@0: typedef pair type; sl@0: }; sl@0: }; sl@0: sl@0: template< sl@0: typename Sequence sl@0: , typename Predicate sl@0: , typename Inserter sl@0: > sl@0: struct unique_impl sl@0: : first< typename fold< sl@0: Sequence sl@0: , pair< typename Inserter::state,na > sl@0: , protect< aux::unique_op > sl@0: >::type > sl@0: { sl@0: }; sl@0: sl@0: template< sl@0: typename Sequence sl@0: , typename Predicate sl@0: , typename Inserter sl@0: > sl@0: struct reverse_unique_impl sl@0: : first< typename reverse_fold< sl@0: Sequence sl@0: , pair< typename Inserter::state,na > sl@0: , protect< aux::unique_op > sl@0: >::type > sl@0: { sl@0: }; sl@0: sl@0: } // namespace aux sl@0: sl@0: BOOST_MPL_AUX_INSERTER_ALGORITHM_DEF(3, unique) sl@0: sl@0: }} sl@0: sl@0: #endif // BOOST_MPL_UNIQUE_HPP_INCLUDED