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
|
//===----------------------------------------------------------------------===//
//
// 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++03, c++11, c++14
// <memory>
// template <class InputIt, class ForwardIt>
// ForwardIt uninitialized_move(InputIt, InputIt, ForwardIt);
#include <memory>
#include <cstdlib>
#include <cassert>
#include "test_macros.h"
#include "test_iterators.h"
#include "../overload_compare_iterator.h"
struct Counted {
static int count;
static int constructed;
static void reset() { count = constructed = 0; }
explicit Counted(int&& x) : value(x) { x = 0; ++count; ++constructed; }
Counted(Counted const&) { assert(false); }
~Counted() { assert(count > 0); --count; }
friend void operator&(Counted) = delete;
int value;
};
int Counted::count = 0;
int Counted::constructed = 0;
struct ThrowsCounted {
static int count;
static int constructed;
static int throw_after;
static void reset() { throw_after = count = constructed = 0; }
explicit ThrowsCounted(int&& x) {
++constructed;
if (throw_after > 0 && --throw_after == 0) {
TEST_THROW(1);
}
++count;
x = 0;
}
ThrowsCounted(ThrowsCounted const&) { assert(false); }
~ThrowsCounted() { assert(count > 0); --count; }
friend void operator&(ThrowsCounted) = delete;
};
int ThrowsCounted::count = 0;
int ThrowsCounted::constructed = 0;
int ThrowsCounted::throw_after = 0;
void test_ctor_throws()
{
#ifndef TEST_HAS_NO_EXCEPTIONS
using It = forward_iterator<ThrowsCounted*>;
const int N = 5;
int values[N] = {1, 2, 3, 4, 5};
alignas(ThrowsCounted) char pool[sizeof(ThrowsCounted)*N] = {};
ThrowsCounted* p = (ThrowsCounted*)pool;
try {
ThrowsCounted::throw_after = 4;
std::uninitialized_move(values, values + N, It(p));
assert(false);
} catch (...) {}
assert(ThrowsCounted::count == 0);
assert(ThrowsCounted::constructed == 4); // forth construction throws
assert(values[0] == 0);
assert(values[1] == 0);
assert(values[2] == 0);
assert(values[3] == 4);
assert(values[4] == 5);
#endif
}
void test_counted()
{
using It = cpp17_input_iterator<int*>;
using FIt = forward_iterator<Counted*>;
const int N = 5;
int values[N] = {1, 2, 3, 4, 5};
alignas(Counted) char pool[sizeof(Counted)*N] = {};
Counted* p = (Counted*)pool;
auto ret = std::uninitialized_move(It(values), It(values + 1), FIt(p));
assert(ret == FIt(p +1));
assert(Counted::constructed == 1);
assert(Counted::count == 1);
assert(p[0].value == 1);
assert(values[0] == 0);
ret = std::uninitialized_move(It(values+1), It(values+N), FIt(p+1));
assert(ret == FIt(p + N));
assert(Counted::count == 5);
assert(Counted::constructed == 5);
assert(p[1].value == 2);
assert(p[2].value == 3);
assert(p[3].value == 4);
assert(p[4].value == 5);
assert(values[1] == 0);
assert(values[2] == 0);
assert(values[3] == 0);
assert(values[4] == 0);
std::destroy(p, p+N);
assert(Counted::count == 0);
}
int main(int, char**) {
test_counted();
test_ctor_throws();
// Test with an iterator that overloads operator== and operator!= as the input and output iterators
{
using T = int;
using Iterator = overload_compare_iterator<T*>;
const int N = 5;
// input
{
char pool[sizeof(T) * N] = {0};
T* p = reinterpret_cast<T*>(pool);
T array[N] = {1, 2, 3, 4, 5};
std::uninitialized_move(Iterator(array), Iterator(array + N), p);
for (int i = 0; i != N; ++i) {
assert(array[i] == p[i]);
}
}
// output
{
char pool[sizeof(T) * N] = {0};
T* p = reinterpret_cast<T*>(pool);
T array[N] = {1, 2, 3, 4, 5};
std::uninitialized_move(array, array + N, Iterator(p));
for (int i = 0; i != N; ++i) {
assert(array[i] == p[i]);
}
}
}
return 0;
}
|
