104 lines
3.3 KiB
C++
104 lines
3.3 KiB
C++
|
/*!
|
||
|
|
@file
|
||
|
|
Defines `boost::hana::reverse_partial`.
|
||
|
|
|
||
|
|
@copyright Louis Dionne 2013-2016
|
||
|
|
Distributed under the Boost Software License, Version 1.0.
|
||
|
|
(See accompanying file LICENSE.md or copy at http://boost.org/LICENSE_1_0.txt)
|
||
|
|
*/
|
||
|
|
|
||
|
|
#ifndef BOOST_HANA_FUNCTIONAL_REVERSE_PARTIAL_HPP
|
||
|
|
#define BOOST_HANA_FUNCTIONAL_REVERSE_PARTIAL_HPP
|
||
|
|
|
||
|
|
#include <boost/hana/basic_tuple.hpp>
|
||
|
|
#include <boost/hana/config.hpp>
|
||
|
|
#include <boost/hana/detail/decay.hpp>
|
||
|
|
|
||
|
|
#include <cstddef>
|
||
|
|
#include <utility>
|
||
|
|
|
||
|
|
|
||
|
|
BOOST_HANA_NAMESPACE_BEGIN
|
||
|
|
//! @ingroup group-functional
|
||
|
|
//! Partially apply a function to some arguments.
|
||
|
|
//!
|
||
|
|
//! Given a function `f` and some arguments, `reverse_partial` returns a
|
||
|
|
//! new function corresponding to `f` whose last arguments are partially
|
||
|
|
//! applied. Specifically, `reverse_partial(f, x...)` is a function such
|
||
|
|
//! that
|
||
|
|
//! @code
|
||
|
|
//! reverse_partial(f, x...)(y...) == f(y..., x...)
|
||
|
|
//! @endcode
|
||
|
|
//!
|
||
|
|
//! @note
|
||
|
|
//! The arity of `f` must match the total number of arguments passed to
|
||
|
|
//! it, i.e. `sizeof...(x) + sizeof...(y)`.
|
||
|
|
//!
|
||
|
|
//!
|
||
|
|
//! Example
|
||
|
|
//! -------
|
||
|
|
//! @include example/functional/reverse_partial.cpp
|
||
|
|
#ifdef BOOST_HANA_DOXYGEN_INVOKED
|
||
|
|
constexpr auto reverse_partial = [](auto&& f, auto&& ...x) {
|
||
|
|
return [perfect-capture](auto&& ...y) -> decltype(auto) {
|
||
|
|
return forwarded(f)(forwarded(y)..., forwarded(x)...);
|
||
|
|
};
|
||
|
|
};
|
||
|
|
#else
|
||
|
|
template <typename Indices, typename F, typename ...X>
|
||
|
|
struct reverse_partial_t;
|
||
|
|
|
||
|
|
struct make_reverse_partial_t {
|
||
|
|
struct secret { };
|
||
|
|
template <typename F, typename ...X>
|
||
|
|
constexpr reverse_partial_t<
|
||
|
|
std::make_index_sequence<sizeof...(X)>,
|
||
|
|
typename detail::decay<F>::type,
|
||
|
|
typename detail::decay<X>::type...
|
||
|
|
> operator()(F&& f, X&& ...x) const {
|
||
|
|
return {secret{}, static_cast<F&&>(f), static_cast<X&&>(x)...};
|
||
|
|
}
|
||
|
|
};
|
||
|
|
|
||
|
|
template <std::size_t ...n, typename F, typename ...X>
|
||
|
|
struct reverse_partial_t<std::index_sequence<n...>, F, X...> {
|
||
|
|
reverse_partial_t() = default;
|
||
|
|
|
||
|
|
template <typename ...T>
|
||
|
|
constexpr reverse_partial_t(make_reverse_partial_t::secret, T&& ...t)
|
||
|
|
: storage_{static_cast<T&&>(t)...}
|
||
|
|
{ }
|
||
|
|
|
||
|
|
basic_tuple<F, X...> storage_;
|
||
|
|
|
||
|
|
template <typename ...Y>
|
||
|
|
constexpr decltype(auto) operator()(Y&& ...y) const& {
|
||
|
|
return hana::get_impl<0>(storage_)(
|
||
|
|
static_cast<Y&&>(y)...,
|
||
|
|
hana::get_impl<n+1>(storage_)...
|
||
|
|
);
|
||
|
|
}
|
||
|
|
|
||
|
|
template <typename ...Y>
|
||
|
|
constexpr decltype(auto) operator()(Y&& ...y) & {
|
||
|
|
return hana::get_impl<0>(storage_)(
|
||
|
|
static_cast<Y&&>(y)...,
|
||
|
|
hana::get_impl<n+1>(storage_)...
|
||
|
|
);
|
||
|
|
}
|
||
|
|
|
||
|
|
template <typename ...Y>
|
||
|
|
constexpr decltype(auto) operator()(Y&& ...y) && {
|
||
|
|
return static_cast<F&&>(hana::get_impl<0>(storage_))(
|
||
|
|
static_cast<Y&&>(y)...,
|
||
|
|
static_cast<X&&>(hana::get_impl<n+1>(storage_))...
|
||
|
|
);
|
||
|
|
}
|
||
|
|
};
|
||
|
|
|
||
|
|
constexpr make_reverse_partial_t reverse_partial{};
|
||
|
|
#endif
|
||
|
|
BOOST_HANA_NAMESPACE_END
|
||
|
|
|
||
|
|
#endif // !BOOST_HANA_FUNCTIONAL_REVERSE_PARTIAL_HPP
|