microsoft · StephanTLavavej · Mar 7, 2023 · Feb 27, 2023 · Feb 27, 2023 · Feb 27, 2023
@@ -124,7 +124,6 @@ struct _Unicode_property_data {
 // Codepoint ranges may not overlap, and, within one property, a codepoint may only appear once. Furthermore the
 // codepoint lower bounds appear in sorted (ascending) order.
 
-
 enum class _Grapheme_Break_property_values : uint8_t {
     _CR_value,
     _Control_value,
@@ -339,7 +338,6 @@ inline constexpr _Unicode_property_data<_Grapheme_Break_property_values, 1355> _
         0x2004, 0x2003, 0x2037, 0x2032, 0x2001, 0x2001, 0x2005, 0x200f, 0x2007, 0x2011, 0x2007, 0x2002, 0x2005, 0x2007,
         0x2001, 0x2004, 0x2007, 0x2007, 0x801a, 0x2005, 0x1020, 0x2060, 0x1080, 0x20f0, 0x1e10}};
 
-
 enum class _Extended_Pictographic_property_values : uint8_t { _Extended_Pictographic_value, _No_value = 255 };
 
 inline constexpr _Unicode_property_data<_Extended_Pictographic_property_values, 78>

@@ -2088,7 +2088,6 @@ struct _Atomic_pointer : _Atomic_storage<_Ty> {
     }
 };
 
-
 template <class _Ty>
 struct _Atomic_pointer<_Ty&> : _Atomic_storage<_Ty&> {
     using _Base           = _Atomic_storage<_Ty&>;
@@ -2143,7 +2142,6 @@ struct _Atomic_pointer<_Ty&> : _Atomic_storage<_Ty&> {
     }
 };
 
-
 #define ATOMIC_VAR_INIT(_Value) \
     { _Value }
 
@@ -2885,7 +2883,6 @@ _EXPORT_STD struct atomic_flag { // flag with test-and-set semantics
 #endif // TRANSITION, ABI
 };
 
