swap.hpp

来自「Boost provides free peer-reviewed portab」· HPP 代码 · 共 60 行

HPP
60
字号
/*=============================================================================    Copyright (c) 2001-2006 Joel de Guzman    Copyright (c) 2006 Dan Marsden    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)==============================================================================*/#if !defined(BOOST_FUSION_SWAP_20070501_1956)#define BOOST_FUSION_SWAP_20070501_1956#include <algorithm>#include <boost/fusion/support/is_sequence.hpp>#include <boost/fusion/view/zip_view.hpp>#include <boost/fusion/algorithm/iteration/for_each.hpp>#include <boost/utility/enable_if.hpp>#include <boost/fusion/sequence/intrinsic/front.hpp>#include <boost/fusion/sequence/intrinsic/back.hpp>#include <boost/mpl/and.hpp>namespace boost { namespace fusion {    namespace result_of    {        template<typename Seq1, typename Seq2>        struct swap        {            typedef void type;        };    }    namespace detail    {        struct swap        {            template<typename Elem>            struct result            {                typedef void type;            };            template<typename Elem>            void operator()(Elem const& e) const            {                using std::swap;                swap(front(e), back(e));            }        };    }    template<typename Seq1, typename Seq2>    typename enable_if<mpl::and_<traits::is_sequence<Seq1>, traits::is_sequence<Seq2> >, void>::type     swap(Seq1& lhs, Seq2& rhs)    {        typedef vector<Seq1&, Seq2&> references;        for_each(zip_view<references>(references(lhs, rhs)), detail::swap());    }}}#endif

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?