Line data    Source code

       1              : /*
       2              :  * Copyright (c) 2016:  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_archivar
      34              : #define __H__UG_archivar
      35              : 
      36              : #include <type_traits> // for std::is_base_of
      37              : 
      38              : #include <boost/mpl/for_each.hpp>
      39              : 
      40              : #include "../boost_serialization.h"
      41              : #include "detail/register_type_pair_functor.h"
      42              : 
      43              : namespace ug{
      44              : 
      45              : 
      46              : namespace detail{
      47              : namespace archivar{
      48              :         template <typename TArchive, typename TBase, typename TDerived>
      49            0 :         void CallArchiveOnDerivedClass (TArchive& ar, TBase& base, const char* name)
      50              :         {
      51              :                 static_assert((std::is_base_of<TBase, TDerived>::value), "TDerived is not a subclass of TBase");
      52            0 :                 TDerived& derived = dynamic_cast<TDerived&>(base);
      53              :                 ar & make_nvp(name, derived);
      54            0 :         }
      55              : }
      56              : }
      57              : 
      58              : template <class TArchive, class TBase, class TPairSeq>
      59              : class Archivar
      60              : {
      61              : public:
      62            0 :         Archivar()
      63              :         {
      64              :                 detail::RegisterTypePairFunctor<Archivar> func(this);
      65              :                 boost::mpl::for_each<TPairSeq>(func);
      66            0 :         }
      67              : 
      68              :         template <class T>
      69              :         void archive(TArchive& ar, T& t)
      70              :         {
      71            0 :                 archive(ar, t, "");
      72            0 :         }
      73              : 
      74              :         template <class T>
      75            0 :         void archive(TArchive& ar, T& t, const char* name)
      76              :         {
      77            0 :                 std::string typeName(typeid(t).name());
      78              : 
      79              :                 typename callback_map_t::iterator icallback = m_callbackMap.find(typeName);
      80            0 :                 UG_COND_THROW(icallback == m_callbackMap.end(),
      81              :                                           "Unregistered class used in 'Archivar::archive': " << typeName);
      82              : 
      83            0 :                 icallback->second(ar, t, name);
      84            0 :         }
      85              : 
      86              :         template <class TDerived>
      87            0 :         void register_class(const char* name)
      88              :         {
      89              :                 static_assert((std::is_base_of<TBase, TDerived>::value), "TDerived is not a subclass of TBase");
      90            0 :                 std::string typeName(typeid(TDerived).name());
      91            0 :                 m_callbackMap[typeName] =
      92              :                                 &detail::archivar::CallArchiveOnDerivedClass<TArchive, TBase, TDerived>;
      93            0 :         }
      94              : 
      95              : private:
      96              :         typedef void (*archive_sig)(TArchive&, TBase&, const char* name);
      97              : 
      98              :         typedef std::map<std::string, archive_sig>        callback_map_t;
      99              :         callback_map_t  m_callbackMap;
     100              : };
     101              : 
     102              : }//     end of namespace
     103              : 
     104              : #endif  //__H__UG_archivar