124 lines
3.6 KiB
C++
124 lines
3.6 KiB
C++
/////////1/////////2/////////3/////////4/////////5/////////6/////////7/////////8
|
|
// test_set.cpp
|
|
|
|
// (C) Copyright 2002 Robert Ramey - http://www.rrsd.com .
|
|
// (C) Copyright 2014 Jim Bell
|
|
// Use, modification and distribution is subject to the Boost Software
|
|
// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
|
|
// http://www.boost.org/LICENSE_1_0.txt)
|
|
|
|
// should pass compilation and execution
|
|
|
|
#include <cstddef> // NULLsize_t
|
|
#include <cstdio> // remove
|
|
#include <fstream>
|
|
|
|
#include <algorithm> // std::copy
|
|
#include <vector>
|
|
|
|
#include <boost/config.hpp>
|
|
#if defined(BOOST_NO_STDC_NAMESPACE)
|
|
namespace std{
|
|
using ::size_t;
|
|
}
|
|
#endif
|
|
|
|
#include <boost/detail/workaround.hpp>
|
|
#if defined(BOOST_NO_STDC_NAMESPACE)
|
|
namespace std{
|
|
using ::remove;
|
|
}
|
|
#endif
|
|
|
|
#include <boost/archive/archive_exception.hpp>
|
|
|
|
#include "test_tools.hpp"
|
|
|
|
#include <boost/serialization/nvp.hpp>
|
|
#include <boost/serialization/set.hpp>
|
|
|
|
#include "A.hpp"
|
|
#include "A.ipp"
|
|
|
|
#include <boost/serialization/boost_unordered_set.hpp>
|
|
#include <functional> // requires changeset [69520]; Ticket #5254
|
|
|
|
namespace boost {
|
|
template<>
|
|
struct hash<A> {
|
|
std::size_t operator()(const A& a) const {
|
|
return static_cast<std::size_t>(a);
|
|
}
|
|
};
|
|
} // namespace boost
|
|
|
|
void
|
|
test_unordered_set(){
|
|
const char * testfile = boost::archive::tmpnam(NULL);
|
|
BOOST_REQUIRE(NULL != testfile);
|
|
|
|
// test array of objects
|
|
boost::unordered_set<A> anunordered_set;
|
|
A a, a1;
|
|
anunordered_set.insert(a);
|
|
anunordered_set.insert(a1);
|
|
{
|
|
test_ostream os(testfile, TEST_STREAM_FLAGS);
|
|
test_oarchive oa(os, TEST_ARCHIVE_FLAGS);
|
|
oa << boost::serialization::make_nvp("anunordered_set", anunordered_set);
|
|
}
|
|
boost::unordered_set<A> anunordered_set1;
|
|
{
|
|
test_istream is(testfile, TEST_STREAM_FLAGS);
|
|
test_iarchive ia(is, TEST_ARCHIVE_FLAGS);
|
|
ia >> boost::serialization::make_nvp("anunordered_set", anunordered_set1);
|
|
}
|
|
std::vector<A> tvec, tvec1;
|
|
tvec.clear();
|
|
tvec1.clear();
|
|
std::copy(anunordered_set.begin(), anunordered_set.end(), std::back_inserter(tvec));
|
|
std::sort(tvec.begin(), tvec.end());
|
|
std::copy(anunordered_set1.begin(), anunordered_set1.end(), std::back_inserter(tvec1));
|
|
std::sort(tvec1.begin(), tvec1.end());
|
|
BOOST_CHECK(tvec == tvec1);
|
|
std::remove(testfile);
|
|
}
|
|
|
|
void
|
|
test_unordered_multiset(){
|
|
const char * testfile = boost::archive::tmpnam(NULL);
|
|
BOOST_REQUIRE(NULL != testfile);
|
|
|
|
boost::unordered_multiset<A> anunordered_multiset;
|
|
anunordered_multiset.insert(A());
|
|
anunordered_multiset.insert(A());
|
|
{
|
|
test_ostream os(testfile, TEST_STREAM_FLAGS);
|
|
test_oarchive oa(os, TEST_ARCHIVE_FLAGS);
|
|
oa << boost::serialization::make_nvp("anunordered_multiset", anunordered_multiset);
|
|
}
|
|
boost::unordered_multiset<A> anunordered_multiset1;
|
|
{
|
|
test_istream is(testfile, TEST_STREAM_FLAGS);
|
|
test_iarchive ia(is, TEST_ARCHIVE_FLAGS);
|
|
ia >> boost::serialization::make_nvp("anunordered_multiset", anunordered_multiset1);
|
|
}
|
|
|
|
std::vector<A> tvec, tvec1;
|
|
tvec.clear();
|
|
tvec1.clear();
|
|
std::copy(anunordered_multiset.begin(), anunordered_multiset.end(), std::back_inserter(tvec));
|
|
std::sort(tvec.begin(), tvec.end());
|
|
std::copy(anunordered_multiset1.begin(), anunordered_multiset1.end(), std::back_inserter(tvec1));
|
|
std::sort(tvec1.begin(), tvec1.end());
|
|
BOOST_CHECK(tvec == tvec1);
|
|
|
|
std::remove(testfile);
|
|
}
|
|
|
|
int test_main( int /* argc */, char* /* argv */[] ){
|
|
test_unordered_set();
|
|
test_unordered_multiset();
|
|
return EXIT_SUCCESS;
|
|
}
|