Tiles

res/cmake/test.cmake

@@ -29,6 +29,7 @@ if (test AND ${PHARE_EXEC_LEVEL_MIN} GREATER 0) # 0 = no tests
   add_subdirectory(tests/core/numerics/faraday)
   add_subdirectory(tests/core/numerics/ohm)
   add_subdirectory(tests/core/numerics/ion_updater)
+  add_subdirectory(tests/core/data/tiles)
 
 
   add_subdirectory(tests/initializer)

src/core/data/particles/particle_tile.hpp

@@ -0,0 +1,50 @@
+#ifndef PHARE_PARTICLE_TILE_HPP
+#define PHARE_PARTICLE_TILE_HPP
+
+#include "core/utilities/box/box.hpp"
+#include "core/data/tiles/tile_set.hpp"
+
+namespace PHARE::core
+{
+
+template<typename ParticleArray>
+struct ParticleTile : public Box<int, ParticleArray::dimension>
+{
+    // *this: box constructed first
+    ParticleArray domainParticles_{*this};
+    ParticleArray patchGhostParticles_{*this};
+    ParticleArray levelGhostParticles_{*this};
+    ParticleArray levelGhostParticlesNew_{*this};
+    ParticleArray levelGhostParticlesOld_{*this};
+};
+
+
+template<typename ParticleArray>
+class ParticleTileSet : public TileSet<ParticleTile<ParticleArray>>
+{
+public:
+    static auto constexpr dimension = ParticleArray::dimension;
+
+    auto select_particles(Box<int, dimension> const& from) const
+    {
+        ParticleArray selected;
+
+        auto overlaped_tiles = export_overlaped_with(from);
+        for (auto const& [complete, tile] : overlaped_tiles)
+        {
+            if (complete)
+            {
+                selected.push_back(tile.domainParticles_);
+            }
+            else
+            {
+                auto intersection = tile * from;
+                tile.domainParticles.export_to(*intersection, selected);
+            }
+        }
+        return selected;
+    }
+};
+} // namespace PHARE::core
+
+#endif

src/core/data/tiles/tile_set.hpp

