fix : a sufficient results may occur(has marked_deleted node)

박선영 · 박선영 · commit a29c3dd736b0 · 2021-10-25T18:44:48.000+09:00
If the top_candidate is insufficient, the problem can be supplemented by
allowing the cadidate_set to search further when there is data.
diff --git a/hnswlib/hnswalg.h b/hnswlib/hnswalg.h
@@ -182,7 +182,7 @@ namespace hnswlib {
 
             while (!candidateSet.empty()) {
                 std::pair<dist_t, tableint> curr_el_pair = candidateSet.top();
-                if ((-curr_el_pair.first) > lowerBound) {
+                if ((-curr_el_pair.first) > lowerBound and top_candidates.size() == ef_construction_) {
                     break;
                 }
                 candidateSet.pop();
@@ -271,7 +271,7 @@ namespace hnswlib {
 
                 std::pair<dist_t, tableint> current_node_pair = candidate_set.top();
 
-                if ((-current_node_pair.first) > lowerBound) {
+                if ((-current_node_pair.first) > lowerBound and top_candidates.size() == ef) {
                     break;
                 }
                 candidate_set.pop();

Original file line number	Diff line number	Diff line change
`@@ -182,7 +182,7 @@ namespace hnswlib {`
`182`	`182`
`183`	`183`	`while (!candidateSet.empty()) {`
`184`	`184`	`std::pair<dist_t, tableint> curr_el_pair = candidateSet.top();`
`185`		`- if ((-curr_el_pair.first) > lowerBound) {`
	`185`	`+ if ((-curr_el_pair.first) > lowerBound and top_candidates.size() == ef_construction_) {`
`186`	`186`	`break;`
`187`	`187`	`}`
`188`	`188`	`candidateSet.pop();`
`@@ -271,7 +271,7 @@ namespace hnswlib {`
`271`	`271`
`272`	`272`	`std::pair<dist_t, tableint> current_node_pair = candidate_set.top();`
`273`	`273`
`274`		`- if ((-current_node_pair.first) > lowerBound) {`
	`274`	`+ if ((-current_node_pair.first) > lowerBound and top_candidates.size() == ef) {`
`275`	`275`	`break;`
`276`	`276`	`}`
`277`	`277`	`candidate_set.pop();`