Peng Liu ad87d5f23d
[libc++][test] Refactor tests for std::{copy, move, fill} algorithms (#120909)
This refactor includes the following changes:
- Refactor similar tests using `types::for_each` to remove redundant code;
- Explicitly include the missing header `type_algorithms.h` in some test files;
- Some tests scattered in different test functions with ad-hoc names
  (e.g., `test5()`, `test6()`) but belong to the same kind are now grouped
  into one function (`test_struct_array()`).
2025-02-19 12:44:44 -05:00

70 lines
2.3 KiB
C++

//===----------------------------------------------------------------------===//
//
// 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
// UNSUPPORTED: libcpp-has-no-incomplete-pstl
// template<class ExecutionPolicy, class ForwardIterator, class T>
// void fill(ExecutionPolicy&& exec,
// ForwardIterator first, ForwardIterator last, const T& value);
#include <algorithm>
#include <cassert>
#include <vector>
#include "test_macros.h"
#include "test_execution_policies.h"
#include "test_iterators.h"
#include "type_algorithms.h"
EXECUTION_POLICY_SFINAE_TEST(fill);
static_assert(sfinae_test_fill<int, int*, int*, bool (*)(int)>);
static_assert(!sfinae_test_fill<std::execution::parallel_policy, int*, int*, int>);
template <class Iter>
struct Test {
template <class Policy>
void operator()(Policy&& policy) {
{ // simple test
int a[4];
std::fill(policy, Iter(std::begin(a)), Iter(std::end(a)), 33);
assert(std::all_of(std::begin(a), std::end(a), [](int i) { return i == 33; }));
}
{ // check that an empty range works
int a[1] = {2};
std::fill(policy, Iter(std::begin(a)), Iter(std::begin(a)), 33);
assert(a[0] == 2);
}
{ // check that a one-element range works
int a[1];
std::fill(policy, Iter(std::begin(a)), Iter(std::end(a)), 33);
assert(std::all_of(std::begin(a), std::end(a), [](int i) { return i == 33; }));
}
{ // check that a two-element range works
int a[2];
std::fill(policy, Iter(std::begin(a)), Iter(std::end(a)), 33);
assert(std::all_of(std::begin(a), std::end(a), [](int i) { return i == 33; }));
}
{ // check that a large range works
std::vector<int> a(234, 2);
std::fill(policy, Iter(std::data(a)), Iter(std::data(a) + std::size(a)), 33);
assert(std::all_of(std::begin(a), std::end(a), [](int i) { return i == 33; }));
}
}
};
int main(int, char**) {
types::for_each(types::forward_iterator_list<int*>{}, TestIteratorWithPolicies<Test>{});
return 0;
}