Loading...
Searching...
No Matches
AluGridCartesianIndexMapper.hpp
// -*- mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*-
// vi: set et ts=4 sw=4 sts=4:
/*
This file is part of the Open Porous Media project (OPM).
OPM is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 2 of the License, or
(at your option) any later version.
OPM is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with OPM. If not, see <http://www.gnu.org/licenses/>.
Consult the COPYING file in the top-level source directory of this
module for the precise wording of the license and the list of
copyright holders.
*/
#ifndef OPM_ALUGRID_CARTESIAN_INDEX_MAPPER_HPP
#define OPM_ALUGRID_CARTESIAN_INDEX_MAPPER_HPP
#include <dune/alugrid/grid.hh>
#include <dune/alugrid/3d/gridview.hh>
#include <opm/grid/common/CartesianIndexMapper.hpp>
#include <dune/grid/common/datahandleif.hh>
#include <dune/grid/utility/persistentcontainer.hh>
#include <array>
#include <cassert>
#include <cstddef>
#include <memory>
#include <stdexcept>
#include <vector>
namespace Dune {
//#if HAVE_MPI
template <>
class CartesianIndexMapper<Dune::ALUGrid<3, 3, Dune::cube, Dune::nonconforming>>
{
public:
#if HAVE_MPI
using Grid = Dune::ALUGrid<3, 3, Dune::cube, Dune::nonconforming, Dune::ALUGridMPIComm>;
#else
using Grid = Dune::ALUGrid<3, 3, Dune::cube, Dune::nonconforming, Dune::ALUGridNoComm>;
#endif //HAVE_MPI
// data handle for communicating global ids during load balance and communication
template <class GridView>
class GlobalIndexDataHandle : public Dune::CommDataHandleIF<GlobalIndexDataHandle<GridView>, int>
{
// global id
class GlobalCellIndex
{
public:
GlobalCellIndex()
: idx_(-1)
{}
GlobalCellIndex& operator=(const int index)
{
idx_ = index;
return *this;
}
int index() const
{ return idx_; }
private:
int idx_;
};
using GlobalIndexContainer = typename Dune::PersistentContainer<Grid, GlobalCellIndex>;
public:
// constructor copying cartesian index to persistent container
GlobalIndexDataHandle(const GridView& gridView,
std::vector<int>& cartesianIndex)
: gridView_(gridView)
, globalIndex_(gridView.grid(), 0)
, cartesianIndex_(cartesianIndex)
{
globalIndex_.resize();
initialize();
}
// constructor copying cartesian index to persistent container
GlobalIndexDataHandle(const GlobalIndexDataHandle& other) = delete ;
// destrcutor writing load balanced cartesian index back to vector
~GlobalIndexDataHandle()
{ finalize(); }
bool contains(int /* dim */, int codim) const
{ return codim == 0; }
bool fixedsize(int /* dim */, int /* codim */) const
{ return true; }
template<class MessageBufferImp, class EntityType>
void gather(MessageBufferImp& buff, const EntityType& element) const
{
int globalIdx = globalIndex_[element].index();
buff.write(globalIdx);
}
template<class MessageBufferImp, class EntityType>
void scatter(MessageBufferImp& buff, const EntityType& element, std::size_t /* n */)
{
int globalIdx = -1;
buff.read(globalIdx);
if (globalIdx >= 0)
{
globalIndex_.resize();
globalIndex_[element] = globalIdx;
}
}
template<class EntityType>
std::size_t size(const EntityType& /* en */) const
{ return 1; }
protected:
// initialize persistent container from given vector
void initialize()
{
auto idx = cartesianIndex_.begin();
auto it = gridView_.template begin<0>();
const auto& endIt = gridView_.template end<0>();
for (; it != endIt; ++it, ++idx)
globalIndex_[*it] = *idx;
}
// update vector from given persistent container
void finalize()
{
std::vector<int> newIndex ;
newIndex.reserve(gridView_.indexSet().size(0));
auto it = gridView_.template begin<0>();
const auto& endIt = gridView_.template end<0>();
for (; it != endIt; ++it)
newIndex.push_back(globalIndex_[*it].index()) ;
cartesianIndex_.swap(newIndex);
}
GridView gridView_;
GlobalIndexContainer globalIndex_;
std::vector<int>& cartesianIndex_;
};
public:
static constexpr int dimension = Grid::dimension ;
CartesianIndexMapper(const Grid& grid,
const std::array<int, dimension>& cartDims,
const std::vector<int>& cartesianIndex)
: grid_(grid)
, cartesianDimensions_(cartDims)
, cartesianIndex_(cartesianIndex)
, cartesianSize_(computeCartesianSize())
{}
const std::array<int, dimension>& cartesianDimensions() const
{ return cartesianDimensions_; }
int cartesianSize() const
{ return cartesianSize_; }
int compressedSize() const
{ return cartesianIndex_.size(); }
int cartesianIndex(const int compressedElementIndex) const
{
assert(compressedElementIndex < compressedSize());
return cartesianIndex_[compressedElementIndex];
}
int cartesianIndex(const std::array<int, dimension>& coords) const
{
int cartIndex = coords[0];
int factor = cartesianDimensions()[0];
for (int i=1; i < dimension; ++i) {
cartIndex += coords[i] * factor;
factor *= cartesianDimensions()[i];
}
return cartIndex;
}
void cartesianCoordinate(const int compressedElementIndex, std::array<int, dimension>& coords) const
{
int gc = cartesianIndex(compressedElementIndex);
if constexpr (dimension == 3) {
coords[0] = gc % cartesianDimensions()[0];
gc /= cartesianDimensions()[0];
coords[1] = gc % cartesianDimensions()[1];
coords[2] = gc / cartesianDimensions()[1];
}
else if constexpr (dimension == 2) {
coords[0] = gc % cartesianDimensions()[0];
coords[1] = gc / cartesianDimensions()[0];
}
else if constexpr (dimension == 1)
coords[0] = gc ;
else
throw std::invalid_argument("cartesianCoordinate not implemented for dimension " + std::to_string(dimension));
}
template <class GridView>
std::unique_ptr<GlobalIndexDataHandle<GridView> > dataHandle(const GridView& gridView)
{
using DataHandle = GlobalIndexDataHandle<GridView>;
assert(&grid_ == &gridView.grid());
return std::make_unique<DataHandle>(gridView, cartesianIndex_);
}
protected:
int computeCartesianSize() const
{
int size = cartesianDimensions()[0];
for (int d=1; d<dimension; ++d)
size *= cartesianDimensions()[d];
return size ;
}
const Grid& grid_;
const std::array<int, dimension> cartesianDimensions_;
std::vector<int> cartesianIndex_;
const int cartesianSize_ ;
};
} // end namespace Dune
#endif // OPM_ALUGRID_CARTESIAN_INDEX_MAPPER_HPP
Dune::CartesianIndexMapper< Dune::ALUGrid< 3, 3, Dune::cube, Dune::nonconforming > >::GlobalIndexDataHandle::gather
void gather(MessageBufferImp &buff, const EntityType &element) const
loop over all internal data handlers and call gather for given entity
Definition AluGridCartesianIndexMapper.hpp:113
Dune::CartesianIndexMapper< Dune::ALUGrid< 3, 3, Dune::cube, Dune::nonconforming > >::GlobalIndexDataHandle::size
std::size_t size(const EntityType &) const
loop over all internal data handlers and return sum of data size of given entity
Definition AluGridCartesianIndexMapper.hpp:136
Dune::CartesianIndexMapper< Dune::ALUGrid< 3, 3, Dune::cube, Dune::nonconforming > >::GlobalIndexDataHandle::scatter
void scatter(MessageBufferImp &buff, const EntityType &element, std::size_t)
loop over all internal data handlers and call scatter for given entity
Definition AluGridCartesianIndexMapper.hpp:122
Dune::CartesianIndexMapper< Dune::ALUGrid< 3, 3, Dune::cube, Dune::nonconforming > >::cartesianSize
int cartesianSize() const
return total number of cells in the logical Cartesian grid
Definition AluGridCartesianIndexMapper.hpp:189
Dune::CartesianIndexMapper< Dune::ALUGrid< 3, 3, Dune::cube, Dune::nonconforming > >::CartesianIndexMapper
CartesianIndexMapper(const Grid &grid, const std::array< int, dimension > &cartDims, const std::vector< int > &cartesianIndex)
constructor taking grid
Definition AluGridCartesianIndexMapper.hpp:175
Dune::CartesianIndexMapper< Dune::ALUGrid< 3, 3, Dune::cube, Dune::nonconforming > >::cartesianDimensions
const std::array< int, dimension > & cartesianDimensions() const
return Cartesian dimensions, i.e.
Definition AluGridCartesianIndexMapper.hpp:185
Dune::CartesianIndexMapper< Dune::ALUGrid< 3, 3, Dune::cube, Dune::nonconforming > >::cartesianIndex
int cartesianIndex(const std::array< int, dimension > &coords) const
return index of the cells in the logical Cartesian grid
Definition AluGridCartesianIndexMapper.hpp:204
Dune::CartesianIndexMapper< Dune::ALUGrid< 3, 3, Dune::cube, Dune::nonconforming > >::cartesianCoordinate
void cartesianCoordinate(const int compressedElementIndex, std::array< int, dimension > &coords) const
return Cartesian coordinate, i.e.
Definition AluGridCartesianIndexMapper.hpp:217
Dune::CartesianIndexMapper< Dune::ALUGrid< 3, 3, Dune::cube, Dune::nonconforming > >::dimension
static constexpr int dimension
dimension of the grid
Definition AluGridCartesianIndexMapper.hpp:172
Dune::CartesianIndexMapper< Dune::ALUGrid< 3, 3, Dune::cube, Dune::nonconforming > >::cartesianIndex
int cartesianIndex(const int compressedElementIndex) const
return index of the cells in the logical Cartesian grid
Definition AluGridCartesianIndexMapper.hpp:197
Dune::CartesianIndexMapper< Dune::ALUGrid< 3, 3, Dune::cube, Dune::nonconforming > >::compressedSize
int compressedSize() const
return number of cells in the active grid
Definition AluGridCartesianIndexMapper.hpp:193