-
Notifications
You must be signed in to change notification settings - Fork 3.7k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Add tutorial on PQFastScan for cpp (#3468)
Summary: Pull Request resolved: #3468 This commit includes the tutorial for PQFastScan in the cpp environment. Reviewed By: junjieqi Differential Revision: D57631441
- Loading branch information
1 parent
4489773
commit f2325af
Showing
2 changed files
with
75 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,72 @@ | ||
/** | ||
* Copyright (c) Facebook, Inc. and its affiliates. | ||
* | ||
* This source code is licensed under the MIT license found in the | ||
* LICENSE file in the root directory of this source tree. | ||
*/ | ||
|
||
#include <cassert> | ||
#include <cstdio> | ||
#include <cstdlib> | ||
#include <random> | ||
|
||
#include <faiss/IndexPQFastScan.h> | ||
|
||
using idx_t = faiss::idx_t; | ||
|
||
int main() { | ||
int d = 64; // dimension | ||
int nb = 100000; // database size | ||
int nq = 10000; // nb of queries | ||
|
||
std::mt19937 rng; | ||
std::uniform_real_distribution<> distrib; | ||
|
||
float* xb = new float[d * nb]; | ||
float* xq = new float[d * nq]; | ||
|
||
for (int i = 0; i < nb; i++) { | ||
for (int j = 0; j < d; j++) | ||
xb[d * i + j] = distrib(rng); | ||
xb[d * i] += i / 1000.; | ||
} | ||
|
||
for (int i = 0; i < nq; i++) { | ||
for (int j = 0; j < d; j++) | ||
xq[d * i + j] = distrib(rng); | ||
xq[d * i] += i / 1000.; | ||
} | ||
|
||
int m = 8; | ||
int n_bit = 4; | ||
|
||
faiss::IndexPQFastScan index(d, m, n_bit); | ||
printf("Index is trained? %s\n", index.is_trained ? "true" : "false"); | ||
index.train(nb, xb); | ||
printf("Index is trained? %s\n", index.is_trained ? "true" : "false"); | ||
index.add(nb, xb); | ||
|
||
int k = 4; | ||
|
||
{ // search xq | ||
idx_t* I = new idx_t[k * nq]; | ||
float* D = new float[k * nq]; | ||
|
||
index.search(nq, xq, k, D, I); | ||
|
||
printf("I=\n"); | ||
for (int i = nq - 5; i < nq; i++) { | ||
for (int j = 0; j < k; j++) | ||
printf("%5zd ", I[i * k + j]); | ||
printf("\n"); | ||
} | ||
|
||
delete[] I; | ||
delete[] D; | ||
} | ||
|
||
delete[] xb; | ||
delete[] xq; | ||
|
||
return 0; | ||
} // namespace facebook::detail |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters