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
|
//===----------------------------------------------------------------------===//
//
// 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.
//
//===----------------------------------------------------------------------===//
// UNSUPPORTED: c++98, c++03
// <list>
// iterator insert(const_iterator p, initializer_list<value_type> il);
#include <list>
#include <cassert>
#include "min_allocator.h"
int main()
{
{
std::list<int> d(10, 1);
std::list<int>::iterator i = d.insert(next(d.cbegin(), 2), {3, 4, 5, 6});
assert(d.size() == 14);
assert(i == next(d.begin(), 2));
i = d.begin();
assert(*i++ == 1);
assert(*i++ == 1);
assert(*i++ == 3);
assert(*i++ == 4);
assert(*i++ == 5);
assert(*i++ == 6);
assert(*i++ == 1);
assert(*i++ == 1);
assert(*i++ == 1);
assert(*i++ == 1);
assert(*i++ == 1);
assert(*i++ == 1);
assert(*i++ == 1);
assert(*i++ == 1);
}
{
std::list<int, min_allocator<int>> d(10, 1);
std::list<int, min_allocator<int>>::iterator i = d.insert(next(d.cbegin(), 2), {3, 4, 5, 6});
assert(d.size() == 14);
assert(i == next(d.begin(), 2));
i = d.begin();
assert(*i++ == 1);
assert(*i++ == 1);
assert(*i++ == 3);
assert(*i++ == 4);
assert(*i++ == 5);
assert(*i++ == 6);
assert(*i++ == 1);
assert(*i++ == 1);
assert(*i++ == 1);
assert(*i++ == 1);
assert(*i++ == 1);
assert(*i++ == 1);
assert(*i++ == 1);
assert(*i++ == 1);
}
}
|
