Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Please consider the following formatting changes to #13257 #290

Open
wants to merge 1 commit into
base: pr13257
Choose a base branch
from
Open

Please consider the following formatting changes to #13257 #290

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
15 changes: 5 additions & 10 deletions Framework/Foundation/include/Framework/Pack.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -117,41 +117,36 @@ consteval auto prune_voids_pack(Result result, pack<>)

// The first one is non void, but one of the others is void
template <typename... Rs, typename T, typename... Ts>
requires(!std::is_void_v<T>)
consteval auto prune_voids_pack(pack<Rs...> result, pack<T, Ts...>)
requires(!std::is_void_v<T>) consteval auto prune_voids_pack(pack<Rs...> result, pack<T, Ts...>)
{
return prune_voids_pack(pack<Rs..., T>{}, pack<Ts...>{});
}

// The first one is void
template <typename... Rs, typename V, typename... Ts>
requires(std::is_void_v<V>)
consteval auto prune_voids_pack(pack<Rs...> result, pack<V, Ts...>)
requires(std::is_void_v<V>) consteval auto prune_voids_pack(pack<Rs...> result, pack<V, Ts...>)
{
return prune_voids_pack(pack<Rs...>{}, pack<Ts...>{});
}

// The first one is non void, but one of the others is void
template <typename... Rs, typename T1, typename T2, typename... Ts>
requires(!std::is_void_v<T1> && !std::is_void_v<T2>)
consteval auto prune_voids_pack(pack<Rs...> result, pack<T1, T2, Ts...>)
requires(!std::is_void_v<T1> && !std::is_void_v<T2>) consteval auto prune_voids_pack(pack<Rs...> result, pack<T1, T2, Ts...>)
{
return prune_voids_pack(pack<Rs..., T1, T2>{}, pack<Ts...>{});
}

// Eats 4 types at the time
template <typename... Rs, typename T1, typename T2, typename T3, typename T4, typename... Ts>
requires(!std::is_void_v<T1> && !std::is_void_v<T2> && !std::is_void_v<T3> && !std::is_void_v<T4>)
consteval auto prune_voids_pack(pack<Rs...> result, pack<T1, T2, T3, T4, Ts...>)
requires(!std::is_void_v<T1> && !std::is_void_v<T2> && !std::is_void_v<T3> && !std::is_void_v<T4>) consteval auto prune_voids_pack(pack<Rs...> result, pack<T1, T2, T3, T4, Ts...>)
{
return prune_voids_pack(pack<Rs..., T1, T2, T3, T4>{}, pack<Ts...>{});
}

// Eats 8 types at the time
template <typename... Rs, typename T1, typename T2, typename T3, typename T4,
typename T5, typename T6, typename T7, typename T8, typename... Ts>
requires(!std::is_void_v<T1> && !std::is_void_v<T2> && !std::is_void_v<T3> && !std::is_void_v<T4> && !std::is_void_v<T5> && !std::is_void_v<T6> && !std::is_void_v<T7> && !std::is_void_v<T8>)
consteval auto prune_voids_pack(pack<Rs...> result, pack<T1, T2, T3, T4, T5, T6, T7, T8, Ts...>)
requires(!std::is_void_v<T1> && !std::is_void_v<T2> && !std::is_void_v<T3> && !std::is_void_v<T4> && !std::is_void_v<T5> && !std::is_void_v<T6> && !std::is_void_v<T7> && !std::is_void_v<T8>) consteval auto prune_voids_pack(pack<Rs...> result, pack<T1, T2, T3, T4, T5, T6, T7, T8, Ts...>)
{
return prune_voids_pack(pack<Rs..., T1, T2, T3, T4, T5, T6, T7, T8>{}, pack<Ts...>{});
}
Expand Down
Loading