Move tests for fixed_size_merge_sort into their own file

Author: davidstone

source/containers/CMakeLists.txt

@@ -218,6 +218,7 @@ target_sources(containers_test PRIVATE
 	FILES
 		test/sort/chunked_insertion_sort.cpp
 		test/sort/double_buffered_ska_sort.cpp
+		test/sort/fixed_size_merge_sort.cpp
 		test/sort/sort_test_data.cpp
 		test/sort/ska_sort.cpp
 		test/sort/sort.cpp

source/containers/algorithms/sort/fixed_size_merge_sort.cpp

@@ -13,9 +13,6 @@ import containers.algorithms.sort.sort_exactly_5;
 
 import containers.algorithms.uninitialized;
 
-import containers.array;
-import containers.begin_end;
-import containers.contiguous_iterator;
 import containers.subrange;
 import containers.uninitialized_array;
 
@@ -57,15 +54,3 @@ export constexpr auto fixed_size_merge_sort(auto it, auto const size1, auto cons
 }
 
 } // namespace containers
-
-static_assert([]{
-	auto container = containers::array{0, 1};
-	containers::fixed_size_merge_sort(containers::begin(container), 1_bi, 1_bi, std::less());
-	return container == containers::array{0, 1};
-}());
-
-static_assert([]{
-	auto container = containers::array{1, 0};
-	containers::fixed_size_merge_sort(containers::begin(container), 1_bi, 1_bi, std::less());
-	return container == containers::array{0, 1};
-}());

source/containers/test/sort/fixed_size_merge_sort.cpp

@@ -0,0 +1,27 @@
+// Copyright David Stone 2023.
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
+export module containers.test.algorithms.sort.fixed_size_merge_sort;
+
+import containers.algorithms.sort.fixed_size_merge_sort;
+import containers.array;
+import containers.begin_end;
+
+import bounded;
+import std_module;
+
+using namespace bounded::literal;
+
+static_assert([]{
+	auto container = containers::array{0, 1};
+	containers::fixed_size_merge_sort(containers::begin(container), 1_bi, 1_bi, std::less());
+	return container == containers::array{0, 1};
+}());
+
+static_assert([]{
+	auto container = containers::array{1, 0};
+	containers::fixed_size_merge_sort(containers::begin(container), 1_bi, 1_bi, std::less());
+	return container == containers::array{0, 1};
+}());