| 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131 | // Boost.Range library////  Copyright Neil Groves 2014. Use, modification and//  distribution is subject to 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)//// For more information, see http://www.boost.org/libs/range///#ifndef BOOST_RANGE_DETAIL_COMBINE_CXX03_HPP#define BOOST_RANGE_DETAIL_COMBINE_CXX03_HPP#ifndef BOOST_RANGE_MIN_COMBINE_ARGS#define BOOST_RANGE_MIN_COMBINE_ARGS 2#endif#ifndef BOOST_RANGE_MAX_COMBINE_ARGS#define BOOST_RANGE_MAX_COMBINE_ARGS 5#endif#include <boost/config.hpp>#include <boost/iterator/zip_iterator.hpp>#include <boost/preprocessor/arithmetic/dec.hpp>#include <boost/preprocessor/arithmetic/div.hpp>#include <boost/preprocessor/arithmetic/mul.hpp>#include <boost/preprocessor/control.hpp>#include <boost/preprocessor/control/while.hpp>#include <boost/preprocessor/facilities/empty.hpp>#include <boost/preprocessor/facilities/identity.hpp>#include <boost/preprocessor/iteration/local.hpp>#include <boost/preprocessor/punctuation/comma.hpp>#include <boost/preprocessor/repetition.hpp>#include <boost/preprocessor/tuple/elem.hpp>#include <boost/range/iterator_range_core.hpp>#include <boost/type_traits/remove_reference.hpp>#include <boost/mpl/transform.hpp>#include <boost/utility/result_of.hpp>#include <vector>#include <list>namespace boost{    namespace range_detail    {template<typename F, typename T, int SIZE>struct combined_result_impl;template<typename F, typename T>struct combined_result    : combined_result_impl<F, T, tuples::length<T>::value>{};#define BOOST_RANGE_combined_element(z, n, data) \    typename tuples::element<n, T>::type#define BOOST_RANGE_combined_result(z, n, data) \    template<typename F, typename T> \    struct combined_result_impl <F,T,n> \        : result_of<F(BOOST_PP_ENUM(n, BOOST_RANGE_combined_element, ~))> \    { \    };#define BOOST_PP_LOCAL_MACRO(n) BOOST_RANGE_combined_result(~,n,~)#define BOOST_PP_LOCAL_LIMITS (BOOST_RANGE_MIN_COMBINE_ARGS, \                               BOOST_RANGE_MAX_COMBINE_ARGS)#include BOOST_PP_LOCAL_ITERATE()#define BOOST_RANGE_combined_get(z, n, data) get<n>(tuple)#define BOOST_RANGE_combined_unpack(z, n, data) \    template<typename F, typename T> inline \    typename combined_result<F,T>::type \    unpack_(mpl::int_<n>, F f, const T& tuple) \    { \        return f(BOOST_PP_ENUM(n, BOOST_RANGE_combined_get, ~)); \    }#define BOOST_PP_LOCAL_MACRO(n) BOOST_RANGE_combined_unpack(~,n,~)#define BOOST_PP_LOCAL_LIMITS (BOOST_RANGE_MIN_COMBINE_ARGS, \                               BOOST_RANGE_MAX_COMBINE_ARGS)#include BOOST_PP_LOCAL_ITERATE()} // namespace range_detailnamespace range{#define BOOST_RANGE_combined_seq(z, n, data) boost::data(BOOST_PP_CAT(r,n))#ifdef BOOST_NO_CXX11_RVALUE_REFERENCES#include <boost/range/detail/combine_no_rvalue.hpp>#else // by using rvalue references we avoid requiring 2^n overloads.#include <boost/range/detail/combine_rvalue.hpp>#endif#define BOOST_PP_LOCAL_MACRO(n) BOOST_RANGE_combine(~,n,~)#define BOOST_PP_LOCAL_LIMITS (BOOST_RANGE_MIN_COMBINE_ARGS, \                               BOOST_RANGE_MAX_COMBINE_ARGS)#include BOOST_PP_LOCAL_ITERATE()    } // namespace range    using boost::range::combine;} // namespace boost#endif // include guard#undef BOOST_RANGE_combined_element#undef BOOST_RANGE_combined_result#undef BOOST_RANGE_combined_get#undef BOOST_RANGE_combined_unpack#undef BOOST_RANGE_combined_seq#undef BOOST_RANGE_combined_exp_pred#undef BOOST_RANGE_combined_exp_op#undef BOOST_RANGE_combined_exp#undef BOOST_RANGE_combined_bitset_pred#undef BOOST_RANGE_combined_bitset_op#undef BOOST_RANGE_combined_bitset#undef BOOST_RANGE_combined_range_iterator#undef BOOST_RANGE_combined_args#undef BOOST_RANGE_combine_impl#undef BOOST_RANGE_combine
 |