mirror of
https://github.com/danog/ton.git
synced 2024-12-02 09:28:02 +01:00
223 lines
8.3 KiB
C
223 lines
8.3 KiB
C
|
/*
|
||
|
This file is part of TON Blockchain Library.
|
||
|
|
||
|
TON Blockchain Library is free software: you can redistribute it and/or modify
|
||
|
it under the terms of the GNU Lesser General Public License as published by
|
||
|
the Free Software Foundation, either version 2 of the License, or
|
||
|
(at your option) any later version.
|
||
|
|
||
|
TON Blockchain Library is distributed in the hope that it will be useful,
|
||
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||
|
GNU Lesser General Public License for more details.
|
||
|
|
||
|
You should have received a copy of the GNU Lesser General Public License
|
||
|
along with TON Blockchain Library. If not, see <http://www.gnu.org/licenses/>.
|
||
|
|
||
|
Copyright 2017-2019 Telegram Systems LLP
|
||
|
*/
|
||
|
#pragma once
|
||
|
|
||
|
#include "td/utils/common.h"
|
||
|
|
||
|
#include <functional>
|
||
|
#include <tuple>
|
||
|
#include <type_traits>
|
||
|
#include <utility>
|
||
|
|
||
|
namespace td {
|
||
|
|
||
|
namespace detail {
|
||
|
|
||
|
template <std::size_t... S>
|
||
|
struct IntSeq {};
|
||
|
|
||
|
template <std::size_t L, std::size_t N, std::size_t... S>
|
||
|
struct IntSeqGen : IntSeqGen<L, N - 1, L + N - 1, S...> {};
|
||
|
|
||
|
template <std::size_t L, std::size_t... S>
|
||
|
struct IntSeqGen<L, 0, S...> {
|
||
|
using type = IntSeq<S...>;
|
||
|
};
|
||
|
|
||
|
template <bool... Args>
|
||
|
class LogicAndImpl {};
|
||
|
|
||
|
template <bool Res, bool X, bool... Args>
|
||
|
class LogicAndImpl<Res, X, Args...> {
|
||
|
public:
|
||
|
static constexpr bool value = LogicAndImpl<(Res && X), Args...>::value;
|
||
|
};
|
||
|
|
||
|
template <bool Res>
|
||
|
class LogicAndImpl<Res> {
|
||
|
public:
|
||
|
static constexpr bool value = Res;
|
||
|
};
|
||
|
|
||
|
template <std::size_t N>
|
||
|
using IntRange = typename IntSeqGen<0, N>::type;
|
||
|
|
||
|
template <class T>
|
||
|
struct is_reference_wrapper : std::false_type {};
|
||
|
|
||
|
template <class U>
|
||
|
struct is_reference_wrapper<std::reference_wrapper<U>> : std::true_type {};
|
||
|
|
||
|
template <class Base, class T, class Derived, class... Args>
|
||
|
auto invoke_impl(T Base::*pmf, Derived &&ref,
|
||
|
Args &&... args) noexcept(noexcept((std::forward<Derived>(ref).*pmf)(std::forward<Args>(args)...)))
|
||
|
-> std::enable_if_t<std::is_function<T>::value && std::is_base_of<Base, std::decay<Derived>>::value,
|
||
|
decltype((std::forward<Derived>(ref).*pmf)(std::forward<Args>(args)...))> {
|
||
|
return (std::forward<Derived>(ref).*pmf)(std::forward<Args>(args)...);
|
||
|
}
|
||
|
|
||
|
template <class Base, class T, class RefWrap, class... Args>
|
||
|
auto invoke_impl(T Base::*pmf, RefWrap &&ref,
|
||
|
Args &&... args) noexcept(noexcept((ref.get().*pmf)(std::forward<Args>(args)...)))
|
||
|
-> std::enable_if_t<std::is_function<T>::value && is_reference_wrapper<std::decay_t<RefWrap>>::value,
|
||
|
decltype((ref.get().*pmf)(std::forward<Args>(args)...))>
|
||
|
|
||
|
{
|
||
|
return (ref.get().*pmf)(std::forward<Args>(args)...);
|
||
|
}
|
||
|
|
||
|
template <class Base, class T, class Pointer, class... Args>
|
||
|
auto invoke_impl(T Base::*pmf, Pointer &&ptr,
|
||
|
Args &&... args) noexcept(noexcept(((*std::forward<Pointer>(ptr)).*pmf)(std::forward<Args>(args)...)))
|
||
|
-> std::enable_if_t<std::is_function<T>::value && !is_reference_wrapper<std::decay_t<Pointer>>::value &&
|
||
|
!std::is_base_of<Base, std::decay_t<Pointer>>::value,
|
||
|
decltype(((*std::forward<Pointer>(ptr)).*pmf)(std::forward<Args>(args)...))> {
|
||
|
return ((*std::forward<Pointer>(ptr)).*pmf)(std::forward<Args>(args)...);
|
||
|
}
|
||
|
|
||
|
template <class Base, class T, class Derived>
|
||
|
auto invoke_impl(T Base::*pmd, Derived &&ref) noexcept(noexcept(std::forward<Derived>(ref).*pmd))
|
||
|
-> std::enable_if_t<!std::is_function<T>::value && std::is_base_of<Base, std::decay_t<Derived>>::value,
|
||
|
decltype(std::forward<Derived>(ref).*pmd)> {
|
||
|
return std::forward<Derived>(ref).*pmd;
|
||
|
}
|
||
|
|
||
|
template <class Base, class T, class RefWrap>
|
||
|
auto invoke_impl(T Base::*pmd, RefWrap &&ref) noexcept(noexcept(ref.get().*pmd))
|
||
|
-> std::enable_if_t<!std::is_function<T>::value && is_reference_wrapper<std::decay_t<RefWrap>>::value,
|
||
|
decltype(ref.get().*pmd)> {
|
||
|
return ref.get().*pmd;
|
||
|
}
|
||
|
|
||
|
template <class Base, class T, class Pointer>
|
||
|
auto invoke_impl(T Base::*pmd, Pointer &&ptr) noexcept(noexcept((*std::forward<Pointer>(ptr)).*pmd))
|
||
|
-> std::enable_if_t<!std::is_function<T>::value && !is_reference_wrapper<std::decay_t<Pointer>>::value &&
|
||
|
!std::is_base_of<Base, std::decay_t<Pointer>>::value,
|
||
|
decltype((*std::forward<Pointer>(ptr)).*pmd)> {
|
||
|
return (*std::forward<Pointer>(ptr)).*pmd;
|
||
|
}
|
||
|
|
||
|
template <class F, class... Args>
|
||
|
auto invoke_impl(F &&f, Args &&... args) noexcept(noexcept(std::forward<F>(f)(std::forward<Args>(args)...)))
|
||
|
-> std::enable_if_t<!std::is_member_pointer<std::decay_t<F>>::value,
|
||
|
decltype(std::forward<F>(f)(std::forward<Args>(args)...))> {
|
||
|
return std::forward<F>(f)(std::forward<Args>(args)...);
|
||
|
}
|
||
|
|
||
|
template <class F, class... ArgTypes>
|
||
|
auto invoke(F &&f,
|
||
|
ArgTypes &&... args) noexcept(noexcept(invoke_impl(std::forward<F>(f), std::forward<ArgTypes>(args)...)))
|
||
|
-> decltype(invoke_impl(std::forward<F>(f), std::forward<ArgTypes>(args)...)) {
|
||
|
return invoke_impl(std::forward<F>(f), std::forward<ArgTypes>(args)...);
|
||
|
}
|
||
|
|
||
|
template <class F, class... Args, std::size_t... S>
|
||
|
auto call_tuple_impl(F &func, std::tuple<Args...> &&tuple, IntSeq<S...>) {
|
||
|
return func(std::forward<Args>(std::get<S>(tuple))...);
|
||
|
}
|
||
|
|
||
|
template <class... Args, std::size_t... S>
|
||
|
auto invoke_tuple_impl(std::tuple<Args...> &&tuple, IntSeq<S...>) {
|
||
|
return invoke(std::forward<Args>(std::get<S>(tuple))...);
|
||
|
}
|
||
|
|
||
|
template <class ActorT, class F, class... Args, std::size_t... S>
|
||
|
auto mem_call_tuple_impl(ActorT *actor, std::tuple<F, Args...> &&tuple, IntSeq<0, S...>) {
|
||
|
return (actor->*std::get<0>(tuple))(std::forward<Args>(std::get<S>(tuple))...);
|
||
|
}
|
||
|
|
||
|
template <class F, class... Args, std::size_t... S>
|
||
|
void tuple_for_each_impl(std::tuple<Args...> &tuple, const F &func, IntSeq<S...>) {
|
||
|
const auto &dummy = {0, (func(std::get<S>(tuple)), 0)...};
|
||
|
(void)dummy;
|
||
|
}
|
||
|
|
||
|
template <class F, class... Args, std::size_t... S>
|
||
|
void tuple_for_each_impl(const std::tuple<Args...> &tuple, const F &func, IntSeq<S...>) {
|
||
|
const auto &dummy = {0, (func(std::get<S>(tuple)), 0)...};
|
||
|
(void)dummy;
|
||
|
}
|
||
|
|
||
|
} // namespace detail
|
||
|
|
||
|
template <bool... Args>
|
||
|
class LogicAnd {
|
||
|
public:
|
||
|
static constexpr bool value = detail::LogicAndImpl<true, Args...>::value;
|
||
|
};
|
||
|
|
||
|
template <class F, class... Args>
|
||
|
auto call_tuple(F &func, std::tuple<Args...> &&tuple) {
|
||
|
return detail::call_tuple_impl(func, std::move(tuple), detail::IntRange<sizeof...(Args)>());
|
||
|
}
|
||
|
|
||
|
template <class... Args>
|
||
|
auto invoke_tuple(std::tuple<Args...> &&tuple) {
|
||
|
return detail::invoke_tuple_impl(std::move(tuple), detail::IntRange<sizeof...(Args)>());
|
||
|
}
|
||
|
|
||
|
template <class ActorT, class... Args>
|
||
|
auto mem_call_tuple(ActorT *actor, std::tuple<Args...> &&tuple) {
|
||
|
return detail::mem_call_tuple_impl(actor, std::move(tuple), detail::IntRange<sizeof...(Args)>());
|
||
|
}
|
||
|
|
||
|
template <class F, class... Args>
|
||
|
void tuple_for_each(std::tuple<Args...> &tuple, const F &func) {
|
||
|
detail::tuple_for_each_impl(tuple, func, detail::IntRange<sizeof...(Args)>());
|
||
|
}
|
||
|
|
||
|
template <class F, class... Args>
|
||
|
void tuple_for_each(const std::tuple<Args...> &tuple, const F &func) {
|
||
|
detail::tuple_for_each_impl(tuple, func, detail::IntRange<sizeof...(Args)>());
|
||
|
}
|
||
|
|
||
|
template <size_t N, class Arg, class... Args, std::enable_if_t<N == 0, int> = 0>
|
||
|
auto &&get_nth_argument(Arg &&arg, Args &&... args) {
|
||
|
return std::forward<Arg>(arg);
|
||
|
}
|
||
|
|
||
|
template <size_t N, class Arg, class... Args, std::enable_if_t<N != 0, int> = 0>
|
||
|
auto &&get_nth_argument(Arg &&arg, Args &&... args) {
|
||
|
return get_nth_argument<N - 1>(std::forward<Args &&>(args)...);
|
||
|
}
|
||
|
|
||
|
template <class... Args>
|
||
|
auto &&get_last_argument(Args &&... args) {
|
||
|
return get_nth_argument<sizeof...(Args) - 1>(std::forward<Args &&>(args)...);
|
||
|
}
|
||
|
|
||
|
namespace detail {
|
||
|
template <class F, class... Args, std::size_t... S>
|
||
|
auto call_n_arguments_impl(IntSeq<S...>, F &&f, Args &&... args) {
|
||
|
return f(get_nth_argument<S>(std::forward<Args>(args)...)...);
|
||
|
}
|
||
|
} // namespace detail
|
||
|
|
||
|
template <size_t N, class F, class... Args>
|
||
|
auto call_n_arguments(F &&f, Args &&... args) {
|
||
|
return detail::call_n_arguments_impl(detail::IntRange<N>(), f, std::forward<Args>(args)...);
|
||
|
}
|
||
|
|
||
|
template <class F, class X, class = void>
|
||
|
struct is_callable : public std::false_type {};
|
||
|
template <class F, class X>
|
||
|
struct is_callable<F, X, decltype(std::declval<F>()(std::declval<X>()))> : public std::true_type {};
|
||
|
|
||
|
} // namespace td
|