Home
last modified time | relevance | path

Searched refs:reverse_fold (Results 1 – 25 of 60) sorted by relevance

123

/third_party/boost/libs/hof/test/
Dreverse_fold.cpp31 …static_assert(noexcept(boost::hof::reverse_fold(max_f(), 0)(2, 3, 4, 5)), "noexcept reverse_fold"); in BOOST_HOF_TEST_CASE()
32 …static_assert(noexcept(boost::hof::reverse_fold(sum_f(), 0)(2, 3, 4, 5)), "noexcept reverse_fold"); in BOOST_HOF_TEST_CASE()
33 …static_assert(!noexcept(boost::hof::reverse_fold(sum_f(), std::string())("hello", "-", "world")), … in BOOST_HOF_TEST_CASE()
39 BOOST_HOF_TEST_CHECK(boost::hof::reverse_fold(max_f(), 0)(2, 3, 4, 5) == 5); in BOOST_HOF_TEST_CASE()
40 BOOST_HOF_TEST_CHECK(boost::hof::reverse_fold(max_f(), 0)(5, 4, 3, 2) == 5); in BOOST_HOF_TEST_CASE()
41 BOOST_HOF_TEST_CHECK(boost::hof::reverse_fold(max_f(), 0)(2, 3, 5, 4) == 5); in BOOST_HOF_TEST_CASE()
43 BOOST_HOF_STATIC_TEST_CHECK(boost::hof::reverse_fold(max_f(), 0)(2, 3, 4, 5) == 5); in BOOST_HOF_TEST_CASE()
44 BOOST_HOF_STATIC_TEST_CHECK(boost::hof::reverse_fold(max_f(), 0)(5, 4, 3, 2) == 5); in BOOST_HOF_TEST_CASE()
45 BOOST_HOF_STATIC_TEST_CHECK(boost::hof::reverse_fold(max_f(), 0)(2, 3, 5, 4) == 5); in BOOST_HOF_TEST_CASE()
50 BOOST_HOF_TEST_CHECK(boost::hof::reverse_fold(max_f(), 0)() == 0); in BOOST_HOF_TEST_CASE()
[all …]
/third_party/boost/boost/fusion/algorithm/iteration/
Dreverse_fold_fwd.hpp16 struct reverse_fold;
21 inline typename result_of::reverse_fold<
26 reverse_fold(Seq& seq, State const& state, F f);
30 inline typename result_of::reverse_fold<
35 reverse_fold(Seq const& seq, State const& state, F f);
39 inline typename result_of::reverse_fold<
44 reverse_fold(Seq& seq, State& state, F f);
48 inline typename result_of::reverse_fold<
53 reverse_fold(Seq const& seq, State& state, F f);
/third_party/boost/boost/fusion/algorithm/iteration/detail/preprocessed/
Dreverse_fold.hpp123 reverse_fold(Seq& seq, State& state, F& f) in reverse_fold() function
140 struct reverse_fold struct
146 inline typename result_of::reverse_fold<
151 reverse_fold(Seq& seq, State const& state, F f) in reverse_fold() function
153 return detail::reverse_fold<Seq, State const, F>(seq, state, f); in reverse_fold()
157 inline typename result_of::reverse_fold<
162 reverse_fold(Seq const& seq, State const& state, F f) in reverse_fold() function
164 return detail::reverse_fold<Seq const, State const, F>(seq, state, f); in reverse_fold()
168 inline typename result_of::reverse_fold<
173 reverse_fold(Seq& seq, State& state, F f) in reverse_fold() function
[all …]
/third_party/boost/libs/hof/doc/html/_sources/include/boost/hof/
Dreverse_fold.hpp.txt3 reverse_fold.h
11 /// reverse_fold
17 /// The `reverse_fold` function adaptor uses a binary function to apply a
31 /// constexpr reverse_fold_adaptor<F, State> reverse_fold(F f, State s);
34 /// constexpr reverse_fold_adaptor<F> reverse_fold(F f);
39 /// assert(reverse_fold(f, z)() == z);
40 /// assert(reverse_fold(f, z)(x, xs...) == f(reverse_fold(f, z)(xs...), x));
41 /// assert(reverse_fold(f)(x) == x);
42 /// assert(reverse_fold(f)(x, xs...) == f(reverse_fold(f)(xs...), x));
72 /// assert(boost::hof::reverse_fold(max_f())(2, 3, 4, 5) == 5);
[all …]
/third_party/boost/libs/mpl/doc/src/refmanual/
Dreverse_fold.rst1 .. Algorithms/Iteration Algorithms//reverse_fold
3 reverse_fold title
17 struct reverse_fold
39 #include <boost/mpl/reverse_fold.hpp>
73 typedef reverse_fold< s,state,backward_op >::type t;
96 typedef reverse_fold< s,state,backward_op,forward_op >::type t;
107 typedef reverse_fold<
129 typedef reverse_fold<
Dreverse_transform.rst103 typedef reverse_fold<
125 typedef reverse_fold<
/third_party/boost/boost/proto/transform/
Dfold.hpp148 struct reverse_fold : transform<reverse_fold<Sequence, State0, Fun> > struct
173 typename fusion::result_of::reverse_fold<
197 return fusion::reverse_fold( in operator ()()
226 struct reverse_fold<_, State0, Fun> : transform<reverse_fold<_, State0, Fun> > struct
244 struct is_callable<reverse_fold<Sequence, State, Fun> >
Dfold_tree.hpp52 : if_<has_tag<Tag>, reverse_fold<_, _state, reverse_fold_tree_<Tag, Fun> >, Fun>
149 : reverse_fold<
158 : reverse_fold<
/third_party/boost/boost/mpl/
Dreverse_fold.hpp32 struct reverse_fold struct
43 BOOST_MPL_AUX_LAMBDA_SUPPORT(3,reverse_fold,(Sequence,State,BackwardOp))
46 BOOST_MPL_AUX_NA_SPEC(3, reverse_fold)
Dtransform.hpp57 : reverse_fold<
97 : reverse_fold<
Dcopy.hpp44 : reverse_fold<
Dstable_partition.hpp57 : reverse_fold<
Dremove_if.hpp66 : reverse_fold<
Dcopy_if.hpp79 : reverse_fold<
/third_party/boost/boost/msm/mpl_graph/detail/
Dadjacency_list_graph.ipp35 mpl::reverse_fold<AdjacencyList,
49 mpl::reverse_fold<Adjacencies,
59 mpl::reverse_fold<AdjacencyList,
75 mpl::reverse_fold<Adjacencies,
83 mpl::reverse_fold<AdjacencyList,
100 mpl::reverse_fold<Adjacencies,
107 mpl::reverse_fold<GraphData,
/third_party/boost/libs/hana/example/
Dreverse_fold.cpp27 hana::reverse_fold(hana::make_tuple(1, '2', 3.0, 4), "5", f) in main()
34 hana::reverse_fold(hana::make_tuple(1, '2', 3.0, 4, "5"), f) in main()
/third_party/boost/boost/hana/fwd/
Dreverse_fold.hpp68 constexpr auto reverse_fold = [](auto&& xs[, auto&& state], auto&& f) -> decltype(auto) {
80 constexpr reverse_fold_t reverse_fold{};
/third_party/boost/libs/hana/include/boost/hana/fwd/
Dreverse_fold.hpp68 constexpr auto reverse_fold = [](auto&& xs[, auto&& state], auto&& f) -> decltype(auto) {
80 constexpr reverse_fold_t reverse_fold{};
/third_party/boost/boost/mpl/aux_/
Dinsert_impl.hpp50 typedef typename reverse_fold<
56 typedef typename reverse_fold<
Derase_impl.hpp53 typedef typename reverse_fold<
59 typedef typename reverse_fold<
Dinsert_range_impl.hpp47 : reverse_fold<
61 typedef typename reverse_fold<
Dreverse_fold_impl.hpp40 # define AUX778076_FOLD_IMPL_NAME_PREFIX reverse_fold
/third_party/boost/libs/mpl/example/
Dtuple_from_list.cpp23 : reverse_fold<
/third_party/boost/libs/mpl/test/
Dfold.cpp48 typedef reverse_fold< in MPL_TEST_CASE()
/third_party/boost/boost/geometry/util/
Dcompress_variant.hpp45 typename boost::mpl::reverse_fold<

123