mirror of
https://github.com/OPM/opm-simulators.git
synced 2025-02-25 18:55:30 -06:00
114 lines
3.2 KiB
C++
114 lines
3.2 KiB
C++
//===========================================================================
|
|
//
|
|
// File: AluGridLevelCartesianIndexMapper.hpp
|
|
//
|
|
// Created: Tue October 01 09:44:00 2024
|
|
//
|
|
// Author(s): Antonella Ritorto <antonella.ritorto@opm-op.com>
|
|
//
|
|
//
|
|
// $Date$
|
|
//
|
|
// $Revision$
|
|
//
|
|
//===========================================================================
|
|
|
|
/*
|
|
Copyright 2024 Equinor ASA.
|
|
|
|
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 3 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/>.
|
|
*/
|
|
#ifndef OPM_ALUGRIDLEVELCARTESIANINDEXMAPPER_HPP
|
|
#define OPM_ALUGRIDLEVELCARTESIANINDEXMAPPER_HPP
|
|
|
|
#include <dune/alugrid/grid.hh>
|
|
#include <opm/grid/common/LevelCartesianIndexMapper.hpp>
|
|
#include <opm/simulators/flow/AluGridCartesianIndexMapper.hpp>
|
|
|
|
#include <array>
|
|
#include <memory>
|
|
#include <vector>
|
|
|
|
|
|
namespace Opm
|
|
{
|
|
|
|
template<>
|
|
class LevelCartesianIndexMapper<Dune::ALUGrid<3, 3, Dune::cube, Dune::nonconforming>>
|
|
{
|
|
|
|
#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
|
|
|
|
public:
|
|
static const int dimension = 3 ;
|
|
|
|
LevelCartesianIndexMapper(const Grid& grid,
|
|
const Dune::CartesianIndexMapper<Grid>& cartesianIndexMapper)
|
|
: grid_{&grid}
|
|
, cartesianIndexMapper_{std::make_unique<Dune::CartesianIndexMapper<Grid>>(cartesianIndexMapper)}
|
|
{}
|
|
|
|
const std::array<int,3>& cartesianDimensions(int level) const
|
|
{
|
|
throwIfLevelPositive(level);
|
|
return cartesianIndexMapper_ ->cartesianDimensions();
|
|
}
|
|
|
|
int cartesianSize(int level) const
|
|
{
|
|
throwIfLevelPositive(level);
|
|
return cartesianIndexMapper_->cartesianSize();
|
|
}
|
|
|
|
int compressedSize(int level) const
|
|
{
|
|
throwIfLevelPositive(level);
|
|
return cartesianIndexMapper_-> compressedSize();
|
|
}
|
|
|
|
|
|
int cartesianIndex( const int compressedElementIndex, const int level) const
|
|
{
|
|
throwIfLevelPositive(level);;
|
|
return cartesianIndexMapper_->cartesianIndex(compressedElementIndex);
|
|
}
|
|
|
|
void cartesianCoordinate(const int compressedElementIndex, std::array<int,dimension>& coords, int level) const
|
|
{
|
|
throwIfLevelPositive(level);
|
|
cartesianIndexMapper_->cartesianCoordinate(compressedElementIndex, coords);
|
|
}
|
|
|
|
private:
|
|
const Grid* grid_;
|
|
std::unique_ptr<Dune::CartesianIndexMapper<Grid>> cartesianIndexMapper_;
|
|
|
|
void throwIfLevelPositive(int level) const
|
|
{
|
|
if (level) {
|
|
throw std::invalid_argument("Invalid level.\n");
|
|
}
|
|
}
|
|
};
|
|
|
|
}
|
|
|
|
#endif
|