Implement ranges::uninitialized_meow

stl/inc/xutility

@@ -4378,6 +4378,17 @@ _OutIt _Copy_memmove(move_iterator<_InIt> _First, move_iterator<_InIt> _Last, _O
     return _Copy_memmove(_First.base(), _Last.base(), _Dest);
 }
 
+template <class _InIt, class _OutIt>
+_OutIt _Copy_memcpy_common(_InIt _IFirst, _InIt _ILast, _OutIt _OFirst, _OutIt _OLast) noexcept {
+    const auto _IFirst_ch = const_cast<const char*>(reinterpret_cast<const volatile char*>(_IFirst));
+    const auto _ILast_ch  = const_cast<const char*>(reinterpret_cast<const volatile char*>(_ILast));
+    const auto _OFirst_ch = const_cast<char*>(reinterpret_cast<volatile char*>(_OFirst));
+    const auto _OLast_ch  = const_cast<const char*>(reinterpret_cast<const volatile char*>(_OLast));
+    const auto _Count     = static_cast<size_t>((_STD min)(_ILast_ch - _IFirst_ch, _OLast_ch - _OFirst_ch));
+    _CSTD memcpy(_OFirst_ch, _IFirst_ch, _Count);
+    return reinterpret_cast<_OutIt>(_OFirst_ch + _Count);
+}
+
 #if _HAS_IF_CONSTEXPR
 // VARIABLE TEMPLATE _Is_vb_iterator
 template <class _It, bool _RequiresMutable = false>

tests/std/test.lst

@@ -311,7 +311,16 @@ tests\P0896R4_ranges_alg_sort
 tests\P0896R4_ranges_alg_swap_ranges
 tests\P0896R4_ranges_alg_transform_binary
 tests\P0896R4_ranges_alg_transform_unary
+tests\P0896R4_ranges_alg_uninitialized_copy
+tests\P0896R4_ranges_alg_uninitialized_copy_n
+tests\P0896R4_ranges_alg_uninitialized_default_construct
+tests\P0896R4_ranges_alg_uninitialized_default_construct_n
+tests\P0896R4_ranges_alg_uninitialized_fill
+tests\P0896R4_ranges_alg_uninitialized_fill_n
 tests\P0896R4_ranges_alg_uninitialized_move
+tests\P0896R4_ranges_alg_uninitialized_move_n
+tests\P0896R4_ranges_alg_uninitialized_value_construct
+tests\P0896R4_ranges_alg_uninitialized_value_construct_n
 tests\P0896R4_ranges_alg_unique
 tests\P0896R4_ranges_alg_unique_copy
 tests\P0896R4_ranges_algorithm_machinery

tests/std/tests/P0896R4_ranges_alg_uninitialized_copy/env.lst

@@ -0,0 +1,4 @@
+# Copyright (c) Microsoft Corporation.
+# SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+
+RUNALL_INCLUDE ..\concepts_matrix.lst

tests/std/tests/P0896R4_ranges_alg_uninitialized_copy/test.cpp

