Move find tests to their own file. Use array instead of empty_range for those tests.

Author: davidstone

source/containers/CMakeLists.txt

@@ -232,6 +232,7 @@ target_sources(containers_test PRIVATE
 		test/algorithms/copy_or_relocate_from.cpp
 		test/algorithms/erase.cpp
 		test/algorithms/filter.cpp
+		test/algorithms/find.cpp
 		test/algorithms/join.cpp
 		test/algorithms/keyed_binary_search.cpp
 		test/algorithms/set.cpp

source/containers/algorithms/find.cpp

@@ -5,21 +5,16 @@
 
 module;
 
-#include <bounded/assert.hpp>
-
 #include <operators/forward.hpp>
 
 export module containers.algorithms.find;
 
 import containers.begin_end;
 import containers.bidirectional_iterator;
 import containers.bidirectional_range;
-import containers.c_array;
-import containers.empty_range;
 import containers.iterator;
 import containers.range;
 import containers.sentinel_for;
-import containers.size;
 
 import bounded;
 import std_module;
@@ -123,34 +118,3 @@ export constexpr auto find_last(bidirectional_range auto && range, auto const &
 }
 
 } // namespace containers
-
-template<std::size_t size>
-constexpr auto test(auto const index, containers::c_array<int, size> && a) -> bool {
-	auto it = containers::find(a, 5);
-	BOUNDED_ASSERT(index == containers::size(a) or *it == 5);
-	return it - containers::begin(a) == index;
-}
-
-static_assert(containers::find(containers::empty_range<int>(), 5) == containers::empty_range<int>::end());
-static_assert(test(1_bi, {0}));
-static_assert(test(0_bi, {5}));
-static_assert(test(2_bi, {0, 0}));
-static_assert(test(1_bi, {0, 5}));
-static_assert(test(0_bi, {5, 0}));
-static_assert(test(0_bi, {5, 5}));
-
-
-template<std::size_t size>
-constexpr auto test_backward(auto const index, containers::c_array<int, size> && a) -> bool {
-	auto it = containers::find_last(a, 5);
-	BOUNDED_ASSERT(index == containers::size(a) or *it == 5);
-	return it - containers::begin(a) == index;
-}
-
-static_assert(containers::find_last(containers::empty_range<int>(), 5) == containers::empty_range<int>::end());
-static_assert(test_backward(1_bi, {0}));
-static_assert(test_backward(0_bi, {5}));
-static_assert(test_backward(2_bi, {0, 0}));
-static_assert(test_backward(1_bi, {0, 5}));
-static_assert(test_backward(0_bi, {5, 0}));
-static_assert(test_backward(1_bi, {5, 5}));

source/containers/test/algorithms/find.cpp

@@ -0,0 +1,53 @@
+// Copyright David Stone 2024.
+// 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)
+
+module;
+
+#include <bounded/assert.hpp>
+
+export module containers.test.algorithms.find;
+
+import containers.algorithms.find;
+import containers.array;
+import containers.begin_end;
+import containers.c_array;
+import containers.size;
+
+import bounded;
+import std_module;
+
+using namespace bounded::literal;
+
+template<std::size_t size>
+constexpr auto test(auto const index, containers::c_array<int, size> && a) -> bool {
+	auto it = containers::find(a, 5);
+	BOUNDED_ASSERT(index == containers::size(a) or *it == 5);
+	return it - containers::begin(a) == index;
+}
+
+constexpr auto empty = containers::array<int, 0_bi>();
+static_assert(containers::find(empty, 5) == containers::end(empty));
+static_assert(test(1_bi, {0}));
+static_assert(test(0_bi, {5}));
+static_assert(test(2_bi, {0, 0}));
+static_assert(test(1_bi, {0, 5}));
+static_assert(test(0_bi, {5, 0}));
+static_assert(test(0_bi, {5, 5}));
+
+
+template<std::size_t size>
+constexpr auto test_backward(auto const index, containers::c_array<int, size> && a) -> bool {
+	auto it = containers::find_last(a, 5);
+	BOUNDED_ASSERT(index == containers::size(a) or *it == 5);
+	return it - containers::begin(a) == index;
+}
+
+static_assert(containers::find_last(empty, 5) == containers::end(empty));
+static_assert(test_backward(1_bi, {0}));
+static_assert(test_backward(0_bi, {5}));
+static_assert(test_backward(2_bi, {0, 0}));
+static_assert(test_backward(1_bi, {0, 5}));
+static_assert(test_backward(0_bi, {5, 0}));
+static_assert(test_backward(1_bi, {5, 5}));