12345678910111213141516171819202122232425262728293031323334353637383940414243 |
- #ifndef BOOST_MPL_AUX_BACK_IMPL_HPP_INCLUDED
- #define BOOST_MPL_AUX_BACK_IMPL_HPP_INCLUDED
- // Copyright Aleksey Gurtovoy 2000-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/begin_end.hpp>
- #include <boost/mpl/next_prior.hpp>
- #include <boost/mpl/deref.hpp>
- #include <boost/mpl/aux_/traits_lambda_spec.hpp>
- namespace boost { namespace mpl {
- // default implementation, requires at least bi-directional iterators;
- // conrete sequences might override it by specializing either the
- // 'back_impl' or the primary 'back' template
- template< typename Tag >
- struct back_impl
- {
- template< typename Sequence > struct apply
- {
- typedef typename end<Sequence>::type end_;
- typedef typename prior<end_>::type last_;
- typedef typename deref<last_>::type type;
- };
- };
- BOOST_MPL_ALGORITM_TRAITS_LAMBDA_SPEC(1, back_impl)
- }}
- #endif // BOOST_MPL_AUX_BACK_IMPL_HPP_INCLUDED
|