1 files changed, 94 insertions, 0 deletions
diff --git a/3rdParty/Boost/src/boost/proto/detail/and_n.hpp b/3rdParty/Boost/src/boost/proto/detail/and_n.hpp
new file mode 100644
index 0000000..a046f49
--- /dev/null
+++ b/3rdParty/Boost/src/boost/proto/detail/and_n.hpp
@@ -0,0 +1,94 @@
+#if !defined(BOOST_PROTO_DONT_USE_PREPROCESSED_FILES)
+
+    #include <boost/proto/detail/preprocessed/and_n.hpp>
+
+#elif !defined(BOOST_PP_IS_ITERATING)
+
+    #if defined(__WAVE__) && defined(BOOST_PROTO_CREATE_PREPROCESSED_FILES)
+        #pragma wave option(preserve: 2, line: 0, output: "preprocessed/and_n.hpp")
+    #endif
+
+    ///////////////////////////////////////////////////////////////////////////////
+    /// \file and_n.hpp
+    /// Definitions of and_N, and_impl
+    //
+    //  Copyright 2008 Eric Niebler. 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(__WAVE__) && defined(BOOST_PROTO_CREATE_PREPROCESSED_FILES)
+        #pragma wave option(preserve: 1)
+    #endif
+
+    #define BOOST_PP_ITERATION_PARAMS_1                                                             \
+        (3, (2, BOOST_PP_MAX(BOOST_PROTO_MAX_ARITY, BOOST_PROTO_MAX_LOGICAL_ARITY), <boost/proto/detail/and_n.hpp>))
+    #include BOOST_PP_ITERATE()
+
+    #if defined(__WAVE__) && defined(BOOST_PROTO_CREATE_PREPROCESSED_FILES)
+        #pragma wave option(output: null)
+    #endif
+
+#else // BOOST_PP_IS_ITERATING
+
+    #define N BOOST_PP_ITERATION()
+
+    // Assymetry here between the handling of and_N and or_N because
+    // and_N is used by lambda_matches up to BOOST_PROTO_MAX_ARITY,
+    // regardless of how low BOOST_PROTO_MAX_LOGICAL_ARITY is.
+    template<bool B, BOOST_PP_ENUM_PARAMS(BOOST_PP_DEC(N), typename P)>
+    struct BOOST_PP_CAT(and_, N)
+    #if 2 == N
+      : mpl::bool_<P0::value>
+    {};
+    #else
+      : BOOST_PP_CAT(and_, BOOST_PP_DEC(N))<
+            P0::value BOOST_PP_COMMA_IF(BOOST_PP_SUB(N,2))
+            BOOST_PP_ENUM_SHIFTED_PARAMS(BOOST_PP_DEC(N), P)
+        >
+    {};
+    #endif
+
+    template<BOOST_PP_ENUM_PARAMS(BOOST_PP_DEC(N), typename P)>
+    struct BOOST_PP_CAT(and_, N)<false, BOOST_PP_ENUM_PARAMS(BOOST_PP_DEC(N), P)>
+      : mpl::false_
+    {};
+
+    #if N <= BOOST_PROTO_MAX_LOGICAL_ARITY
+
+        template<BOOST_PP_ENUM_PARAMS(N, typename G), typename Expr, typename State, typename Data>
+        struct _and_impl<proto::and_<BOOST_PP_ENUM_PARAMS(N, G)>, Expr, State, Data>
+          : proto::transform_impl<Expr, State, Data>
+        {
+            #define M0(Z, N, DATA)                                                            \
+            typedef                                                                           \
+                typename proto::when<proto::_, BOOST_PP_CAT(G, N)>                            \
+                    ::template impl<Expr, State, Data>                                        \
+            BOOST_PP_CAT(Gimpl, N);                                                           \
+            /**/
+            BOOST_PP_REPEAT(N, M0, ~)
+            #undef M0
+
+            typedef typename BOOST_PP_CAT(Gimpl, BOOST_PP_DEC(N))::result_type result_type;
+
+            result_type operator()(
+                typename _and_impl::expr_param e
+              , typename _and_impl::state_param s
+              , typename _and_impl::data_param d
+            ) const
+            {
+                // Fix: jfalcou - 12/29/2010
+                // Avoid the use of comma operator here so as not to find Proto's
+                // by accident.
+                // expands to G0()(e,s,d); G1()(e,s,d); ... G{N-1}()(e,s,d);
+                #define M0(Z,N,DATA) BOOST_PP_CAT(Gimpl,N)()(e,s,d);
+                BOOST_PP_REPEAT(BOOST_PP_DEC(N),M0,~)
+                return BOOST_PP_CAT(Gimpl,BOOST_PP_DEC(N))()(e,s,d);
+                #undef M0
+            }
+        };
+
+    #endif
+
+    #undef N
+
+#endif