Searched refs:mp_fill (Results 1 – 10 of 10) sorted by relevance
| /third_party/boost/libs/mp11/test/ |
| D | mp_fill.cpp | 22 using boost::mp11::mp_fill; in main()
25 BOOST_TEST_TRAIT_TRUE((std::is_same<mp_fill<L1, X1>, mp_list<X1, X1, X1>>)); in main()
30 BOOST_TEST_TRAIT_TRUE((std::is_same<mp_fill<L2, X1>, std::tuple<X1, X1, X1>>)); in main()
35 BOOST_TEST_TRAIT_TRUE((std::is_same<mp_fill<L3, X1>, std::pair<X1, X1>>)); in main()
|
| D | mp_transform_if.cpp | 38 using boost::mp11::mp_fill; in main()
55 …BOOST_TEST_TRAIT_TRUE((std::is_same<mp_transform_if<is_not_ref, second, L1, mp_fill<L1, void>>, mp… in main()
56 …BOOST_TEST_TRAIT_TRUE((std::is_same<mp_transform_if<is_not_ref, second, L2, mp_fill<L2, void>>, st… in main()
57 …BOOST_TEST_TRAIT_TRUE((std::is_same<mp_transform_if<is_not_ref, second, L3, mp_fill<L3, void>>, st… in main()
|
| D | mp_transform_if_q.cpp | 51 using boost::mp11::mp_fill; in main()
68 …BOOST_TEST_TRAIT_TRUE((std::is_same<mp_transform_if_q<Q_is_not_ref, Q_second, L1, mp_fill<L1, void… in main()
69 …BOOST_TEST_TRAIT_TRUE((std::is_same<mp_transform_if_q<Q_is_not_ref, Q_second, L2, mp_fill<L2, void… in main()
70 …BOOST_TEST_TRAIT_TRUE((std::is_same<mp_transform_if_q<Q_is_not_ref, Q_second, L3, mp_fill<L3, void… in main()
|
| D | mp_reverse.cpp | 76 using boost::mp11::mp_fill; in main()
90 BOOST_TEST_TRAIT_TRUE((std::is_same<R3, mp_fill<L, mp_size_t<N-1>>>)); in main()
|
| D | Jamfile | 60 run mp_fill.cpp ;
|
| /third_party/boost/libs/mp11/doc/mp11/ |
| D | algorithm.adoc | 175 ## mp_fill<L, V>
177 template<class L, class V> using mp_fill = /*...*/;
179 `mp_fill<L<T...>, V>` returns `L<V, V, ..., V>`, with the result having the same size as the input.
181 .Using mp_fill with std::tuple
184 using R1 = mp_fill<L1, double>; // std::tuple<double, double, double>
187 .Using mp_fill with std::pair
190 using R1 = mp_fill<L1, void>; // std::pair<void, void>
193 .mp_fill
198 |*mp_fill<L1, V>*|V|V|...|V
|
| D | examples.adoc | 212 using list3 = mp_transform<mp_fill, list1, list2>;
354 using list3 = mp_transform<mp_fill, list1, list2>;
|
| D | utility.adoc | 272 mp_apply<mp_all, mp_transform<mp_invoke_q, LQ, mp_fill<LQ, T>>>;
|
| /third_party/boost/libs/mp11/doc/article/ |
| D | simple_cxx11_metaprogramming.adoc | 706 We'll call this function `mp_fill`, after `std::fill`.
708 Functional programmers will immediately realize that `mp_fill` is
718 using mp_fill = mp_transform<mp_constant<V>::template apply, L>;
731 template<class L, class V> using mp_fill = typename mp_fill_impl<L, V>::type;
741 We can now `mp_fill`, but we still need the `[0, 1, 2, 3]` index sequence. We
814 We can now compute the two lists that we wanted to transform with `mp_fill`:
849 using list3 = mp_transform<mp_fill, list1, list2>;
932 using list3 = mp_transform<mp_fill, list1, list2>;
|
| /third_party/boost/boost/mp11/ |
| D | algorithm.hpp | 221 template<class L, class V> using mp_fill = typename detail::mp_fill_impl<L, V>::type; typedef
|