blob: ba3799b103ebec4e94ff5de801cf8c7bb42f810e (
plain)
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
|
// Copyright (C) 2020 Free Software Foundation, Inc.
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License along
// with this library; see the file COPYING3. If not see
// <http://www.gnu.org/licenses/>.
// { dg-options "-std=gnu++2a" }
// { dg-do run { target c++2a } }
#include <algorithm>
#include <cstring>
#include <deque>
#include <list>
#include <memory>
#include <span>
#include <string>
#include <vector>
#include <testsuite_hooks.h>
#include <testsuite_iterators.h>
using __gnu_test::test_forward_range;
namespace ranges = std::ranges;
template<typename T>
void
test01()
{
static_assert(std::default_initializable<T>);
static_assert(std::equality_comparable<T>);
for (int k = 0; k < 6; k++)
{
constexpr int size = 1024;
auto buffer = std::unique_ptr<char[]>(new char[sizeof(T)*size]);
std::span<T> rx((T *)buffer.get(), size);
T t{};
auto i = rx.begin();
if (k == 0)
i = ranges::uninitialized_value_construct(rx.begin(), rx.end());
else if (k == 1)
i = ranges::uninitialized_value_construct(rx);
else if (k == 2)
i = ranges::uninitialized_value_construct_n(rx.begin(), 1024);
else if (k == 3)
i = ranges::uninitialized_value_construct(rx.begin(), rx.end());
else if (k == 4)
i = ranges::uninitialized_value_construct(std::as_const(rx));
else if (k == 5)
i = ranges::uninitialized_value_construct_n(rx.begin(), 1024);
else
__builtin_abort();
VERIFY( i == rx.end() );
VERIFY( ranges::find_if(rx, [&t](const T& v) { return t != v; }) == i );
ranges::destroy(rx);
}
}
struct X
{
static constexpr int limit = 67;
static inline int construct_count = 0;
static inline int destruct_count = 0;
struct exception {};
bool live = false;
X()
{
if (construct_count >= limit)
throw exception{};
construct_count++;
live = true;
}
~X()
{
VERIFY( live );
live = false;
destruct_count++;
}
};
template<bool test_sized>
void
test02()
{
constexpr int size = 100;
auto buffer = std::unique_ptr<char[]>(new char[sizeof(X)*size]);
test_forward_range<X> rx((X *)buffer.get(), (X *)buffer.get() + size);
try
{
X::construct_count = 0;
X::destruct_count = 0;
if constexpr (test_sized)
ranges::uninitialized_value_construct_n(rx.begin(), size);
else
ranges::uninitialized_value_construct(rx);
VERIFY( false && "exception not thrown" );
}
catch (const X::exception&)
{
VERIFY( X::construct_count == X::limit );
VERIFY( X::destruct_count == X::limit );
}
}
int
main()
{
test01<char>();
test01<int>();
test01<long long>();
test01<float>();
test01<double>();
test01<std::vector<char>>();
test01<std::string>();
test01<std::deque<double>>();
test01<std::list<std::vector<std::deque<double>>>>();
test01<std::unique_ptr<std::string>>();
test02<false>();
test02<true>();
}
|