@@ -0,0 +1,236 @@
+#ifndef PHARE_TILE_SET_HPP
+#define PHARE_TILE_SET_HPP
+
+#include "core/utilities/box/box.hpp"
+#include "core/utilities/types.hpp"
+#include "core/def.hpp"
+#include "core/data/ndarray/ndarray_vector.hpp"
+#include "core/utilities/span.hpp"
+
+#include <array>
+#include <utility>
+#include <string>
+
+namespace PHARE::core
+{
+
+
+
+template<typename Tile>
+class TileSetView
+{
+public:
+    static auto constexpr dimension = Tile::dimension;
+
+    TileSetView(Box<int, dimension> const& box, std::array<std::size_t, dimension> const& tile_size,
+                std::array<std::uint32_t, dimension> const& shape, Tile* tiles,
+                std::uint32_t tile_nbr, Tile** cells,
+                std::array<std::uint32_t, dimension> const& nbr_cells)
+        : box_{box}
+        , tile_size_{tile_size}
+        , shape_{shape}
+        , tiles_{tiles, tile_nbr}
+        , cells_{cells, nbr_cells}
+    {
+    }
+    NO_DISCARD auto export_overlaped_with(Box<int, dimension> const& box) const
+    {
+        std::vector<std::pair<bool, Tile>> overlaped;
+        for (auto const& tile : tiles_)
+        {
+            auto overlap = box * Box<int, dimension>{tile.lower, tile.upper};
+            if (overlap)
+            {
+                auto complete_overlap = (*overlap).size() == tile.size();
+                overlaped.emplace_back(complete_overlap, tile);
+            }
+        }
+        return overlaped;
+    }
+    NO_DISCARD auto shape() const { return shape_; }
+    NO_DISCARD auto size() const { return tiles_.size(); }
+
+    NO_DISCARD auto begin() { return tiles_.begin(); }
+    NO_DISCARD auto begin() const { return tiles_.begin(); }
+
+    NO_DISCARD auto end() { return tiles_.end(); }
+    NO_DISCARD auto end() const { return tiles_.end(); }
+
+    NO_DISCARD auto& operator[](std::size_t i) { return tiles_[i]; }
+    NO_DISCARD auto const& operator[](std::size_t i) const { return tiles_[i]; }
+
+    template<typename... Index>
+    NO_DISCARD auto& at(Index... indexes)
+    {
+        return cells_(indexes...);
+    }
+
+private:
+    Box<int, dimension> const box_;
+    std::array<std::size_t, dimension> tile_size_;
+    std::array<std::uint32_t, dimension> shape_;
+    Span<Tile> tiles_;
+    NdArrayView<dimension, Tile*> cells_;
+};
+
+
+
+template<typename Tile>
+class TileSet
+{
+public:
+    static auto constexpr dimension = Tile::dimension;
+
+    TileSet(Box<int, dimension> const& box, std::array<std::size_t, dimension> const& tile_size)
+        : box_{box}
+        , tile_size_{tile_size}
+        , shape_{[&]() {
+            std::array<std::uint32_t, dimension> s;
+            auto bs = box.shape();
+            for (auto i = 0u; i < dimension; ++i)
+            {
+                auto const div = (bs[i] + tile_size_[i] - 1) / tile_size_[i];
+                s[i]           = div;
+            }
+            return s;
+        }()}
+        , tiles_(product(shape_))
+        , cells_{box.shape().template toArray<std::uint32_t>()}
+    {
+        consistent_tile_size_();
+        make_tiles_();
+        tag_cells_();
+    }
+
+
+    NO_DISCARD auto export_overlaped_with(Box<int, dimension> const& box) const
+    {
+        std::vector<std::pair<bool, Tile>> overlaped;
+        for (auto const& tile : tiles_)
+        {
+            auto overlap = box * Box<int, dimension>{tile.lower, tile.upper};
+            if (overlap)
+            {
+                auto complete_overlap = (*overlap).size() == tile.size();
+                overlaped.emplace_back(complete_overlap, tile);
+            }
+        }
+        return overlaped;
+    }
+
+    NO_DISCARD auto shape() const { return shape_; }
+    NO_DISCARD auto size() const { return tiles_.size(); }
+
+    NO_DISCARD auto begin() { return tiles_.begin(); }
+    NO_DISCARD auto begin() const { return tiles_.begin(); }
+
+    NO_DISCARD auto end() { return tiles_.end(); }
+    NO_DISCARD auto end() const { return tiles_.end(); }
+
+    NO_DISCARD auto& operator[](std::size_t i) { return tiles_[i]; }
+    NO_DISCARD auto const& operator[](std::size_t i) const { return tiles_[i]; }
+
+    template<typename... Index>
+    NO_DISCARD auto& at(Index... indexes)
+    {
+        return cells_(indexes...);
+    }
+
+
+    auto make_view()
+    {
+        return TileSetView<Tile>{box_,          tile_size_,    shape_,        tiles_.data(),
+                                 tiles_.size(), cells_.data(), cells_.shape()};
+    }
+
+private:
+    void consistent_tile_size_() const
+    {
+        for (auto idim = 0u; idim < dimension; ++idim)
+        {
+            if (box_.shape()[idim] < tile_size_[idim])
+            {
+                throw std::runtime_error("tile size larger than box size in dimension "
+                                         + std::to_string(idim));
+            }
+        }
+    }
+
+    void make_tiles_()
+    {
+        auto const size_me = [&](auto dim, auto idx) {
+            if (idx == shape_[dim] - 1)
+            {
+                auto const remain = box_.shape()[dim] % tile_size_[dim];
+                return (remain == 0) ? tile_size_[dim] : remain;
+            }
+            else
+                return tile_size_[dim];
+        };
+
+        for (auto ix = 0u; ix < shape_[0]; ++ix)
+        {
+            if constexpr (dimension == 1)
+            {
+                // -1 because upper is included
+                tiles_[ix].lower[0] = box_.lower[0] + ix * tile_size_[0];
+                tiles_[ix].upper[0] = tiles_[ix].lower[0] + size_me(0, ix) - 1;
+            }
+            else
+            {
+                for (auto iy = 0u; iy < shape_[1]; ++iy)
+                {
+                    if constexpr (dimension == 2)
+                    {
+                        auto const i       = ix * shape_[1] + iy;
+                        tiles_[i].lower[0] = box_.lower[0] + ix * tile_size_[0];
+                        tiles_[i].upper[0] = tiles_[i].lower[0] + size_me(0, ix) - 1;
+                        tiles_[i].lower[1] = box_.lower[1] + iy * tile_size_[1];
+                        tiles_[i].upper[1] = tiles_[i].lower[1] + size_me(1, iy) - 1;
+                    }
+                    else
+                    {
+                        for (auto iz = 0u; iz < shape_[2]; ++iz)
+                        {
+                            auto const i       = ix * shape_[1] * shape_[2] + shape_[2] * iy + iz;
+                            tiles_[i].lower[0] = box_.lower[0] + ix * tile_size_[0];
+                            tiles_[i].upper[0] = tiles_[i].lower[0] + size_me(0, ix) - 1;
+                            tiles_[i].lower[1] = box_.lower[1] + iy * tile_size_[1];
+                            tiles_[i].upper[1] = tiles_[i].lower[1] + size_me(1, iy) - 1;
+                            tiles_[i].lower[2] = box_.lower[2] + iz * tile_size_[2];
+                            tiles_[i].upper[2] = tiles_[i].lower[2] + size_me(2, iz) - 1;
+                        }
+                    }
+                }
+            }
+        }
+    }
+
+
+    //! store the pointer to the tile associated with each cell
+    void tag_cells_()
+    {
+        for (auto& tile : tiles_)
+        {
+            for (auto const& cell : tile)
+            {
+                cells_(cell) = &tile;
+            }
+        }
+    }
+
+
+    Box<int, dimension> box_;
+    std::array<std::size_t, dimension> tile_size_;
+    std::array<std::uint32_t, dimension> shape_;
+    std::vector<Tile> tiles_;
+    NdArrayVector<dimension, Tile*> cells_;
+};
+
+
+
+
+} // namespace PHARE::core
+
+
+#endif

