1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
|
//
// Boost.Pointer Container
//
// Copyright Thorsten Ottosen 2003-2005. 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)
//
// For more information, see http://www.boost.org/libs/ptr_container/
//
#include "test_data.hpp"
#include <boost/range/iterator_range.hpp>
#include <boost/bind.hpp>
template< typename C, typename B, typename T >
void reversible_container_test();
template< class IntContainer >
void algorithms_test();
template< typename C, typename B, typename T >
void reversible_container_test()
{
using namespace boost;
BOOST_MESSAGE( "starting reversible container test" );
enum { max_cnt = 10, size = 100 };
C c;
BOOST_CHECK( c.size() == 0 );
c.push_back( new T );
BOOST_CHECK( c.size() == 1 );
const C c2( c.clone() );
BOOST_CHECK( c2.size() == c.size() );
C c3( c.begin(), c.end() );
BOOST_CHECK( c.size() == c3.size() );
c.assign( c3.begin(), c3.end() );
BOOST_CHECK( c.size() == c3.size() );
c.assign( c3 );
BOOST_MESSAGE( "finished construction test" );
BOOST_DEDUCED_TYPENAME C::allocator_type alloc = c.get_allocator();
hide_warning(alloc);
BOOST_DEDUCED_TYPENAME C::iterator i = c.begin();
BOOST_DEDUCED_TYPENAME C::const_iterator ci = c2.begin();
BOOST_DEDUCED_TYPENAME C::iterator i2 = c.end();
BOOST_DEDUCED_TYPENAME C::const_iterator ci2 = c2.begin();
BOOST_DEDUCED_TYPENAME C::reverse_iterator ri = c.rbegin();
BOOST_DEDUCED_TYPENAME C::const_reverse_iterator cri = c2.rbegin();
BOOST_DEDUCED_TYPENAME C::reverse_iterator rv2 = c.rend();
BOOST_DEDUCED_TYPENAME C::const_reverse_iterator cvr2 = c2.rend();
BOOST_MESSAGE( "finished iterator test" );
BOOST_DEDUCED_TYPENAME C::size_type s = c.size();
hide_warning(s);
BOOST_DEDUCED_TYPENAME C::size_type s2 = c.max_size();
hide_warning(s2);
c.push_back( new T );
bool b = c.empty();
BOOST_CHECK( !c.empty() );
b = is_null( c.begin() );
BOOST_CHECK( b == false );
BOOST_DEDUCED_TYPENAME C::reference r = c.front();
hide_warning(r);
BOOST_DEDUCED_TYPENAME C::const_reference cr = c2.front();
hide_warning(cr);
BOOST_DEDUCED_TYPENAME C::reference r2 = c.back();
hide_warning(r2);
BOOST_DEDUCED_TYPENAME C::const_reference cr2 = c2.back();
hide_warning(cr2);
BOOST_MESSAGE( "finished accessors test" );
c.push_back( new T );
c.pop_back();
c.insert( c.end(), new T );
#ifdef BOOST_NO_SFINAE
#else
c.insert( c.end(), c3 );
#endif
c3.insert( c3.end(), c.begin(), c.end() );
c.erase( c.begin() );
c3.erase( c3.begin(), c3.end() );
BOOST_CHECK( c3.empty() );
c.swap( c3 );
BOOST_CHECK( !c3.empty() );
c3.clear();
BOOST_CHECK( c3.empty() );
C c4;
c4.swap(c3);
#ifdef BOOST_NO_SFINAE
#else
swap(c4,c3);
#endif
BOOST_MESSAGE( "finished modifiers test" );
c.push_back( new T ); c.push_back( new T ); c.push_back( new T );
typedef BOOST_DEDUCED_TYPENAME C::auto_type auto_type;
#ifdef BOOST_NO_SFINAE
#else
auto_type ptr = c.release( c.begin() );
#endif
std::auto_ptr<C> ap = c.release();
c = c2.clone();
BOOST_CHECK( !c.empty() );
auto_type ptr2 = c.replace(c.begin(), new T );
BOOST_MESSAGE( "finished release/clone/replace test" );
c3.push_back( new T );
c3.push_back( new T );
c3.push_back( new T );
c.transfer( c.begin(), c3.begin(), c3 );
c.transfer( c.end(), c3.begin(), c3.end(), c3 );
#ifdef BOOST_NO_SFINAE
#else
c.transfer( c.end(), boost::make_iterator_range( c3 ), c3 );
BOOST_CHECK( c3.empty() );
BOOST_CHECK( !c.empty() );
#endif
c3.transfer( c3.begin(), c );
BOOST_CHECK( !c3.empty() );
BOOST_CHECK( c.empty() );
BOOST_MESSAGE( "finished transfer test" );
}
#include <boost/assign/list_inserter.hpp>
#include <iostream>
template< class Compare, class C >
bool is_sorted( const C& c )
{
if( c.size() < 2 )
return true;
typename C::const_iterator prev = c.begin(),
e = c.end(),
next = prev;
Compare pred;
for( ; next != e ; )
{
prev = next;
++next;
if( next == c.end() )
return true;
if( !pred(*prev,*next) )
return false;
}
return true;
}
struct equal_to_int
{
int i_;
equal_to_int( int i ) : i_(i)
{ }
bool operator()( int i ) const
{
return i_ == i;
}
};
template< class IntContainer >
void random_access_algorithms_test()
{
IntContainer c;
assign::push_back( c )
( new int(1) )
( new int(3) )
( new int(6) )
( new int(7) )
( new int(2) )
( new int(2) )
( new int(0) )
( new int(6) )
( new int(3) );
c.sort();
BOOST_CHECK( is_sorted< std::less_equal<int> >( c ) );
BOOST_CHECK_EQUAL( c.size(), 9u );
c.unique();
BOOST_CHECK_EQUAL( c.size(), 6u );
#ifdef PTR_LIST_TEST
BOOST_CHECK( c.front() == 0 );
BOOST_CHECK( c.back() == 7 );
#else
BOOST_CHECK( c[0] == 0 );
BOOST_CHECK( c[1] == 1 );
BOOST_CHECK( c[2] == 2 );
BOOST_CHECK( c[3] == 3 );
BOOST_CHECK( c[4] == 6 );
BOOST_CHECK( c[5] == 7 );
#endif
c.erase_if( equal_to_int(1) );
BOOST_CHECK_EQUAL( c.size(), 5u );
#ifdef PTR_LIST_TEST
BOOST_CHECK_EQUAL( c.front(), 0 );
#else
BOOST_CHECK_EQUAL( c[0], 0 );
BOOST_CHECK_EQUAL( c[1], 2 );
#endif
c.erase_if( equal_to_int(7) );
BOOST_CHECK_EQUAL( c.size(), 4u );
BOOST_CHECK_EQUAL( c.back(), 6 );
// C = [0,2,3,6]
IntContainer c2;
assign::push_back( c2 )
( new int(-1) )
( new int(1) )
( new int(4) )
( new int(5) )
( new int(7) );
BOOST_CHECK( c2.size() == 5u );
c.merge( c2 );
BOOST_CHECK( c2.empty() );
BOOST_CHECK( c.size() == 9u );
BOOST_CHECK( is_sorted< std::less_equal<int> >( c ) );
}
|
