//===----------------------------------------------------------------------===// // // 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 // //===----------------------------------------------------------------------===// // // UNSUPPORTED: c++03, c++11, c++14, c++17 // template O, sentinel_for S> // constexpr O ranges::fill(O first, S last, const T& value); // template R> // constexpr borrowed_iterator_t ranges::fill(R&& r, const T& value); #include #include #include #include #include #include #include "sized_allocator.h" #include "almost_satisfies_types.h" #include "test_iterators.h" #include "test_macros.h" template > concept HasFillIt = requires(Iter iter, Sent sent) { std::ranges::fill(iter, sent, int{}); }; static_assert(HasFillIt); static_assert(!HasFillIt); static_assert(!HasFillIt); static_assert(!HasFillIt); static_assert(!HasFillIt); template concept HasFillR = requires(Range range) { std::ranges::fill(range, int{}); }; static_assert(HasFillR>); static_assert(!HasFillR); static_assert(!HasFillR); static_assert(!HasFillR); static_assert(!HasFillR); template constexpr void test_iterators() { { // simple test { int a[3]; std::same_as auto ret = std::ranges::fill(It(a), Sent(It(a + 3)), 1); assert(std::all_of(a, a + 3, [](int i) { return i == 1; })); assert(base(ret) == a + 3); } { int a[3]; auto range = std::ranges::subrange(It(a), Sent(It(a + 3))); std::same_as auto ret = std::ranges::fill(range, 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 a; auto ret = std::ranges::fill(It(a.data()), Sent(It(a.data())), 1); assert(base(ret) == a.data()); } { std::array a; auto range = std::ranges::subrange(It(a.data()), Sent(It(a.data()))); auto ret = std::ranges::fill(range, 1); assert(base(ret) == a.data()); } } } // The `ranges::{fill, fill_n}` algorithms require `vector::iterator` to satisfy // the `std::indirectly_writable` concept when used with `vector`, which is only // satisfied since C++23. #if TEST_STD_VER >= 23 constexpr 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::ranges::fill(std::ranges::subrange(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::ranges::fill(std::ranges::subrange(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::ranges::fill(std::ranges::subrange(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::ranges::fill(in, true); assert(in == expected); } { // Partial bytes with offset filled std::vector in(N, false); std::vector expected(N, true); std::ranges::fill(std::ranges::subrange(std::ranges::begin(in) + 4, std::ranges::end(in) - 4), true); std::ranges::fill(std::ranges::subrange(std::ranges::begin(expected), std::ranges::begin(expected) + 4), false); std::ranges::fill(std::ranges::subrange(std::ranges::end(expected) - 4, std::ranges::end(expected)), false); assert(in == expected); } } return true; } #endif constexpr bool test() { test_iterators, sentinel_wrapper>>(); test_iterators, sentinel_wrapper>>(); test_iterators>(); test_iterators>(); test_iterators>(); test_iterators>(); test_iterators(); { // check that every element is copied once struct S { bool copied = false; constexpr S& operator=(const S&) { copied = true; return *this; } }; { S a[5]; std::ranges::fill(a, a + 5, S{true}); assert(std::all_of(a, a + 5, [](S& s) { return s.copied; })); } { S a[5]; std::ranges::fill(a, S{true}); assert(std::all_of(a, a + 5, [](S& s) { return s.copied; })); } } { // check that std::ranges::dangling is returned [[maybe_unused]] std::same_as decltype(auto) ret = std::ranges::fill(std::array{}, 1); } { // check that std::ranges::dangling isn't returned with a borrowing range std::array a{}; [[maybe_unused]] std::same_as::iterator> decltype(auto) ret = std::ranges::fill(std::views::all(a), 1); assert(std::all_of(a.begin(), a.end(), [](int i) { return i == 1; })); } { // check that non-trivially copyable items are copied properly { std::array a; auto ret = std::ranges::fill(a.begin(), a.end(), "long long string so no SSO"); assert(ret == a.end()); assert(std::all_of(a.begin(), a.end(), [](auto& s) { return s == "long long string so no SSO"; })); } { std::array a; auto ret = std::ranges::fill(a, "long long string so no SSO"); assert(ret == a.end()); assert(std::all_of(a.begin(), a.end(), [](auto& s) { return s == "long long string so no SSO"; })); } } #if TEST_STD_VER >= 23 { // 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::ranges::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::ranges::fill(in, true); assert(in == expected); } { using Alloc = sized_allocator; std::vector in(200, false, Alloc(1)); std::vector expected(200, true, Alloc(1)); std::ranges::fill(in, true); assert(in == expected); } { using Alloc = sized_allocator; std::vector in(200, false, Alloc(1)); std::vector expected(200, true, Alloc(1)); std::ranges::fill(in, true); assert(in == expected); } { using Alloc = sized_allocator; std::vector in(200, false, Alloc(1)); std::vector expected(200, true, Alloc(1)); std::ranges::fill(in, true); assert(in == expected); } } #endif return true; } int main(int, char**) { test(); static_assert(test()); return 0; }