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
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
|
/*
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_STRUCTS_MINIMAL_H_
#define CEREAL_TEST_STRUCTS_MINIMAL_H_
#include "common.hpp"
class MemberMinimal
{
public:
MemberMinimal() = default;
MemberMinimal( std::string const & str ) : x( str ) {}
protected:
friend class cereal::access;
template <class Archive>
std::string save_minimal( Archive const & ) const
{
return x;
}
template <class Archive>
void load_minimal( Archive const &, std::string const & str )
{
x = str;
}
public:
std::string x;
};
class MemberMinimalVersioned
{
public:
MemberMinimalVersioned() = default;
MemberMinimalVersioned( double d ) : x( d ) {}
protected:
friend class cereal::access;
template <class Archive>
double save_minimal( Archive const &, const std::uint32_t ) const
{
return x;
}
template <class Archive>
void load_minimal( Archive const &, double const & d, const std::uint32_t )
{
x = d;
}
public:
double x;
};
struct NonMemberMinimal
{
NonMemberMinimal() = default;
NonMemberMinimal( std::uint32_t xx ) : x(xx) {}
std::uint32_t x;
};
template <class Archive> inline
std::uint32_t save_minimal( Archive const &, NonMemberMinimal const & nmm )
{
return nmm.x;
}
template <class Archive> inline
void load_minimal( Archive const &, NonMemberMinimal & nmm, std::uint32_t const & data )
{
nmm.x = data;
}
struct NonMemberMinimalVersioned
{
NonMemberMinimalVersioned() = default;
NonMemberMinimalVersioned( bool xx ) : x(xx) {}
bool x;
};
template <class Archive> inline
bool save_minimal( Archive const &, NonMemberMinimalVersioned const & nmm, std::uint32_t const )
{
return nmm.x;
}
template <class Archive> inline
void load_minimal( Archive const &, NonMemberMinimalVersioned & nmm, bool const & data, std::uint32_t const )
{
nmm.x = data;
}
struct TestStruct
{
TestStruct() = default;
TestStruct( std::string const & s, double d, std::uint32_t u, bool b ) :
mm(s), mmv(d), nmm(u), nmmv(b) {}
template <class Archive>
void serialize( Archive & ar )
{
ar( mm, mmv );
ar( nmm, nmmv );
}
MemberMinimal mm;
MemberMinimalVersioned mmv;
NonMemberMinimal nmm;
NonMemberMinimalVersioned nmmv;
};
struct Issue79Struct
{
Issue79Struct() = default;
Issue79Struct( std::int32_t xx ) : x(xx) {}
std::int32_t x;
};
template <class Archive, cereal::traits::DisableIf<std::is_same<Archive, cereal::BinaryOutputArchive>::value ||
std::is_same<Archive, cereal::PortableBinaryOutputArchive>::value> = cereal::traits::sfinae>
inline std::string save_minimal( Archive const &, Issue79Struct const & val )
{
return std::to_string( val.x );
}
template <class Archive, cereal::traits::DisableIf<std::is_same<Archive, cereal::BinaryInputArchive>::value ||
std::is_same<Archive, cereal::PortableBinaryInputArchive>::value> = cereal::traits::sfinae>
inline void load_minimal( Archive const &, Issue79Struct & val, std::string const & str )
{
val.x = std::stoi( str );
}
template <class Archive, cereal::traits::EnableIf<std::is_same<Archive, cereal::BinaryOutputArchive>::value ||
std::is_same<Archive, cereal::PortableBinaryOutputArchive>::value> = cereal::traits::sfinae>
inline std::int32_t save_minimal( Archive const &, Issue79Struct const & val )
{
return val.x;
}
template <class Archive, cereal::traits::EnableIf<std::is_same<Archive, cereal::BinaryInputArchive>::value ||
std::is_same<Archive, cereal::PortableBinaryInputArchive>::value> = cereal::traits::sfinae>
inline void load_minimal( Archive const &, Issue79Struct & val, std::int32_t const & xx )
{
val.x = xx;
}
struct Issue79StructInternal
{
Issue79StructInternal() = default;
Issue79StructInternal( std::int32_t xx ) : x(xx) {}
std::int32_t x;
template <class Archive, cereal::traits::DisableIf<std::is_same<Archive, cereal::BinaryOutputArchive>::value ||
std::is_same<Archive, cereal::PortableBinaryOutputArchive>::value> = cereal::traits::sfinae>
inline std::string save_minimal( Archive const & ) const
{
return std::to_string( x );
}
template <class Archive, cereal::traits::DisableIf<std::is_same<Archive, cereal::BinaryInputArchive>::value ||
std::is_same<Archive, cereal::PortableBinaryInputArchive>::value> = cereal::traits::sfinae>
inline void load_minimal( Archive const &, std::string const & str )
{
x = std::stoi( str );
}
template <class Archive, cereal::traits::EnableIf<std::is_same<Archive, cereal::BinaryOutputArchive>::value ||
std::is_same<Archive, cereal::PortableBinaryOutputArchive>::value> = cereal::traits::sfinae>
inline std::int32_t save_minimal( Archive const & ) const
{
return x;
}
template <class Archive, cereal::traits::EnableIf<std::is_same<Archive, cereal::BinaryInputArchive>::value ||
std::is_same<Archive, cereal::PortableBinaryInputArchive>::value> = cereal::traits::sfinae>
inline void load_minimal( Archive const &, std::int32_t const & xx )
{
x = xx;
}
};
template <class IArchive, class OArchive> inline
void test_structs_minimal()
{
std::random_device rd;
std::mt19937 gen(rd());
for(int ii=0; ii<100; ++ii)
{
TestStruct o_struct = { random_basic_string<char>(gen), random_value<double>(gen),
random_value<std::uint32_t>(gen), random_value<uint8_t>(gen) % 2 ? true : false };
Issue79Struct o_struct2 = { random_value<std::int32_t>(gen) };
Issue79StructInternal o_struct3 = { random_value<std::int32_t>(gen) };
std::ostringstream os;
{
OArchive oar(os);
oar( o_struct );
oar( o_struct2 );
oar( o_struct3 );
}
decltype(o_struct) i_struct;
decltype(o_struct2) i_struct2;
decltype(o_struct3) i_struct3;
std::istringstream is(os.str());
{
IArchive iar(is);
iar( i_struct );
iar( i_struct2 );
iar( i_struct3 );
}
CHECK_EQ(o_struct.mm.x, i_struct.mm.x);
CHECK_EQ(o_struct.mmv.x, doctest::Approx(i_struct.mmv.x).epsilon(1e-5));
CHECK_EQ(o_struct.nmm.x, i_struct.nmm.x);
CHECK_EQ(o_struct.nmmv.x, i_struct.nmmv.x);
CHECK_EQ(o_struct2.x, i_struct2.x);
CHECK_EQ(o_struct3.x, i_struct3.x);
}
}
#endif // CEREAL_TEST_STRUCTS_MINIMAL_H_
|
