avr/util
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Implement reference_wrapper and invoke to allow invoke_result_t implementation

Browse Source
This commit is contained in:
BlackMark
2020-05-16 16:55:12 +02:00
parent 2f2f203be4
commit d045bbffc3
2 changed files with 137 additions and 26 deletions
Download Patch File Download Diff File Expand all files Collapse all files

68
util.hpp
View File

@@ -6,6 +6,26 @@
namespace util {
// <memory>
// clang-format off
template <typename T>
type::enable_if_t<type::is_object_v<T>, T *> addressof(T &arg) noexcept
{
return reinterpret_cast<T *>(&const_cast<char &>(reinterpret_cast<const volatile char &>(arg)));
}
template <typename T>
type::enable_if_t<!type::is_object_v<T>, T *> addressof(T &arg) noexcept
{
return &arg;
}
// <utility>
template <typename T> type::add_rvalue_reference_t<T> declval() noexcept;
template <typename T>
inline constexpr type::remove_reference_t<T> &&move(T &&t) noexcept
{
@@ -36,33 +56,26 @@ struct integer_sequence {
}
};
template <size_t... Ints>
using index_sequence = integer_sequence<size_t, Ints...>;
template <size_t... Ints> using index_sequence = integer_sequence<size_t, Ints...>;
namespace detail {
template <typename T, typename Seq1, typename Seq2>
struct concat;
template <typename T, typename Seq1, typename Seq2> struct concat;
template <typename T, T... Ints1, T... Ints2>
struct concat<T, integer_sequence<T, Ints1...>, integer_sequence<T, Ints2...>>
: integer_sequence<T, Ints1..., (sizeof...(Ints1) + Ints2)...> {
};
: integer_sequence<T, Ints1..., (sizeof...(Ints1) + Ints2)...>
{};
// uint64_t because this must be able to hold all possible sizes and cannot be T, because then the specialization for 0
// and 1 are not possible
template <typename T, uint64_t N>
struct gen_integer_sequence : detail::concat<T, typename gen_integer_sequence<T, N / 2>::__type,
typename gen_integer_sequence<T, N - N / 2>::__type> {
};
typename gen_integer_sequence<T, N - N / 2>::__type>
{};
template <typename T>
struct gen_integer_sequence<T, 0> : integer_sequence<T> {
};
template <typename T>
struct gen_integer_sequence<T, 1> : integer_sequence<T, 0> {
};
template <typename T> struct gen_integer_sequence<T, 0> : integer_sequence<T> {};
template <typename T> struct gen_integer_sequence<T, 1> : integer_sequence<T, 0> {};
} // namespace detail
@@ -71,21 +84,16 @@ struct make_integer_sequence : detail::gen_integer_sequence<T, N> {
static_assert(N >= 0, "Integer sequence cannot be negative");
};
template <size_t N>
using make_index_sequence = make_integer_sequence<size_t, N>;
template <size_t N> using make_index_sequence = make_integer_sequence<size_t, N>;
template <typename... T>
using index_sequence_for = make_index_sequence<sizeof...(T)>;
template <typename... T> using index_sequence_for = make_index_sequence<sizeof...(T)>;
// Not part of <utility>, but very useful
namespace detail {
template <typename T, T Offset, T... Ints>
inline constexpr integer_sequence<T, (Offset + Ints)...> add_offset(integer_sequence<T, Ints...>)
{
return {};
}
inline constexpr integer_sequence<T, (Offset + Ints)...> add_offset(integer_sequence<T, Ints...>) { return {}; }
} // namespace detail
@@ -101,10 +109,18 @@ inline constexpr auto make_offset_index_sequence()
return make_offset_integer_sequence<size_t, Offset, N>();
}
template <class Fn, size_t... Ints>
void for_constexpr(Fn &&func, index_sequence<Ints...>)
template <typename Fn, size_t... Ints>
auto for_constexpr(Fn &&func, index_sequence<Ints...>)
{
(func(type::integral_constant<size_t, Ints>{}), ...);
if constexpr (type::is_void_v<type::invoke_result_t<Fn, type::integral_constant<size_t, 0>>>) {
(func(type::integral_constant<size_t, Ints>{}), ...);
} else {
if ((func(type::integral_constant<size_t, Ints>{}) && ...))
return true;
return false;
}
}
// clang-format on
} // namespace util