Learn to Build with CppCode

#include <faiss/IndexIVFFlat.h>
#include <faiss/invlists/SortedOnDiskInvertedLists.h>

// Create sorted on-disk inverted lists for faster search
auto sorted_lists = std::make_unique<SortedOnDiskInvertedLists>(
    nlist,           // number of clusters
    code_size,       // vector dimension * sizeof(float)
    "index.ivf"      // storage file
);

// Build index with sorted lists
faiss::IndexIVFFlat index(quantizer, d, nlist);
index.replace_invlists(sorted_lists.release(), true);

// Train and add vectors
index.train(n, vectors);
index.add(n, vectors);

// Search with early termination (3-5x faster!)
index.nprobe = 16;
index.search(nq, queries, k, distances, labels);