@@ -0,0 +1,177 @@
+// Copyright (c) Microsoft Corporation.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+
+#include <algorithm>
+#include <cassert>
+#include <concepts>
+#include <cstdlib>
+#include <memory>
+#include <ranges>
+#include <span>
+#include <utility>
+
+#include <range_algorithm_support.hpp>
+
+using namespace std;
+
+// Validate that uninitialized_copy_result aliases in_out_result
+STATIC_ASSERT(same_as<ranges::uninitialized_copy_result<int, double>, ranges::in_out_result<int, double>>);
+
+// Validate dangling story
+STATIC_ASSERT(same_as<decltype(ranges::uninitialized_copy(borrowed<false>{}, borrowed<false>{})),
+    ranges::uninitialized_copy_result<ranges::dangling, ranges::dangling>>);
+STATIC_ASSERT(same_as<decltype(ranges::uninitialized_copy(borrowed<false>{}, borrowed<true>{})),
+    ranges::uninitialized_copy_result<ranges::dangling, int*>>);
+STATIC_ASSERT(same_as<decltype(ranges::uninitialized_copy(borrowed<true>{}, borrowed<false>{})),
+    ranges::uninitialized_copy_result<int*, ranges::dangling>>);
+STATIC_ASSERT(same_as<decltype(ranges::uninitialized_copy(borrowed<true>{}, borrowed<true>{})),
+    ranges::uninitialized_copy_result<int*, int*>>);
+
+struct int_wrapper {
+    inline static int constructions = 0;
+    inline static int destructions  = 0;
+
+    static void clear_counts() {
+        constructions = 0;
+        destructions  = 0;
+    }
+
+    static constexpr int magic_throwing_val = 29;
+    int val                                 = 10;
+
+    int_wrapper() {
+        ++constructions;
+    }
+    int_wrapper(int x) : val{x} {
+        ++constructions;
+    }
+
+    int_wrapper(const int_wrapper& that) {
+        if (that.val == magic_throwing_val) {
+            throw magic_throwing_val;
+        }
+
+        val = that.val;
+        ++constructions;
+    }
+
+    ~int_wrapper() {
+        ++destructions;
+    }
+
+    int_wrapper& operator=(const int_wrapper&) {
+        abort();
+    }
+
+    auto operator<=>(const int_wrapper&) const = default;
+};
+
+template <class T, size_t N>
+struct holder {
+    STATIC_ASSERT(N < ~size_t{0} / sizeof(T));
+    alignas(T) unsigned char space[N * sizeof(T)];
+
+    auto as_span() {
+        return span<T, N>{reinterpret_cast<T*>(space + 0), N};
+    }
+};
+
+template <class R>
+void not_ranges_destroy(R&& r) { // TRANSITION, ranges::destroy
+    for (auto& e : r) {
+        destroy_at(&e);
+    }
+}
+
+struct instantiator {
+    static constexpr int expected_output[] = {13, 55, 12345};
+    static constexpr int expected_input[]  = {13, 55, 12345};
+
+    template <ranges::input_range R, ranges::forward_range W>
+    static void call() {
+        using ranges::uninitialized_copy, ranges::uninitialized_copy_result, ranges::equal, ranges::equal_to,
+            ranges::iterator_t;
+
+        { // Validate range overload
+            int_wrapper input[3] = {13, 55, 12345};
+            R wrapped_input{input};
+            holder<int_wrapper, 3> mem;
+            W wrapped_output{mem.as_span()};
+
+            int_wrapper::clear_counts();
+            const same_as<uninitialized_copy_result<iterator_t<R>, iterator_t<W>>> auto result =
+                uninitialized_copy(wrapped_input, wrapped_output);
+            assert(int_wrapper::constructions == 3);
+            assert(int_wrapper::destructions == 0);
+            assert(result.in == wrapped_input.end());
+            assert(result.out == wrapped_output.end());
+            assert(equal(wrapped_output, expected_output, equal_to{}, &int_wrapper::val));
+            assert(equal(input, expected_input, equal_to{}, &int_wrapper::val));
+            not_ranges_destroy(wrapped_output);
+            assert(int_wrapper::constructions == 3);
+            assert(int_wrapper::destructions == 3);
+        }
+
+        { // Validate iterator overload
+            int_wrapper input[3] = {13, 55, 12345};
+            R wrapped_input{input};
+            holder<int_wrapper, 3> mem;
+            W wrapped_output{mem.as_span()};
+
+            int_wrapper::clear_counts();
+            const same_as<uninitialized_copy_result<iterator_t<R>, iterator_t<W>>> auto result = uninitialized_copy(
+                wrapped_input.begin(), wrapped_input.end(), wrapped_output.begin(), wrapped_output.end());
+            assert(int_wrapper::constructions == 3);
+            assert(int_wrapper::destructions == 0);
+            assert(result.in == wrapped_input.end());
+            assert(result.out == wrapped_output.end());
+            assert(equal(wrapped_output, expected_output, equal_to{}, &int_wrapper::val));
+            assert(equal(input, expected_input, equal_to{}, &int_wrapper::val));
+            not_ranges_destroy(wrapped_output);
+            assert(int_wrapper::constructions == 3);
+            assert(int_wrapper::destructions == 3);
+        }
+    }
+};
+
+struct throwing_test {
+    static constexpr int expected_input[] = {13, 55, int_wrapper::magic_throwing_val, 12345};
+
+    template <ranges::input_range R, ranges::forward_range W>
+    static void call() {
+        // Validate only range overload (one is plenty since they both use the same backend)
+        int_wrapper input[] = {13, 55, int_wrapper::magic_throwing_val, 12345};
+        R wrapped_input{input};
+        holder<int_wrapper, 4> mem;
+        W wrapped_output{mem.as_span()};
+
+        int_wrapper::clear_counts();
+        try {
+            (void) ranges::uninitialized_copy(wrapped_input, wrapped_output);
+            assert(false);
+        } catch (int i) {
+            assert(i == int_wrapper::magic_throwing_val);
+        } catch (...) {
+            assert(false);
+        }
+        assert(int_wrapper::constructions == 2);
+        assert(int_wrapper::destructions == 2);
+        assert(ranges::equal(input, expected_input, ranges::equal_to{}, &int_wrapper::val));
+    }
+};
+
+template <test::ProxyRef IsProxy>
+using test_input  = test::range<test::input, int_wrapper, test::Sized::no, test::CanDifference::no, test::Common::no,
+    test::CanCompare::yes, IsProxy>;
+using test_output = test::range<test::fwd, int_wrapper, test::Sized::no, test::CanDifference::no, test::Common::no,
+    test::CanCompare::yes, test::ProxyRef::no>;
+
+int main() {
+    // The algorithm is oblivious to non-required category, size, difference, and "proxyness" of the input range. It
+    // _is_ sensitive to proxyness in that it requires non-proxy references for the output range.
+
+    instantiator::call<test_input<test::ProxyRef::no>, test_output>();
+    instantiator::call<test_input<test::ProxyRef::yes>, test_output>();
+    throwing_test::call<test_input<test::ProxyRef::no>, test_output>();
+    throwing_test::call<test_input<test::ProxyRef::yes>, test_output>();
+}

