1515#include < chrono>
1616#include < iostream>
1717#include < ailego/internal/cpu_features.h>
18- #include < rabitqlib/index /estimator.hpp>
18+ #include < rabitqlib/core /estimator.hpp>
1919#include " zvec/ailego/internal/platform.h"
2020#include " hnsw_rabitq_entity.h"
2121#include " hnsw_rabitq_query_entity.h"
@@ -46,7 +46,7 @@ int HnswRabitqQueryAlgorithm::cleanup() {
4646int HnswRabitqQueryAlgorithm::search (HnswRabitqQueryEntity *entity,
4747 HnswRabitqContext *ctx) const {
4848 spin_lock_.lock ();
49- auto maxLevel = entity_.cur_max_level ();
49+ auto max_level = entity_.cur_max_level ();
5050 auto entry_point = entity_.entry_point ();
5151 spin_lock_.unlock ();
5252
@@ -57,7 +57,7 @@ int HnswRabitqQueryAlgorithm::search(HnswRabitqQueryEntity *entity,
5757 EstimateRecord curest;
5858 get_bin_est (entity_.get_vector (entry_point), curest, *entity);
5959
60- for (level_t cur_level = maxLevel ; cur_level >= 1 ; --cur_level) {
60+ for (level_t cur_level = max_level ; cur_level >= 1 ; --cur_level) {
6161 select_entry_point (cur_level, &entry_point, &curest, ctx, entity);
6262 }
6363
@@ -170,10 +170,10 @@ void HnswRabitqQueryAlgorithm::search_neighbors(
170170
171171 if (ex_bits_ > 0 ) {
172172 // Check preliminary score against current worst full estimate.
173- bool flag_update_KNNs =
173+ bool update_knns =
174174 (!topk.full ()) || candest.low_dist < topk[0 ].second .est_dist ;
175175
176- if (flag_update_KNNs ) {
176+ if (update_knns ) {
177177 // Compute the full estimate if promising.
178178 get_full_est (cand_vector, candest, *query_entity);
179179 } else {
0 commit comments