generic-library/cereal
1
0
Fork 0
mirror of https://github.com/USCiLab/cereal.git synced 2025-10-18 01:45:52 +02:00
Code Issues Projects Releases Wiki Activity

more #139

Browse Source
This commit is contained in:
Shane Grant
2016-11-04 12:00:16 -07:00
parent b5e500d3b2
commit 07818f4527
8 changed files with 558 additions and 420 deletions
Download Patch File Download Diff File Expand all files Collapse all files

77
unittests/set.cpp
View File

@@ -24,90 +24,29 @@
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "common.hpp"
#include <boost/test/unit_test.hpp>
#define DOCTEST_CONFIG_IMPLEMENT_WITH_MAIN
#include "set.hpp"
template <class IArchive, class OArchive>
void test_set()
{
std::random_device rd;
std::mt19937 gen(rd());
TEST_SUITE("set");
for(int ii=0; ii<100; ++ii)
{
std::set<int> o_podset;
for(int j=0; j<100; ++j)
o_podset.insert(random_value<int>(gen));
std::set<StructInternalSerialize> o_iserset;
for(int j=0; j<100; ++j)
o_iserset.insert({ random_value<int>(gen), random_value<int>(gen) });
std::set<StructInternalSplit> o_isplset;
for(int j=0; j<100; ++j)
o_isplset.insert({ random_value<int>(gen), random_value<int>(gen) });
std::set<StructExternalSerialize> o_eserset;
for(int j=0; j<100; ++j)
o_eserset.insert({ random_value<int>(gen), random_value<int>(gen) });
std::set<StructExternalSplit> o_esplset;
for(int j=0; j<100; ++j)
o_esplset.insert({ random_value<int>(gen), random_value<int>(gen) });
std::ostringstream os;
{
OArchive oar(os);
oar(o_podset);
oar(o_iserset);
oar(o_isplset);
oar(o_eserset);
oar(o_esplset);
}
std::set<int> i_podset;
std::set<StructInternalSerialize> i_iserset;
std::set<StructInternalSplit> i_isplset;
std::set<StructExternalSerialize> i_eserset;
std::set<StructExternalSplit> i_esplset;
std::istringstream is(os.str());
{
IArchive iar(is);
iar(i_podset);
iar(i_iserset);
iar(i_isplset);
iar(i_eserset);
iar(i_esplset);
}
BOOST_CHECK_EQUAL_COLLECTIONS(i_podset.begin(), i_podset.end(), o_podset.begin(), o_podset.end());
BOOST_CHECK_EQUAL_COLLECTIONS(i_iserset.begin(), i_iserset.end(), o_iserset.begin(), o_iserset.end());
BOOST_CHECK_EQUAL_COLLECTIONS(i_isplset.begin(), i_isplset.end(), o_isplset.begin(), o_isplset.end());
BOOST_CHECK_EQUAL_COLLECTIONS(i_eserset.begin(), i_eserset.end(), o_eserset.begin(), o_eserset.end());
BOOST_CHECK_EQUAL_COLLECTIONS(i_esplset.begin(), i_esplset.end(), o_esplset.begin(), o_esplset.end());
}
}
BOOST_AUTO_TEST_CASE( binary_set )
TEST_CASE("binary_set")
{
test_set<cereal::BinaryInputArchive, cereal::BinaryOutputArchive>();
}
BOOST_AUTO_TEST_CASE( portable_binary_set )
TEST_CASE("portable_binary_set")
{
test_set<cereal::PortableBinaryInputArchive, cereal::PortableBinaryOutputArchive>();
}
BOOST_AUTO_TEST_CASE( xml_set )
TEST_CASE("xml_set")
{
test_set<cereal::XMLInputArchive, cereal::XMLOutputArchive>();
}
BOOST_AUTO_TEST_CASE( json_set )
TEST_CASE("json_set")
{
test_set<cereal::JSONInputArchive, cereal::JSONOutputArchive>();
}
TEST_SUITE_END();

95
unittests/set.hpp Normal file
View File

