2024-10-23 00:46:48 +08:00
|
|
|
/*
|
|
|
|
* Copyright (c) Meta Platforms, Inc. and affiliates.
|
2018-02-26 18:23:17 +08:00
|
|
|
*
|
2019-06-12 21:46:08 +08:00
|
|
|
* This source code is licensed under the MIT license found in the
|
2018-02-26 18:23:17 +08:00
|
|
|
* LICENSE file in the root directory of this source tree.
|
|
|
|
*/
|
|
|
|
|
|
|
|
// -*- c -*-
|
|
|
|
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <time.h>
|
|
|
|
|
2021-02-25 20:44:50 +08:00
|
|
|
#include "AutoTune_c.h"
|
|
|
|
#include "IndexFlat_c.h"
|
|
|
|
#include "Index_c.h"
|
|
|
|
#include "clone_index_c.h"
|
2018-02-26 18:23:17 +08:00
|
|
|
#include "error_c.h"
|
2023-03-10 07:30:19 +08:00
|
|
|
#include "impl/AuxIndexStructures_c.h"
|
2020-07-27 23:26:17 +08:00
|
|
|
#include "index_factory_c.h"
|
2018-05-02 19:39:59 +08:00
|
|
|
#include "index_io_c.h"
|
2018-02-26 18:23:17 +08:00
|
|
|
|
|
|
|
#define FAISS_TRY(C) \
|
|
|
|
{ \
|
|
|
|
if (C) { \
|
|
|
|
fprintf(stderr, "%s", faiss_get_last_error()); \
|
|
|
|
exit(-1); \
|
|
|
|
} \
|
|
|
|
}
|
|
|
|
|
2018-06-04 17:58:23 +08:00
|
|
|
double drand() {
|
2018-02-26 18:23:17 +08:00
|
|
|
return (double)rand() / (double)RAND_MAX;
|
|
|
|
}
|
|
|
|
|
|
|
|
int main() {
|
|
|
|
time_t seed = time(NULL);
|
|
|
|
srand(seed);
|
|
|
|
printf("Generating some data...\n");
|
2021-02-25 20:44:50 +08:00
|
|
|
int d = 128; // dimension
|
|
|
|
int nb = 100000; // database size
|
|
|
|
int nq = 10000; // nb of queries
|
|
|
|
float* xb = malloc(d * nb * sizeof(float));
|
|
|
|
float* xq = malloc(d * nq * sizeof(float));
|
2018-02-26 18:23:17 +08:00
|
|
|
|
2021-02-25 20:44:50 +08:00
|
|
|
for (int i = 0; i < nb; i++) {
|
|
|
|
for (int j = 0; j < d; j++)
|
|
|
|
xb[d * i + j] = drand();
|
2018-02-26 18:23:17 +08:00
|
|
|
xb[d * i] += i / 1000.;
|
|
|
|
}
|
2021-02-25 20:44:50 +08:00
|
|
|
for (int i = 0; i < nq; i++) {
|
|
|
|
for (int j = 0; j < d; j++)
|
|
|
|
xq[d * i + j] = drand();
|
2018-02-26 18:23:17 +08:00
|
|
|
xq[d * i] += i / 1000.;
|
|
|
|
}
|
|
|
|
|
|
|
|
printf("Building an index...\n");
|
|
|
|
|
|
|
|
FaissIndex* index = NULL;
|
2021-02-25 20:44:50 +08:00
|
|
|
FAISS_TRY(faiss_index_factory(
|
|
|
|
&index, d, "Flat", METRIC_L2)); // use factory to create index
|
|
|
|
printf("is_trained = %s\n",
|
|
|
|
faiss_Index_is_trained(index) ? "true" : "false");
|
|
|
|
FAISS_TRY(faiss_Index_add(index, nb, xb)); // add vectors to the index
|
2021-02-16 04:40:02 +08:00
|
|
|
printf("ntotal = %lld\n", faiss_Index_ntotal(index));
|
2018-02-26 18:23:17 +08:00
|
|
|
|
|
|
|
printf("Searching...\n");
|
|
|
|
int k = 5;
|
|
|
|
|
2021-02-25 20:44:50 +08:00
|
|
|
{ // sanity check: search 5 first vectors of xb
|
|
|
|
idx_t* I = malloc(k * 5 * sizeof(idx_t));
|
|
|
|
float* D = malloc(k * 5 * sizeof(float));
|
2018-02-26 18:23:17 +08:00
|
|
|
FAISS_TRY(faiss_Index_search(index, 5, xb, k, D, I));
|
|
|
|
printf("I=\n");
|
2021-02-25 20:44:50 +08:00
|
|
|
for (int i = 0; i < 5; i++) {
|
|
|
|
for (int j = 0; j < k; j++)
|
2021-02-16 04:40:02 +08:00
|
|
|
printf("%5lld (d=%2.3f) ", I[i * k + j], D[i * k + j]);
|
2018-02-26 18:23:17 +08:00
|
|
|
printf("\n");
|
|
|
|
}
|
|
|
|
free(I);
|
|
|
|
free(D);
|
|
|
|
}
|
2021-02-25 20:44:50 +08:00
|
|
|
{ // search xq
|
|
|
|
idx_t* I = malloc(k * nq * sizeof(idx_t));
|
|
|
|
float* D = malloc(k * nq * sizeof(float));
|
2022-08-31 20:44:25 +08:00
|
|
|
FAISS_TRY(faiss_Index_search(index, nq, xq, k, D, I));
|
2018-02-26 18:23:17 +08:00
|
|
|
printf("I=\n");
|
2021-02-25 20:44:50 +08:00
|
|
|
for (int i = 0; i < 5; i++) {
|
|
|
|
for (int j = 0; j < k; j++)
|
2021-02-16 04:40:02 +08:00
|
|
|
printf("%5lld (d=%2.3f) ", I[i * k + j], D[i * k + j]);
|
2018-02-26 18:23:17 +08:00
|
|
|
printf("\n");
|
|
|
|
}
|
|
|
|
free(I);
|
|
|
|
free(D);
|
|
|
|
}
|
2023-03-10 07:30:19 +08:00
|
|
|
{ // search xb first 5 but search parameters of id range [50, 100]
|
|
|
|
idx_t* I = malloc(k * nq * sizeof(idx_t));
|
|
|
|
float* D = malloc(k * nq * sizeof(float));
|
|
|
|
FaissIDSelectorRange* sel = NULL;
|
|
|
|
FAISS_TRY(faiss_IDSelectorRange_new(&sel, 50, 100));
|
|
|
|
FaissSearchParameters* params = NULL;
|
|
|
|
FAISS_TRY(faiss_SearchParameters_new(¶ms, sel));
|
|
|
|
FAISS_TRY(
|
|
|
|
faiss_Index_search_with_params(index, nq, xq, k, params, D, I));
|
|
|
|
printf("Searching w/ IDSelectorRange [50,100]\n");
|
|
|
|
printf("I=\n");
|
|
|
|
for (int i = 0; i < 5; i++) {
|
|
|
|
for (int j = 0; j < k; j++)
|
|
|
|
printf("%5lld (d=%2.3f) ", I[i * k + j], D[i * k + j]);
|
|
|
|
printf("\n");
|
|
|
|
}
|
|
|
|
free(I);
|
|
|
|
free(D);
|
|
|
|
faiss_SearchParameters_free(params);
|
|
|
|
faiss_IDSelectorRange_free(sel);
|
|
|
|
}
|
2018-02-26 18:23:17 +08:00
|
|
|
|
2023-03-25 00:25:48 +08:00
|
|
|
{ // search xb first 5 but search parameters of id range [20,40] OR
|
|
|
|
// [45,60]
|
|
|
|
idx_t* I = malloc(k * nq * sizeof(idx_t));
|
|
|
|
float* D = malloc(k * nq * sizeof(float));
|
|
|
|
FaissIDSelectorRange* lhs_sel = NULL;
|
|
|
|
FAISS_TRY(faiss_IDSelectorRange_new(&lhs_sel, 20, 40));
|
|
|
|
FaissIDSelectorRange* rhs_sel = NULL;
|
|
|
|
FAISS_TRY(faiss_IDSelectorRange_new(&rhs_sel, 45, 60));
|
|
|
|
FaissIDSelectorOr* sel = NULL;
|
|
|
|
FAISS_TRY(faiss_IDSelectorOr_new(&sel, lhs_sel, rhs_sel));
|
|
|
|
FaissSearchParameters* params = NULL;
|
|
|
|
FAISS_TRY(faiss_SearchParameters_new(¶ms, sel));
|
|
|
|
FAISS_TRY(
|
|
|
|
faiss_Index_search_with_params(index, nq, xq, k, params, D, I));
|
|
|
|
printf("Searching w/ IDSelectorRange [20,40] OR [45,60] \n");
|
|
|
|
printf("I=\n");
|
|
|
|
for (int i = 0; i < 5; i++) {
|
|
|
|
for (int j = 0; j < k; j++)
|
|
|
|
printf("%5lld (d=%2.3f) ", I[i * k + j], D[i * k + j]);
|
|
|
|
printf("\n");
|
|
|
|
}
|
|
|
|
free(I);
|
|
|
|
free(D);
|
|
|
|
faiss_SearchParameters_free(params);
|
|
|
|
faiss_IDSelectorRange_free(lhs_sel);
|
|
|
|
faiss_IDSelectorRange_free(rhs_sel);
|
|
|
|
faiss_IDSelector_free(sel);
|
|
|
|
}
|
|
|
|
{ // search xb first 5 but search parameters of id range [20,40] AND
|
|
|
|
// [15,35] = [20,35]
|
|
|
|
idx_t* I = malloc(k * nq * sizeof(idx_t));
|
|
|
|
float* D = malloc(k * nq * sizeof(float));
|
|
|
|
FaissIDSelectorRange* lhs_sel = NULL;
|
|
|
|
FAISS_TRY(faiss_IDSelectorRange_new(&lhs_sel, 20, 40));
|
|
|
|
FaissIDSelectorRange* rhs_sel = NULL;
|
|
|
|
FAISS_TRY(faiss_IDSelectorRange_new(&rhs_sel, 15, 35));
|
|
|
|
FaissIDSelectorAnd* sel = NULL;
|
|
|
|
FAISS_TRY(faiss_IDSelectorAnd_new(&sel, lhs_sel, rhs_sel));
|
|
|
|
FaissSearchParameters* params = NULL;
|
|
|
|
FAISS_TRY(faiss_SearchParameters_new(¶ms, sel));
|
|
|
|
FAISS_TRY(
|
|
|
|
faiss_Index_search_with_params(index, nq, xq, k, params, D, I));
|
|
|
|
printf("Searching w/ IDSelectorRange [20,40] AND [15,35] = [20,35]\n");
|
|
|
|
printf("I=\n");
|
|
|
|
for (int i = 0; i < 5; i++) {
|
|
|
|
for (int j = 0; j < k; j++)
|
|
|
|
printf("%5lld (d=%2.3f) ", I[i * k + j], D[i * k + j]);
|
|
|
|
printf("\n");
|
|
|
|
}
|
|
|
|
free(I);
|
|
|
|
free(D);
|
|
|
|
faiss_SearchParameters_free(params);
|
|
|
|
faiss_IDSelectorRange_free(lhs_sel);
|
|
|
|
faiss_IDSelectorRange_free(rhs_sel);
|
|
|
|
faiss_IDSelector_free(sel);
|
|
|
|
}
|
|
|
|
|
2018-05-02 19:39:59 +08:00
|
|
|
printf("Saving index to disk...\n");
|
|
|
|
FAISS_TRY(faiss_write_index_fname(index, "example.index"));
|
|
|
|
|
2018-02-26 18:23:17 +08:00
|
|
|
printf("Freeing index...\n");
|
|
|
|
faiss_Index_free(index);
|
|
|
|
printf("Done.\n");
|
|
|
|
|
|
|
|
return 0;
|
2018-06-04 17:58:23 +08:00
|
|
|
}
|