AK: Add a TypeList class for expanded compile-time tools

Also add IndexSequence and associated helpers. The TypeList class can be
queried for what type is at a certain index, and there are two helper
functions: for_each_type, and for_each_type_zipped.

for_each_type will invoke a lambda with a TypeWrapper object for
each type in the type list. The original type can be obtained by
extracting the ::Type from the type of your generic lambda's one
argument.

for_each_type_zipped will walk two TypeLists in lockstep and pass a
TypeWrapper object for the current index in each list to a generic
lambda. The original type from the TypeList can again be extracted via
the ::Type of the generic lambda's two parameters.
This commit is contained in:
Andrew Kaster 2020-12-29 22:40:21 -07:00 committed by Andreas Kling
parent fe4b44b489
commit 3bf77f01a7
Notes: sideshowbarker 2024-07-19 00:24:21 +09:00
2 changed files with 121 additions and 0 deletions

View File

@ -517,6 +517,30 @@ using IsArithmetic = IntegralConstant<bool, IsIntegral<T>::value || IsFloatingPo
template<typename T>
using IsFundamental = IntegralConstant<bool, IsArithmetic<T>::value || IsVoid<T>::value || IsNullPointer<T>::value>;
template<typename T, T... Ts>
struct IntegerSequence {
using Type = T;
static constexpr unsigned size() noexcept { return sizeof...(Ts); };
};
template<unsigned... Indices>
using IndexSequence = IntegerSequence<unsigned, Indices...>;
template<typename T, T N, T... Ts>
auto make_integer_sequence_impl()
{
if constexpr (N == 0)
return IntegerSequence<T, Ts...> {};
else
return make_integer_sequence_impl<T, N - 1, N - 1, Ts...>();
}
template<typename T, T N>
using MakeIntegerSequence = decltype(make_integer_sequence_impl<T, N>());
template<unsigned N>
using MakeIndexSequence = MakeIntegerSequence<unsigned, N>;
}
using AK::AddConst;
@ -528,6 +552,8 @@ using AK::declval;
using AK::DependentFalse;
using AK::exchange;
using AK::forward;
using AK::IndexSequence;
using AK::IntegerSequence;
using AK::is_trivial;
using AK::is_trivially_copyable;
using AK::IsArithmetic;
@ -539,6 +565,8 @@ using AK::IsNullPointer;
using AK::IsSame;
using AK::IsUnion;
using AK::IsVoid;
using AK::MakeIndexSequence;
using AK::MakeIntegerSequence;
using AK::MakeSigned;
using AK::MakeUnsigned;
using AK::max;

93
AK/TypeList.h Normal file
View File

@ -0,0 +1,93 @@
/*
* Copyright (c) 2020, the SerenityOS developers.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#pragma once
#include <AK/StdLibExtras.h>
namespace AK {
template<typename... Types>
struct TypeList;
template<unsigned Index, typename List>
struct TypeListElement;
template<unsigned Index, typename Head, typename... Tail>
struct TypeListElement<Index, TypeList<Head, Tail...>>
: TypeListElement<Index - 1, TypeList<Tail...>> {
};
template<typename Head, typename... Tail>
struct TypeListElement<0, TypeList<Head, Tail...>> {
using Type = Head;
};
template<typename... Types>
struct TypeList {
static constexpr unsigned size = sizeof...(Types);
template<unsigned N>
using Type = typename TypeListElement<N, TypeList<Types...>>::Type;
};
template<typename T>
struct TypeWrapper {
using Type = T;
};
template<typename List, typename F, unsigned... Indexes>
constexpr void for_each_type_impl(F&& f, IndexSequence<Indexes...>)
{
(forward<F>(f)(TypeWrapper<typename List::Type<Indexes>> {}), ...);
}
template<typename List, typename F>
constexpr void for_each_type(F&& f)
{
for_each_type_impl<List>(forward<F>(f), MakeIndexSequence<List::size> {});
}
template<typename ListA, typename ListB, typename F, unsigned... Indexes>
constexpr void for_each_type_zipped_impl(F&& f, IndexSequence<Indexes...>)
{
(forward<F>(f)(TypeWrapper<typename ListA::Type<Indexes>> {}, TypeWrapper<typename ListB::Type<Indexes>> {}), ...);
}
template<typename ListA, typename ListB, typename F>
constexpr void for_each_type_zipped(F&& f)
{
static_assert(ListA::size == ListB::size, "Can't zip TypeLists that aren't the same size!");
for_each_type_zipped_impl<ListA, ListB>(forward<F>(f), MakeIndexSequence<ListA::size> {});
}
}
using AK::for_each_type;
using AK::for_each_type_zipped;
using AK::TypeList;
using AK::TypeListElement;
using AK::TypeWrapper;