lint

facebookresearch · Dec 19, 2024 · e96237e · e96237e
1 parent b7e73e1
commit e96237e
Show file tree

Hide file tree

Showing 2 changed files with 3 additions and 3 deletions.
diff --git a/faiss/utils/approx_topk_hamming/approx_topk_hamming.h b/faiss/utils/approx_topk_hamming/approx_topk_hamming.h
@@ -101,7 +101,7 @@ struct HeapWithBucketsForHamming32<
                     uint32_t hamming_distances[8];
                     uint8_t valid_counter = 0;
                     for (size_t j8 = 0; j8 < 8; j8++) {
-                        const uint32_t idx = 
+                        const uint32_t idx =
                                 j8 + j * 8 + ip + n_per_beam * beam_index;
                         if (!sel || sel->is_member(idx)) {
                             hamming_distances[j8] = hc.hamming(
@@ -172,7 +172,7 @@ struct HeapWithBucketsForHamming32<
                         const auto value = min_distances_scalar[j8];
                         const auto index = min_indices_scalar[j8];
 
-                        if (value < std::numeric_limits<int32_t>::max() && 
+                        if (value < std::numeric_limits<int32_t>::max() &&
                             C::cmp2(bh_val[0], value, bh_ids[0], index)) {
                             heap_replace_top<C>(
                                     k, bh_val, bh_ids, value, index);

diff --git a/faiss/utils/hamming.cpp b/faiss/utils/hamming.cpp
@@ -205,7 +205,7 @@ void hammings_knn_hc(
                 NB,                                                          \
                 BD,                                                          \
                 HammingComputer>::                                           \
-                addn(j1 - j0, hc, bs2_, k, bh_val_, bh_ids_, sel);          \
+                addn(j1 - j0, hc, bs2_, k, bh_val_, bh_ids_, sel);           \
         break;
 
             switch (approx_topk_mode) {