static_assert without a message

Author: Morwenn

docs/Sorter-traits.md

@@ -153,7 +153,7 @@ When a sorter adapter is used, the *resulting sorter* is considered always stabl
 template<typename>
 struct is_stable;
 
-template<typename Sorter, typename Args> 
+template<typename Sorter, typename Args>
 struct is_stable<Sorter(Args...)>:
     sorter_traits<Sorter>::is_always_stable
 {};
@@ -166,7 +166,7 @@ This trait is a more flexible version of [`is_always_stable`][is-always-stable]:
 
 ```cpp
 using sorter = self_sort_adapter<heap_sorter>;
-static_assert(is_stable<sorter(std::list<int>&)>, "");
+static_assert(is_stable<sorter(std::list<int>&)>);
 ```
 
 [`self_sort_adapter`][self-sort-adapter] is a [*sorter adapter*][sorter-adapters] that checks whether a container can sort itself and, if so, uses the container's sorting method instead of the *adapted sorter*. As a matter of fact, [`std::list::sort`][std-list-sort] implements a stable sorting algorithm and **cpp-sort** specializes `is_stable` to take that information into account, so `is_stable_v<sorter(std::list<int>&)>` is `true` despite `is_always_stable_v<sorter>` being `false`. However, `is_stable_v<sorter(std::vector<int>&)>` and `is_stable_v<sorter(std::list<int>::iterator, std::list<int>::iterator)>` remain `false`.

include/cpp-sort/detail/memcpy_cast.h

@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017 Morwenn
+ * Copyright (c) 2017-2025 Morwenn
  * SPDX-License-Identifier: MIT
  */
 #ifndef CPPSORT_DETAIL_MEMCPY_CAST_H_
@@ -20,9 +20,9 @@ namespace detail
     auto memcpy_cast(const From& value)
         -> To
     {
-        static_assert(std::is_trivially_copyable<From>::value, "");
-        static_assert(std::is_trivially_copyable<To>::value, "");
-        static_assert(sizeof(From) == sizeof(To), "");
+        static_assert(std::is_trivially_copyable<From>::value);
+        static_assert(std::is_trivially_copyable<To>::value);
+        static_assert(sizeof(From) == sizeof(To));
 
         To result;
         std::memcpy(std::addressof(result),

include/cpp-sort/detail/spreadsort/detail/common.h

@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015-2022 Morwenn
+ * Copyright (c) 2015-2025 Morwenn
  * SPDX-License-Identifier: MIT
  */
 
@@ -65,13 +65,13 @@ namespace detail
       constexpr unsigned min_size = log_mean_bin_size + log_min_split_count;
       //Assuring that constants have valid settings
       static_assert(log_min_split_count <= max_splits &&
-                    log_min_split_count > 0, "");
+                    log_min_split_count > 0);
       static_assert(max_splits > 1 &&
-                    max_splits < (8 * sizeof(unsigned)), "");
+                    max_splits < (8 * sizeof(unsigned)));
       static_assert(max_finishing_splits >= max_splits &&
-                    max_finishing_splits < (8 * sizeof(unsigned)), "");
-      static_assert(log_mean_bin_size >= 0, "");
-      static_assert(log_finishing_count >= 0, "");
+                    max_finishing_splits < (8 * sizeof(unsigned)));
+      static_assert(log_mean_bin_size >= 0);
+      static_assert(log_finishing_count >= 0);
       //if we can complete in one iteration, do so
       //This first check allows the compiler to optimize never-executed code out
       if (log_finishing_count < min_size) {

include/cpp-sort/detail/spreadsort/detail/string_sort.h

@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015-2022 Morwenn
+ * Copyright (c) 2015-2025 Morwenn
  * SPDX-License-Identifier: MIT
  */
 
@@ -109,7 +109,7 @@ namespace spreadsort
 
             std::size_t minSize = (std::min)(proj_x.size(), proj_y.size());
             for (std::size_t u = std::get<0>(data); u < minSize; ++u) {
-                static_assert(sizeof(proj_x[u]) == sizeof(Unsigned_char_type), "");
+                static_assert(sizeof(proj_x[u]) == sizeof(Unsigned_char_type));
                 if (static_cast<Unsigned_char_type>(proj_x[u]) != static_cast<Unsigned_char_type>(proj_y[u])) {
                     return static_cast<Unsigned_char_type>(proj_x[u]) <
                            static_cast<Unsigned_char_type>(proj_y[u]);
@@ -140,7 +140,7 @@ namespace spreadsort
 
             std::size_t minSize = (std::min)(proj_x.size(), proj_y.size());
             for (std::size_t u = std::get<0>(data); u < minSize; ++u) {
-                static_assert(sizeof(proj_x[u]) == sizeof(Unsigned_char_type), "");
+                static_assert(sizeof(proj_x[u]) == sizeof(Unsigned_char_type));
                 if (static_cast<Unsigned_char_type>(proj_x[u]) != static_cast<Unsigned_char_type>(proj_y[u])) {
                     return static_cast<Unsigned_char_type>(proj_x[u]) >
                            static_cast<Unsigned_char_type>(proj_y[u]);