src/core/utilities/span.hpp

@@ -19,8 +19,8 @@ struct Span
     NO_DISCARD auto& operator[](SIZE i) { return ptr[i]; }
     NO_DISCARD auto& operator[](SIZE i) const { return ptr[i]; }
     NO_DISCARD T const* const& data() const { return ptr; }
-    NO_DISCARD T const* const& begin() const { return ptr; }
-    NO_DISCARD T* end() const { return ptr + s; }
+    NO_DISCARD auto begin() const { return ptr; }
+    NO_DISCARD auto end() const { return ptr + s; }
     NO_DISCARD SIZE const& size() const { return s; }
 
     T const* ptr = nullptr;

tests/core/data/particles/CMakeLists.txt

@@ -20,3 +20,4 @@ endfunction(_particles_test)
 
 _particles_test(test_main.cpp test-particles)
 _particles_test(test_interop.cpp test-particles-interop)
+_particles_test(test_particle_tiles.cpp test-particle-tiles)

tests/core/data/particles/test_particle_tiles.cpp

@@ -0,0 +1,40 @@
+#include "gmock/gmock.h"
+#include "gtest/gtest.h"
+
+#include "core/data/particles/particle_array.hpp"
+#include "core/data/particles/particle_tile.hpp"
+#include "core/data/tiles/tile_set.hpp"
+
+using namespace PHARE::core;
+
+template<std::size_t dimension>
+using ParticleTile_t = ParticleTile<ParticleArray<dimension>>;
+
+template<std::size_t dimension>
+using TileSet_t = TileSet<ParticleTile_t<dimension>>;
+
+using DimParticleTiles = testing::Types<ParticleTile_t<1>, ParticleTile_t<2>, ParticleTile_t<3>>;
+
+template<typename ParticleTile>
+class ParticleTileTest : public ::testing::Test
+{
+protected:
+    ParticleTileTest() {}
+};
+
+TYPED_TEST_SUITE(ParticleTileTest, DimParticleTiles);
+
+TYPED_TEST(ParticleTileTest, constructs)
+{
+    constexpr auto dim = TypeParam::dimension;
+    Box<int, dim> box{ConstArray<int, dim>(0), ConstArray<int, dim>(50)};
+    auto const tile_size = PHARE::core::ConstArray<std::size_t, dim>(4);
+    TileSet<TypeParam> particleTileSet{box, tile_size};
+}
+
+int main(int argc, char** argv)
+{
+    ::testing::InitGoogleTest(&argc, argv);
+
+    return RUN_ALL_TESTS();
+}

tests/core/data/tiles/CMakeLists.txt

@@ -0,0 +1,19 @@
+cmake_minimum_required (VERSION 3.20.1)
+
+project(test-tile)
+
+set(SOURCES test_tile.cpp)
+
+add_executable(${PROJECT_NAME} ${SOURCES})
+
+target_include_directories(${PROJECT_NAME} PRIVATE
+  ${GTEST_INCLUDE_DIRS}
+  )
+
+target_link_libraries(${PROJECT_NAME} PRIVATE
+  phare_core
+  ${GTEST_LIBS})
+
+add_no_mpi_phare_test(${PROJECT_NAME} ${CMAKE_CURRENT_BINARY_DIR})
+
+