adds more tests with const trees

Author: Tim Ebbeke

tests/find_tests.hpp

@@ -32,6 +32,15 @@ TEST_F(FindTests, WillFindRoot)
     EXPECT_EQ(tree.find({0, 1}), std::begin(tree));
 }
 
+TEST_F(FindTests, WillFindRootOnConstTree)
+{
+    tree.insert({0, 1});
+    [](auto const& tree)
+    {
+        EXPECT_EQ(tree.find({0, 1}), std::begin(tree));
+    }(tree);
+}
+
 TEST_F(FindTests, WillFindInBiggerTree)
 {
     tree.insert({16, 21});
@@ -156,24 +165,4 @@ TEST_F(FindTests, CanFindAllOnConstTree)
 
     ASSERT_EQ(intervals.size(), 1);
     EXPECT_EQ(intervals[0], targetInterval);
-}
-
-TEST_F(FindTests, CanOverlapFindAllOnConstTree)
-{
-    const auto targetInterval = lib_interval_tree::make_safe_interval(16, 21);
-    tree.insert(targetInterval);
-    tree.insert({8, 9});
-    tree.insert({25, 30});
-    std::vector <decltype(tree)::interval_type> intervals;
-    auto findWithConstTree = [&intervals, &targetInterval](auto const& tree)
-    {
-        tree.overlap_find_all(targetInterval, [&intervals](auto const& iter) {
-            intervals.emplace_back(*iter);
-            return true;
-        });
-    };
-    findWithConstTree(tree);
-
-    ASSERT_EQ(intervals.size(), 1);
-    EXPECT_EQ(intervals[0], targetInterval);
-}
+}

tests/overlap_find_tests.hpp

@@ -28,6 +28,14 @@ TEST_F(OverlapFindTests, WillFindOverlapWithRoot)
     EXPECT_EQ(tree.overlap_find({2, 7}), std::begin(tree));
 }
 
+TEST_F(OverlapFindTests, WillFindOverlapWithRootOnConstTree)
+{
+    tree.insert({2, 4});
+    [](auto const& tree) {
+        EXPECT_EQ(tree.overlap_find({2, 7}), std::begin(tree));
+    }(tree);
+}
+
 TEST_F(OverlapFindTests, WillFindOverlapWithRootIfMatchingExactly)
 {
     tree.insert({2, 7});
@@ -149,4 +157,24 @@ TEST_F(OverlapFindTests, WillFindSingleOverlapInBiggerTree)
     EXPECT_NE(iter, std::end(tree));
     EXPECT_EQ(iter->low(), 1000);
     EXPECT_EQ(iter->high(), 2000);
-}
+}
+
+TEST_F(FindTests, CanOverlapFindAllOnConstTree)
+{
+    const auto targetInterval = lib_interval_tree::make_safe_interval(16, 21);
+    tree.insert(targetInterval);
+    tree.insert({8, 9});
+    tree.insert({25, 30});
+    std::vector <decltype(tree)::interval_type> intervals;
+    auto findWithConstTree = [&intervals, &targetInterval](auto const& tree)
+    {
+        tree.overlap_find_all(targetInterval, [&intervals](auto const& iter) {
+            intervals.emplace_back(*iter);
+            return true;
+        });
+    };
+    findWithConstTree(tree);
+
+    ASSERT_EQ(intervals.size(), 1);
+    EXPECT_EQ(intervals[0], targetInterval);
+}