Use std::bool_constant

Author: Morwenn

docs/Writing-a-sorter.md

@@ -368,7 +368,7 @@ While type-specific sorters are, by their very nature, unable to generically han
 
 ## Stability
 
-A sorting algorithm is said to be [stable][stability] if it preserves the relative order of *equivalent elements*. **cpp-sort** documents the stability of every sorter by giving them an `is_always_stable` type aliasing a boolean specialization of `std::integer_constant`. This information should be accessed via [`sorter_traits`][sorter-traits] or via the more specific [`is_always_stable`][is-always-stable] trait. The stability of a sorter is always either [`std::true_type` or `std::false_type`][std-integral-constant].
+A sorting algorithm is said to be [stable][stability] if it preserves the relative order of *equivalent elements*. **cpp-sort** documents the stability of every sorter by giving them an `is_always_stable` type aliasing a specialization of `std::bool_constant`. This information should be accessed via [`sorter_traits`][sorter-traits] or via the more specific [`is_always_stable`][is-always-stable] trait. The stability of a sorter is always either [`std::true_type` or `std::false_type`][std-integral-constant].
 
 ```cpp
 using stability = cppsort::is_always_stable<cppsort::tim_sorter>;

include/cpp-sort/adapters/verge_adapter.h

@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017-2023 Morwenn
+ * Copyright (c) 2017-2025 Morwenn
  * SPDX-License-Identifier: MIT
  */
 #ifndef CPPSORT_ADAPTERS_VERGE_ADAPTER_H_
@@ -92,7 +92,7 @@ namespace cppsort
             // Sorter traits
 
             using iterator_category = typename bidir_at_best_tag<Sorter>::type;
-            using is_always_stable = std::integral_constant<bool, Stable>;
+            using is_always_stable = std::bool_constant<Stable>;
         };
     }
 

include/cpp-sort/detail/checkers.h

@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016-2017 Morwenn
+ * Copyright (c) 2016-2025 Morwenn
  * SPDX-License-Identifier: MIT
  */
 #ifndef CPPSORT_DETAIL_CHECKERS_H_
@@ -45,8 +45,7 @@ namespace detail
     template<typename... Sorters>
     struct check_is_always_stable_impl<true, Sorters...>
     {
-        using is_always_stable = std::integral_constant<
-            bool,
+        using is_always_stable = std::bool_constant<
             all(typename sorter_traits<Sorters>::is_always_stable{}()...)
         >;
     };

include/cpp-sort/detail/move.h

@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019-2022 Morwenn
+ * Copyright (c) 2019-2025 Morwenn
  * SPDX-License-Identifier: MIT
  */
 #ifndef CPPSORT_DETAIL_MOVE_H_
@@ -101,7 +101,7 @@ namespace detail
     auto uninitialized_move(InputIterator first, InputIterator last, T* result, destruct_n<T>& destroyer)
         -> T*
     {
-        using truth_type = std::integral_constant<bool,
+        using truth_type = std::bool_constant<
             std::is_trivial<value_type_t<InputIterator>>::value &&
             std::is_trivial<T>::value
         >;

include/cpp-sort/detail/raw_checkers.h

@@ -71,8 +71,7 @@ namespace detail
     template<typename... Sorters>
     struct raw_check_is_always_stable_impl<true, Sorters...>
     {
-        using is_always_stable = std::integral_constant<
-            bool,
+        using is_always_stable = std::bool_constant<
             all(typename Sorters::is_always_stable{}()...)
         >;
     };

include/cpp-sort/detail/ska_sort.h

@@ -959,15 +959,15 @@ namespace detail
 
     template<>
     struct is_ska_sortable<float>:
-        std::integral_constant<bool,
+        std::bool_constant<
             sizeof(float) == sizeof(std::uint32_t) &&
             std::numeric_limits<float>::is_iec559
         >
     {};
 
     template<>
     struct is_ska_sortable<double>:
-        std::integral_constant<bool,
+        std::bool_constant<
             sizeof(double) == sizeof(std::uint64_t) &&
             std::numeric_limits<double>::is_iec559
         >

include/cpp-sort/detail/vergesort.h

@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015-2024 Morwenn
+ * Copyright (c) 2015-2025 Morwenn
  * SPDX-License-Identifier: MIT
  */
 #ifndef CPPSORT_DETAIL_VERGESORT_H_
@@ -529,7 +529,7 @@ namespace verge
         verge::sort<Stable>(iterator_category_t<BidirectionalIterator>{},
                             std::move(first), std::move(last), size,
                             std::move(compare), std::move(projection),
-                            get_maybe_stable(std::integral_constant<bool, Stable>{}, std::move(fallback)));
+                            get_maybe_stable(std::bool_constant<Stable>{}, std::move(fallback)));
     }
 }}}