Allowing less than K nodes in result (Filter and Non Filter In Memory…

… Search)
microsoft · Dec 18, 2023 · 77b432f · 77b432f
1 parent 0640c3f
commit 77b432f
Showing 1 changed file with 6 additions and 8 deletions.
diff --git a/src/index.cpp b/src/index.cpp
@@ -2251,14 +2251,13 @@ std::pair<uint32_t, uint32_t> Index<T, TagT, LabelT>::search(const T *query, con
             break;
     }
 
-    if (pos < K)
+    if (pos <= K)
     {
-        context.SetState(State::Failure);
-        diskann::cerr << "Found pos: " << pos << "fewer than K elements " << K << " for query" << std::endl;
+        context.SetState(State::Success);
     }
     else
     {
-        context.SetState(State::Success);
+        context.SetState(State::Failure);
     }
 
     return retval;
@@ -2387,14 +2386,13 @@ std::pair<uint32_t, uint32_t> Index<T, TagT, LabelT>::search_with_filters(const
         if (pos == K)
             break;
     }
-    if (pos < K)
+    if (pos <= K)
     {
-        context.SetState(State::Failure);
-        diskann::cerr << "Found fewer than K elements for query" << std::endl;
+        context.SetState(State::Success);
     }
     else
     {
-        context.SetState(State::Success);
+        context.SetState(State::Failure);
     }
 
     return retval;