summaryrefslogtreecommitdiff
path: root/c++/iterator.hpp
diff options
context:
space:
mode:
authorClaudius "keldu" Holeksa <mail@keldu.de>2025-10-18 18:01:14 +0200
committerClaudius "keldu" Holeksa <mail@keldu.de>2025-10-18 18:01:14 +0200
commit24bf28a8fb9cc8c3a90b77de9b60728bece7885d (patch)
treedfcbfcb8775bf96847d4a187695158b968902889 /c++/iterator.hpp
parenta980da34513a9ad41e309e66432fcb80ddaf2e31 (diff)
downloadlibs-lbm-24bf28a8fb9cc8c3a90b77de9b60728bece7885d.tar.gz
Moving project structure for more less compilation
Diffstat (limited to 'c++/iterator.hpp')
-rw-r--r--c++/iterator.hpp32
1 files changed, 0 insertions, 32 deletions
diff --git a/c++/iterator.hpp b/c++/iterator.hpp
deleted file mode 100644
index 78babff..0000000
--- a/c++/iterator.hpp
+++ /dev/null
@@ -1,32 +0,0 @@
-#pragma once
-
-#include "descriptor.hpp"
-
-namespace kel {
-namespace lbm {
-template<typename Func>
-void iterate_over(Func&& func, const saw::data<sch::FixedArray<sch::UInt64,2u>>& start, const saw::data<sch::FixedArray<sch::UInt64,2u>>& end, const saw::data<sch::FixedArray<sch::UInt64,2u>>& dist = {{{0u,0u}}}){
- // static_assert(D == 2u, "Currently a lazy implementation for AND combinations of intervalls.");
- for(saw::data<sch::UInt64> i{start.at({0u}) + dist.at({0u})}; (i+dist.at({0u})) < end.at({0u}); ++i){
- for(saw::data<sch::UInt64> j{start.at({1u}) + dist.at({1u})}; (j+dist.at({1u})) < end.at({1u}); ++j){
- func({{i,j}});
- }
- }
- return;
-}
-/* Ambiguous
-template<typename Func>
-void iterate_over(Func&& func, const saw::data<sch::FixedArray<sch::UInt64,3u>>& start, const saw::data<sch::FixedArray<sch::UInt64,3u>>& end, const saw::data<sch::FixedArray<sch::UInt64,3u>>& dist = {{{0u,0u,0u}}}){
- // static_assert(D == 2u, "Currently a lazy implementation for AND combinations of intervalls.");
- for(saw::data<sch::UInt64> i{start.at({0u}) + dist.at({0u})}; (i+dist.at({0u})) < end.at({0u}); ++i){
- for(saw::data<sch::UInt64> j{start.at({1u}) + dist.at({1u})}; (j+dist.at({1u})) < end.at({1u}); ++j){
- for(saw::data<sch::UInt64> k{start.at({2u}) + dist.at({2u})}; (j+dist.at({2u})) < end.at({2u}); ++j){
- func({{k,j,i}});
- }
- }
- }
- return;
-}
-*/
-}
-}