@@ -0,0 +1,95 @@
/*
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 cereal 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 RANDOLPH VOORHIES AND SHANE GRANT 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_SET_H_
#define CEREAL_TEST_SET_H_
#include "common.hpp"
template <class IArchive, class OArchive> inline
void test_set()
{
std::random_device rd;
std::mt19937 gen(rd());
for(int ii=0; ii<100; ++ii)
{
std::set<int> o_podset;
for(int j=0; j<100; ++j)
o_podset.insert(random_value<int>(gen));
std::set<StructInternalSerialize> o_iserset;
for(int j=0; j<100; ++j)
o_iserset.insert({ random_value<int>(gen), random_value<int>(gen) });
std::set<StructInternalSplit> o_isplset;
for(int j=0; j<100; ++j)
o_isplset.insert({ random_value<int>(gen), random_value<int>(gen) });
std::set<StructExternalSerialize> o_eserset;
for(int j=0; j<100; ++j)
o_eserset.insert({ random_value<int>(gen), random_value<int>(gen) });
std::set<StructExternalSplit> o_esplset;
for(int j=0; j<100; ++j)
o_esplset.insert({ random_value<int>(gen), random_value<int>(gen) });
std::ostringstream os;
{
OArchive oar(os);
oar(o_podset);
oar(o_iserset);
oar(o_isplset);
oar(o_eserset);
oar(o_esplset);
}
std::set<int> i_podset;
std::set<StructInternalSerialize> i_iserset;
std::set<StructInternalSplit> i_isplset;
std::set<StructExternalSerialize> i_eserset;
std::set<StructExternalSplit> i_esplset;
std::istringstream is(os.str());
{
IArchive iar(is);
iar(i_podset);
iar(i_iserset);
iar(i_isplset);
iar(i_eserset);
iar(i_esplset);
}
check_collection(i_podset, o_podset);
check_collection(i_iserset, o_iserset);
check_collection(i_isplset, o_isplset);
check_collection(i_eserset, o_eserset);
check_collection(i_esplset, o_esplset);
}
}
#endif // CEREAL_TEST_SET_H_

89
unittests/stack.cpp
View File

@@ -24,102 +24,29 @@
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "common.hpp"
#include <boost/test/unit_test.hpp>
#define DOCTEST_CONFIG_IMPLEMENT_WITH_MAIN
#include "stack.hpp"
template <class IArchive, class OArchive>
void test_stack()
{
std::random_device rd;
std::mt19937 gen(rd());
TEST_SUITE("stack");
for(int ii=0; ii<100; ++ii)
{
std::stack<int> o_podstack;
for(int j=0; j<100; ++j)
o_podstack.push(random_value<int>(gen));
std::stack<StructInternalSerialize> o_iserstack;
for(int j=0; j<100; ++j)
o_iserstack.push({ random_value<int>(gen), random_value<int>(gen) });
std::stack<StructInternalSplit> o_isplstack;
for(int j=0; j<100; ++j)
o_isplstack.push({ random_value<int>(gen), random_value<int>(gen) });
std::stack<StructExternalSerialize> o_eserstack;
for(int j=0; j<100; ++j)
o_eserstack.push({ random_value<int>(gen), random_value<int>(gen) });
std::stack<StructExternalSplit> o_esplstack;
for(int j=0; j<100; ++j)
o_esplstack.push({ random_value<int>(gen), random_value<int>(gen) });
std::ostringstream os;
{
OArchive oar(os);
oar(o_podstack);
oar(o_iserstack);
oar(o_isplstack);
oar(o_eserstack);
oar(o_esplstack);
}
std::stack<int> i_podstack;
std::stack<StructInternalSerialize> i_iserstack;
std::stack<StructInternalSplit> i_isplstack;
std::stack<StructExternalSerialize> i_eserstack;
std::stack<StructExternalSplit> i_esplstack;
std::istringstream is(os.str());
{
IArchive iar(is);
iar(i_podstack);
iar(i_iserstack);
iar(i_isplstack);
iar(i_eserstack);
iar(i_esplstack);
}
auto & i_podstack_c = cereal::stack_detail::container(i_podstack);
auto & i_iserstack_c = cereal::stack_detail::container(i_iserstack);
auto & i_isplstack_c = cereal::stack_detail::container(i_isplstack);
auto & i_eserstack_c = cereal::stack_detail::container(i_eserstack);
auto & i_esplstack_c = cereal::stack_detail::container(i_esplstack);
auto & o_podstack_c = cereal::stack_detail::container(o_podstack);
auto & o_iserstack_c = cereal::stack_detail::container(o_iserstack);
auto & o_isplstack_c = cereal::stack_detail::container(o_isplstack);
auto & o_eserstack_c = cereal::stack_detail::container(o_eserstack);
auto & o_esplstack_c = cereal::stack_detail::container(o_esplstack);
BOOST_CHECK_EQUAL_COLLECTIONS(i_podstack_c.begin(), i_podstack_c.end(), o_podstack_c.begin(), o_podstack_c.end());
BOOST_CHECK_EQUAL_COLLECTIONS(i_iserstack_c.begin(), i_iserstack_c.end(), o_iserstack_c.begin(), o_iserstack_c.end());
BOOST_CHECK_EQUAL_COLLECTIONS(i_isplstack_c.begin(), i_isplstack_c.end(), o_isplstack_c.begin(), o_isplstack_c.end());
BOOST_CHECK_EQUAL_COLLECTIONS(i_eserstack_c.begin(), i_eserstack_c.end(), o_eserstack_c.begin(), o_eserstack_c.end());
BOOST_CHECK_EQUAL_COLLECTIONS(i_esplstack_c.begin(), i_esplstack_c.end(), o_esplstack_c.begin(), o_esplstack_c.end());
}
}
BOOST_AUTO_TEST_CASE( binary_stack )
TEST_CASE("binary_stack")
{
test_stack<cereal::BinaryInputArchive, cereal::BinaryOutputArchive>();
}
BOOST_AUTO_TEST_CASE( portable_binary_stack )
TEST_CASE("portable_binary_stack")
{
test_stack<cereal::PortableBinaryInputArchive, cereal::PortableBinaryOutputArchive>();
}
BOOST_AUTO_TEST_CASE( xml_stack )
TEST_CASE("xml_stack")
{
test_stack<cereal::XMLInputArchive, cereal::XMLOutputArchive>();
}
BOOST_AUTO_TEST_CASE( json_stack )
TEST_CASE("json_stack")
{
test_stack<cereal::JSONInputArchive, cereal::JSONOutputArchive>();
}
TEST_SUITE_END();

107
unittests/stack.hpp Normal file
View File

@@ -0,0 +1,107 @@
/*
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 cereal 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 RANDOLPH VOORHIES AND SHANE GRANT 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_STACK_H_
#define CEREAL_TEST_STACK_H_
#include "common.hpp"
template <class IArchive, class OArchive> inline
void test_stack()
{
std::random_device rd;
std::mt19937 gen(rd());
for(int ii=0; ii<100; ++ii)
{
std::stack<int> o_podstack;
for(int j=0; j<100; ++j)
o_podstack.push(random_value<int>(gen));
std::stack<StructInternalSerialize> o_iserstack;
for(int j=0; j<100; ++j)
o_iserstack.push({ random_value<int>(gen), random_value<int>(gen) });
std::stack<StructInternalSplit> o_isplstack;
for(int j=0; j<100; ++j)
o_isplstack.push({ random_value<int>(gen), random_value<int>(gen) });
std::stack<StructExternalSerialize> o_eserstack;
for(int j=0; j<100; ++j)
o_eserstack.push({ random_value<int>(gen), random_value<int>(gen) });
std::stack<StructExternalSplit> o_esplstack;
for(int j=0; j<100; ++j)
o_esplstack.push({ random_value<int>(gen), random_value<int>(gen) });
std::ostringstream os;
{
OArchive oar(os);
oar(o_podstack);
oar(o_iserstack);
oar(o_isplstack);
oar(o_eserstack);
oar(o_esplstack);
}
std::stack<int> i_podstack;
std::stack<StructInternalSerialize> i_iserstack;
std::stack<StructInternalSplit> i_isplstack;
std::stack<StructExternalSerialize> i_eserstack;
std::stack<StructExternalSplit> i_esplstack;
std::istringstream is(os.str());
{
IArchive iar(is);
iar(i_podstack);
iar(i_iserstack);
iar(i_isplstack);
iar(i_eserstack);
iar(i_esplstack);
}
auto & i_podstack_c = cereal::stack_detail::container(i_podstack);
auto & i_iserstack_c = cereal::stack_detail::container(i_iserstack);
auto & i_isplstack_c = cereal::stack_detail::container(i_isplstack);
auto & i_eserstack_c = cereal::stack_detail::container(i_eserstack);
auto & i_esplstack_c = cereal::stack_detail::container(i_esplstack);
auto & o_podstack_c = cereal::stack_detail::container(o_podstack);
auto & o_iserstack_c = cereal::stack_detail::container(o_iserstack);
auto & o_isplstack_c = cereal::stack_detail::container(o_isplstack);
auto & o_eserstack_c = cereal::stack_detail::container(o_eserstack);
auto & o_esplstack_c = cereal::stack_detail::container(o_esplstack);
check_collection(i_podstack_c, o_podstack_c );
check_collection(i_iserstack_c, o_iserstack_c);
check_collection(i_isplstack_c, o_isplstack_c);
check_collection(i_eserstack_c, o_eserstack_c);
check_collection(i_esplstack_c, o_esplstack_c);
}
}
#endif // CEREAL_TEST_STACK_H_

51
unittests/structs.cpp
View File

@@ -24,62 +24,29 @@
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "common.hpp"
#include <boost/test/unit_test.hpp>
#define DOCTEST_CONFIG_IMPLEMENT_WITH_MAIN
#include "structs.hpp"
template <class IArchive, class OArchive>
void test_structs()
{
std::random_device rd;
std::mt19937 gen(rd());
TEST_SUITE("structs");
for(int ii=0; ii<100; ++ii)
{
StructInternalSerialize o_iser = { random_value<int>(gen), random_value<int>(gen) };
StructInternalSplit o_ispl = { random_value<int>(gen), random_value<int>(gen) };
StructExternalSerialize o_eser = { random_value<int>(gen), random_value<int>(gen) };
StructExternalSplit o_espl = { random_value<int>(gen), random_value<int>(gen) };
std::ostringstream os;
{
OArchive oar(os);
oar( o_iser, o_ispl, o_eser, o_espl);
}
StructInternalSerialize i_iser;
StructInternalSplit i_ispl;
StructExternalSerialize i_eser;
StructExternalSplit i_espl;
std::istringstream is(os.str());
{
IArchive iar(is);
iar( i_iser, i_ispl, i_eser, i_espl);
}
BOOST_CHECK(i_iser == o_iser);
BOOST_CHECK(i_ispl == o_ispl);
BOOST_CHECK(i_eser == o_eser);
BOOST_CHECK(i_espl == o_espl);
}
}
BOOST_AUTO_TEST_CASE( binary_structs )
TEST_CASE("binary_structs")
{
test_structs<cereal::BinaryInputArchive, cereal::BinaryOutputArchive>();
}
BOOST_AUTO_TEST_CASE( portable_binary_structs )
TEST_CASE("portable_binary_structs")
{
test_structs<cereal::PortableBinaryInputArchive, cereal::PortableBinaryOutputArchive>();
}
BOOST_AUTO_TEST_CASE( xml_structs )
TEST_CASE("xml_structs")
{
test_structs<cereal::XMLInputArchive, cereal::XMLOutputArchive>();
}
BOOST_AUTO_TEST_CASE( json_structs )
TEST_CASE("json_structs")
{
test_structs<cereal::JSONInputArchive, cereal::JSONOutputArchive>();
}
TEST_SUITE_END();

68
unittests/structs.hpp Normal file
View File

@@ -0,0 +1,68 @@
/*
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 cereal 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 RANDOLPH VOORHIES AND SHANE GRANT 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_H_
#define CEREAL_TEST_STRUCTS_H_
#include "common.hpp"
template <class IArchive, class OArchive> inline
void test_structs()
{
std::random_device rd;
std::mt19937 gen(rd());
for(int ii=0; ii<100; ++ii)
{
StructInternalSerialize o_iser = { random_value<int>(gen), random_value<int>(gen) };
StructInternalSplit o_ispl = { random_value<int>(gen), random_value<int>(gen) };
StructExternalSerialize o_eser = { random_value<int>(gen), random_value<int>(gen) };
StructExternalSplit o_espl = { random_value<int>(gen), random_value<int>(gen) };
std::ostringstream os;
{
OArchive oar(os);
oar( o_iser, o_ispl, o_eser, o_espl);
}
StructInternalSerialize i_iser;
StructInternalSplit i_ispl;
StructExternalSerialize i_eser;
StructExternalSplit i_espl;
std::istringstream is(os.str());
{
IArchive iar(is);
iar( i_iser, i_ispl, i_eser, i_espl);
}
CHECK_EQ(i_iser, o_iser);
CHECK_EQ(i_ispl, o_ispl);
CHECK_EQ(i_eser, o_eser);
CHECK_EQ(i_espl, o_espl);
}
}
#endif // CEREAL_TEST_STRUCTS_H_

237
unittests/structs_minimal.cpp
View File

@@ -24,248 +24,29 @@
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "common.hpp"
#include <boost/test/unit_test.hpp>
#define DOCTEST_CONFIG_IMPLEMENT_WITH_MAIN
#include "structs_minimal.hpp"
class MemberMinimal
{
public:
MemberMinimal() = default;
MemberMinimal( std::string const & str ) : x( str ) {}
TEST_SUITE("structs_minimal");
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>
std::uint32_t save_minimal( Archive const &, NonMemberMinimal const & nmm )
{
return nmm.x;
}
template <class Archive>
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>
bool save_minimal( Archive const &, NonMemberMinimalVersioned const & nmm, std::uint32_t const )
{
return nmm.x;
}
template <class Archive>
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>
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>
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>
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>
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>
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>
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>
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>
void load_minimal( Archive const &, std::int32_t const & xx )
{
x = xx;
}
};
template <class IArchive, class OArchive>
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 );
}
BOOST_CHECK(o_struct.mm.x == i_struct.mm.x);
BOOST_CHECK_CLOSE(o_struct.mmv.x, i_struct.mmv.x, 1e-5);
BOOST_CHECK(o_struct.nmm.x == i_struct.nmm.x);
BOOST_CHECK(o_struct.nmmv.x == i_struct.nmmv.x);
BOOST_CHECK(o_struct2.x == i_struct2.x);
BOOST_CHECK(o_struct3.x == i_struct3.x);
}
}
BOOST_AUTO_TEST_CASE( binary_structs_minimal )
TEST_CASE("binary_structs_minimal")
{
test_structs_minimal<cereal::BinaryInputArchive, cereal::BinaryOutputArchive>();
}
BOOST_AUTO_TEST_CASE( portable_binary_structs_minimal )
TEST_CASE("portable_binary_structs_minimal")
{
test_structs_minimal<cereal::PortableBinaryInputArchive, cereal::PortableBinaryOutputArchive>();
}
BOOST_AUTO_TEST_CASE( xml_structs_minimal )
TEST_CASE("xml_structs_minimal")
{
test_structs_minimal<cereal::XMLInputArchive, cereal::XMLOutputArchive>();
}
BOOST_AUTO_TEST_CASE( json_structs_minimal )
TEST_CASE("json_structs_minimal")
{
test_structs_minimal<cereal::JSONInputArchive, cereal::JSONOutputArchive>();
}
TEST_SUITE_END();

254
unittests/structs_minimal.hpp Normal file
View File

@@ -0,0 +1,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 cereal 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 RANDOLPH VOORHIES AND SHANE GRANT 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_STACK_H_