-
 #if _HAS_CXX20
 _EXPORT_STD _NODISCARD inline bool atomic_flag_test(const volatile atomic_flag* const _Flag) noexcept {
     return _Flag->test();

@@ -204,7 +204,6 @@ _EXPORT_STD _CONSTEXPR23 to_chars_result to_chars(char* const _First, char* cons
 
 _EXPORT_STD to_chars_result to_chars(char* _First, char* _Last, bool _Value, int _Base = 10) = delete;
 
-
 _EXPORT_STD struct from_chars_result {
     const char* ptr;
     errc ec;
@@ -933,7 +932,6 @@ _NODISCARD inline uint64_t _Divide(_Big_integer_flt& _Numerator, const _Big_inte
 
 // ^^^^^^^^^^ DERIVED FROM corecrt_internal_big_integer.h ^^^^^^^^^^
 
-
 // vvvvvvvvvv DERIVED FROM corecrt_internal_strtox.h vvvvvvvvvv
 
 // This type is used to hold a partially-parsed string representation of a floating-point number.
@@ -2275,7 +2273,6 @@ _NODISCARD to_chars_result _Floating_to_chars_hex_shortest(
     return _STD to_chars(_First, _Last, static_cast<uint32_t>(_Unbiased_exponent));
 }
 
-
 template <class _Floating>
 _NODISCARD inline to_chars_result _Floating_to_chars_general_precision(
     char* _First, char* const _Last, const _Floating _Value, int _Precision) noexcept {

@@ -3131,7 +3131,6 @@ namespace chrono {
             return (_Bits & ~_Optional) == _Must_set;
         }
 
-
         template <class _Ty>
         static constexpr _Ty _Invalid_time_field{numeric_limits<_Ty>::lowest()};
 
@@ -4693,7 +4692,6 @@ _NODISCARD constexpr const _CharT* _Choose_literal(const char* const _Str, const
 
 #define _STATICALLY_WIDEN(_CharT, _Literal) (_Choose_literal<_CharT>(_Literal, L##_Literal))
 
-
 // clang-format off
 template <class _Ty, class _CharT>
 concept _Chrono_parse_spec_callbacks = _Parse_align_callbacks<_Ty, _CharT>

@@ -554,7 +554,6 @@ _NODISCARD _Check_return_ inline long double trunc(_In_ long double _Xx) noexcep
 #endif // ^^^ intrinsics unavailable ^^^
 }
 
-
 _STD_BEGIN
 template <class _Ty1, class _Ty2>
 using _Common_float_type_t = conditional_t<is_same_v<_Ty1, long double> || is_same_v<_Ty2, long double>, long double,
@@ -712,7 +711,6 @@ _GENERIC_MATH2(fmin)
 #undef _GENERIC_MATH2I
 #undef _HAS_CMATH_INTRINSICS
 
-
 _STD_BEGIN
 _EXPORT_STD using _CSTD abs;
 _EXPORT_STD using _CSTD acos;

@@ -5098,7 +5098,7 @@ void uninitialized_default_construct(_ExPo&& _Exec, const _NoThrowFwdIt _First,
 _EXPORT_STD template <class _ExPo, class _NoThrowFwdIt, class _Diff, _Enable_if_execution_policy_t<_ExPo> /* = 0 */>
 _NoThrowFwdIt uninitialized_default_construct_n(_ExPo&& _Exec, _NoThrowFwdIt _First, const _Diff _Count_raw) noexcept
 /* terminates */ {
-    // default-initialize all elements in [_First, _First + _Count_raw)
+    // default-initialize all elements in [_First, _First + _Count)
     _REQUIRE_PARALLEL_LVALUE_ITERATOR(_NoThrowFwdIt);
     _Algorithm_int_t<_Diff> _Count = _Count_raw;
     if (_Count <= 0) {
@@ -5163,7 +5163,7 @@ void uninitialized_value_construct(_ExPo&&, _NoThrowFwdIt _First, _NoThrowFwdIt
 _EXPORT_STD template <class _ExPo, class _NoThrowFwdIt, class _Diff, _Enable_if_execution_policy_t<_ExPo> /* = 0 */>
 _NoThrowFwdIt uninitialized_value_construct_n(_ExPo&&, _NoThrowFwdIt _First, const _Diff _Count_raw) noexcept
 /* terminates */ {
-    // value-initialize all elements in [_First, _First + _Count_raw)
+    // value-initialize all elements in [_First, _First + _Count)
     _REQUIRE_PARALLEL_LVALUE_ITERATOR(_NoThrowFwdIt);
     _Algorithm_int_t<_Diff> _Count = _Count_raw;
 

@@ -358,8 +358,7 @@ public:
 
     template <class _First, class _Second, class... _Args>
     static constexpr void _Reinit_expected(_First& _New_val, _Second& _Old_val, _Args&&... _Vals) noexcept(
-        is_nothrow_constructible_v<_First, _Args...>) // strengthened
-    {
+        is_nothrow_constructible_v<_First, _Args...>) /* strengthened */ {
         if constexpr (is_nothrow_constructible_v<_First, _Args...>) {
             if constexpr (!is_trivially_destructible_v<_Second>) {
                 _Old_val.~_Second();

@@ -190,7 +190,6 @@ namespace experimental {
         return !(_Left < _Right);
     }
 
-
     struct suspend_if {
         bool _Ready;
 

@@ -1665,7 +1665,6 @@ namespace filesystem {
             return _Result;
         }
 
-
         const iterator _This_end   = _This.end();
         const iterator _Base_begin = _Base.begin();
         const iterator _Base_end   = _Base.end();

@@ -358,7 +358,6 @@ public:
     }
 };
 
-
 // Implements a DFA matching the regex on the left side of rule GB11. The DFA is:
 //
 // +---+   ExtPic      +---+    ZWJ        +---+
@@ -2549,7 +2548,6 @@ template <class _CharT, class _OutputIt>
 _NODISCARD _OutputIt _Fmt_write(
     _OutputIt _Out, _CharT _Value, _Basic_format_specs<_CharT> _Specs, _Lazy_locale _Locale);
 
-
 template <class _CharT, class _OutputIt, floating_point _Float>
 _NODISCARD _OutputIt _Fmt_write(
     _OutputIt _Out, _Float _Value, const _Basic_format_specs<_CharT>& _Specs, _Lazy_locale _Locale);
@@ -3017,7 +3015,6 @@ public:
     }
 };
 
-
 class _Measure_string_prefix_iterator_legacy {
 private:
     _Fmt_codec<char> _Codec = _Get_fmt_codec<char>();

@@ -2314,7 +2314,6 @@ private:
     _Compressed_pair<_Pred_eq, pair<_FwdItPat, _FwdItPat>> _Data;
 };
 
-
 template <class _RanItPat, class _Hash_ty, class _Pred_eq>
 struct _Boyer_moore_hash_delta_1_table { // stores the Boyer-Moore delta_1 table using a hash table
     using _Value_t = _Iter_value_t<_RanItPat>;
@@ -2350,7 +2349,6 @@ private:
     unordered_map<_Value_t, _Diff, _Hash_ty, _Pred_eq> _Map;
 };
 
-
 template <class _RanItPat, _Iter_diff_t<_RanItPat> _Limit>
 struct _Boyer_moore_flat_delta_1_table { // stores the Boyer-Moore delta_1 table using a plain array lookup
     using _Value_t = _Iter_value_t<_RanItPat>;
@@ -2482,7 +2480,6 @@ void _Build_boyer_moore_delta_2_table(_Iter_diff_t<_RanItPat>* const _Shifts, co
     }
 }
 
-
 template <class _Delta1_t, class _RanItHaystack>
 pair<_RanItHaystack, _RanItHaystack> _Boyer_moore_search(
     const _Delta1_t& _Delta1, typename _Delta1_t::_Diff* _Delta2, _RanItHaystack _First, _RanItHaystack _Last) {
@@ -2524,7 +2521,6 @@ pair<_RanItHaystack, _RanItHaystack> _Boyer_moore_search(
     return {_First, _Last};
 }
 
-
 template <class _Delta1_t, class _RanItHaystack>
 pair<_RanItHaystack, _RanItHaystack> _Boyer_moore_horspool_search(
     const _Delta1_t& _Delta1, _RanItHaystack _First, _RanItHaystack _Last) {
@@ -2562,7 +2558,6 @@ pair<_RanItHaystack, _RanItHaystack> _Boyer_moore_horspool_search(
     return {_First, _Last};
 }
 
-
 template <class _RanItPat, class _Hash_ty, class _Pred_eq, class _Delta1_t>
 struct _Single_delta1_type_boyer_moore_traits {
     using _Diff = _Iter_diff_t<_RanItPat>;
@@ -2768,7 +2763,6 @@ using _Boyer_moore_traits =
             _Boyer_moore_traits_wchar_t_mode<_RanItPat>>,
         _Boyer_moore_traits_general_mode<_RanItPat, _Hash_ty, _Pred_eq>>;
 
-
 _EXPORT_STD template <class _RanItPat, class _Hash_ty = hash<_Iter_value_t<_RanItPat>>, class _Pred_eq = equal_to<>>
 class boyer_moore_searcher {
 public:
@@ -2807,7 +2801,6 @@ private:
     void* _Data;
 };
 
-
 _EXPORT_STD template <class _RanItPat, class _Hash_ty = hash<_Iter_value_t<_RanItPat>>, class _Pred_eq = equal_to<>>
 class boyer_moore_horspool_searcher { // equivalent to Boyer-Moore without the second table
 public:

@@ -252,8 +252,8 @@ public:
     constexpr istream_iterator() noexcept(is_nothrow_default_constructible_v<_Ty>) /* strengthened */ {}
 
 #ifdef __cpp_lib_concepts
-    constexpr istream_iterator(default_sentinel_t) noexcept(is_nothrow_default_constructible_v<_Ty>) // strengthened
-    {}
+    constexpr istream_iterator(default_sentinel_t) noexcept(
+        is_nothrow_default_constructible_v<_Ty>) /* strengthened */ {}
 #endif // __cpp_lib_concepts
 
     istream_iterator(istream_type& _Istr) : _Myistr(_STD addressof(_Istr)) {

@@ -752,7 +752,7 @@ namespace ranges {
 
 _EXPORT_STD template <class _NoThrowFwdIt, class _Diff>
 _NoThrowFwdIt uninitialized_default_construct_n(_NoThrowFwdIt _First, const _Diff _Count_raw) {
-    // default-initialize all elements in [_First, _First + _Count_raw)
+    // default-initialize all elements in [_First, _First + _Count)
     using _Ty                      = _Iter_value_t<_NoThrowFwdIt>;
     _Algorithm_int_t<_Diff> _Count = _Count_raw;
     if (_Count <= 0) {
@@ -886,7 +886,7 @@ namespace ranges {
 
 _EXPORT_STD template <class _NoThrowFwdIt, class _Diff>
 _NoThrowFwdIt uninitialized_value_construct_n(_NoThrowFwdIt _First, const _Diff _Count_raw) {
-    // value-initialize all elements in [_First, _First + _Count_raw)
+    // value-initialize all elements in [_First, _First + _Count)
     _Algorithm_int_t<_Diff> _Count = _Count_raw;
     if (_Count <= 0) {
         return _First;
@@ -935,7 +935,6 @@ namespace ranges {
 #endif // __cpp_lib_concepts
 #endif // _HAS_CXX17
 
-
 #if _HAS_DEPRECATED_RAW_STORAGE_ITERATOR
 _EXPORT_STD template <class _OutIt, class _Ty>
 class _CXX17_DEPRECATE_RAW_STORAGE_ITERATOR raw_storage_iterator { // wrap stores to raw buffer as output iterator
@@ -986,7 +985,6 @@ private:
 };
 #endif // _HAS_DEPRECATED_RAW_STORAGE_ITERATOR
 
-
 #if _HAS_AUTO_PTR_ETC
 _EXPORT_STD template <class _Ty>
 class auto_ptr;
@@ -1096,7 +1094,6 @@ public:
 };
 #endif // _HAS_AUTO_PTR_ETC
 
-
 _EXPORT_STD class bad_weak_ptr : public exception { // exception type for invalid use of expired weak_ptr object
 public:
     bad_weak_ptr() noexcept {}
@@ -3154,7 +3151,6 @@ private:
     mutable weak_ptr<_Ty> _Wptr;
 };
 
-
 _EXPORT_STD template <class _Ty>
 struct default_delete { // default deleter for unique_ptr
     constexpr default_delete() noexcept = default;
@@ -3459,7 +3455,6 @@ private:
     _Compressed_pair<_Dx, pointer> _Mypair;
 };
 
-
 _EXPORT_STD template <class _Ty, class... _Types, enable_if_t<!is_array_v<_Ty>, int> = 0>
 _NODISCARD_SMART_PTR_ALLOC _CONSTEXPR23 unique_ptr<_Ty> make_unique(_Types&&... _Args) { // make a unique_ptr
     return unique_ptr<_Ty>(new _Ty(_STD forward<_Types>(_Args)...));

@@ -2149,7 +2149,6 @@ private:
     param_type _Par;
 };
 
-
 // Returns smallest _Flt such that static_cast<_Ty>(_Result) > _Val.
 // First truncate to largest _Flt <= _Val, then add ceil(ulp).
 
@@ -5064,7 +5063,6 @@ _EXPORT_STD using knuth_b       = shuffle_order_engine<minstd_rand0, 256>;
 
 _EXPORT_STD using default_random_engine = mt19937;
 
-
 extern "C++" _CRTIMP2_PURE unsigned int __CLRCALL_PURE_OR_CDECL _Random_device();
 
 _EXPORT_STD class random_device { // class to generate random numbers (from hardware where available)

@@ -1592,8 +1592,7 @@ namespace ranges {
         _NODISCARD constexpr _Iterator begin() const noexcept /* strengthened */ {
             return _Iterator{_STD addressof(*_Value)};
         }
-        _NODISCARD constexpr auto end() const noexcept // strengthened
-        {
+        _NODISCARD constexpr auto end() const noexcept /* strengthened */ {
             if constexpr (same_as<_Bo, unreachable_sentinel_t>) {
                 return unreachable_sentinel;
             } else {

@@ -2022,7 +2022,7 @@ _CONSTEXPR20 _Alloc_ptr_t<_Alloc> _Uninitialized_value_construct_n(
 
 template <class _NoThrowFwdIt, class _Diff>
 _NoThrowFwdIt _Uninitialized_value_construct_n_unchecked1(_NoThrowFwdIt _UFirst, _Diff _Count) {
-    // value-initialize all elements in [_UFirst, _UFirst + _Count_raw)
+    // value-initialize all elements in [_UFirst, _UFirst + _Count)
     _STL_INTERNAL_CHECK(_Count >= 0);
     if constexpr (_Use_memset_value_construct_v<_NoThrowFwdIt>) {
         return _Zero_range(_UFirst, _UFirst + _Count);

@@ -39,7 +39,6 @@ using _SMF_control_copy = conditional_t<
     conjunction_v<is_copy_constructible<_Types>..., negation<conjunction<is_trivially_copy_constructible<_Types>...>>>,
     _Non_trivial_copy<_Base>, _Base>;
 
-
 template <class _Base, class... _Types>
 struct _Non_trivial_move : _SMF_control_copy<_Base, _Types...> { // non-trivial move construction facade
     using _Mybase = _SMF_control_copy<_Base, _Types...>;
@@ -60,7 +59,6 @@ using _SMF_control_move = conditional_t<
     conjunction_v<is_move_constructible<_Types>..., negation<conjunction<is_trivially_move_constructible<_Types>...>>>,
     _Non_trivial_move<_Base, _Types...>, _SMF_control_copy<_Base, _Types...>>;
 
-
 template <class _Base, class... _Types>
 struct _Non_trivial_copy_assign : _SMF_control_move<_Base, _Types...> { // non-trivial copy assignment facade
     using _Mybase = _SMF_control_move<_Base, _Types...>;
@@ -98,7 +96,6 @@ using _SMF_control_copy_assign =
         conditional_t<conjunction_v<is_copy_constructible<_Types>..., is_copy_assignable<_Types>...>,
             _Non_trivial_copy_assign<_Base, _Types...>, _Deleted_copy_assign<_Base, _Types...>>>;
 
-
 template <class _Base, class... _Types>
 struct _Non_trivial_move_assign : _SMF_control_copy_assign<_Base, _Types...> { // non-trivial move assignment facade
     using _Mybase = _SMF_control_copy_assign<_Base, _Types...>;
@@ -136,7 +133,6 @@ using _SMF_control_move_assign =
         conditional_t<conjunction_v<is_move_constructible<_Types>..., is_move_assignable<_Types>...>,
             _Non_trivial_move_assign<_Base, _Types...>, _Deleted_move_assign<_Base, _Types...>>>;
 
-
 template <class _Base, class... _Types>
 using _SMF_control = _SMF_control_move_assign<_Base, _Types...>;
-Original file line number
+Diff line change
@@ Expand Up / @@ -190,7 +190,6 @@ namespace experimental { @@
             return !(_Left < _Right);
         }
         struct suspend_if {
             bool _Ready;
@@ Expand Down @@