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
|
//////////////////////////////////////////////////////////////////////////////
//
// (C) Copyright Ion Gaztanaga 2004-2013. 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/container for documentation.
//
//////////////////////////////////////////////////////////////////////////////
#include <boost/container/devector.hpp>
#include <boost/container/allocator.hpp>
#include <boost/container/detail/next_capacity.hpp>
#include <boost/core/lightweight_test.hpp>
using namespace boost::container;
template<class Unsigned, class DevectorType>
void test_stored_size_type_impl()
{
#ifndef BOOST_NO_EXCEPTIONS
DevectorType v;
typedef typename DevectorType::size_type size_type;
typedef typename DevectorType::value_type value_type;
size_type const max = Unsigned(-1);
v.resize(5);
v.resize(max);
BOOST_TEST_THROWS(v.resize(max+1), std::exception);
BOOST_TEST_THROWS(v.push_back(value_type(1)), std::exception);
BOOST_TEST_THROWS(v.insert(v.begin(), value_type(1)), std::exception);
BOOST_TEST_THROWS(v.emplace(v.begin(), value_type(1)),std::exception);
BOOST_TEST_THROWS(v.reserve(max+1), std::exception);
BOOST_TEST_THROWS(DevectorType v2(max+1), std::exception);
#endif
}
template<class Unsigned>
void test_stored_size_type()
{
#if !defined(BOOST_NO_CXX11_TEMPLATE_ALIASES)
using options_t = devector_options_t< stored_size<Unsigned> >;
#else
typedef typename devector_options
< stored_size<Unsigned> >::type options_t;
#endif
//Test first with a typical allocator
{
typedef devector<unsigned char, new_allocator<unsigned char>, options_t> devector_t;
test_stored_size_type_impl<Unsigned, devector_t>();
}
//Test with a V2 allocator
{
typedef devector<unsigned char, allocator<unsigned char>, options_t> devector_t;
test_stored_size_type_impl<Unsigned, devector_t>();
}
//Test size reduction
{
typedef devector<unsigned char, void, options_t> devector_t;
BOOST_CONTAINER_STATIC_ASSERT( sizeof(Unsigned) >= sizeof(std::size_t) ||
sizeof(devector_t) < sizeof(devector<unsigned char>) );
}
}
void test_growth_factor_50()
{
#if !defined(BOOST_NO_CXX11_TEMPLATE_ALIASES)
using options_t = devector_options_t< growth_factor<growth_factor_50> >;
#else
typedef devector_options
< growth_factor<growth_factor_50> >::type options_t;
#endif
devector<int, new_allocator<int>, options_t> v(5u, 0);
std::size_t old_capacity = v.size() + v.back_free_capacity() + v.front_free_capacity();
v.push_back(0);
std::size_t new_capacity = v.size() + v.back_free_capacity() + v.front_free_capacity();
BOOST_TEST(new_capacity == old_capacity + old_capacity/2);
}
void test_growth_factor_60()
{
#if !defined(BOOST_NO_CXX11_TEMPLATE_ALIASES)
using options_t = devector_options_t< growth_factor<growth_factor_60> >;
#else
typedef devector_options
< growth_factor<growth_factor_60> >::type options_t;
#endif
devector<int, new_allocator<int>, options_t> v(5u, 0);
std::size_t old_capacity = v.size()+v.back_free_capacity()+v.front_free_capacity();
v.push_back(0);
std::size_t new_capacity = v.size() + v.back_free_capacity() + v.front_free_capacity();
BOOST_TEST(new_capacity == old_capacity + 3*old_capacity/5);
}
void test_growth_factor_100()
{
#if !defined(BOOST_NO_CXX11_TEMPLATE_ALIASES)
using options_t = devector_options_t< growth_factor<growth_factor_100> >;
#else
typedef devector_options
< growth_factor<growth_factor_100> >::type options_t;
#endif
devector<int, new_allocator<int>, options_t> v(5,0);
std::size_t old_capacity = v.size() + v.back_free_capacity() + v.front_free_capacity();
v.push_back(0);
std::size_t new_capacity = v.size() + v.back_free_capacity() + v.front_free_capacity();
BOOST_TEST(new_capacity == 2*old_capacity);
}
void test_stored_reloc_on_66()
{
#if !defined(BOOST_NO_CXX11_TEMPLATE_ALIASES)
using options_t = devector_options_t< relocate_on_66 >;
#else
typedef devector_options
< relocate_on_66 >::type options_t;
#endif
const std::size_t buffer_size = 32u;
const std::size_t initial_side = buffer_size/2u;
devector<int, new_allocator<int>, options_t> v(initial_side, initial_side, reserve_only_tag_t());
const int* buffer = v.data();
const int* buffer_start = v.data() - initial_side;
std::size_t old_cp = v.capacity();
for ( int i = 0u; i != (int)initial_side; ++i) {
v.push_back(i);
}
BOOST_TEST(v.back_free_capacity() == 0);
BOOST_TEST(buffer == v.data());
v.push_back(0);
BOOST_TEST(v.size() == initial_side + 1u);
//Relocation -> 9 elements on the left, 8 elements on the right
BOOST_TEST(v.front_free_capacity() == (buffer_size - v.size())/2u);
BOOST_TEST(v.data() == buffer_start + v.front_free_capacity());
BOOST_TEST(v.capacity() == old_cp);
//Reach the back limit again
for (int i = 0u, max = (int)v.back_free_capacity(); i != max; ++i) {
v.push_back(-i);
}
BOOST_TEST(v.back_free_capacity() == 0);
//New insertion should reallocate
v.push_back(-1);
BOOST_TEST(v.back_free_capacity() > initial_side/2u);
BOOST_TEST(v.capacity() > old_cp);
}
void test_stored_reloc_on_90()
{
#if !defined(BOOST_NO_CXX11_TEMPLATE_ALIASES)
using options_t = devector_options_t< relocate_on_90 >;
#else
typedef devector_options< relocate_on_90 >::type options_t;
#endif
const std::size_t buffer_size = 32u;
const std::size_t initial_side = buffer_size/2u;
devector<int, new_allocator<int>, options_t> v(initial_side, initial_side, reserve_only_tag_t());
const int* buffer = v.data();
const int* buffer_start = v.data() - initial_side;
std::size_t old_cp = v.capacity();
for ( int i = 0u; i != (int)initial_side; ++i) {
v.push_back(i);
}
BOOST_TEST(v.back_free_capacity() == 0);
BOOST_TEST(buffer == v.data());
v.push_back(0);
BOOST_TEST(v.size() == initial_side + 1u);
//Relocation -> 9 elements on the left, 8 elements on the right
BOOST_TEST(v.front_free_capacity() == (buffer_size - v.size())/2u);
BOOST_TEST(v.data() == buffer_start + v.front_free_capacity());
BOOST_TEST(v.capacity() == old_cp);
//Reach the back limit again
for (int i = 0u, max = (int)v.back_free_capacity(); i != max; ++i) {
v.push_back(-i);
}
BOOST_TEST(v.back_free_capacity() == 0);
//New insertion should relocate again
v.push_back(-1);
BOOST_TEST(v.capacity() == old_cp);
BOOST_TEST(v.front_free_capacity() == (buffer_size - v.size()) / 2u);
BOOST_TEST(v.data() == buffer_start + v.front_free_capacity());
//Reach the back limit again
for (int i = 0u, max = (int)v.back_free_capacity(); i != max; ++i) {
v.push_back(-i);
}
BOOST_TEST(v.back_free_capacity() == 0);
//Last insertion should reallocate
v.push_back(-1);
BOOST_TEST(v.capacity() > old_cp);
}
int main()
{
test_growth_factor_50();
test_growth_factor_60();
test_growth_factor_100();
test_stored_size_type<unsigned char>();
test_stored_size_type<unsigned short>();
test_stored_reloc_on_66();
test_stored_reloc_on_90();
return ::boost::report_errors();
}
|
