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
|
//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
// UNSUPPORTED: c++98, c++03
// <iterator>
// insert_iterator
// requires CopyConstructible<Cont::value_type>
// insert_iterator<Cont>&
// operator=(const Cont::value_type& value);
#include <iterator>
#include <utility>
#include <vector>
#include <memory>
#include <cassert>
template <class C>
void
test(C c1, typename C::difference_type j,
typename C::value_type x1, typename C::value_type x2,
typename C::value_type x3, const C& c2)
{
std::insert_iterator<C> q(c1, c1.begin() + j);
q = std::move(x1);
q = std::move(x2);
q = std::move(x3);
assert(c1 == c2);
}
template <class C>
void
insert3at(C& c, typename C::iterator i,
typename C::value_type x1, typename C::value_type x2,
typename C::value_type x3)
{
i = c.insert(i, std::move(x1));
i = c.insert(++i, std::move(x2));
c.insert(++i, std::move(x3));
}
struct do_nothing
{
void operator()(void*) const {}
};
int main()
{
{
typedef std::unique_ptr<int, do_nothing> Ptr;
typedef std::vector<Ptr> C;
C c1;
int x[6] = {0};
for (int i = 0; i < 3; ++i)
c1.push_back(Ptr(x+i));
C c2;
for (int i = 0; i < 3; ++i)
c2.push_back(Ptr(x+i));
insert3at(c2, c2.begin(), Ptr(x+3), Ptr(x+4), Ptr(x+5));
test(std::move(c1), 0, Ptr(x+3), Ptr(x+4), Ptr(x+5), c2);
c1.clear();
for (int i = 0; i < 3; ++i)
c1.push_back(Ptr(x+i));
c2.clear();
for (int i = 0; i < 3; ++i)
c2.push_back(Ptr(x+i));
insert3at(c2, c2.begin()+1, Ptr(x+3), Ptr(x+4), Ptr(x+5));
test(std::move(c1), 1, Ptr(x+3), Ptr(x+4), Ptr(x+5), c2);
c1.clear();
for (int i = 0; i < 3; ++i)
c1.push_back(Ptr(x+i));
c2.clear();
for (int i = 0; i < 3; ++i)
c2.push_back(Ptr(x+i));
insert3at(c2, c2.begin()+2, Ptr(x+3), Ptr(x+4), Ptr(x+5));
test(std::move(c1), 2, Ptr(x+3), Ptr(x+4), Ptr(x+5), c2);
c1.clear();
for (int i = 0; i < 3; ++i)
c1.push_back(Ptr(x+i));
c2.clear();
for (int i = 0; i < 3; ++i)
c2.push_back(Ptr(x+i));
insert3at(c2, c2.begin()+3, Ptr(x+3), Ptr(x+4), Ptr(x+5));
test(std::move(c1), 3, Ptr(x+3), Ptr(x+4), Ptr(x+5), c2);
}
}
|
