Fixed merge issue and added simple tests.

Author: 5cript

tests/find_tests.hpp

@@ -7,6 +7,9 @@ class FindTests
     using types = IntervalTypes <int>;
 protected:
     IntervalTypes <int>::tree_type tree;
+    std::default_random_engine gen;
+    std::uniform_int_distribution <int> distSmall{-500, 500};
+    std::uniform_int_distribution <int> distLarge{-50000, 50000};
 };
 
 TEST_F(FindTests, WillReturnEndIfTreeIsEmpty)
@@ -78,3 +81,57 @@ TEST_F(FindTests, WillFindAllCanExitPreemptively)
     EXPECT_EQ(findCount, 3);
 }
 
+TEST_F(FindTests, CanFindAllElementsBack)
+{
+    constexpr int amount = 10'000;
+
+    std::vector <decltype(tree)::interval_type> intervals;
+    intervals.reserve(amount);
+    for (int i = 0; i != amount; ++i)
+    {
+        const auto interval = lib_interval_tree::make_safe_interval(distLarge(gen), distLarge(gen));
+        intervals.emplace_back(interval);
+        tree.insert(interval);
+    }
+    for (auto const& ival : intervals)
+    {
+        ASSERT_NE(tree.find(ival), std::end(tree));
+    }
+}
+
+TEST_F(FindTests, CanFindAllElementsBackInStrictlyAscendingNonOverlappingIntervals)
+{
+    constexpr int amount = 10'000;
+
+    std::vector <decltype(tree)::interval_type> intervals;
+    intervals.reserve(amount);
+    for (int i = 0; i != amount; ++i)
+    {
+        const auto interval = lib_interval_tree::make_safe_interval(i * 2,  i * 2 + 1);
+        intervals.emplace_back(interval);
+        tree.insert(interval);
+    }
+    for (auto const& ival : intervals)
+    {
+        ASSERT_NE(tree.find(ival), std::end(tree));
+    }
+}
+
+TEST_F(FindTests, CanFindAllElementsBackInStrictlyAscendingOverlappingIntervals)
+{
+    constexpr int amount = 10'000;
+
+    std::vector <decltype(tree)::interval_type> intervals;
+    intervals.reserve(amount);
+    for (int i = 0; i != amount; ++i)
+    {
+        const auto interval = lib_interval_tree::make_safe_interval(i - 1,  i + 1);
+        intervals.emplace_back(interval);
+        tree.insert(interval);
+    }
+    for (auto const& ival : intervals)
+    {
+        ASSERT_NE(tree.find(ival), std::end(tree));
+    }
+}
+