Tentative fix.

Index.h

@@ -69,7 +69,7 @@ struct DistanceComputer;
  * database-to-database queries are not implemented.
  */
 struct Index {
-    using idx_t = long;    ///< all indices are this type
+    using idx_t = int64_t;  ///< all indices are this type
     using component_t = float;
     using distance_t = float;
 

utils.cpp

@@ -1227,8 +1227,8 @@ size_t merge_result_table_with (size_t n, size_t k,
 
 
 
-size_t ranklist_intersection_size (size_t k1, const Index::idx_t *v1,
-                                   size_t k2, const Index::idx_t *v2_in)
+size_t ranklist_intersection_size (size_t k1, const int64_t *v1,
+                                   size_t k2, const int64_t *v2_in)
 {
     if (k2 > k1) return ranklist_intersection_size (k2, v2_in, k1, v1);
     int64_t *v2 = new int64_t [k2];

utils.h

@@ -20,7 +20,6 @@
 #include <random>
 #include <stdint.h>
 
-#include "Index.h"
 #include "Heap.h"
 
 
@@ -335,8 +334,8 @@ void ranklist_handle_ties (int k, int64_t *idx, const float *dis);
 /** count the number of comon elements between v1 and v2
  * algorithm = sorting + bissection to avoid double-counting duplicates
  */
-size_t ranklist_intersection_size (size_t k1, const Index::idx_t *v1,
-                                   size_t k2, const Index::idx_t *v2);
+size_t ranklist_intersection_size (size_t k1, const int64_t *v1,
+                                   size_t k2, const int64_t *v2);
 
 /** merge a result table into another one
  *