cereal
A C++11 library for serialization
queue.hpp
Go to the documentation of this file.
1 
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 cereal 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 RANDOLPH VOORHIES OR SHANE GRANT 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_QUEUE_HPP_
31 #define CEREAL_TYPES_QUEUE_HPP_
32 
34 #include <queue>
35 
36 // The default container for queue is deque, so let's include that too
37 #include <cereal/types/deque.hpp>
38 
39 namespace cereal
40 {
41  namespace queue_detail
42  {
44 
45  template <class T, class C> inline
46  C const & container( std::queue<T, C> const & queue )
47  {
48  struct H : public std::queue<T, C>
49  {
50  static C const & get( std::queue<T, C> const & q )
51  {
52  return q.*(&H::c);
53  }
54  };
55 
56  return H::get( queue );
57  }
58 
60 
61  template <class T, class C, class Comp> inline
62  C const & container( std::priority_queue<T, C, Comp> const & priority_queue )
63  {
64  struct H : public std::priority_queue<T, C, Comp>
65  {
66  static C const & get( std::priority_queue<T, C, Comp> const & pq )
67  {
68  return pq.*(&H::c);
69  }
70  };
71 
72  return H::get( priority_queue );
73  }
74 
76 
77  template <class T, class C, class Comp> inline
78  Comp const & comparator( std::priority_queue<T, C, Comp> const & priority_queue )
79  {
80  struct H : public std::priority_queue<T, C, Comp>
81  {
82  static Comp const & get( std::priority_queue<T, C, Comp> const & pq )
83  {
84  return pq.*(&H::comp);
85  }
86  };
87 
88  return H::get( priority_queue );
89  }
90  }
91 
93  template <class Archive, class T, class C> inline
94  void CEREAL_SAVE_FUNCTION_NAME( Archive & ar, std::queue<T, C> const & queue )
95  {
96  ar( CEREAL_NVP_("container", queue_detail::container( queue )) );
97  }
98 
100  template <class Archive, class T, class C> inline
101  void CEREAL_LOAD_FUNCTION_NAME( Archive & ar, std::queue<T, C> & queue )
102  {
103  C container;
104  ar( CEREAL_NVP_("container", container) );
105  queue = std::queue<T, C>( std::move( container ) );
106  }
107 
109  template <class Archive, class T, class C, class Comp> inline
110  void CEREAL_SAVE_FUNCTION_NAME( Archive & ar, std::priority_queue<T, C, Comp> const & priority_queue )
111  {
112  ar( CEREAL_NVP_("comparator", queue_detail::comparator( priority_queue )) );
113  ar( CEREAL_NVP_("container", queue_detail::container( priority_queue )) );
114  }
115 
117  template <class Archive, class T, class C, class Comp> inline
118  void CEREAL_LOAD_FUNCTION_NAME( Archive & ar, std::priority_queue<T, C, Comp> & priority_queue )
119  {
120  Comp comparator;
121  ar( CEREAL_NVP_("comparator", comparator) );
122 
123  C container;
124  ar( CEREAL_NVP_("container", container) );
125 
126  priority_queue = std::priority_queue<T, C, Comp>( comparator, std::move( container ) );
127  }
128 } // namespace cereal
129 
130 #endif // CEREAL_TYPES_QUEUE_HPP_
#define CEREAL_NVP_(name, value)
Convenience for creating a templated NVP.
Definition: helpers.hpp:197
Comp const & comparator(std::priority_queue< T, C, Comp > const &priority_queue)
Allows access to the protected comparator in priority queue.
Definition: queue.hpp:78
Internal helper functionality.
Definition: access.hpp:39
Support for types found in <deque>
#define CEREAL_LOAD_FUNCTION_NAME
The deserialization (load) function name to search for.
Definition: macros.hpp:58
C const & container(std::queue< T, C > const &queue)
Allows access to the protected container in queue.
Definition: queue.hpp:46
#define CEREAL_SAVE_FUNCTION_NAME
The serialization (save) function name to search for.
Definition: macros.hpp:65