//===----------------------------------------------------------------------===// // // 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 // //===----------------------------------------------------------------------===// // // template // requires OutputIterator // constexpr void // constexpr after C++17 // fill(Iter first, Iter last, const T& value); #include #include #include #include #include #include "sized_allocator.h" #include "test_macros.h" #include "test_iterators.h" #include "type_algorithms.h" template TEST_CONSTEXPR_CXX20 void test(Container in, size_t from, size_t to, typename Container::value_type value, Container expected) { std::fill(Iter(in.data() + from), Iter(in.data() + to), value); assert(in == expected); } template struct Test { template TEST_CONSTEXPR_CXX20 void operator()() { { std::array in = {1, 2, 3, 4}; std::array expected = {5, 5, 5, 5}; test(in, 0, 4, 5, expected); } { std::array in = {1, 2, 3, 4}; std::array expected = {1, 5, 5, 4}; test(in, 1, 3, 5, expected); } } }; TEST_CONSTEXPR_CXX20 bool test_vector_bool(std::size_t N) { { // Test cases validating leading/trailing bits unfilled remain unchanged { // Leading bits are not filled std::vector in(N, false); std::vector expected(N, true); expected[0] = expected[1] = false; std::fill(in.begin() + 2, in.end(), true); assert(in == expected); } { // Trailing bits are not filled std::vector in(N, false); std::vector expected(N, true); expected[N - 1] = expected[N - 2] = false; std::fill(in.begin(), in.end() - 2, true); assert(in == expected); } { // Leading and trailing bits are not filled std::vector in(N, false); std::vector expected(N, true); expected[0] = expected[1] = expected[N - 1] = expected[N - 2] = false; std::fill(in.begin() + 2, in.end() - 2, true); assert(in == expected); } } { // Test cases with full or partial bytes filled { // Full bytes filled std::vector in(N, false); std::vector expected(N, true); std::fill(in.begin(), in.end(), true); assert(in == expected); } { // Partial bytes with offset filled std::vector in(N, false); std::vector expected(N, true); std::fill(in.begin() + 4, in.end() - 4, true); std::fill(expected.begin(), expected.begin() + 4, false); std::fill(expected.end() - 4, expected.end(), false); assert(in == expected); } } return true; } TEST_CONSTEXPR_CXX20 bool test() { types::for_each(types::forward_iterator_list(), Test()); types::for_each(types::forward_iterator_list(), Test()); { // Test vector::iterator optimization assert(test_vector_bool(8)); assert(test_vector_bool(19)); assert(test_vector_bool(32)); assert(test_vector_bool(49)); assert(test_vector_bool(64)); assert(test_vector_bool(199)); assert(test_vector_bool(256)); // Make sure std::fill behaves properly with std::vector iterators with custom size types. // See https://github.com/llvm/llvm-project/pull/122410. { using Alloc = sized_allocator; std::vector in(100, false, Alloc(1)); std::vector expected(100, true, Alloc(1)); std::fill(in.begin(), in.end(), true); assert(in == expected); } { using Alloc = sized_allocator; std::vector in(200, false, Alloc(1)); std::vector expected(200, true, Alloc(1)); std::fill(in.begin(), in.end(), true); assert(in == expected); } { using Alloc = sized_allocator; std::vector in(200, false, Alloc(1)); std::vector expected(200, true, Alloc(1)); std::fill(in.begin(), in.end(), true); assert(in == expected); } { using Alloc = sized_allocator; std::vector in(200, false, Alloc(1)); std::vector expected(200, true, Alloc(1)); std::fill(in.begin(), in.end(), true); assert(in == expected); } } return true; } int main(int, char**) { test(); #if TEST_STD_VER >= 20 static_assert(test()); #endif return 0; }