| 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 |
|
| 14 |
// 64-bit int |
| 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 |
faiss::IndexFlatL2 index(d); // call constructor |
| 43 |
printf("is_trained = %s\n", index.is_trained ? "true" : "false"); |
| 44 |
index.add(nb, xb); // add vectors to the index |
| 45 |
printf("ntotal = %zd\n", index.ntotal); |
| 46 |
|
| 47 |
int k = 4; |
| 48 |
|
| 49 |
{ // sanity check: search 5 first vectors of xb |
| 50 |
idx_t* I = new idx_t[k * 5]; |
| 51 |
float* D = new float[k * 5]; |
| 52 |
|
| 53 |
index.search(5, xb, k, D, I); |
| 54 |
|
| 55 |
// print results |
| 56 |
printf("I=\n"); |
| 57 |
for (int i = 0; i < 5; i++) { |
| 58 |
for (int j = 0; j < k; j++) { |
| 59 |
printf("%5zd ", I[i * k + j]); |
| 60 |
} |
| 61 |
printf("\n"); |
| 62 |
} |
| 63 |
|
| 64 |
printf("D=\n"); |
| 65 |
for (int i = 0; i < 5; i++) { |
| 66 |
for (int j = 0; j < k; j++) { |
| 67 |
printf("%7g ", D[i * k + j]); |
| 68 |
} |
| 69 |
printf("\n"); |
| 70 |
} |
| 71 |
|
| 72 |
delete[] I; |
| 73 |
delete[] D; |
| 74 |
} |
| 75 |
|
| 76 |
{ // search xq |
| 77 |
idx_t* I = new idx_t[k * nq]; |
| 78 |
float* D = new float[k * nq]; |
| 79 |
|
| 80 |
index.search(nq, xq, k, D, I); |
| 81 |
|
| 82 |
// print results |
| 83 |
printf("I (5 first results)=\n"); |
| 84 |
for (int i = 0; i < 5; i++) { |
| 85 |
for (int j = 0; j < k; j++) { |
| 86 |
printf("%5zd ", I[i * k + j]); |
| 87 |
} |
| 88 |
printf("\n"); |
| 89 |
} |
| 90 |
|
| 91 |
printf("D (5 last results)=\n"); |
| 92 |
for (int i = nq - 5; i < nq; i++) { |
| 93 |
for (int j = 0; j < k; j++) { |
| 94 |
printf("%5f ", D[i * k + j]); |
| 95 |
} |
| 96 |
printf("\n"); |
| 97 |
} |
| 98 |
|
| 99 |
delete[] I; |
| 100 |
delete[] D; |
| 101 |
} |
| 102 |
|
| 103 |
delete[] xb; |
| 104 |
delete[] xq; |
| 105 |
|
| 106 |
return 0; |
| 107 |
} |