mirror of
https://github.com/boostorg/multi_index.git
synced 2025-05-11 13:24:04 +00:00
225 lines
4.9 KiB
C++
225 lines
4.9 KiB
C++
/* Boost.MultiIndex test for serialization.
|
|
*
|
|
* Copyright 2003-2004 Joaquín M López Muñoz.
|
|
* Distributed under 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)
|
|
*
|
|
* See http://www.boost.org/libs/multi_index for library home page.
|
|
*/
|
|
|
|
#include "test_serialization.hpp"
|
|
|
|
#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
|
|
#include <boost/archive/text_oarchive.hpp>
|
|
#include <boost/archive/text_iarchive.hpp>
|
|
#include "pre_multi_index.hpp"
|
|
#include <boost/multi_index_container.hpp>
|
|
#include <boost/multi_index/ordered_index.hpp>
|
|
#include <boost/multi_index/sequenced_index.hpp>
|
|
#include <boost/multi_index/key_extractors.hpp>
|
|
#include <boost/noncopyable.hpp>
|
|
#include <boost/test/test_tools.hpp>
|
|
#include <sstream>
|
|
#include <string>
|
|
#include "pair_of_ints.hpp"
|
|
|
|
using namespace boost::multi_index;
|
|
|
|
template<int N>
|
|
struct all_indices_equal_helper
|
|
{
|
|
template<class MultiIndexContainer>
|
|
static bool compare(
|
|
const MultiIndexContainer& m1,const MultiIndexContainer& m2)
|
|
{
|
|
if(!(get<N>(m1)==get<N>(m2))){
|
|
return false;
|
|
}
|
|
return all_indices_equal_helper<N-1>::compare(m1,m2);
|
|
}
|
|
};
|
|
|
|
template<>
|
|
struct all_indices_equal_helper<0>
|
|
{
|
|
template<class MultiIndexContainer>
|
|
static bool compare(
|
|
const MultiIndexContainer& m1,const MultiIndexContainer& m2)
|
|
{
|
|
return true;
|
|
}
|
|
};
|
|
|
|
template<class MultiIndexContainer>
|
|
bool all_indices_equal(
|
|
const MultiIndexContainer& m1,const MultiIndexContainer& m2)
|
|
{
|
|
BOOST_STATIC_CONSTANT(int,
|
|
N=boost::mpl::size<
|
|
BOOST_DEDUCED_TYPENAME MultiIndexContainer::index_type_list>::type::value);
|
|
|
|
return all_indices_equal_helper<N-1>::compare(m1,m2);
|
|
}
|
|
|
|
template<class MultiIndexContainer>
|
|
void test_serialization(const MultiIndexContainer& m)
|
|
{
|
|
std::ostringstream oss;
|
|
{
|
|
boost::archive::text_oarchive oa(oss);
|
|
oa<<boost::serialization::make_nvp("container",m);
|
|
}
|
|
|
|
std::istringstream iss(oss.str());
|
|
MultiIndexContainer m2;
|
|
{
|
|
boost::archive::text_iarchive ia(iss);
|
|
ia>>boost::serialization::make_nvp("container",m2);
|
|
}
|
|
|
|
BOOST_CHECK(all_indices_equal(m,m2));
|
|
}
|
|
|
|
struct container_holder
|
|
{
|
|
typedef multi_index_container<
|
|
int,
|
|
indexed_by<
|
|
sequenced<>
|
|
>
|
|
> multi_index_t;
|
|
|
|
container_holder(const multi_index_t& m_):m(m_){}
|
|
|
|
bool operator==(const container_holder& x)const
|
|
{
|
|
return m==x.m;
|
|
}
|
|
|
|
multi_index_t m;
|
|
|
|
private:
|
|
friend class boost::serialization::access;
|
|
|
|
template<class Archive>
|
|
void serialize(Archive& ar,const unsigned int)
|
|
{
|
|
ar&boost::serialization::make_nvp("container",m);
|
|
}
|
|
};
|
|
|
|
namespace boost{
|
|
|
|
namespace serialization{
|
|
|
|
template<class Archive>
|
|
inline void load_construct_data(Archive& ar,container_holder* p,unsigned int)
|
|
{
|
|
::new(p)container_holder(container_holder::multi_index_t());
|
|
}
|
|
|
|
} /* namespace serialization */
|
|
|
|
} /* namespace boost*/
|
|
|
|
void test_serialization()
|
|
{
|
|
{
|
|
typedef multi_index_container<
|
|
int,
|
|
indexed_by<
|
|
sequenced<>,
|
|
sequenced<>
|
|
>
|
|
> multi_index_t;
|
|
|
|
multi_index_t m;
|
|
for(int i=0;i<100;++i)m.push_back(i);
|
|
m.reverse();
|
|
test_serialization(m);
|
|
|
|
m.clear();
|
|
for(int j=50;j<100;++j)m.push_back(j);
|
|
for(int k=0;k<50;++k)m.push_back(k);
|
|
m.sort();
|
|
test_serialization(m);
|
|
}
|
|
{
|
|
typedef multi_index_container<
|
|
int,
|
|
indexed_by<
|
|
sequenced<>,
|
|
ordered_non_unique<identity<int> >
|
|
>
|
|
> multi_index_t;
|
|
|
|
multi_index_t m;
|
|
for(int i=0;i<100;++i){
|
|
m.push_back(i);
|
|
m.push_back(i);
|
|
m.push_back(i);
|
|
}
|
|
m.reverse();
|
|
test_serialization(m);
|
|
}
|
|
{
|
|
typedef multi_index_container<
|
|
pair_of_ints,
|
|
indexed_by<
|
|
ordered_unique<
|
|
BOOST_MULTI_INDEX_MEMBER(pair_of_ints,int,first)
|
|
>,
|
|
ordered_non_unique<
|
|
BOOST_MULTI_INDEX_MEMBER(pair_of_ints,int,second)
|
|
>,
|
|
sequenced<>
|
|
>
|
|
> multi_index_t;
|
|
|
|
multi_index_t m;
|
|
test_serialization(m);
|
|
|
|
m.insert(pair_of_ints(4,0));
|
|
test_serialization(m);
|
|
|
|
m.insert(pair_of_ints(3,1));
|
|
m.insert(pair_of_ints(2,1));
|
|
test_serialization(m);
|
|
|
|
m.insert(pair_of_ints(1,1));
|
|
test_serialization(m);
|
|
|
|
m.insert(pair_of_ints(0,0));
|
|
test_serialization(m);
|
|
|
|
m.insert(pair_of_ints(5,1));
|
|
m.insert(pair_of_ints(7,1));
|
|
m.insert(pair_of_ints(6,1));
|
|
test_serialization(m);
|
|
|
|
m.insert(pair_of_ints(8,1));
|
|
m.insert(pair_of_ints(9,1));
|
|
m.insert(pair_of_ints(12,1));
|
|
m.insert(pair_of_ints(11,1));
|
|
m.insert(pair_of_ints(10,1));
|
|
test_serialization(m);
|
|
}
|
|
{
|
|
typedef multi_index_container<
|
|
container_holder,
|
|
indexed_by<
|
|
sequenced<>
|
|
>
|
|
> multi_index_t;
|
|
|
|
multi_index_t m;
|
|
container_holder::multi_index_t c1,c2;
|
|
for(int i=0;i<100;++i)c1.push_back(i);
|
|
for(int j=100;j<200;++j)c2.push_back(j);
|
|
m.push_back(container_holder(c1));
|
|
m.push_back(container_holder(c2));
|
|
test_serialization(m);
|
|
}
|
|
}
|