Line data    Source code

       1             : /*! \file unordered_set.hpp
       2             :     \brief Support for types found in \<unordered_set\>
       3             :     \ingroup STLSupport */
       4             : /*
       5             :   Copyright (c) 2014, Randolph Voorhies, Shane Grant
       6             :   All rights reserved.
       7             : 
       8             :   Redistribution and use in source and binary forms, with or without
       9             :   modification, are permitted provided that the following conditions are met:
      10             :       * Redistributions of source code must retain the above copyright
      11             :         notice, this list of conditions and the following disclaimer.
      12             :       * Redistributions in binary form must reproduce the above copyright
      13             :         notice, this list of conditions and the following disclaimer in the
      14             :         documentation and/or other materials provided with the distribution.
      15             :       * Neither the name of the copyright holder nor the
      16             :         names of its contributors may be used to endorse or promote products
      17             :         derived from this software without specific prior written permission.
      18             : 
      19             :   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
      20             :   ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
      21             :   WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
      22             :   DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY
      23             :   DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
      24             :   (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
      25             :   LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
      26             :   ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
      27             :   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
      28             :   SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
      29             : */
      30             : #ifndef CEREAL_TYPES_UNORDERED_SET_HPP_
      31             : #define CEREAL_TYPES_UNORDERED_SET_HPP_
      32             : 
      33             : #include "cereal/cereal.hpp"
      34             : #include <unordered_set>
      35             : 
      36             : namespace cereal
      37             : {
      38             :   namespace unordered_set_detail
      39             :   {
      40             :     //! @internal
      41             :     template <class Archive, class SetT> inline
      42        4000 :     void save( Archive & ar, SetT const & set )
      43             :     {
      44        4000 :       ar( make_size_tag( static_cast<size_type>(set.size()) ) );
      45             : 
      46      604000 :       for( const auto & i : set )
      47      600000 :         ar( i );
      48        4000 :     }
      49             : 
      50             :     //! @internal
      51             :     template <class Archive, class SetT> inline
      52        4000 :     void load( Archive & ar, SetT & set )
      53             :     {
      54             :       size_type size;
      55        4000 :       ar( make_size_tag( size ) );
      56             : 
      57        4000 :       set.clear();
      58        4000 :       set.reserve( static_cast<std::size_t>( size ) );
      59             : 
      60      604000 :       for( size_type i = 0; i < size; ++i )
      61             :       {
      62      480000 :         typename SetT::key_type key;
      63             : 
      64      600000 :         ar( key );
      65      600000 :         set.emplace( std::move( key ) );
      66             :       }
      67        4000 :     }
      68             :   }
      69             : 
      70             :   //! Saving for std::unordered_set
      71             :   template <class Archive, class K, class H, class KE, class A> inline
      72        2000 :   void CEREAL_SAVE_FUNCTION_NAME( Archive & ar, std::unordered_set<K, H, KE, A> const & unordered_set )
      73             :   {
      74        2000 :     unordered_set_detail::save( ar, unordered_set );
      75        2000 :   }
      76             : 
      77             :   //! Loading for std::unordered_set
      78             :   template <class Archive, class K, class H, class KE, class A> inline
      79        2000 :   void CEREAL_LOAD_FUNCTION_NAME( Archive & ar, std::unordered_set<K, H, KE, A> & unordered_set )
      80             :   {
      81        2000 :     unordered_set_detail::load( ar, unordered_set );
      82        2000 :   }
      83             : 
      84             :   //! Saving for std::unordered_multiset
      85             :   template <class Archive, class K, class H, class KE, class A> inline
      86        2000 :   void CEREAL_SAVE_FUNCTION_NAME( Archive & ar, std::unordered_multiset<K, H, KE, A> const & unordered_multiset )
      87             :   {
      88        2000 :     unordered_set_detail::save( ar, unordered_multiset );
      89        2000 :   }
      90             : 
      91             :   //! Loading for std::unordered_multiset
      92             :   template <class Archive, class K, class H, class KE, class A> inline
      93        2000 :   void CEREAL_LOAD_FUNCTION_NAME( Archive & ar, std::unordered_multiset<K, H, KE, A> & unordered_multiset )
      94             :   {
      95        2000 :     unordered_set_detail::load( ar, unordered_multiset );
      96        2000 :   }
      97             : } // namespace cereal
      98             : 
      99             : #endif // CEREAL_TYPES_UNORDERED_SET_HPP_