Use nested namespaces where possible (#66)

Author: Morwenn

include/cpp-sort/detail/adaptive_quickselect.h

@@ -27,9 +27,7 @@
 #include "partition.h"
 #include "type_traits.h"
 
-namespace cppsort
-{
-namespace detail
+namespace cppsort::detail
 {
     namespace median_common_detail
     {
@@ -483,6 +481,6 @@ namespace detail
         }
         return mid;
     }
-}}
+}
 
 #endif // CPPSORT_DETAIL_QUICKSELECT_ADAPTIVE_H_

include/cpp-sort/detail/associate_iterator.h

@@ -13,9 +13,7 @@
 #include <cpp-sort/utility/iter_move.h>
 #include "iterator_traits.h"
 
-namespace cppsort
-{
-namespace detail
+namespace cppsort::detail
 {
     //
     // This header contains utility classes used when an adapter
@@ -355,6 +353,6 @@ namespace detail
 
             Iterator _it;
     };
-}}
+}
 
 #endif // CPPSORT_DETAIL_ASSOCIATE_ITERATOR_H_

include/cpp-sort/detail/binary_tree.h

@@ -11,9 +11,7 @@
 #include <type_traits>
 #include <utility>
 
-namespace cppsort
-{
-namespace detail
+namespace cppsort::detail
 {
     struct binary_tree_node_base
     {
@@ -53,6 +51,6 @@ namespace detail
         // Stored value
         T value;
     };
-}}
+}
 
 #endif // CPPSORT_DETAIL_BINARY_TREE_H_

include/cpp-sort/detail/bitops.h

@@ -14,9 +14,7 @@
 #include "config.h"
 #include "type_traits.h"
 
-namespace cppsort
-{
-namespace detail
+namespace cppsort::detail
 {
     // Cast signed value to unsigned one
     template<typename Integer>
@@ -137,6 +135,6 @@ namespace detail
         constexpr auto n = std::numeric_limits<Unsigned>::digits;
         return (x << s) | (x >> (n - s));
     }
-}}
+}
 
 #endif // CPPSORT_DETAIL_BITOPS_H_

include/cpp-sort/detail/boost_common/range.h

@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019-2022 Morwenn
+ * Copyright (c) 2019-2025 Morwenn
  * SPDX-License-Identifier: MIT
  */
 
@@ -28,11 +28,7 @@
 #include "../iterator_traits.h"
 #include "../move.h"
 
-namespace cppsort
-{
-namespace detail
-{
-namespace boost_common
+namespace cppsort::detail::boost_common
 {
     ///---------------------------------------------------------------------------
     /// @struct range
@@ -208,6 +204,6 @@ namespace boost_common
                                        compare, projection);
         return range<Iter2_t>(dest.first, it_aux);
     }
-}}}
+}
 
 #endif  // CPPSORT_DETAIL_BOOST_COMMON_RANGE_H_

include/cpp-sort/detail/boost_common/util/merge.h

@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019-2022 Morwenn
+ * Copyright (c) 2019-2025 Morwenn
  * SPDX-License-Identifier: MIT
  */
 
@@ -31,13 +31,7 @@
 #include "../../merge_move.h"
 #include "../../move.h"
 
-namespace cppsort
-{
-namespace detail
-{
-namespace boost_common
-{
-namespace util
+namespace cppsort::detail::boost_common::util
 {
     //-----------------------------------------------------------------------------
     //  function : merge
@@ -134,6 +128,6 @@ namespace util
                                             end_buf1 - buf1, compare, projection);
         return end_buf2;
     }
-}}}}
+}
 
 #endif // CPPSORT_DETAIL_BOOST_COMMON_UTIL_MERGE_H_

include/cpp-sort/detail/bubble_sort.h

@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015-2017 Morwenn
+ * Copyright (c) 2015-2025 Morwenn
  * SPDX-License-Identifier: MIT
  */
 #ifndef CPPSORT_DETAIL_BUBBLE_SORT_H_
@@ -12,9 +12,7 @@
 #include "iterator_traits.h"
 #include "swap_if.h"
 
-namespace cppsort
-{
-namespace detail
+namespace cppsort::detail
 {
     //
     // This sorting algorithm isn't exposed to users of the
@@ -43,6 +41,6 @@ namespace detail
             }
         }
     }
-}}
+}
 
 #endif // CPPSORT_DETAIL_BUBBLE_SORT_H_

include/cpp-sort/detail/buffered_inplace_merge.h

@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015-2021 Morwenn
+ * Copyright (c) 2015-2025 Morwenn
  * SPDX-License-Identifier: MIT
  */
 
@@ -29,9 +29,7 @@
 #include "move.h"
 #include "type_traits.h"
 
-namespace cppsort
-{
-namespace detail
+namespace cppsort::detail
 {
     ////////////////////////////////////////////////////////////
     // Blind merge with a buffer
@@ -126,6 +124,6 @@ namespace detail
                                cppsort::flip(compare), std::move(projection));
         }
     }
-}}
+}
 
 #endif // CPPSORT_DETAIL_BUFFERED_INPLACE_MERGE_H_

include/cpp-sort/detail/cartesian_tree_sort.h

@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021-2022 Morwenn
+ * Copyright (c) 2021-2025 Morwenn
  * SPDX-License-Identifier: MIT
  */
 #ifndef CPPSORT_DETAIL_CARTESIAN_TREE_SORT_H_
@@ -21,9 +21,7 @@
 #include "iterator_traits.h"
 #include "type_traits.h"
 
-namespace cppsort
-{
-namespace detail
+namespace cppsort::detail
 {
     template<typename T>
     struct cartesian_tree
@@ -157,6 +155,6 @@ namespace detail
             }
         }
     }
-}}
+}
 
 #endif // CPPSORT_DETAIL_CARTESIAN_TREE_SORT_H_

include/cpp-sort/detail/checkers.h

@@ -12,9 +12,7 @@
 #include <cpp-sort/sorter_traits.h>
 #include "raw_checkers.h"
 
-namespace cppsort
-{
-namespace detail
+namespace cppsort::detail
 {
     ////////////////////////////////////////////////////////////
     // High-level checkers (check with sorter_traits)
@@ -56,6 +54,6 @@ namespace detail
             Sorters...
         >
     {};
-}}
+}
 
 #endif // CPPSORT_DETAIL_CHECKERS_H_