Debian Codegraph @

tutorial/cpp/3-IVFPQ.cpp

raw
1 /*
2 * Copyright (c) Meta Platforms, Inc. and affiliates.
3 *
4 * This source code is licensed under the MIT license found in the
5 * LICENSE file in the root directory of this source tree.
6 */
7
8 #include <cstdio>
9 #include <cstdlib>
10 #include <random>
11
12 #include <faiss/IndexFlat.h>
13 #include <faiss/IndexIVFPQ.h>
14
15 using idx_t = faiss::idx_t;
16
17 int main() {
18 int d = 64; // dimension
19 int nb = 100000; // database size
20 int nq = 10000; // nb of queries
21
22 std::mt19937 rng;
23 std::uniform_real_distribution<> distrib;
24
25 float* xb = new float[d * nb];
26 float* xq = new float[d * nq];
27
28 for (int i = 0; i < nb; i++) {
29 for (int j = 0; j < d; j++) {
30 xb[d * i + j] = distrib(rng);
31 }
32 xb[d * i] += i / 1000.;
33 }
34
35 for (int i = 0; i < nq; i++) {
36 for (int j = 0; j < d; j++) {
37 xq[d * i + j] = distrib(rng);
38 }
39 xq[d * i] += i / 1000.;
40 }
41
42 int nlist = 100;
43 int k = 4;
44 int m = 8; // bytes per vector
45 faiss::IndexFlatL2 quantizer(d); // the other index
46 faiss::IndexIVFPQ index(&quantizer, d, nlist, m, 8);
47
48 index.train(nb, xb);
49 index.add(nb, xb);
50
51 { // sanity check
52 idx_t* I = new idx_t[k * 5];
53 float* D = new float[k * 5];
54
55 index.search(5, xb, k, D, I);
56
57 printf("I=\n");
58 for (int i = 0; i < 5; i++) {
59 for (int j = 0; j < k; j++) {
60 printf("%5zd ", I[i * k + j]);
61 }
62 printf("\n");
63 }
64
65 printf("D=\n");
66 for (int i = 0; i < 5; i++) {
67 for (int j = 0; j < k; j++) {
68 printf("%7g ", D[i * k + j]);
69 }
70 printf("\n");
71 }
72
73 delete[] I;
74 delete[] D;
75 }
76
77 { // search xq
78 idx_t* I = new idx_t[k * nq];
79 float* D = new float[k * nq];
80
81 index.nprobe = 10;
82 index.search(nq, xq, k, D, I);
83
84 printf("I=\n");
85 for (int i = nq - 5; i < nq; i++) {
86 for (int j = 0; j < k; j++) {
87 printf("%5zd ", I[i * k + j]);
88 }
89 printf("\n");
90 }
91
92 delete[] I;
93 delete[] D;
94 }
95
96 delete[] xb;
97 delete[] xq;
98
99 return 0;
100 }