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
|
//===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is dual licensed under the MIT and the University of Illinois Open
// Source Licenses. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
// <deque>
// deque(size_type n, const value_type& v, const allocator_type& a);
#include <deque>
#include <cassert>
#include <cstddef>
#include "min_allocator.h"
template <class T, class Allocator>
void
test(unsigned n, const T& x, const Allocator& a)
{
typedef std::deque<T, Allocator> C;
typedef typename C::const_iterator const_iterator;
C d(n, x, a);
assert(d.get_allocator() == a);
assert(d.size() == n);
assert(static_cast<std::size_t>(distance(d.begin(), d.end())) == d.size());
for (const_iterator i = d.begin(), e = d.end(); i != e; ++i)
assert(*i == x);
}
int main()
{
{
std::allocator<int> a;
test(0, 5, a);
test(1, 10, a);
test(10, 11, a);
test(1023, -11, a);
test(1024, 25, a);
test(1025, 0, a);
test(2047, 110, a);
test(2048, -500, a);
test(2049, 654, a);
test(4095, 78, a);
test(4096, 1165, a);
test(4097, 157, a);
}
#if TEST_STD_VER >= 11
{
min_allocator<int> a;
test(0, 5, a);
test(1, 10, a);
test(10, 11, a);
test(1023, -11, a);
test(1024, 25, a);
test(1025, 0, a);
test(2047, 110, a);
test(2048, -500, a);
test(2049, 654, a);
test(4095, 78, a);
test(4096, 1165, a);
test(4097, 157, a);
}
#endif
}
|
