1//===----------------------------------------------------------------------===//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//
8
9// <algorithm>
10
11// UNSUPPORTED: c++03, c++11, c++14
12
13// UNSUPPORTED: libcpp-has-no-incomplete-pstl
14
15// template<class ExecutionPolicy, class ForwardIterator, class Size, class T>
16// ForwardIterator fill_n(ExecutionPolicy&& exec,
17// ForwardIterator first, Size n, const T& value);
18
19#include <algorithm>
20#include <cassert>
21#include <vector>
22
23#include "test_macros.h"
24#include "test_execution_policies.h"
25#include "test_iterators.h"
26
27EXECUTION_POLICY_SFINAE_TEST(fill_n);
28
29static_assert(sfinae_test_fill_n<int, int*, int*, bool (*)(int)>);
30static_assert(!sfinae_test_fill_n<std::execution::parallel_policy, int*, int*, int>);
31
32template <class Iter>
33struct Test {
34 template <class Policy>
35 void operator()(Policy&& policy) {
36 { // simple test
37 int a[4];
38 std::fill_n(policy, Iter(std::begin(arr&: a)), std::size(a), 33);
39 assert(std::all_of(std::begin(a), std::end(a), [](int i) { return i == 33; }));
40 }
41 { // check that an empty range works
42 int a[1] = {2};
43 std::fill_n(policy, Iter(std::begin(arr&: a)), 0, 33);
44 assert(a[0] == 2);
45 }
46 { // check that a one-element range works
47 int a[1];
48 std::fill_n(policy, Iter(std::begin(arr&: a)), std::size(a), 33);
49 assert(std::all_of(std::begin(a), std::end(a), [](int i) { return i == 33; }));
50 }
51 { // check that a two-element range works
52 int a[2];
53 std::fill_n(policy, Iter(std::begin(arr&: a)), std::size(a), 33);
54 assert(std::all_of(std::begin(a), std::end(a), [](int i) { return i == 33; }));
55 }
56 { // check that a large range works
57 std::vector<int> a(234, 2);
58 std::fill_n(policy, Iter(std::data(cont&: a)), std::size(cont: a), 33);
59 assert(std::all_of(std::begin(a), std::end(a), [](int i) { return i == 33; }));
60 }
61 }
62};
63
64int main(int, char**) {
65 types::for_each(types::forward_iterator_list<int*>{}, TestIteratorWithPolicies<Test>{});
66
67 return 0;
68}
69

source code of libcxx/test/std/algorithms/alg.modifying.operations/alg.fill/pstl.fill_n.pass.cpp