Add a .clang-tidy file

Fix some of the clang-tidy diagnostics, mute a few specific ones. There are still diagnostics firing with the current configuration, but they can be ignored for now. This is but a first stone.
Morwenn · Dec 31, 2023 · bb621a7 · bb621a7
1 parent a53a0e2
commit bb621a7
Show file tree

Hide file tree

Showing 8 changed files with 40 additions and 16 deletions.
diff --git a/include/cpp-sort/utility/apply_permutation.h b/include/cpp-sort/utility/apply_permutation.h
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022 Morwenn
+ * Copyright (c) 2022-2023 Morwenn
  * SPDX-License-Identifier: MIT
  */
 #ifndef CPPSORT_UTILITY_APPLY_PERMUTATION_H_
@@ -13,9 +13,7 @@
 #include <cpp-sort/mstd/ranges.h>
 #include "../detail/config.h"
 
-namespace cppsort
-{
-namespace utility
+namespace cppsort::utility
 {
     template<
         mstd::random_access_iterator Iterator1,
@@ -53,6 +51,6 @@ namespace utility
         apply_permutation(mstd::begin(range), mstd::end(range),
                           mstd::begin(indices), mstd::end(indices));
     }
-}}
+}
 
 #endif // CPPSORT_UTILITY_APPLY_PERMUTATION_H_
diff --git a/tests/sorters/ska_sorter.cpp b/tests/sorters/ska_sorter.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017-2022 Morwenn
+ * Copyright (c) 2017-2023 Morwenn
  * SPDX-License-Identifier: MIT
  */
 #include <algorithm>
