| [de061d] | 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   has_tempgrids.hpp
 | 
|---|
 | 21 |  * @author Julian Iseringhausen <isering@ins.uni-bonn.de>
 | 
|---|
 | 22 |  * @date   Tue Apr  5 21:00:56 2011
 | 
|---|
 | 23 |  *
 | 
|---|
 | 24 |  * @brief  Provides an arbitrary number of temporary grids,
 | 
|---|
 | 25 |  *         accessible by an integer key.
 | 
|---|
 | 26 |  *
 | 
|---|
 | 27 |  */
 | 
|---|
 | 28 | 
 | 
|---|
 | 29 | #ifndef HAS_TEMPGRIDS_HPP_
 | 
|---|
 | 30 | #define HAS_TEMPGRIDS_HPP_
 | 
|---|
 | 31 | 
 | 
|---|
 | 32 | #include <map>
 | 
|---|
 | 33 | 
 | 
|---|
 | 34 | #include "grid/tempgrid.hpp"
 | 
|---|
 | 35 | #include "mg.hpp"
 | 
|---|
 | 36 | 
 | 
|---|
 | 37 | namespace VMG
 | 
|---|
 | 38 | {
 | 
|---|
 | 39 | 
 | 
|---|
 | 40 | class HasTempGrids
 | 
|---|
 | 41 | {
 | 
|---|
 | 42 | public:
 | 
|---|
 | 43 |   virtual ~HasTempGrids()
 | 
|---|
 | 44 |   {
 | 
|---|
 | 45 |     for (std::map<int, TempGrid*>::iterator iter = grids_1.begin(); iter != grids_1.end(); ++iter)
 | 
|---|
 | 46 |       delete iter->second;
 | 
|---|
 | 47 | 
 | 
|---|
 | 48 |     for (std::map<const Grid*, TempGrid*>::iterator iter = grids_2.begin(); iter != grids_2.end(); ++iter)
 | 
|---|
 | 49 |       delete iter->second;
 | 
|---|
 | 50 |   }
 | 
|---|
 | 51 | 
 | 
|---|
 | 52 | protected:
 | 
|---|
 | 53 |   TempGrid* GetTempGrid(int key)
 | 
|---|
 | 54 |   {
 | 
|---|
 | 55 |     std::map<int, TempGrid*>::iterator iter = grids_1.find(key);
 | 
|---|
 | 56 | 
 | 
|---|
 | 57 |     if (iter == grids_1.end())
 | 
|---|
 | 58 |       iter = grids_1.insert(std::pair<int, TempGrid*>(key, new TempGrid())).first;
 | 
|---|
 | 59 | 
 | 
|---|
 | 60 |     return iter->second;
 | 
|---|
 | 61 |   }
 | 
|---|
 | 62 | 
 | 
|---|
 | 63 |   TempGrid* GetTempGrid(const Grid* key)
 | 
|---|
 | 64 |   {
 | 
|---|
 | 65 |     std::map<const Grid*, TempGrid*>::iterator iter = grids_2.find(key);
 | 
|---|
 | 66 | 
 | 
|---|
 | 67 |     if (iter == grids_2.end())
 | 
|---|
 | 68 |       iter = grids_2.insert(std::pair<const Grid*, TempGrid*>(key, new TempGrid())).first;
 | 
|---|
 | 69 | 
 | 
|---|
 | 70 |     return iter->second;
 | 
|---|
 | 71 |   }
 | 
|---|
 | 72 | 
 | 
|---|
 | 73 | private:
 | 
|---|
 | 74 |   std::map<int, TempGrid*> grids_1;
 | 
|---|
 | 75 |   std::map<const Grid*, TempGrid*> grids_2;
 | 
|---|
 | 76 | };
 | 
|---|
 | 77 | 
 | 
|---|
 | 78 | }
 | 
|---|
 | 79 | 
 | 
|---|
 | 80 | #endif /* HAS_TEMPGRIDS_HPP_ */
 | 
|---|