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 // The default comparator for queue is less
40 
41 namespace cereal
42 {
43  namespace queue_detail
44  {
46 
47  template <class T, class C> inline
48  C const & container( std::queue<T, C> const & queue )
49  {
50  struct H : public std::queue<T, C>
51  {
52  static C const & get( std::queue<T, C> const & q )
53  {
54  return q.*(&H::c);
55  }
56  };
57 
58  return H::get( queue );
59  }
60 
62 
63  template <class T, class C, class Comp> inline
64  C const & container( std::priority_queue<T, C, Comp> const & priority_queue )
65  {
66  struct H : public std::priority_queue<T, C, Comp>
67  {
68  static C const & get( std::priority_queue<T, C, Comp> const & pq )
69  {
70  return pq.*(&H::c);
71  }
72  };
73 
74  return H::get( priority_queue );
75  }
76 
78 
79  template <class T, class C, class Comp> inline
80  Comp const & comparator( std::priority_queue<T, C, Comp> const & priority_queue )
81  {
82  struct H : public std::priority_queue<T, C, Comp>
83  {
84  static Comp const & get( std::priority_queue<T, C, Comp> const & pq )
85  {
86  return pq.*(&H::comp);
87  }
88  };
89 
90  return H::get( priority_queue );
91  }
92  }
93 
95  template <class Archive, class T, class C> inline
96  void CEREAL_SAVE_FUNCTION_NAME( Archive & ar, std::queue<T, C> const & queue )
97  {
98  ar( CEREAL_NVP_("container", queue_detail::container( queue )) );
99  }
100 
102  template <class Archive, class T, class C> inline
103  void CEREAL_LOAD_FUNCTION_NAME( Archive & ar, std::queue<T, C> & queue )
104  {
105  C container;
106  ar( CEREAL_NVP_("container", container) );
107  queue = std::queue<T, C>( std::move( container ) );
108  }
109 
111  template <class Archive, class T, class C, class Comp> inline
112  void CEREAL_SAVE_FUNCTION_NAME( Archive & ar, std::priority_queue<T, C, Comp> const & priority_queue )
113  {
114  ar( CEREAL_NVP_("comparator", queue_detail::comparator( priority_queue )) );
115  ar( CEREAL_NVP_("container", queue_detail::container( priority_queue )) );
116  }
117 
119  template <class Archive, class T, class C, class Comp> inline
120  void CEREAL_LOAD_FUNCTION_NAME( Archive & ar, std::priority_queue<T, C, Comp> & priority_queue )
121  {
122  Comp comparator;
123  ar( CEREAL_NVP_("comparator", comparator) );
124 
125  C container;
126  ar( CEREAL_NVP_("container", container) );
127 
128  priority_queue = std::priority_queue<T, C, Comp>( comparator, std::move( container ) );
129  }
130 } // namespace cereal
131 
132 #endif // CEREAL_TYPES_QUEUE_HPP_
#define CEREAL_NVP_(name, value)
Convenience for creating a templated NVP.
Definition: helpers.hpp:199
Internal helper functionality.
Definition: access.hpp:40
Support for types found in
#define CEREAL_LOAD_FUNCTION_NAME
The deserialization (load) function name to search for.
Definition: macros.hpp:85
#define CEREAL_SAVE_FUNCTION_NAME
The serialization (save) function name to search for.
Definition: macros.hpp:92
Support for types found in