@@ -23,6 +23,7 @@ TEST_CASE( "ska_sorter tests", "[ska_sorter]" )
     SECTION( "sort with range of int" )
     {
         std::vector<int> vec;
+        vec.reserve(100'000);
         distribution(std::back_inserter(vec), 100'000);
         cppsort::ska_sort(vec);
         CHECK( std::is_sorted(vec.begin(), vec.end()) );
@@ -31,6 +32,7 @@ TEST_CASE( "ska_sorter tests", "[ska_sorter]" )
     SECTION( "sort with unsigned int iterators" )
     {
         std::vector<unsigned> vec;
+        vec.reserve(100'000);
         distribution(std::back_inserter(vec), 100'000);
         cppsort::ska_sort(vec.begin(), vec.end());
         CHECK( std::is_sorted(vec.begin(), vec.end()) );
@@ -40,6 +42,7 @@ TEST_CASE( "ska_sorter tests", "[ska_sorter]" )
     SECTION( "sort with range of int128" )
     {
         std::vector<__int128_t> vec;
+        vec.reserve(100'000);
         distribution(std::back_inserter(vec), 100'000, -10'000);
         cppsort::ska_sort(vec);
         CHECK( std::is_sorted(vec.begin(), vec.end()) );
@@ -48,6 +51,7 @@ TEST_CASE( "ska_sorter tests", "[ska_sorter]" )
     SECTION( "sort with range of unsigned int128" )
     {
         std::vector<__uint128_t> vec;
+        vec.reserve(100'000);
         distribution(std::back_inserter(vec), 100'000);
         cppsort::ska_sort(vec);
         CHECK( std::is_sorted(vec.begin(), vec.end()) );
@@ -57,6 +61,7 @@ TEST_CASE( "ska_sorter tests", "[ska_sorter]" )
     SECTION( "sort with range of float" )
     {
         std::vector<float> vec;
+        vec.reserve(100'000);
         distribution.call<float>(std::back_inserter(vec), 100'000);
         cppsort::ska_sort(vec);
         CHECK( std::is_sorted(vec.begin(), vec.end()) );
@@ -65,6 +70,7 @@ TEST_CASE( "ska_sorter tests", "[ska_sorter]" )
     SECTION( "sort with double iterators" )
     {
         std::vector<double> vec;
+        vec.reserve(100'000);
         distribution.call<double>(std::back_inserter(vec), 100'000);
         cppsort::ska_sort(vec.begin(), vec.end());
         CHECK( std::is_sorted(vec.begin(), vec.end()) );
@@ -73,6 +79,7 @@ TEST_CASE( "ska_sorter tests", "[ska_sorter]" )
     SECTION( "sort with std::string" )
     {
         std::vector<std::string> vec;
+        vec.reserve(100'000);
         for (int i = 0 ; i < 100'000 ; ++i) {
             vec.push_back(std::to_string(i));
         }

diff --git a/tests/sorters/ska_sorter_projection.cpp b/tests/sorters/ska_sorter_projection.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017-2022 Morwenn
+ * Copyright (c) 2017-2023 Morwenn
  * SPDX-License-Identifier: MIT
  */
 #include <algorithm>
@@ -19,6 +19,7 @@ TEST_CASE( "ska_sorter tests with projections",
     SECTION( "sort with range of int" )
     {
         std::vector<std::pair<int, float>> vec;
+        vec.reserve(100'000);
         for (int i = 0 ; i < 100'000 ; ++i) {
             vec.emplace_back(i, float(i));
         }
@@ -31,6 +32,7 @@ TEST_CASE( "ska_sorter tests with projections",
     SECTION( "sort with unsigned int iterators" )
     {
         std::vector<std::pair<unsigned, float>> vec;
+        vec.reserve(100'000);
         for (int i = 0 ; i < 100'000 ; ++i) {
             vec.emplace_back(i, float(i));
         }
@@ -43,6 +45,7 @@ TEST_CASE( "ska_sorter tests with projections",
     SECTION( "sort with range of float" )
     {
         std::vector<std::pair<int, float>> vec;
+        vec.reserve(100'000);
         for (int i = 0 ; i < 100'000 ; ++i) {
             vec.emplace_back(i, float(i));
         }
@@ -55,6 +58,7 @@ TEST_CASE( "ska_sorter tests with projections",
     SECTION( "sort with double iterators" )
     {
         std::vector<std::pair<int, double>> vec;
+        vec.reserve(100'000);
         for (int i = 0 ; i < 100'000 ; ++i) {
             vec.emplace_back(i, double(i));
         }
@@ -69,6 +73,7 @@ TEST_CASE( "ska_sorter tests with projections",
         using wrapper = generic_wrapper<std::string>;
 
         std::vector<wrapper> vec;
+        vec.reserve(100'000);
         for (int i = 0 ; i < 100'000 ; ++i) {
             vec.emplace_back(std::to_string(i));
         }

diff --git a/tests/sorters/spread_sorter.cpp b/tests/sorters/spread_sorter.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015-2022 Morwenn
+ * Copyright (c) 2015-2023 Morwenn
  * SPDX-License-Identifier: MIT
  */
 #include <algorithm>
@@ -18,6 +18,7 @@ TEST_CASE( "spread_sorter tests", "[spread_sorter]" )
     SECTION( "sort with range of int" )
     {
         std::vector<int> vec;
+        vec.reserve(100'000);
         distribution(std::back_inserter(vec), 100'000);
         cppsort::spread_sort(vec);
         CHECK( std::is_sorted(vec.begin(), vec.end()) );
@@ -26,6 +27,7 @@ TEST_CASE( "spread_sorter tests", "[spread_sorter]" )
     SECTION( "sort with unsigned int iterators" )
     {
         std::vector<unsigned> vec;
+        vec.reserve(100'000);
         distribution(std::back_inserter(vec), 100'000);
         cppsort::spread_sort(vec.begin(), vec.end());
         CHECK( std::is_sorted(vec.begin(), vec.end()) );
@@ -34,6 +36,7 @@ TEST_CASE( "spread_sorter tests", "[spread_sorter]" )
     SECTION( "sort with range of float" )
     {
         std::vector<float> vec;
+        vec.reserve(100'000);
         distribution.call<float>(std::back_inserter(vec), 100'000);
         cppsort::spread_sort(vec);
         CHECK( std::is_sorted(vec.begin(), vec.end()) );
@@ -42,6 +45,7 @@ TEST_CASE( "spread_sorter tests", "[spread_sorter]" )
     SECTION( "sort with double iterators" )
     {
         std::vector<double> vec;
+        vec.reserve(100'000);
         distribution.call<double>(std::back_inserter(vec), 100'000);
         cppsort::spread_sort(vec.begin(), vec.end());
         CHECK( std::is_sorted(vec.begin(), vec.end()) );
@@ -50,6 +54,7 @@ TEST_CASE( "spread_sorter tests", "[spread_sorter]" )
     SECTION( "sort with std::string" )
     {
         std::vector<std::string> vec;
+        vec.reserve(100'000);
         for (int i = 0 ; i < 100'000 ; ++i) {
             vec.push_back(std::to_string(i));
         }
@@ -66,6 +71,7 @@ TEST_CASE( "spread_sorter tests", "[spread_sorter]" )
     SECTION( "reverse sort with std::string" )
     {
         std::vector<std::string> vec;
+        vec.reserve(100'000);
         for (int i = 0 ; i < 100'000 ; ++i) {
             vec.push_back(std::to_string(i));
         }

diff --git a/tests/sorters/spread_sorter_projection.cpp b/tests/sorters/spread_sorter_projection.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016-2022 Morwenn
+ * Copyright (c) 2016-2023 Morwenn
  * SPDX-License-Identifier: MIT
  */
 #include <algorithm>
@@ -19,6 +19,7 @@ TEST_CASE( "spread_sorter tests with projections",
     SECTION( "sort with range of int" )
     {
         std::vector<std::pair<int, float>> vec;
+        vec.reserve(100'000);
         for (int i = 0 ; i < 100'000 ; ++i) {
             vec.emplace_back(i, float(i));
         }
@@ -31,6 +32,7 @@ TEST_CASE( "spread_sorter tests with projections",
     SECTION( "sort with unsigned int iterators" )
     {
         std::vector<std::pair<unsigned, float>> vec;
+        vec.reserve(100'000);
         for (int i = 0 ; i < 100'000 ; ++i) {
             vec.emplace_back(i, float(i));
         }
@@ -43,6 +45,7 @@ TEST_CASE( "spread_sorter tests with projections",
     SECTION( "sort with range of float" )
     {
         std::vector<std::pair<int, float>> vec;
+        vec.reserve(100'000);
         for (int i = 0 ; i < 100'000 ; ++i) {
             vec.emplace_back(i, float(i));
         }
@@ -55,6 +58,7 @@ TEST_CASE( "spread_sorter tests with projections",
     SECTION( "sort with double iterators" )
     {
         std::vector<std::pair<int, double>> vec;
+        vec.reserve(100'000);
         for (int i = 0 ; i < 100'000 ; ++i) {
             vec.emplace_back(i, double(i));
         }
@@ -69,6 +73,7 @@ TEST_CASE( "spread_sorter tests with projections",
         using wrapper = generic_wrapper<std::string>;
 
         std::vector<wrapper> vec;
+        vec.reserve(100'000);
         for (int i = 0 ; i < 100'000 ; ++i) {
             vec.emplace_back(std::to_string(i));
         }
@@ -83,6 +88,7 @@ TEST_CASE( "spread_sorter tests with projections",
         using wrapper = generic_wrapper<std::string>;
 
         std::vector<wrapper> vec;
+        vec.reserve(100'000);
         for (int i = 0 ; i < 100'000 ; ++i) {
             vec.emplace_back(std::to_string(i));
         }

diff --git a/tests/testing-tools/random.h b/tests/testing-tools/random.h
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021-2022 Morwenn
+ * Copyright (c) 2021-2023 Morwenn
  * SPDX-License-Identifier: MIT
  */
 #ifndef CPPSORT_TESTSUITE_RANDOM_H_
@@ -136,7 +136,7 @@ namespace hasard // Blame POSIX for picking the good name
     //
     // Returns a random integer in the range [low, high].
     // See *Optimal Discrete Uniform Generation from Coin Flips,
-    // and Applications* by Jérémie Lumbroso
+    // and Applications* by Jérémie Lumbroso
 
     template<typename Integer, typename URBG>
     auto randint(Integer low, Integer high, URBG& generator)

diff --git a/tests/utility/branchless_traits.cpp b/tests/utility/branchless_traits.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017-2022 Morwenn
+ * Copyright (c) 2017-2023 Morwenn
  * SPDX-License-Identifier: MIT
  */
 #include <functional>
@@ -74,7 +74,7 @@ TEST_CASE( "test that some specific projections are branchless",
     struct foobar
     {
         int foo;
-        int bar() { return 0; }
+        auto bar() -> int { return 0; }
     };
 
     STATIC_CHECK( is_probably_branchless_projection_v<std::identity, std::string> );

diff --git a/tests/utility/chainable_projections.cpp b/tests/utility/chainable_projections.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020-2022 Morwenn
+ * Copyright (c) 2020-2023 Morwenn
  * SPDX-License-Identifier: MIT
  */
 #include <algorithm>
@@ -20,7 +20,8 @@ namespace
     struct proj1:
         cppsort::utility::projection_base
     {
-        int operator()(int value) const
+        auto operator()(int value) const
+            -> int
         {
             return -value;
         }
@@ -29,7 +30,8 @@ namespace
     struct proj2:
         cppsort::utility::projection_base
     {
-        int operator()(int value)
+        auto operator()(int value)
+            -> int
         {
             return -value;
         }