faiss 0.2.0 → 0.2.1

data/vendor/faiss/faiss/utils/extra_distances.h

@@ -5,10 +5,7 @@
  * LICENSE file in the root directory of this source tree.
  */
 
-// -*- c++ -*-
-
-#ifndef FAISS_distances_h
-#define FAISS_distances_h
+#pragma once
 
 /** In this file are the implementations of extra metrics beyond L2
  *  and inner product */
@@ -19,36 +16,40 @@
 
 #include <faiss/utils/Heap.h>
 
-
-
 namespace faiss {
 
-
-void pairwise_extra_distances (
-                     int64_t d,
-                     int64_t nq, const float *xq,
-                     int64_t nb, const float *xb,
-                     MetricType mt, float metric_arg,
-                     float *dis,
-                     int64_t ldq = -1, int64_t ldb = -1, int64_t ldd = -1);
-
-
-void knn_extra_metrics (
-        const float * x,
-        const float * y,
-        size_t d, size_t nx, size_t ny,
-        MetricType mt, float metric_arg,
-        float_maxheap_array_t * res);
-
+void pairwise_extra_distances(
+        int64_t d,
+        int64_t nq,
+        const float* xq,
+        int64_t nb,
+        const float* xb,
+        MetricType mt,
+        float metric_arg,
+        float* dis,
+        int64_t ldq = -1,
+        int64_t ldb = -1,
+        int64_t ldd = -1);
+
+void knn_extra_metrics(
+        const float* x,
+        const float* y,
+        size_t d,
+        size_t nx,
+        size_t ny,
+        MetricType mt,
+        float metric_arg,
+        float_maxheap_array_t* res);
 
 /** get a DistanceComputer that refers to this type of distance and
  *  indexes a flat array of size nb */
-DistanceComputer *get_extra_distance_computer (
+DistanceComputer* get_extra_distance_computer(
         size_t d,
-        MetricType mt, float metric_arg,
-        size_t nb, const float *xb);
-
-}
+        MetricType mt,
+        float metric_arg,
+        size_t nb,
+        const float* xb);
 
+} // namespace faiss
 
-#endif
+#include <faiss/utils/extra_distances-inl.h>

data/vendor/faiss/faiss/utils/hamming-inl.h

