Use [[maybe_unused]] (#66)

Author: Morwenn

include/cpp-sort/detail/memory.h

@@ -143,13 +143,12 @@ namespace cppsort::detail
     }
 
     template<typename T>
-    auto return_temporary_buffer(T* ptr, std::size_t count) noexcept
+    auto return_temporary_buffer(T* ptr, [[maybe_unused]] std::size_t count) noexcept
         -> void
     {
 #ifdef __cpp_sized_deallocation
         ::operator delete(ptr, count * sizeof(T));
 #else
-        (void)count;
         ::operator delete(ptr);
 #endif
     }

include/cpp-sort/detail/swap_ranges.h

@@ -76,8 +76,7 @@ namespace cppsort::detail
     {
         CPPSORT_ASSERT(first1 <= last1);
 
-        auto last2 = first2 + (last1 - first1);
-        (void)last2;
+        [[maybe_unused]] auto last2 = first2 + (last1 - first1);
         CPPSORT_ASSERT(not (first2 >= first1 && first2 < last1));
         CPPSORT_ASSERT(not (last2 > first1 && last2 <= last1));
 

include/cpp-sort/utility/apply_permutation.h

@@ -17,14 +17,13 @@
 namespace cppsort::utility
 {
     template<typename RandomAccessIterator1, typename RandomAccessIterator2>
-    auto apply_permutation(RandomAccessIterator1 first, RandomAccessIterator1 last,
+    auto apply_permutation(RandomAccessIterator1 first, [[maybe_unused]] RandomAccessIterator1 last,
                            RandomAccessIterator2 indices_first, RandomAccessIterator2 indices_last)
         -> void
     {
         using difference_type = cppsort::detail::difference_type_t<RandomAccessIterator1>;
         using utility::iter_move;
         CPPSORT_ASSERT( (last - first) == (indices_last - indices_first) );
-        (void)last;
 
         auto size = indices_last - indices_first;
         for (difference_type idx = 0; idx < size; ++idx) {