Line data    Source code

       1              : /*
       2              :  * Copyright (c) 2013:  G-CSC, Goethe University Frankfurt
       3              :  * Author: Sebastian Reiter
       4              :  * 
       5              :  * This file is part of UG4.
       6              :  * 
       7              :  * UG4 is free software: you can redistribute it and/or modify it under the
       8              :  * terms of the GNU Lesser General Public License version 3 (as published by the
       9              :  * Free Software Foundation) with the following additional attribution
      10              :  * requirements (according to LGPL/GPL v3 §7):
      11              :  * 
      12              :  * (1) The following notice must be displayed in the Appropriate Legal Notices
      13              :  * of covered and combined works: "Based on UG4 (www.ug4.org/license)".
      14              :  * 
      15              :  * (2) The following notice must be displayed at a prominent place in the
      16              :  * terminal output of covered works: "Based on UG4 (www.ug4.org/license)".
      17              :  * 
      18              :  * (3) The following bibliography is recommended for citation and must be
      19              :  * preserved in all covered files:
      20              :  * "Reiter, S., Vogel, A., Heppner, I., Rupp, M., and Wittum, G. A massively
      21              :  *   parallel geometric multigrid solver on hierarchically distributed grids.
      22              :  *   Computing and visualization in science 16, 4 (2013), 151-164"
      23              :  * "Vogel, A., Reiter, S., Rupp, M., Nägel, A., and Wittum, G. UG4 -- a novel
      24              :  *   flexible software system for simulating pde based models on high performance
      25              :  *   computers. Computing and visualization in science 16, 4 (2013), 165-179"
      26              :  * 
      27              :  * This program is distributed in the hope that it will be useful,
      28              :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
      29              :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
      30              :  * GNU Lesser General Public License for more details.
      31              :  */
      32              : 
      33              : #include "domain.h"
      34              : #include "common/util/table.h"
      35              : 
      36              : 
      37              : using namespace std;
      38              : 
      39              : namespace ug{
      40              : 
      41            0 : std::string DomainInfo::
      42              : to_string() const
      43              : {
      44              :         if((m_numElems.size() != m_numLocalElems.size())
      45            0 :            || (m_numElems.size() != m_numLocalGhosts.size()))
      46              :         {
      47            0 :                 UG_THROW("elem-arrays have to have the same number of entries!");
      48              :         }
      49              : 
      50              :         StringStreamTable t;
      51              : 
      52            0 :         t(0, 0) << "lvl";
      53            0 :         t(0, 1) << "#total-elems";
      54            0 :         t(0, 2) << "#local-elems";
      55            0 :         t(0, 3) << "(% of total)";
      56            0 :         t(0, 4) << "#local-ghosts";
      57            0 :         t(0, 5) << "#min-local-elems";
      58            0 :         t(0, 6) << "#max-local-elems";
      59            0 :         t(0, 7) << "#surf-elems";
      60              : 
      61            0 :         for(size_t i = 0; i < m_numElems.size(); ++i){
      62            0 :                 int r = i+1;
      63            0 :                 t(r, 0) << i;
      64            0 :                 t(r, 1) << m_numElems[i];
      65            0 :                 t(r, 2) << m_numLocalElems[i];
      66            0 :                 if(m_numElems[i] > 0)
      67            0 :                         t(r, 3) << 100. * (double)m_numLocalElems[i] / (double)m_numElems[i];
      68              :                 else
      69            0 :                         t(r, 3) << "-";
      70            0 :                 t(r, 4) << m_numLocalGhosts[i];
      71            0 :                 t(r, 5) << m_minNumLocalElems[i];
      72            0 :                 t(r, 6) << m_maxNumLocalElems[i];
      73              :                 
      74            0 :                 if(r < (int)m_numElems.size())
      75            0 :                         t(r, 7) << "-";
      76              :                 else
      77            0 :                         t(r, 7) << m_numSurfElems;
      78              :         }
      79              : 
      80            0 :         return t.to_string();
      81            0 : }
      82              : 
      83              : }//     end of namespace