]>
git.proxmox.com Git - ceph.git/blob - ceph/src/boost/libs/multi_index/test/test_rearrange.cpp
1 /* Boost.MultiIndex test for rearrange operations.
3 * Copyright 2003-2013 Joaquin M Lopez Munoz.
4 * Distributed under the Boost Software License, Version 1.0.
5 * (See accompanying file LICENSE_1_0.txt or copy at
6 * http://www.boost.org/LICENSE_1_0.txt)
8 * See http://www.boost.org/libs/multi_index for library home page.
11 #include "test_rearrange.hpp"
13 #include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
16 #include <boost/detail/lightweight_test.hpp>
17 #include "pre_multi_index.hpp"
18 #include <boost/multi_index_container.hpp>
19 #include <boost/multi_index/sequenced_index.hpp>
20 #include <boost/multi_index/random_access_index.hpp>
21 #include <boost/next_prior.hpp>
22 #include <boost/preprocessor/seq/enum.hpp>
23 #include <boost/ref.hpp>
26 using namespace boost::multi_index
;
29 #define CHECK_EQUAL(p,check_seq) \
31 int v[]={BOOST_PP_SEQ_ENUM(check_seq)};\
32 std::size_t size_v=sizeof(v)/sizeof(int);\
33 BOOST_TEST(std::size_t(std::distance((p).begin(),(p).end()))==size_v);\
34 BOOST_TEST(std::equal((p).begin(),(p).end(),&v[0]));\
37 #undef CHECK_VOID_RANGE
38 #define CHECK_VOID_RANGE(p) BOOST_TEST((p).first==(p).second)
40 #if BOOST_WORKAROUND(__MWERKS__,<=0x3003)
41 /* The "ISO C++ Template Parser" option makes CW8.3 incorrectly fail at
42 * expressions of the form sizeof(x) where x is an array local to a
46 #pragma parse_func_templ off
49 template<typename Sequence
>
50 static void local_test_rearrange()
52 typedef typename
Sequence::iterator iterator
;
53 typedef typename
Sequence::value_type value_type
;
67 sc
.relocate(sc
.begin(),it
);
68 CHECK_EQUAL(sc
,(3)(0)(1)(2)(4)(5));
69 BOOST_TEST(it
==sc
.begin());
72 CHECK_EQUAL(sc
,(3)(0)(1)(2)(4)(5));
75 sc
.relocate(sc
.end(),it
,sc
.end());
76 CHECK_EQUAL(sc
,(3)(0)(1)(2)(4)(5));
78 sc
.relocate(sc
.begin(),it
,it
);
79 CHECK_EQUAL(sc
,(3)(0)(1)(2)(4)(5));
85 sc
.relocate(it2
,it
,sc
.end());
86 CHECK_EQUAL(sc
,(3)(2)(4)(5)(0)(1));
87 BOOST_TEST(std::distance(it
,it2
)==3);
89 sc
.relocate(boost::prior(sc
.end()),it
,it2
);
90 CHECK_EQUAL(sc
,(3)(0)(2)(4)(5)(1));
92 std::vector
<boost::reference_wrapper
<const value_type
> > v
;
93 for(iterator it3
=sc
.begin();it3
!=sc
.end();++it3
){
94 v
.push_back(boost::cref(*it3
));
97 sc
.rearrange(v
.begin());
98 BOOST_TEST(std::equal(sc
.begin(),sc
.end(),v
.begin()));
100 std::reverse(v
.begin(),v
.end());
101 sc
.rearrange(v
.begin());
102 BOOST_TEST(std::equal(sc
.begin(),sc
.end(),v
.begin()));
104 std::sort(v
.begin(),v
.end());
105 sc
.rearrange(v
.begin());
106 BOOST_TEST(std::equal(sc
.begin(),sc
.end(),v
.begin()));
108 std::reverse(v
.begin(),v
.begin()+v
.size()/2);
109 sc
.rearrange(v
.begin());
110 BOOST_TEST(std::equal(sc
.begin(),sc
.end(),v
.begin()));
113 #if BOOST_WORKAROUND(__MWERKS__,<=0x3003)
114 #pragma parse_func_templ reset
117 void test_rearrange()
119 typedef multi_index_container
<
121 indexed_by
<sequenced
<> >
124 local_test_rearrange
<int_list
>();
126 typedef multi_index_container
<
128 indexed_by
<random_access
<> >
131 local_test_rearrange
<int_vector
>();