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
|
//===----------------------------------------------------------------------===//
//
// 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
//
//===----------------------------------------------------------------------===//
// <algorithm>
// UNSUPPORTED: c++03, c++11, c++14, c++17
// template<class T, output_iterator<const T&> O>
// constexpr O ranges::fill_n(O first, iter_difference_t<O> n, const T& value);
#include <algorithm>
#include <array>
#include <cassert>
#include <ranges>
#include <string>
#include "almost_satisfies_types.h"
#include "test_iterators.h"
template <class Iter>
concept HasFillN = requires(Iter iter) { std::ranges::fill_n(iter, int{}, int{}); };
struct WrongType {};
static_assert(HasFillN<int*>);
static_assert(!HasFillN<WrongType*>);
static_assert(!HasFillN<OutputIteratorNotIndirectlyWritable>);
static_assert(!HasFillN<OutputIteratorNotInputOrOutputIterator>);
template <class It, class Sent = It>
constexpr void test_iterators() {
{ // simple test
int a[3];
std::same_as<It> decltype(auto) ret = std::ranges::fill_n(It(a), 3, 1);
assert(std::all_of(a, a + 3, [](int i) { return i == 1; }));
assert(base(ret) == a + 3);
}
{ // check that an empty range works
std::array<int, 0> a;
auto ret = std::ranges::fill_n(It(a.data()), 0, 1);
assert(base(ret) == a.data());
}
}
constexpr bool test() {
test_iterators<cpp17_output_iterator<int*>, sentinel_wrapper<cpp17_output_iterator<int*>>>();
test_iterators<cpp20_output_iterator<int*>, sentinel_wrapper<cpp20_output_iterator<int*>>>();
test_iterators<forward_iterator<int*>>();
test_iterators<bidirectional_iterator<int*>>();
test_iterators<random_access_iterator<int*>>();
test_iterators<contiguous_iterator<int*>>();
test_iterators<int*>();
{ // check that every element is copied once
struct S {
bool copied = false;
constexpr S& operator=(const S&) {
assert(!copied);
copied = true;
return *this;
}
};
S a[5];
std::ranges::fill_n(a, 5, S {});
assert(std::all_of(a, a + 5, [](S& s) { return s.copied; }));
}
{ // check that non-trivially copyable items are copied properly
std::array<std::string, 10> a;
auto ret = std::ranges::fill_n(a.data(), 10, "long long string so no SSO");
assert(ret == a.data() + a.size());
assert(std::all_of(a.begin(), a.end(), [](auto& s) { return s == "long long string so no SSO"; }));
}
return true;
}
int main(int, char**) {
test();
static_assert(test());
return 0;
}
|
