Add mp_partition_q

doc/mp11/algorithm.adoc

@@ -452,6 +452,12 @@ As `mp_remove_if`, but takes a quoted metafunction.
 `mp_partition<L<T...>, P>` partitions `L` into two lists `L<U1...>` and `L<U2...>` such that `mp_to_bool<P<T>>` is `mp_true`
 for the elements of `L<U1...>` and `mp_false` for the elements of `L<U2...>`. Returns `L<L<U1...>, L<U2...>>`.
 
+## mp_partition_q<L, Q>
+
+    template<class L, class Q> using mp_partition_q = mp_partition<L, Q::template fn>;
+
+As `mp_partition`, but takes a quoted metafunction.
+
 ## mp_sort<L, P>
 
     template<class L, template<class...> class P> using mp_sort = /*...*/;

include/boost/mp11/algorithm.hpp

@@ -471,6 +471,7 @@ template<template<class...> class L, class... T, template<class...> class P> str
 } // namespace detail
 
 template<class L, template<class...> class P> using mp_partition = typename detail::mp_partition_impl<L, P>::type;
+template<class L, class Q> using mp_partition_q = mp_partition<L, Q::template fn>;
 
 // mp_sort<L, P>
 namespace detail

test/Jamfile

@@ -62,6 +62,7 @@ run mp_remove.cpp ;
 run mp_remove_if.cpp ;
 run mp_remove_if_q.cpp ;
 run mp_partition.cpp ;
+run mp_partition_q.cpp ;
 run mp_sort.cpp ;
 run mp_find.cpp ;
 run mp_find_if.cpp ;

test/mp_partition_q.cpp

@@ -0,0 +1,52 @@
+
+// Copyright 2015, 2017 Peter Dimov.
+//
+// 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
+
+
+#include <boost/mp11/algorithm.hpp>
+#include <boost/mp11/list.hpp>
+#include <boost/mp11/utility.hpp>
+#include <boost/core/lightweight_test_trait.hpp>
+#include <type_traits>
+#include <tuple>
+
+struct X1 {};
+struct X2 {};
+struct X3 {};
+
+int main()
+{
+    using boost::mp11::mp_list;
+    using boost::mp11::mp_partition_q;
+    using boost::mp11::mp_quote;
+
+    {
+        using L1 = mp_list<>;
+
+        BOOST_TEST_TRAIT_TRUE((std::is_same<mp_partition_q<L1, mp_quote<std::is_const>>, mp_list<L1, L1>>));
+
+        using L2 = mp_list<X1, X1 const, X1*, X2 const, X2*, X3*>;
+
+        BOOST_TEST_TRAIT_TRUE((std::is_same<mp_partition_q<L2, mp_quote<std::is_volatile>>, mp_list<L1, L2>>));
+        BOOST_TEST_TRAIT_TRUE((std::is_same<mp_partition_q<L2, mp_quote<std::is_const>>, mp_list<mp_list<X1 const, X2 const>, mp_list<X1, X1*, X2*, X3*>>>));
+        BOOST_TEST_TRAIT_TRUE((std::is_same<mp_partition_q<L2, mp_quote<std::is_pointer>>, mp_list<mp_list<X1*, X2*, X3*>, mp_list<X1, X1 const, X2 const>>>));
+    }
+
+    {
+        using L1 = std::tuple<>;
+
+        BOOST_TEST_TRAIT_TRUE((std::is_same<mp_partition_q<L1, mp_quote<std::is_const>>, std::tuple<L1, L1>>));
+
+        using L2 = std::tuple<X1, X1 const, X1*, X2 const, X2*, X3*>;
+
+        BOOST_TEST_TRAIT_TRUE((std::is_same<mp_partition_q<L2, mp_quote<std::is_volatile>>, std::tuple<L1, L2>>));
+        BOOST_TEST_TRAIT_TRUE((std::is_same<mp_partition_q<L2, mp_quote<std::is_const>>, std::tuple<std::tuple<X1 const, X2 const>, std::tuple<X1, X1*, X2*, X3*>>>));
+        BOOST_TEST_TRAIT_TRUE((std::is_same<mp_partition_q<L2, mp_quote<std::is_pointer>>, std::tuple<std::tuple<X1*, X2*, X3*>, std::tuple<X1, X1 const, X2 const>>>));
+    }
+
+    return boost::report_errors();
+}