tests/std/tests/P0896R4_ranges_alg_uninitialized_copy_n/env.lst

@@ -0,0 +1,4 @@
+# Copyright (c) Microsoft Corporation.
+# SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+
+RUNALL_INCLUDE ..\concepts_matrix.lst

tests/std/tests/P0896R4_ranges_alg_uninitialized_copy_n/test.cpp

@@ -0,0 +1,143 @@
+// Copyright (c) Microsoft Corporation.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+
+#include <algorithm>
+#include <cassert>
+#include <concepts>
+#include <cstdlib>
+#include <memory>
+#include <ranges>
+#include <span>
+#include <utility>
+
+#include <range_algorithm_support.hpp>
+
+using namespace std;
+
+// Validate that uninitialized_copy_n_result aliases in_out_result
+STATIC_ASSERT(same_as<ranges::uninitialized_copy_n_result<int, double>, ranges::in_out_result<int, double>>);
+
+struct int_wrapper {
+    inline static int constructions = 0;
+    inline static int destructions  = 0;
+
+    static void clear_counts() {
+        constructions = 0;
+        destructions  = 0;
+    }
+
+    static constexpr int magic_throwing_val = 29;
+    int val                                 = 10;
+
+    int_wrapper() {
+        ++constructions;
+    }
+    int_wrapper(int x) : val{x} {
+        ++constructions;
+    }
+
+    int_wrapper(const int_wrapper& that) {
+        if (that.val == magic_throwing_val) {
+            throw magic_throwing_val;
+        }
+
+        val = that.val;
+        ++constructions;
+    }
+
+    ~int_wrapper() {
+        ++destructions;
+    }
+
+    int_wrapper& operator=(const int_wrapper&) {
+        abort();
+    }
+
+    auto operator<=>(const int_wrapper&) const = default;
+};
+
+template <class T, size_t N>
+struct holder {
+    STATIC_ASSERT(N < ~size_t{0} / sizeof(T));
+    alignas(T) unsigned char space[N * sizeof(T)];
+
+    auto as_span() {
+        return span<T, N>{reinterpret_cast<T*>(space + 0), N};
+    }
+};
+
+template <class R>
+void not_ranges_destroy(R&& r) { // TRANSITION, ranges::destroy
+    for (auto& e : r) {
+        destroy_at(&e);
+    }
+}
+
+struct instantiator {
+    static constexpr int expected_output[] = {13, 55, 12345};
+    static constexpr int expected_input[]  = {13, 55, 12345};
+
+    template <ranges::input_range Read, ranges::forward_range Write>
+    static void call() {
+        using ranges::uninitialized_copy_n, ranges::uninitialized_copy_n_result, ranges::equal, ranges::equal_to,
+            ranges::iterator_t;
+
+        int_wrapper input[3] = {13, 55, 12345};
+        Read wrapped_input{input};
+        holder<int_wrapper, 3> mem;
+        Write wrapped_output{mem.as_span()};
+
+        int_wrapper::clear_counts();
+        const same_as<uninitialized_copy_n_result<iterator_t<Read>, iterator_t<Write>>> auto result =
+            uninitialized_copy_n(wrapped_input.begin(), 3, wrapped_output.begin(), wrapped_output.end());
+        assert(int_wrapper::constructions == 3);
+        assert(int_wrapper::destructions == 0);
+        assert(result.in == wrapped_input.end());
+        assert(result.out == wrapped_output.end());
+        assert(equal(wrapped_output, expected_output, equal_to{}, &int_wrapper::val));
+        assert(equal(input, expected_input, equal_to{}, &int_wrapper::val));
+        not_ranges_destroy(wrapped_output);
+        assert(int_wrapper::constructions == 3);
+        assert(int_wrapper::destructions == 3);
+    }
+};
+
+struct throwing_test {
+    static constexpr int expected_input[] = {13, 55, int_wrapper::magic_throwing_val, 12345};
+
+    template <ranges::input_range Read, ranges::forward_range Write>
+    static void call() {
+        int_wrapper input[] = {13, 55, int_wrapper::magic_throwing_val, 12345};
+        Read wrapped_input{input};
+        holder<int_wrapper, 4> mem;
+        Write wrapped_output{mem.as_span()};
+
+        int_wrapper::clear_counts();
+        try {
+            (void) ranges::uninitialized_copy_n(wrapped_input.begin(), 4, wrapped_output.begin(), wrapped_output.end());
+            assert(false);
+        } catch (int i) {
+            assert(i == int_wrapper::magic_throwing_val);
+        } catch (...) {
+            assert(false);
+        }
+        assert(int_wrapper::constructions == 2);
+        assert(int_wrapper::destructions == 2);
+    }
+};
+
+template <test::ProxyRef IsProxy>
+using test_input  = test::range<test::input, int_wrapper, test::Sized::no, test::CanDifference::no, test::Common::no,
+    test::CanCompare::yes, IsProxy>;
+using test_output = test::range<test::fwd, int_wrapper, test::Sized::no, test::CanDifference::no, test::Common::no,
+    test::CanCompare::yes, test::ProxyRef::no>;
+
+int main() {
+    // The algorithm is oblivious to non-required category, size, difference, and "proxyness" of the input range. It
+    // _is_ sensitive to proxyness in that it requires non-proxy references for the output range.
+
+    instantiator::call<test_input<test::ProxyRef::no>, test_output>();
+    instantiator::call<test_input<test::ProxyRef::yes>, test_output>();
+    throwing_test::call<test_input<test::ProxyRef::no>, test_output>();
+    throwing_test::call<test_input<test::ProxyRef::yes>, test_output>();
+}

tests/std/tests/P0896R4_ranges_alg_uninitialized_default_construct/env.lst

@@ -0,0 +1,4 @@
+# Copyright (c) Microsoft Corporation.
+# SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+
+RUNALL_INCLUDE ..\concepts_matrix.lst