#pragma once #include "descriptor.hpp" namespace kel { namespace lbm { template void iterate_over(Func&& func, const saw::data>& start, const saw::data>& end, const saw::data>& dist = {{{0u,0u}}}){ // static_assert(D == 2u, "Currently a lazy implementation for AND combinations of intervalls."); for(saw::data i{start.at({0u}) + dist.at({0u})}; (i+dist.at({0u})) < end.at({0u}); ++i){ for(saw::data j{start.at({1u}) + dist.at({1u})}; (j+dist.at({1u})) < end.at({1u}); ++j){ func({{i,j}}); } } return; } /** * */ template struct iterator { private: template static void iterate_over_i(Func& func, const saw::data>& start, const saw::data>& end, const saw::data>& dist, saw::data>& iter ){ static_assert(i <= D, "Eh. Too tired to think of a good message"); if constexpr ( i == D ){ func(iter); }else{ for(iter.at({i}) = start.at({i})+dist.at({i}); (iter.at({i})+dist.at({i}) < end.at({i})); ++iter.at({i})){ iterate_over_i(func,start,end,dist,iter); } } } public: template static void apply( Func&& func, const saw::data>& start, const saw::data>& end, const saw::data>& dist = {} ){ saw::data> iter; iterate_over_i<0u,Func>(func, start, end, dist, iter); } }; /* Ambiguous template void iterate_over(Func&& func, const saw::data>& start, const saw::data>& end, const saw::data>& dist = {{{0u,0u,0u}}}){ // static_assert(D == 2u, "Currently a lazy implementation for AND combinations of intervalls."); for(saw::data i{start.at({0u}) + dist.at({0u})}; (i+dist.at({0u})) < end.at({0u}); ++i){ for(saw::data j{start.at({1u}) + dist.at({1u})}; (j+dist.at({1u})) < end.at({1u}); ++j){ for(saw::data k{start.at({2u}) + dist.at({2u})}; (j+dist.at({2u})) < end.at({2u}); ++j){ func({{k,j,i}}); } } } return; } */ } }