Line data    Source code

       1              : /*
       2              :  * Copyright (c) 2010-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              : #ifndef __H__UG__NODE_TREE__COLLSISION_ELEMENT_INFO__
      34              : #define __H__UG__NODE_TREE__COLLSISION_ELEMENT_INFO__
      35              : 
      36              : namespace ug{
      37              : namespace node_tree
      38              : {
      39              : 
      40              : ////////////////////////////////////////////////////////////////////////
      41              : //      CollisionElementID
      42              : /**
      43              :  * This struct allows to specify a pointer or an integer-id that shall be
      44              :  * stored with each element (edge or triangle) in a collision-tree.
      45              :  *
      46              :  * Note that only a pointer or an integer may be stored not both at the
      47              :  * same time.
      48              :  *
      49              :  * If you construct an empty CollisionElementID, it will be set to
      50              :  * invalid by default.
      51              :  * Note that an integer value of -1 marks the CollisionElementID as invalid.
      52              :  */
      53              : struct CollisionElementID{
      54            0 :         CollisionElementID() : m_intID(-1)                      {}
      55            0 :         CollisionElementID(void* p)     : m_ptrID(p)    {}
      56              :         CollisionElementID(int i)       : m_intID(i)    {}
      57              : 
      58              :         inline bool is_valid()  {return m_intID != -1;}
      59              :         
      60            0 :         bool operator == (const CollisionElementID& id) const {return m_ptrID == id.m_ptrID;}
      61              : 
      62              :         union{
      63              :                 void*   m_ptrID;
      64              :                 int             m_intID;
      65              :         };
      66              : };
      67              : 
      68              : }//     end of namespace node_tree
      69              : }//     end of namespace ug
      70              : 
      71              : #endif
      72              :