@@ -7,15 +7,15 @@
 
 namespace faiss {
 
+extern const uint8_t hamdis_tab_ham_bytes[256];
 
-inline BitstringWriter::BitstringWriter(uint8_t *code, size_t code_size):
-    code (code), code_size (code_size), i(0)
-{
-    memset (code, 0, code_size);
+inline BitstringWriter::BitstringWriter(uint8_t* code, size_t code_size)
+        : code(code), code_size(code_size), i(0) {
+    memset(code, 0, code_size);
 }
 
 inline void BitstringWriter::write(uint64_t x, int nbit) {
-    assert (code_size * 8 >= nbit + i);
+    assert(code_size * 8 >= nbit + i);
     // nb of available bits in i / 8
     int na = 8 - (i & 7);
 
@@ -35,13 +35,11 @@ inline void BitstringWriter::write(uint64_t x, int nbit) {
     }
 }
 
-
-inline BitstringReader::BitstringReader(const uint8_t *code, size_t code_size):
-    code (code), code_size (code_size), i(0)
-{}
+inline BitstringReader::BitstringReader(const uint8_t* code, size_t code_size)
+        : code(code), code_size(code_size), i(0) {}
 
 inline uint64_t BitstringReader::read(int nbit) {
-    assert (code_size * 8 >= nbit + i);
+    assert(code_size * 8 >= nbit + i);
     // nb of available bits in i / 8
     int na = 8 - (i & 7);
     // get available bits in current byte
@@ -67,7 +65,6 @@ inline uint64_t BitstringReader::read(int nbit) {
     }
 }
 
-
 /******************************************************************
  * The HammingComputer series of classes compares a single code of
  * size 4 to 32 to incoming codes. They are intended for use as a
@@ -76,68 +73,64 @@ inline uint64_t BitstringReader::read(int nbit) {
  * hamming() functions and put the a0, a1, ... in registers.
  ******************************************************************/
 
-
 struct HammingComputer4 {
     uint32_t a0;
 
-    HammingComputer4 () {}
+    HammingComputer4() {}
 
-    HammingComputer4 (const uint8_t *a, int code_size) {
-        set (a, code_size);
+    HammingComputer4(const uint8_t* a, int code_size) {
+        set(a, code_size);
     }
 
-    void set (const uint8_t *a, int code_size) {
-        assert (code_size == 4);
-        a0 = *(uint32_t *)a;
+    void set(const uint8_t* a, int code_size) {
+        assert(code_size == 4);
+        a0 = *(uint32_t*)a;
     }
 
-    inline int hamming (const uint8_t *b) const {
-        return popcount64 (*(uint32_t *)b ^ a0);
+    inline int hamming(const uint8_t* b) const {
+        return popcount64(*(uint32_t*)b ^ a0);
     }
-
 };
 
 struct HammingComputer8 {
     uint64_t a0;
 
-    HammingComputer8 () {}
+    HammingComputer8() {}
 
-    HammingComputer8 (const uint8_t *a, int code_size) {
-        set (a, code_size);
+    HammingComputer8(const uint8_t* a, int code_size) {
+        set(a, code_size);
     }
 
-    void set (const uint8_t *a, int code_size) {
-        assert (code_size == 8);
-        a0 = *(uint64_t *)a;
+    void set(const uint8_t* a, int code_size) {
+        assert(code_size == 8);
+        a0 = *(uint64_t*)a;
     }
 
-    inline int hamming (const uint8_t *b) const {
-        return popcount64 (*(uint64_t *)b ^ a0);
+    inline int hamming(const uint8_t* b) const {
+        return popcount64(*(uint64_t*)b ^ a0);
     }
-
 };
 
-
 struct HammingComputer16 {
     uint64_t a0, a1;
 
-    HammingComputer16 () {}
+    HammingComputer16() {}
 
-    HammingComputer16 (const uint8_t *a8, int code_size) {
-        set (a8, code_size);
+    HammingComputer16(const uint8_t* a8, int code_size) {
+        set(a8, code_size);
     }
 
-    void set (const uint8_t *a8, int code_size) {
-        assert (code_size == 16);
-        const uint64_t *a = (uint64_t *)a8;
-        a0 = a[0]; a1 = a[1];
+    void set(const uint8_t* a8, int code_size) {
+        assert(code_size == 16);
+        const uint64_t* a = (uint64_t*)a8;
+        a0 = a[0];
+        a1 = a[1];
     }
 
-    inline int hamming (const uint8_t *b8) const {
-        const uint64_t *b = (uint64_t *)b8;
-        return popcount64 (b[0] ^ a0) + popcount64 (b[1] ^ a1);
+    inline int hamming(const uint8_t* b8) const {
+        const uint64_t* b = (uint64_t*)b8;
+        return popcount64(b[0] ^ a0) + popcount64(b[1] ^ a1);
     }
-
 };
 
 // when applied to an array, 1/2 of the 64-bit accesses are unaligned.
@@ -146,150 +139,212 @@ struct HammingComputer20 {
     uint64_t a0, a1;
     uint32_t a2;
 
-    HammingComputer20 () {}
+    HammingComputer20() {}
 
-    HammingComputer20 (const uint8_t *a8, int code_size) {
-        set (a8, code_size);
+    HammingComputer20(const uint8_t* a8, int code_size) {
+        set(a8, code_size);
     }
 
-    void set (const uint8_t *a8, int code_size) {
-        assert (code_size == 20);
-        const uint64_t *a = (uint64_t *)a8;
-        a0 = a[0]; a1 = a[1]; a2 = a[2];
+    void set(const uint8_t* a8, int code_size) {
+        assert(code_size == 20);
+        const uint64_t* a = (uint64_t*)a8;
+        a0 = a[0];
+        a1 = a[1];
+        a2 = a[2];
     }
 
-    inline int hamming (const uint8_t *b8) const {
-        const uint64_t *b = (uint64_t *)b8;
-        return popcount64 (b[0] ^ a0) + popcount64 (b[1] ^ a1) +
-            popcount64 (*(uint32_t*)(b + 2) ^ a2);
+    inline int hamming(const uint8_t* b8) const {
+        const uint64_t* b = (uint64_t*)b8;
+        return popcount64(b[0] ^ a0) + popcount64(b[1] ^ a1) +
+                popcount64(*(uint32_t*)(b + 2) ^ a2);
     }
 };
 
 struct HammingComputer32 {
     uint64_t a0, a1, a2, a3;
 
-    HammingComputer32 () {}
+    HammingComputer32() {}
 
-    HammingComputer32 (const uint8_t *a8, int code_size) {
-        set (a8, code_size);
+    HammingComputer32(const uint8_t* a8, int code_size) {
+        set(a8, code_size);
     }
 
-    void set (const uint8_t *a8, int code_size) {
-        assert (code_size == 32);
-        const uint64_t *a = (uint64_t *)a8;
-        a0 = a[0]; a1 = a[1]; a2 = a[2]; a3 = a[3];
+    void set(const uint8_t* a8, int code_size) {
+        assert(code_size == 32);
+        const uint64_t* a = (uint64_t*)a8;
+        a0 = a[0];
+        a1 = a[1];
+        a2 = a[2];
+        a3 = a[3];
     }
 
-    inline int hamming (const uint8_t *b8) const {
-        const uint64_t *b = (uint64_t *)b8;
-        return popcount64 (b[0] ^ a0) + popcount64 (b[1] ^ a1) +
-            popcount64 (b[2] ^ a2) + popcount64 (b[3] ^ a3);
+    inline int hamming(const uint8_t* b8) const {
+        const uint64_t* b = (uint64_t*)b8;
+        return popcount64(b[0] ^ a0) + popcount64(b[1] ^ a1) +
+                popcount64(b[2] ^ a2) + popcount64(b[3] ^ a3);
     }
-
 };
 
 struct HammingComputer64 {
     uint64_t a0, a1, a2, a3, a4, a5, a6, a7;
 
-    HammingComputer64 () {}
+    HammingComputer64() {}
 
-    HammingComputer64 (const uint8_t *a8, int code_size) {
-        set (a8, code_size);
+    HammingComputer64(const uint8_t* a8, int code_size) {
+        set(a8, code_size);
     }
 
-    void set (const uint8_t *a8, int code_size) {
-        assert (code_size == 64);
-        const uint64_t *a = (uint64_t *)a8;
-        a0 = a[0]; a1 = a[1]; a2 = a[2]; a3 = a[3];
-        a4 = a[4]; a5 = a[5]; a6 = a[6]; a7 = a[7];
+    void set(const uint8_t* a8, int code_size) {
+        assert(code_size == 64);
+        const uint64_t* a = (uint64_t*)a8;
+        a0 = a[0];
+        a1 = a[1];
+        a2 = a[2];
+        a3 = a[3];
+        a4 = a[4];
+        a5 = a[5];
+        a6 = a[6];
+        a7 = a[7];
     }
 
-    inline int hamming (const uint8_t *b8) const {
-        const uint64_t *b = (uint64_t *)b8;
-        return popcount64 (b[0] ^ a0) + popcount64 (b[1] ^ a1) +
-            popcount64 (b[2] ^ a2) + popcount64 (b[3] ^ a3) +
-            popcount64 (b[4] ^ a4) + popcount64 (b[5] ^ a5) +
-            popcount64 (b[6] ^ a6) + popcount64 (b[7] ^ a7);
+    inline int hamming(const uint8_t* b8) const {
+        const uint64_t* b = (uint64_t*)b8;
+        return popcount64(b[0] ^ a0) + popcount64(b[1] ^ a1) +
+                popcount64(b[2] ^ a2) + popcount64(b[3] ^ a3) +
+                popcount64(b[4] ^ a4) + popcount64(b[5] ^ a5) +
+                popcount64(b[6] ^ a6) + popcount64(b[7] ^ a7);
     }
-
 };
 
-// very inefficient...
 struct HammingComputerDefault {
-    const uint8_t *a;
-    int n;
+    const uint8_t* a8;
+    int quotient8;
+    int remainder8;
 
-    HammingComputerDefault () {}
+    HammingComputerDefault() {}
 
-    HammingComputerDefault (const uint8_t *a8, int code_size) {
-        set (a8, code_size);
+    HammingComputerDefault(const uint8_t* a8, int code_size) {
+        set(a8, code_size);
     }
 
-    void set (const uint8_t *a8, int code_size) {
-        a =  a8;
-        n = code_size;
+    void set(const uint8_t* a8, int code_size) {
+        this->a8 = a8;
+        quotient8 = code_size / 8;
+        remainder8 = code_size % 8;
     }
 
-    int hamming (const uint8_t *b8) const {
+    int hamming(const uint8_t* b8) const {
         int accu = 0;
-        for (int i = 0; i < n; i++)
-            accu += popcount64 (a[i] ^ b8[i]);
+
+        const uint64_t* a64 = reinterpret_cast<const uint64_t*>(a8);
+        const uint64_t* b64 = reinterpret_cast<const uint64_t*>(b8);
+        int i = 0, len = quotient8;
+        switch (len & 7) {
+            default:
+                while (len > 7) {
+                    len -= 8;
+                    accu += popcount64(a64[i] ^ b64[i]);
+                    i++;
+                    case 7:
+                        accu += popcount64(a64[i] ^ b64[i]);
+                        i++;
+                    case 6:
+                        accu += popcount64(a64[i] ^ b64[i]);
+                        i++;
+                    case 5:
+                        accu += popcount64(a64[i] ^ b64[i]);
+                        i++;
+                    case 4:
+                        accu += popcount64(a64[i] ^ b64[i]);
+                        i++;
+                    case 3:
+                        accu += popcount64(a64[i] ^ b64[i]);
+                        i++;
+                    case 2:
+                        accu += popcount64(a64[i] ^ b64[i]);
+                        i++;
+                    case 1:
+                        accu += popcount64(a64[i] ^ b64[i]);
+                        i++;
+                }
+        }
+        if (remainder8) {
+            const uint8_t* a = a8 + 8 * quotient8;
+            const uint8_t* b = b8 + 8 * quotient8;
+            switch (remainder8) {
+                case 7:
+                    accu += hamdis_tab_ham_bytes[a[6] ^ b[6]];
+                case 6:
+                    accu += hamdis_tab_ham_bytes[a[5] ^ b[5]];
+                case 5:
+                    accu += hamdis_tab_ham_bytes[a[4] ^ b[4]];
+                case 4:
+                    accu += hamdis_tab_ham_bytes[a[3] ^ b[3]];
+                case 3:
+                    accu += hamdis_tab_ham_bytes[a[2] ^ b[2]];
+                case 2:
+                    accu += hamdis_tab_ham_bytes[a[1] ^ b[1]];
+                case 1:
+                    accu += hamdis_tab_ham_bytes[a[0] ^ b[0]];
+                default:
+                    break;
+            }
+        }
+
         return accu;
     }
-
 };
 
+// more inefficient than HammingComputerDefault (obsolete)
 struct HammingComputerM8 {
-    const uint64_t *a;
+    const uint64_t* a;
     int n;
 
-    HammingComputerM8 () {}
+    HammingComputerM8() {}
 
-    HammingComputerM8 (const uint8_t *a8, int code_size) {
-        set (a8, code_size);
+    HammingComputerM8(const uint8_t* a8, int code_size) {
+        set(a8, code_size);
     }
 
-    void set (const uint8_t *a8, int code_size) {
-        assert (code_size % 8 == 0);
-        a =  (uint64_t *)a8;
+    void set(const uint8_t* a8, int code_size) {
+        assert(code_size % 8 == 0);
+        a = (uint64_t*)a8;
         n = code_size / 8;
     }
 
-    int hamming (const uint8_t *b8) const {
-        const uint64_t *b = (uint64_t *)b8;
+    int hamming(const uint8_t* b8) const {
+        const uint64_t* b = (uint64_t*)b8;
         int accu = 0;
         for (int i = 0; i < n; i++)
-            accu += popcount64 (a[i] ^ b[i]);
+            accu += popcount64(a[i] ^ b[i]);
         return accu;
     }
-
 };
 
-// even more inefficient!
+// more inefficient than HammingComputerDefault (obsolete)
 struct HammingComputerM4 {
-    const uint32_t *a;
+    const uint32_t* a;
     int n;
 
-    HammingComputerM4 () {}
+    HammingComputerM4() {}
 
-    HammingComputerM4 (const uint8_t *a4, int code_size) {
-        set (a4, code_size);
+    HammingComputerM4(const uint8_t* a4, int code_size) {
+        set(a4, code_size);
     }
 
-    void set (const uint8_t *a4, int code_size) {
-        assert (code_size % 4 == 0);
-        a =  (uint32_t *)a4;
+    void set(const uint8_t* a4, int code_size) {
+        assert(code_size % 4 == 0);
+        a = (uint32_t*)a4;
         n = code_size / 4;
     }
 
-    int hamming (const uint8_t *b8) const {
-        const uint32_t *b = (uint32_t *)b8;
+    int hamming(const uint8_t* b8) const {
+        const uint32_t* b = (uint32_t*)b8;
         int accu = 0;
         for (int i = 0; i < n; i++)
-             accu += popcount64 (a[i] ^ b[i]);
+            accu += popcount64(a[i] ^ b[i]);
         return accu;
     }
-
 };
 
 /***************************************************************************
@@ -297,17 +352,17 @@ struct HammingComputerM4 {
  **************************************************************************/
 
 // default template
-template<int CODE_SIZE>
-struct HammingComputer: HammingComputerM8 {
-    HammingComputer (const uint8_t *a, int code_size):
-    HammingComputerM8(a, code_size) {}
+template <int CODE_SIZE>
+struct HammingComputer : HammingComputerDefault {
+    HammingComputer(const uint8_t* a, int code_size)
+            : HammingComputerDefault(a, code_size) {}
 };
 
-#define SPECIALIZED_HC(CODE_SIZE)                     \
-    template<> struct HammingComputer<CODE_SIZE>:     \
-            HammingComputer ## CODE_SIZE {            \
-        HammingComputer (const uint8_t *a):           \
-        HammingComputer ## CODE_SIZE(a, CODE_SIZE) {} \
+#define SPECIALIZED_HC(CODE_SIZE)                                    \
+    template <>                                                      \
+    struct HammingComputer<CODE_SIZE> : HammingComputer##CODE_SIZE { \
+        HammingComputer(const uint8_t* a)                            \
+                : HammingComputer##CODE_SIZE(a, CODE_SIZE) {}        \
     }
 
 SPECIALIZED_HC(4);
@@ -319,105 +374,98 @@ SPECIALIZED_HC(64);
 
 #undef SPECIALIZED_HC
 
-
 /***************************************************************************
  * generalized Hamming = number of bytes that are different between
  * two codes.
  ***************************************************************************/
 
-
-inline int generalized_hamming_64 (uint64_t a) {
+inline int generalized_hamming_64(uint64_t a) {
     a |= a >> 1;
     a |= a >> 2;
     a |= a >> 4;
     a &= 0x0101010101010101UL;
-    return popcount64 (a);
+    return popcount64(a);
 }
 
-
 struct GenHammingComputer8 {
     uint64_t a0;
 
-    GenHammingComputer8 (const uint8_t *a, int code_size) {
-        assert (code_size == 8);
-        a0 = *(uint64_t *)a;
+    GenHammingComputer8(const uint8_t* a, int code_size) {
+        assert(code_size == 8);
+        a0 = *(uint64_t*)a;
     }
 
-    inline int hamming (const uint8_t *b) const {
-        return generalized_hamming_64 (*(uint64_t *)b ^ a0);
+    inline int hamming(const uint8_t* b) const {
+        return generalized_hamming_64(*(uint64_t*)b ^ a0);
     }
-
 };
 
-
 struct GenHammingComputer16 {
     uint64_t a0, a1;
-    GenHammingComputer16 (const uint8_t *a8, int code_size) {
-        assert (code_size == 16);
-        const uint64_t *a = (uint64_t *)a8;
-        a0 = a[0]; a1 = a[1];
+    GenHammingComputer16(const uint8_t* a8, int code_size) {
+        assert(code_size == 16);
+        const uint64_t* a = (uint64_t*)a8;
+        a0 = a[0];
+        a1 = a[1];
     }
 
-    inline int hamming (const uint8_t *b8) const {
-        const uint64_t *b = (uint64_t *)b8;
-        return generalized_hamming_64 (b[0] ^ a0) +
-            generalized_hamming_64 (b[1] ^ a1);
+    inline int hamming(const uint8_t* b8) const {
+        const uint64_t* b = (uint64_t*)b8;
+        return generalized_hamming_64(b[0] ^ a0) +
+                generalized_hamming_64(b[1] ^ a1);
     }
-
 };
 
 struct GenHammingComputer32 {
     uint64_t a0, a1, a2, a3;
 
-    GenHammingComputer32 (const uint8_t *a8, int code_size) {
-        assert (code_size == 32);
-        const uint64_t *a = (uint64_t *)a8;
-        a0 = a[0]; a1 = a[1]; a2 = a[2]; a3 = a[3];
+    GenHammingComputer32(const uint8_t* a8, int code_size) {
+        assert(code_size == 32);
+        const uint64_t* a = (uint64_t*)a8;
+        a0 = a[0];
+        a1 = a[1];
+        a2 = a[2];
+        a3 = a[3];
     }
 
-    inline int hamming (const uint8_t *b8) const {
-        const uint64_t *b = (uint64_t *)b8;
-        return generalized_hamming_64 (b[0] ^ a0) +
-            generalized_hamming_64 (b[1] ^ a1) +
-            generalized_hamming_64 (b[2] ^ a2) +
-            generalized_hamming_64 (b[3] ^ a3);
+    inline int hamming(const uint8_t* b8) const {
+        const uint64_t* b = (uint64_t*)b8;
+        return generalized_hamming_64(b[0] ^ a0) +
+                generalized_hamming_64(b[1] ^ a1) +
+                generalized_hamming_64(b[2] ^ a2) +
+                generalized_hamming_64(b[3] ^ a3);
     }
-
 };
 
 struct GenHammingComputerM8 {
-    const uint64_t *a;
+    const uint64_t* a;
     int n;
 
-    GenHammingComputerM8 (const uint8_t *a8, int code_size) {
-        assert (code_size % 8 == 0);
-        a =  (uint64_t *)a8;
+    GenHammingComputerM8(const uint8_t* a8, int code_size) {
+        assert(code_size % 8 == 0);
+        a = (uint64_t*)a8;
         n = code_size / 8;
     }
 
-    int hamming (const uint8_t *b8) const {
-        const uint64_t *b = (uint64_t *)b8;
+    int hamming(const uint8_t* b8) const {
+        const uint64_t* b = (uint64_t*)b8;
         int accu = 0;
         for (int i = 0; i < n; i++)
-            accu += generalized_hamming_64 (a[i] ^ b[i]);
+            accu += generalized_hamming_64(a[i] ^ b[i]);
         return accu;
     }
-
 };
 
-
 /** generalized Hamming distances (= count number of code bytes that
     are the same) */
-void generalized_hammings_knn_hc (
-        int_maxheap_array_t * ha,
-        const uint8_t * a,
-        const uint8_t * b,
+void generalized_hammings_knn_hc(
+        int_maxheap_array_t* ha,
+        const uint8_t* a,
+        const uint8_t* b,
         size_t nb,
         size_t code_size,
         int ordered = true);
 
-
-
 /** This class maintains a list of best distances seen so far.
  *
  * Since the distances are in a limited range (0 to nbit), the
@@ -425,46 +473,49 @@ void generalized_hammings_knn_hc (
  * in only the n-first lists, such that the sum of sizes of the
  * n lists is below k.
  */
-template<class HammingComputer>
+template <class HammingComputer>
 struct HCounterState {
-  int *counters;
-  int64_t *ids_per_dis;
-
-  HammingComputer hc;
-  int thres;
-  int count_lt;
-  int count_eq;
-  int k;
-
- HCounterState(int *counters, int64_t *ids_per_dis,
-               const uint8_t *x, int d, int k)
- : counters(counters),
-        ids_per_dis(ids_per_dis),
-        hc(x, d / 8),
-        thres(d + 1),
-        count_lt(0),
-        count_eq(0),
-        k(k) {}
-
-  void update_counter(const uint8_t *y, size_t j) {
-    int32_t dis = hc.hamming(y);
-
-    if (dis <= thres) {
-      if (dis < thres) {
-        ids_per_dis[dis * k + counters[dis]++] = j;
-        ++count_lt;
-        while (count_lt == k && thres > 0) {
-          --thres;
-          count_eq = counters[thres];
-          count_lt -= count_eq;
+    int* counters;
+    int64_t* ids_per_dis;
+
+    HammingComputer hc;
+    int thres;
+    int count_lt;
+    int count_eq;
+    int k;
+
+    HCounterState(
+            int* counters,
+            int64_t* ids_per_dis,
+            const uint8_t* x,
+            int d,
+            int k)
+            : counters(counters),
+              ids_per_dis(ids_per_dis),
+              hc(x, d / 8),
+              thres(d + 1),
+              count_lt(0),
+              count_eq(0),
+              k(k) {}
+
+    void update_counter(const uint8_t* y, size_t j) {
+        int32_t dis = hc.hamming(y);
+
+        if (dis <= thres) {
+            if (dis < thres) {
+                ids_per_dis[dis * k + counters[dis]++] = j;
+                ++count_lt;
+                while (count_lt == k && thres > 0) {
+                    --thres;
+                    count_eq = counters[thres];
+                    count_lt -= count_eq;
+                }
+            } else if (count_eq < k) {
+                ids_per_dis[dis * k + count_eq++] = j;
+                counters[dis] = count_eq;
+            }
         }
-      } else if (count_eq < k) {
-        ids_per_dis[dis * k + count_eq++] = j;
-        counters[dis] = count_eq;
-      }
     }
-  }
 };
 
-
 } // namespace faiss