mirrors
/
faiss
mirror of https://github.com/facebookresearch/faiss.git
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

Update demo_imi_pq.cpp (#1636) 

Summary:
remove long.
This is to close PR https://github.com/facebookresearch/faiss/issues/1050

Pull Request resolved: https://github.com/facebookresearch/faiss/pull/1636

Reviewed By: beauby

Differential Revision: D25994690

Pulled By: mdouze

fbshipit-source-id: 35dfa4295602f64053883594b5a7d0b9b7293545
pull/1647/head
Matthijs Douze 2021-01-22 00:02:26 -08:00 committed by Facebook GitHub Bot
parent 908812266c
commit f351a83ef6
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
demos/demo_imi_pq.cpp
View File

@ -125,7 +125,7 @@ int main ()
elapsed() - t0, nb);
std::vector <float> database (nb * d);
std::vector <long> ids (nb);
std::vector <faiss::Index::idx_t> ids (nb);
for (size_t i = 0; i < nb; i++) {
for (size_t j = 0; j < d; j++) {
database[i * d + j] = distrib(rng);
@ -166,7 +166,7 @@ int main ()
// - given a vector float *x, finding which k centroids are
// closest to it (ie to find the nearest neighbors) can be done with
//
// long *centroid_ids = new long[k];
// faiss::Index::idx_t *centroid_ids = new faiss::Index::idx_t[k];
// float *distances = new float[k];
// index.quantizer->search (1, x, k, dis, centroids_ids);
//