| 1 | /*
|
|---|
| 2 | * vmg - a versatile multigrid solver
|
|---|
| 3 | * Copyright (C) 2012 Institute for Numerical Simulation, University of Bonn
|
|---|
| 4 | *
|
|---|
| 5 | * vmg is free software: you can redistribute it and/or modify
|
|---|
| 6 | * it under the terms of the GNU General Public License as published by
|
|---|
| 7 | * the Free Software Foundation, either version 3 of the License, or
|
|---|
| 8 | * (at your option) any later version.
|
|---|
| 9 | *
|
|---|
| 10 | * vmg is distributed in the hope that it will be useful,
|
|---|
| 11 | * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|---|
| 12 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|---|
| 13 | * GNU General Public License for more details.
|
|---|
| 14 | *
|
|---|
| 15 | * You should have received a copy of the GNU General Public License
|
|---|
| 16 | * along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|---|
| 17 | */
|
|---|
| 18 |
|
|---|
| 19 | /**
|
|---|
| 20 | * @file grid_index_translations.hpp
|
|---|
| 21 | * @author Julian Iseringhausen <isering@ins.uni-bonn.de>
|
|---|
| 22 | * @date Tue May 17 11:46:37 2011
|
|---|
| 23 | *
|
|---|
| 24 | * @brief Class to convert different representations of grid
|
|---|
| 25 | * indices.
|
|---|
| 26 | *
|
|---|
| 27 | */
|
|---|
| 28 |
|
|---|
| 29 | #ifndef GRID_INDEX_TRANSLATIONS_HPP_
|
|---|
| 30 | #define GRID_INDEX_TRANSLATIONS_HPP_
|
|---|
| 31 |
|
|---|
| 32 | #include "base/defs.hpp"
|
|---|
| 33 | #include "base/index.hpp"
|
|---|
| 34 |
|
|---|
| 35 | namespace VMG
|
|---|
| 36 | {
|
|---|
| 37 |
|
|---|
| 38 | class Comm;
|
|---|
| 39 | class Grid;
|
|---|
| 40 | class GridIteratorSet;
|
|---|
| 41 |
|
|---|
| 42 | class GridIndexTranslations
|
|---|
| 43 | {
|
|---|
| 44 | public:
|
|---|
| 45 | GridIndexTranslations() {}
|
|---|
| 46 |
|
|---|
| 47 | static bool IsGridPointOf(const Grid& grid, const Index& index_finest);
|
|---|
| 48 |
|
|---|
| 49 | static Index LocalToGlobal(const Grid& grid, const Index& index_local);
|
|---|
| 50 | static Index LocalToGlobalFinest(const Grid& grid, const Index& index_local);
|
|---|
| 51 |
|
|---|
| 52 | static Index GlobalToLocal(const Grid& grid, const Index& index_global);
|
|---|
| 53 | static Index GlobalToGlobalFinest(const Grid& grid, const Index& index_global);
|
|---|
| 54 |
|
|---|
| 55 | static Index GlobalFinestToLocal(const Grid& grid, const Index& index_finest);
|
|---|
| 56 | static Index GlobalFinestToGlobal(const Grid& grid, const Index& index_finest);
|
|---|
| 57 |
|
|---|
| 58 | static void GlobalCoarseToFine(Index& begin, Index& end);
|
|---|
| 59 | static void GlobalFineToCoarse(Index& begin, Index& end);
|
|---|
| 60 |
|
|---|
| 61 | static void GetGridAlignment(const Grid& grid_1, GridIteratorSet& bounds_1,
|
|---|
| 62 | const Grid& grid_2, GridIteratorSet& bounds_2);
|
|---|
| 63 |
|
|---|
| 64 | static void GetInnerBoundary(const Grid& grid_coarse, Index& b1_c, Index& b2_c,
|
|---|
| 65 | const Grid& grid_fine, Index& b1_f, Index& b2_f);
|
|---|
| 66 |
|
|---|
| 67 |
|
|---|
| 68 |
|
|---|
| 69 |
|
|---|
| 70 |
|
|---|
| 71 | static Index EndOffset(const Boundary& boundary)
|
|---|
| 72 | {
|
|---|
| 73 | return Index(boundary[0] == Periodic ? 0 : 1,
|
|---|
| 74 | boundary[1] == Periodic ? 0 : 1,
|
|---|
| 75 | boundary[2] == Periodic ? 0 : 1);
|
|---|
| 76 | }
|
|---|
| 77 | };
|
|---|
| 78 |
|
|---|
| 79 | }
|
|---|
| 80 |
|
|---|
| 81 | #endif /* GRID_INDEX_TRANSLATIONS_HPP_ */
|
|---|
