1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
|
/*
Copyright (c) 2014, Randolph Voorhies, Shane Grant
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of the copyright holder nor the
names of its contributors may be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef CEREAL_TEST_VERSIONING_H_
#define CEREAL_TEST_VERSIONING_H_
#include "common.hpp"
#if CEREAL_THREAD_SAFE
#include <future>
#endif
namespace Nested
{
struct NestedClass
{
int x;
template <class Archive>
void serialize( Archive & ar )
{ ar( x ); }
};
}
CEREAL_CLASS_VERSION( Nested::NestedClass, 1 )
class VersionStructMS
{
public:
bool x;
std::uint32_t v;
private:
friend class cereal::access;
template <class Archive>
void serialize( Archive & ar, std::uint32_t const version )
{
ar( x );
v = version;
}
};
struct VersionStructMSP
{
uint8_t x;
std::uint32_t v;
template <class Archive>
void save( Archive & ar, std::uint32_t const /*version*/ ) const
{
ar( x );
}
template <class Archive>
void load( Archive & ar, std::uint32_t const version )
{
ar( x );
v = version;
}
};
struct VersionStructNMS
{
std::int32_t x;
std::uint32_t v;
};
template <class Archive>
void serialize( Archive & ar, VersionStructNMS & vnms, const std::uint32_t version )
{
ar( vnms.x );
vnms.v = version;
}
struct VersionStructNMSP
{
double x;
std::uint32_t v;
};
template <class Archive>
void save( Archive & ar, VersionStructNMSP const & vnms, const std::uint32_t /*version*/ )
{
ar( vnms.x );
}
template <class Archive>
void load( Archive & ar, VersionStructNMSP & vnms, const std::uint32_t version )
{
ar( vnms.x );
vnms.v = version;
}
CEREAL_CLASS_VERSION( VersionStructMSP, 33 )
CEREAL_CLASS_VERSION( VersionStructNMS, 66 )
CEREAL_CLASS_VERSION( VersionStructNMSP, 99 )
template <class IArchive, class OArchive> inline
void test_versioning()
{
std::random_device rd;
std::mt19937 gen(rd());
#if CEREAL_THREAD_SAFE
#include <future>
static std::mutex testMutex;
#endif
for(size_t i=0; i<100; ++i)
{
VersionStructMS o_MS = {random_value<uint8_t>(gen) % 2 ? true : false, 1};
VersionStructMSP o_MSP = {random_value<uint8_t>(gen), 1};
VersionStructNMS o_NMS = {random_value<int32_t>(gen), 1};
VersionStructNMSP o_NMSP = {random_value<double>(gen), 1};
VersionStructMS o_MS2 = {random_value<uint8_t>(gen) % 2 ? true : false, 1};
VersionStructMSP o_MSP2 = {random_value<uint8_t>(gen), 1};
VersionStructNMS o_NMS2 = {random_value<int32_t>(gen), 1};
VersionStructNMSP o_NMSP2 = {random_value<double>(gen), 1};
std::ostringstream os;
{
OArchive oar(os);
oar( o_MS );
oar( o_MSP );
oar( o_NMS );
oar( o_NMSP );
oar( o_MS2 );
oar( o_MSP2 );
oar( o_NMS2 );
oar( o_NMSP2 );
}
decltype(o_MS) i_MS;
decltype(o_MSP) i_MSP;
decltype(o_NMS) i_NMS;
decltype(o_NMSP) i_NMSP;
decltype(o_MS2) i_MS2;
decltype(o_MSP2) i_MSP2;
decltype(o_NMS2) i_NMS2;
decltype(o_NMSP2) i_NMSP2;
std::istringstream is(os.str());
{
IArchive iar(is);
iar( i_MS );
iar( i_MSP );
iar( i_NMS );
iar( i_NMSP );
iar( i_MS2 );
iar( i_MSP2 );
iar( i_NMS2 );
iar( i_NMSP2 );
}
#if CEREAL_THREAD_SAFE
std::lock_guard<std::mutex> lock( testMutex );
#endif
CHECK_EQ(o_MS.x, i_MS.x);
CHECK_EQ(i_MS.v, 0u);
CHECK_EQ(o_MSP.x, i_MSP.x);
CHECK_EQ(i_MSP.v, 33u);
CHECK_EQ(o_NMS.x, i_NMS.x);
CHECK_EQ(i_NMS.v, 66u);
CHECK_EQ(o_NMSP.x, doctest::Approx(i_NMSP.x).epsilon(1e-5));
CHECK_EQ(i_NMSP.v, 99u);
CHECK_EQ(o_MS2.x, i_MS2.x);
CHECK_EQ(i_MS2.v, 0u);
CHECK_EQ(o_MSP2.x, i_MSP2.x);
CHECK_EQ(i_MSP2.v, 33u);
CHECK_EQ(o_NMS2.x, i_NMS2.x);
CHECK_EQ(i_NMS2.v, 66u);
CHECK_EQ(o_NMSP2.x, doctest::Approx(i_NMSP2.x).epsilon(1e-5));
CHECK_EQ(i_NMSP2.v, 99u);
}
}
#if CEREAL_THREAD_SAFE
template <class IArchive, class OArchive> inline
void test_versioning_threading()
{
std::vector<std::future<bool>> pool;
for( size_t i = 0; i < 100; ++i )
pool.emplace_back( std::async( std::launch::async,
[](){ test_versioning<IArchive, OArchive>(); return true; } ) );
for( auto & future : pool )
future.wait();
for( auto & future : pool )
CHECK_UNARY( future.get() );
}
#endif // CEREAL_THREAD_SAFE
#endif // CEREAL_TEST_VERSIONING_H_
|
