fix(test): update MockSearchGraph to override search_intern after refactor

Author: Neiko2002

cpp/test/src/regression/graph/test_readonly_graph_regression.cpp

@@ -87,7 +87,7 @@ TEST(ReadOnlyGraphRegression, SearchAndExplore_FP32_L2)
     uint32_t total_explore_gt = 0;
     auto t_start_explore = std::chrono::high_resolution_clock::now();
 
-    for (int run = 0; run < benchmark_runs; ++run) {
+    for (int run = 0; run < benchmark_runs/10; ++run) {
         for (size_t i = 0; i < explore_count_per_run; ++i) {
             uint32_t entry_node = static_cast<uint32_t>((run * 13 + i) % base_count);
             auto results = graph.explore(entry_node, search_k, explore_max_calcs);
@@ -202,7 +202,7 @@ TEST(ReadOnlyGraphRegression, SearchAndExplore_FP32_InnerProduct)
     uint32_t correct_explore = 0;
     uint32_t total_explore_gt = 0;
     auto t_start_explore = std::chrono::high_resolution_clock::now();
-    for (int run = 0; run < benchmark_runs; ++run) {
+    for (int run = 0; run < benchmark_runs/10; ++run) {
         for (size_t i = 0; i < explore_count_per_run; ++i) {
             uint32_t entry_node = static_cast<uint32_t>((run * 13 + i) % base_count);
             auto results = graph.explore(entry_node, search_k, explore_max_calcs);

cpp/test/src/regression/graph/test_sizebounded_graph_regression.cpp

@@ -84,7 +84,7 @@ TEST(SizeBoundedGraphRegression, SearchAndExplore_FP32_L2)
     uint32_t total_explore_gt = 0;
     auto t_start_explore = std::chrono::high_resolution_clock::now();
 
-    for (int run = 0; run < benchmark_runs; ++run) {
+    for (int run = 0; run < benchmark_runs/10; ++run) {
         for (size_t i = 0; i < explore_count_per_run; ++i) {
             uint32_t entry_node = static_cast<uint32_t>((run * 13 + i) % base_count);
             auto results = graph.explore(entry_node, search_k, explore_max_calcs);
@@ -196,7 +196,7 @@ TEST(SizeBoundedGraphRegression, SearchAndExplore_FP32_InnerProduct)
     uint32_t correct_explore = 0;
     uint32_t total_explore_gt = 0;
     auto t_start_explore = std::chrono::high_resolution_clock::now();
-    for (int run = 0; run < benchmark_runs; ++run) {
+    for (int run = 0; run < benchmark_runs/10; ++run) {
         for (size_t i = 0; i < explore_count_per_run; ++i) {
             uint32_t entry_node = static_cast<uint32_t>((run * 13 + i) % base_count);
             auto results = graph.explore(entry_node, search_k, explore_max_calcs);

cpp/test/src/unit/graph/test_readonly_graph.cpp

@@ -201,7 +201,7 @@ TEST(ReadOnlyGraph, Explore) {
     EXPECT_TRUE(graph.hasEdge(0, 2));
     EXPECT_TRUE(graph.hasEdge(0, 3));
     // explore from vertex 0, find 3 nearest neighbors (excluding entry)
-    auto results = graph.explore(0, 3, 3, 0.0f, /*include_entry=*/false);
+    auto results = graph.explore(0, 3, 0, 0.0f, /*include_entry=*/false);
 
     // all 3 other vertices should be found (distance 1.0 each)
     EXPECT_EQ(results.size(), 3u);

cpp/test/src/unit/test_search.cpp

@@ -180,11 +180,9 @@ class MockSearchGraph : public deglib::search::SearchGraph {
     std::vector<deglib::search::ObjectDistance> hasPath(const std::vector<uint32_t>&, uint32_t, float, uint32_t) const override {
         return {};
     }
-    deglib::search::ResultSet search(const std::vector<uint32_t>&, const std::byte*, float, uint32_t,
-                                      const deglib::graph::Filter*, uint32_t) const override {
-        return deglib::search::ResultSet();
-    }
-    deglib::search::ResultSet explore(uint32_t, uint32_t, bool, uint32_t) const override {
+    deglib::search::ResultSet search_intern(const std::vector<uint32_t>&, const std::byte*,
+                                            const uint32_t, const float = 0.0f, const bool = true,
+                                            const deglib::graph::Filter* = nullptr, const uint32_t = 0) const override {
         return deglib::search::ResultSet();
     }