sha512sum/cserver
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Use Map instead directly using

Browse source
This commit is contained in:
sha512sum 2024-03-26 09:11:05 +00:00
parent 3045e1a8e4
commit 904cb20387
1 changed files with 13 additions and 9 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

22
include/cserver/engine/components.hpp
View file

@ -274,15 +274,19 @@ RangeView(std::ranges::range auto&& range) -> RangeView<std::remove_reference_t<
template <utempl::ConstexprString... Names, utempl::Tuple... Dependencies>
consteval auto TopologicalSort(const DependencyGraph<DependencyGraphElement<Names, Dependencies>...>&) {
const utempl::Tuple storage = {[&]<auto DDependencies>(utempl::Wrapper<DDependencies>) {
return [&]<std::size_t... Is>(std::index_sequence<Is...>) -> std::array<std::size_t, utempl::kTupleSize<decltype(DDependencies)>> {
return {utempl::Find(utempl::Tuple{Names...}, Get<Is>(DDependencies))...};
}(std::make_index_sequence<utempl::kTupleSize<decltype(DDependencies)>>{});
}(utempl::Wrapper<Dependencies>{})...};
constexpr utempl::Tuple names = {Names...};
constexpr utempl::Tuple storage = Map(utempl::Tuple{Dependencies...},
[&]<utempl::TupleLike Tuple>(Tuple&& tuple){
static constexpr auto Size = utempl::kTupleSize<Tuple>;
return [&]<std::size_t... Is>(std::index_sequence<Is...>) -> std::array<std::size_t, Size> {
return {Find(names, Get<Is>(std::forward<Tuple>(tuple)))...};
}(std::make_index_sequence<Size>());
});
constexpr auto Size = utempl::kTupleSize<decltype(storage)>;
const std::array adj = [&]<std::size_t... Is>(std::index_sequence<Is...>){
return std::array{impl::RangeView{Get<Is>(storage)}...};
}(std::make_index_sequence<Size>{});
const std::array adj = utempl::Map(storage,
[](std::ranges::range auto& arg){
return impl::RangeView{arg};
}, utempl::kType<std::array<std::size_t, 0>>);
std::array<bool, Size> visited{};
constexpr auto ResultSize = sizeof...(Dependencies);
impl::CompileTimeStack<std::size_t, ResultSize> response{};
@ -300,7 +304,7 @@ consteval auto TopologicalSort(const DependencyGraph<DependencyGraphElement<Name
response.Push(v);
}(i);
};
return utempl::Transform(std::move(response.data), [](auto&& data){
return utempl::Map(std::move(response.data), [](auto&& data){
return *data;
});
};