mirror of
https://github.com/facebookresearch/faiss.git
synced 2026-10-12 02:13:36 +00:00
Missed printing 'D' (#3433)
Summary: 'I' was printed twice and 'D' (distance vector) was not printed. Fixed. Pull Request resolved: https://github.com/facebookresearch/faiss/pull/3433 Reviewed By: fxdawnn Differential Revision: D57451544 Pulled By: junjieqi fbshipit-source-id: fc17b3b467f8b2c4ad7d80b44866456d9146e530
This commit is contained in:
committed by
Facebook GitHub Bot
parent
4489773fd4
commit
59e3ee1e30
@@ -83,10 +83,10 @@ int main() {
|
||||
printf("\n");
|
||||
}
|
||||
|
||||
printf("I (5 last results)=\n");
|
||||
printf("D (5 last results)=\n");
|
||||
for (int i = nq - 5; i < nq; i++) {
|
||||
for (int j = 0; j < k; j++)
|
||||
printf("%5zd ", I[i * k + j]);
|
||||
printf("%5f ", D[i * k + j]);
|
||||
printf("\n");
|
||||
}
|
||||
|
||||
|
||||
@@ -61,13 +61,10 @@ int main() {
|
||||
printf("\n");
|
||||
}
|
||||
|
||||
index.nprobe = 10;
|
||||
index.search(nq, xq, k, D, I);
|
||||
|
||||
printf("I=\n");
|
||||
printf("D=\n");
|
||||
for (int i = nq - 5; i < nq; i++) {
|
||||
for (int j = 0; j < k; j++)
|
||||
printf("%5zd ", I[i * k + j]);
|
||||
printf("%5f ", D[i * k + j]);
|
||||
printf("\n");
|
||||
}
|
||||
|
||||
|
||||
@@ -55,12 +55,10 @@ int main() {
|
||||
printf("\n");
|
||||
}
|
||||
|
||||
index.search(nq, xq, k, D, I);
|
||||
|
||||
printf("I=\n");
|
||||
printf("D=\n");
|
||||
for (int i = nq - 5; i < nq; i++) {
|
||||
for (int j = 0; j < k; j++)
|
||||
printf("%5zd ", I[i * k + j]);
|
||||
printf("%5f ", D[i * k + j]);
|
||||
printf("\n");
|
||||
}
|
||||
|
||||
|
||||
Reference in New Issue
Block a user