📄 back_impl.hpp
字号:
#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: back_impl.hpp 49267 2008-10-11 06:19:02Z agurtovoy $// $Date: 2008-10-11 02:19:02 -0400 (Sat, 11 Oct 2008) $// $Revision: 49267 $#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' templatetemplate< 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
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -