class-not-typename

Author: izvolov

libcxx/include/__algorithm/radix_sort.h

@@ -51,28 +51,28 @@ inline _LIBCPP_HIDE_FROM_ABI void __variadic_expansion_dummy(initializer_list<in
 
 #  define _EXPAND_VARIADIC(expression) std::__variadic_expansion_dummy({(expression, 0)...})
 
-template <typename _Iterator>
+template <class _Iterator>
 _LIBCPP_HIDE_FROM_ABI constexpr auto __move_assign_please(_Iterator __i)
     -> enable_if_t<is_move_assignable<typename iterator_traits<_Iterator>::value_type>::value,
                    move_iterator<_Iterator> > {
   return std::make_move_iterator(std::move(__i));
 }
 
-template <typename _Iterator>
+template <class _Iterator>
 _LIBCPP_HIDE_FROM_ABI constexpr auto __move_assign_please(_Iterator __i)
     -> enable_if_t<not is_move_assignable<typename iterator_traits<_Iterator>::value_type>::value, _Iterator> {
   return __i;
 }
 
-template <typename _UnsignedInteger>
+template <class _UnsignedInteger>
 _LIBCPP_HIDE_FROM_ABI constexpr _UnsignedInteger __intlog2(_UnsignedInteger __n) {
   static_assert(is_integral<_UnsignedInteger>::value, "Must be an integral type");
   static_assert(is_unsigned<_UnsignedInteger>::value, "Must be unsigned");
 
   return numeric_limits<_UnsignedInteger>::digits - 1 - std::__countl_zero(__n);
 }
 
-template <typename _InputIterator, typename _OutputIterator>
+template <class _InputIterator, class _OutputIterator>
 _LIBCPP_HIDE_FROM_ABI pair<_OutputIterator, typename iterator_traits<_InputIterator>::value_type>
 __partial_sum_max(_InputIterator __first, _InputIterator __last, _OutputIterator __result) {
   if (__first == __last)
@@ -92,7 +92,7 @@ __partial_sum_max(_InputIterator __first, _InputIterator __last, _OutputIterator
   return {++__result, __max};
 }
 
-template <typename _Value, typename _Map, typename _Radix>
+template <class _Value, class _Map, class _Radix>
 struct __radix_sort_traits {
   using image_type = decay_t<invoke_result_t<_Map, _Value> >;
   static_assert(is_integral<image_type>::value, "");
@@ -106,7 +106,7 @@ struct __radix_sort_traits {
   constexpr static auto __radix_count       = sizeof(image_type) * CHAR_BIT / __radix_size;
 };
 
-template <typename _Value, typename _Map>
+template <class _Value, class _Map>
 struct __counting_sort_traits {
   using image_type = decay_t<invoke_result_t<_Map, _Value> >;
   static_assert(is_integral<image_type>::value, "");
@@ -116,7 +116,7 @@ struct __counting_sort_traits {
   constexpr static auto __radix_size        = std::__intlog2<uint64_t>(__value_range);
 };
 
-template <typename _Radix>
+template <class _Radix>
 _LIBCPP_HIDE_FROM_ABI auto __nth_radix(size_t __radix_number, _Radix __radix) {
   return [__radix_number, __radix = std::move(__radix)](auto __n) {
     using value_type = decltype(__n);
@@ -128,13 +128,13 @@ _LIBCPP_HIDE_FROM_ABI auto __nth_radix(size_t __radix_number, _Radix __radix) {
   };
 }
 
-template <typename _ForwardIterator, typename _Map, typename _RandomAccessIterator>
+template <class _ForwardIterator, class _Map, class _RandomAccessIterator>
 _LIBCPP_HIDE_FROM_ABI void
 __count(_ForwardIterator __first, _ForwardIterator __last, _Map __map, _RandomAccessIterator __counters) {
   std::for_each(__first, __last, [&__counters, &__map](const auto& __preimage) { ++__counters[__map(__preimage)]; });
 }
 
-template <typename _ForwardIterator, typename _Map, typename _RandomAccessIterator>
+template <class _ForwardIterator, class _Map, class _RandomAccessIterator>
 _LIBCPP_HIDE_FROM_ABI void
 __collect(_ForwardIterator __first, _ForwardIterator __last, _Map __map, _RandomAccessIterator __counters) {
   using value_type = typename iterator_traits<_ForwardIterator>::value_type;
@@ -146,7 +146,7 @@ __collect(_ForwardIterator __first, _ForwardIterator __last, _Map __map, _Random
   std::partial_sum(__counters, __counters_end, __counters);
 }
 
-template <typename _ForwardIterator, typename _RandomAccessIterator1, typename _Map, typename _RandomAccessIterator2>
+template <class _ForwardIterator, class _RandomAccessIterator1, class _Map, class _RandomAccessIterator2>
 _LIBCPP_HIDE_FROM_ABI void
 __dispose(_ForwardIterator __first,
           _ForwardIterator __last,
@@ -159,10 +159,7 @@ __dispose(_ForwardIterator __first,
   });
 }
 
-template <typename _BidirectionalIterator,
-          typename _RandomAccessIterator1,
-          typename _Map,
-          typename _RandomAccessIterator2>
+template <class _BidirectionalIterator, class _RandomAccessIterator1, class _Map, class _RandomAccessIterator2>
 _LIBCPP_HIDE_FROM_ABI void dispose_backward(
     _BidirectionalIterator __first,
     _BidirectionalIterator __last,
@@ -177,11 +174,11 @@ _LIBCPP_HIDE_FROM_ABI void dispose_backward(
                 });
 }
 
-template <typename _ForwardIterator,
-          typename _Map,
-          typename _Radix,
-          typename _RandomAccessIterator1,
-          typename _RandomAccessIterator2,
+template <class _ForwardIterator,
+          class _Map,
+          class _Radix,
+          class _RandomAccessIterator1,
+          class _RandomAccessIterator2,
           size_t... _Radices>
 _LIBCPP_HIDE_FROM_ABI bool __collect_impl(
     _ForwardIterator __first,
@@ -212,11 +209,7 @@ _LIBCPP_HIDE_FROM_ABI bool __collect_impl(
   return __is_sorted;
 }
 
-template <typename _ForwardIterator,
-          typename _Map,
-          typename _Radix,
-          typename _RandomAccessIterator1,
-          typename _RandomAccessIterator2>
+template <class _ForwardIterator, class _Map, class _Radix, class _RandomAccessIterator1, class _RandomAccessIterator2>
 _LIBCPP_HIDE_FROM_ABI bool
 __collect(_ForwardIterator __first,
           _ForwardIterator __last,
@@ -230,10 +223,7 @@ __collect(_ForwardIterator __first,
       __first, __last, __map, __radix, __counters, __maximums, make_index_sequence<__radix_count>());
 }
 
-template <typename _BidirectionalIterator,
-          typename _RandomAccessIterator1,
-          typename _Map,
-          typename _RandomAccessIterator2>
+template <class _BidirectionalIterator, class _RandomAccessIterator1, class _Map, class _RandomAccessIterator2>
 _LIBCPP_HIDE_FROM_ABI void __dispose_backward(
     _BidirectionalIterator __first,
     _BidirectionalIterator __last,
@@ -248,7 +238,7 @@ _LIBCPP_HIDE_FROM_ABI void __dispose_backward(
                 });
 }
 
-template <typename _ForwardIterator, typename _RandomAccessIterator, typename _Map>
+template <class _ForwardIterator, class _RandomAccessIterator, class _Map>
 _LIBCPP_HIDE_FROM_ABI _RandomAccessIterator
 __counting_sort_impl(_ForwardIterator __first, _ForwardIterator __last, _RandomAccessIterator __result, _Map __map) {
   using value_type = typename iterator_traits<_ForwardIterator>::value_type;
@@ -263,7 +253,7 @@ __counting_sort_impl(_ForwardIterator __first, _ForwardIterator __last, _RandomA
   return __result + __counters[traits::__value_range];
 }
 
-template <typename _RandomAccessIterator1, typename _RandomAccessIterator2, typename _Map, typename _Radix>
+template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _Map, class _Radix>
 _LIBCPP_HIDE_FROM_ABI typename enable_if<
     __radix_sort_traits<typename iterator_traits<_RandomAccessIterator1>::value_type, _Map, _Radix>::__radix_count == 1,
     void>::type
@@ -281,7 +271,7 @@ __radix_sort_impl(_RandomAccessIterator1 __first,
   std::copy(std::__move_assign_please(buffer), std::__move_assign_please(__buffer_end), __first);
 }
 
-template <typename _RandomAccessIterator1, typename _RandomAccessIterator2, typename _Map, typename _Radix>
+template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _Map, class _Radix>
 _LIBCPP_HIDE_FROM_ABI typename enable_if<
     __radix_sort_traits<typename iterator_traits<_RandomAccessIterator1>::value_type, _Map, _Radix>::__radix_count %
             2 ==
@@ -343,21 +333,21 @@ __radix_sort_impl(_RandomAccessIterator1 __first,
 
 _LIBCPP_HIDE_FROM_ABI constexpr auto __to_unsigned(bool __b) { return __b; }
 
-template <typename _Ip>
+template <class _Ip>
 _LIBCPP_HIDE_FROM_ABI constexpr auto __to_unsigned(_Ip __n) {
   constexpr const auto __min_value = numeric_limits<_Ip>::min();
   return static_cast<make_unsigned_t<_Ip> >(__n ^ __min_value);
 }
 
 struct __identity_fn {
-  template <typename _Tp>
+  template <class _Tp>
   _LIBCPP_HIDE_FROM_ABI constexpr decltype(auto) operator()(_Tp&& __value) const {
     return std::forward<_Tp>(__value);
   }
 };
 
 struct __low_byte_fn {
-  template <typename _Ip>
+  template <class _Ip>
   _LIBCPP_HIDE_FROM_ABI constexpr uint8_t operator()(_Ip __integer) const {
     static_assert(is_integral<_Ip>::value, "");
     static_assert(is_unsigned<_Ip>::value, "");
@@ -366,7 +356,7 @@ struct __low_byte_fn {
   }
 };
 
-template <typename _RandomAccessIterator1, typename _RandomAccessIterator2, typename _Map, typename _Radix>
+template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _Map, class _Radix>
 _LIBCPP_HIDE_FROM_ABI void
 __radix_sort(_RandomAccessIterator1 __first,
              _RandomAccessIterator1 __last,
@@ -377,20 +367,20 @@ __radix_sort(_RandomAccessIterator1 __first,
   std::__radix_sort_impl(__first, __last, buffer, __map_to_unsigned, __radix);
 }
 
-template <typename _RandomAccessIterator1, typename _RandomAccessIterator2>
+template <class _RandomAccessIterator1, class _RandomAccessIterator2>
 _LIBCPP_HIDE_FROM_ABI void
 __radix_sort(_RandomAccessIterator1 __first, _RandomAccessIterator1 __last, _RandomAccessIterator2 buffer) {
   std::__radix_sort(__first, __last, buffer, __identity_fn{}, __low_byte_fn{});
 }
 
-template <typename _RandomAccessIterator1, typename _RandomAccessIterator2>
+template <class _RandomAccessIterator1, class _RandomAccessIterator2>
 _LIBCPP_HIDE_FROM_ABI bool __radix_sort(
     _RandomAccessIterator1 __first, _RandomAccessIterator1 __last, _RandomAccessIterator2 buffer, _BoolConstant<true>) {
   std::__radix_sort(__first, __last, buffer, __identity_fn{}, __low_byte_fn{});
   return true;
 }
 
-template <typename _RandomAccessIterator1, typename _RandomAccessIterator2>
+template <class _RandomAccessIterator1, class _RandomAccessIterator2>
 _LIBCPP_HIDE_FROM_ABI bool
 __radix_sort(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2, _BoolConstant<false>) {
   return false;
@@ -400,7 +390,7 @@ __radix_sort(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterat
 
 #else // _LIBCPP_STD_VER > 14
 
-template <typename _RandomAccessIterator1, typename _RandomAccessIterator2, bool _EnableRadixSort>
+template <class _RandomAccessIterator1, class _RandomAccessIterator2, bool _EnableRadixSort>
 _LIBCPP_HIDE_FROM_ABI bool
 __radix_sort(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2, _BoolConstant<_EnableRadixSort>) {
   return false;