Line data    Source code

       1              : /*
       2              :  * Copyright (c) 2011-2015:  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 "parallel_grid_layout.h"
      34              : #include "pcl/pcl_layout_util.h"
      35              : 
      36              : namespace ug{
      37              : AGeomObjID      aGeomObjID("globalID", false);
      38              : 
      39              : template <>
      40            0 : size_t hash_key<GeomObjID>(const GeomObjID& key)
      41              : {
      42              : //      of course this hash does not completly avoid collisions.
      43              : //      One should check whether the chosen key is fine.
      44            0 :         return (unsigned long)(99971 * key.first + key.second * key.second);
      45              : }
      46              : 
      47            0 : std::ostream& operator<<(std::ostream& out, const GeomObjID& goId)
      48              : {
      49            0 :         out << "(" << goId.first << ", " << goId.second << ")";
      50            0 :         return out;
      51              : }
      52              : 
      53            0 : bool operator<(const GeomObjID& gid1, const GeomObjID& gid2)
      54              : {
      55            0 :         if(gid1.first < gid2.first)
      56              :                 return true;
      57            0 :         if(gid1.first > gid2.first)
      58              :                 return false;
      59            0 :         return gid1.second < gid2.second;
      60              : }
      61              : 
      62              : ///     A helper method for GridLayoutMap::remove_empty_interfaces()
      63              : template <class TGeomObj>
      64            0 : static void RemoveEmptyInterfaces(
      65              :                 typename GridLayoutMap::Types<TGeomObj>::Map& map)
      66              : {
      67              :         typedef typename GridLayoutMap::Types<TGeomObj>::Map TMap;
      68              :         typedef typename TMap::iterator TIterator;
      69              : 
      70              :         typedef typename GridLayoutMap::Types<TGeomObj>::Layout TLayout;
      71              : 
      72            0 :         for(TIterator layoutIter = map.begin(); layoutIter != map.end(); ++layoutIter)
      73              :         {
      74            0 :                 TLayout& layout = layoutIter->second;
      75            0 :                 RemoveEmptyInterfaces(layout);
      76              :         }
      77            0 : }
      78              : 
      79            0 : void GridLayoutMap::remove_empty_interfaces()
      80              : {
      81            0 :         RemoveEmptyInterfaces<Vertex>(m_vertexLayoutMap);
      82            0 :         RemoveEmptyInterfaces<Edge>(m_edgeLayoutMap);
      83            0 :         RemoveEmptyInterfaces<Face>(m_faceLayoutMap);
      84            0 :         RemoveEmptyInterfaces<Volume>(m_volumeLayoutMap);
      85            0 : }
      86              : 
      87              : }// end of namespace