mirror of
https://github.com/boostorg/multi_index.git
synced 2025-05-09 23:14:04 +00:00
137 lines
3.5 KiB
C++
137 lines
3.5 KiB
C++
/* Boost.MultiIndex test for copying and assignment.
|
|
*
|
|
* Copyright 2003-2006 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_copy_assignment.hpp"
|
|
|
|
#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
|
|
#include <algorithm>
|
|
#include <list>
|
|
#include <numeric>
|
|
#include <vector>
|
|
#include "pre_multi_index.hpp"
|
|
#include "employee.hpp"
|
|
#include <boost/test/test_tools.hpp>
|
|
|
|
using namespace boost::multi_index;
|
|
|
|
#if BOOST_WORKAROUND(__MWERKS__,<=0x3003)
|
|
/* The "ISO C++ Template Parser" option makes CW8.3 incorrectly fail at
|
|
* expressions of the form sizeof(x) where x is an array local to a
|
|
* template function.
|
|
*/
|
|
|
|
#pragma parse_func_templ off
|
|
#endif
|
|
|
|
template<typename Sequence>
|
|
static void test_assign(BOOST_EXPLICIT_TEMPLATE_TYPE(Sequence))
|
|
{
|
|
Sequence s;
|
|
|
|
int a[]={0,1,2,3,4,5};
|
|
std::size_t sa=sizeof(a)/sizeof(a[0]);
|
|
|
|
s.assign(&a[0],&a[sa]);
|
|
|
|
BOOST_CHECK(s.size()==sa&&std::equal(s.begin(),s.end(),&a[0]));
|
|
|
|
s.assign(&a[0],&a[sa]);
|
|
|
|
BOOST_CHECK(s.size()==sa&&std::equal(s.begin(),s.end(),&a[0]));
|
|
|
|
s.assign((std::size_t)18,37);
|
|
BOOST_CHECK(s.size()==18&&std::accumulate(s.begin(),s.end(),0)==666);
|
|
|
|
s.assign((std::size_t)12,167);
|
|
BOOST_CHECK(s.size()==12&&std::accumulate(s.begin(),s.end(),0)==2004);
|
|
}
|
|
|
|
#if BOOST_WORKAROUND(__MWERKS__,<=0x3003)
|
|
#pragma parse_func_templ reset
|
|
#endif
|
|
|
|
void test_copy_assignment()
|
|
{
|
|
employee_set es;
|
|
employee_set es2(es);
|
|
|
|
employee_set::allocator_type al=es.get_allocator();
|
|
al=get<1>(es).get_allocator();
|
|
al=get<2>(es).get_allocator();
|
|
al=get<3>(es).get_allocator();
|
|
al=get<4>(es).get_allocator();
|
|
al=get<5>(es).get_allocator();
|
|
|
|
BOOST_CHECK(es2.empty());
|
|
|
|
es2.insert(employee(0,"Joe",31,1123));
|
|
es2.insert(employee(1,"Robert",27,5601));
|
|
es2.insert(employee(2,"John",40,7889));
|
|
es2.insert(employee(2,"Aristotle",2388,3357)); /* clash */
|
|
es2.insert(employee(3,"Albert",20,9012));
|
|
es2.insert(employee(4,"John",57,1002));
|
|
es2.insert(employee(0,"Andrew",60,2302)); /* clash */
|
|
|
|
employee_set es3(es2);
|
|
|
|
BOOST_CHECK(es2==es3);
|
|
BOOST_CHECK(get<2>(es2)==get<2>(es3));
|
|
BOOST_CHECK(get<3>(es2)==get<3>(es3));
|
|
BOOST_CHECK(get<5>(es2)==get<5>(es3));
|
|
|
|
employee_set es4;
|
|
employee_set_by_name& i1=get<name>(es4);
|
|
i1=get<1>(es2);
|
|
|
|
BOOST_CHECK(es4==es2);
|
|
|
|
employee_set es5;
|
|
employee_set_by_age& i2=get<age>(es5);
|
|
i2=get<2>(es2);
|
|
|
|
BOOST_CHECK(i2==get<2>(es2));
|
|
|
|
employee_set es6;
|
|
employee_set_as_inserted& i3=get<as_inserted>(es6);
|
|
i3=get<3>(es2);
|
|
|
|
BOOST_CHECK(i3==get<3>(es2));
|
|
|
|
employee_set es7;
|
|
employee_set_randomly& i5=get<randomly>(es7);
|
|
i5=get<5>(es2);
|
|
|
|
BOOST_CHECK(i5==get<5>(es2));
|
|
|
|
std::list<employee> l;
|
|
l.push_back(employee(3,"Anna",31,5388));
|
|
l.push_back(employee(1,"Rachel",27,9012));
|
|
l.push_back(employee(2,"Agatha",40,1520));
|
|
|
|
#if BOOST_WORKAROUND(BOOST_MSVC,<1300)
|
|
employee_set es8;
|
|
es8.insert(l.begin(),l.end());
|
|
#else
|
|
employee_set es8(l.begin(),l.end());
|
|
#endif
|
|
|
|
l.sort();
|
|
|
|
BOOST_CHECK(es8.size()==l.size()&&
|
|
std::equal(es8.begin(),es8.end(),l.begin()));
|
|
|
|
/* MSVC++ 6.0 chokes on test_assign without this explicit instantiation */
|
|
multi_index_container<int,indexed_by<sequenced<> > > s1;
|
|
test_assign<multi_index_container<int,indexed_by<sequenced<> > > >();
|
|
|
|
multi_index_container<int,indexed_by<random_access<> > > s2;
|
|
test_assign<multi_index_container<int,indexed_by<random_access<> > > >();
|
|
}
|