mirror of
https://github.com/facebookresearch/faiss.git
synced 2026-10-12 02:13:36 +00:00
Alibek Zhakubayev
3d00b44a47
Summary: Pull Request resolved: https://github.com/facebookresearch/faiss/pull/4745 Reduce test dataset size to use ~13 MB instead of ~1.5 GB while maintaining enough computational complexity to trigger the 10ms timeout before early stopping can converge. Reviewed By: bshethmeta Differential Revision: D90128255 fbshipit-source-id: 75b875d23ce459849d29acdb9d6de0828879ae46
38 lines
922 B
C++
38 lines
922 B
C++
/*
|
|
* Copyright (c) Meta Platforms, Inc. and affiliates.
|
|
*
|
|
* This source code is licensed under the MIT license found in the
|
|
* LICENSE file in the root directory of this source tree.
|
|
*/
|
|
|
|
#include <gtest/gtest.h>
|
|
|
|
#include <faiss/Clustering.h>
|
|
#include <faiss/IndexFlat.h>
|
|
#include <faiss/impl/AuxIndexStructures.h>
|
|
#include <faiss/impl/FaissException.h>
|
|
#include <faiss/utils/random.h>
|
|
|
|
TEST(TestCallback, timeout) {
|
|
int n = 20000;
|
|
int k = 5000;
|
|
int d = 128;
|
|
int niter = 1000000000;
|
|
int seed = 42;
|
|
|
|
std::vector<float> vecs(n * d);
|
|
faiss::float_rand(vecs.data(), vecs.size(), seed);
|
|
|
|
auto index(new faiss::IndexFlat(d));
|
|
|
|
faiss::ClusteringParameters cp;
|
|
cp.niter = niter;
|
|
cp.verbose = false;
|
|
|
|
faiss::Clustering kmeans(d, k, cp);
|
|
|
|
faiss::TimeoutCallback::reset(0.010);
|
|
EXPECT_THROW(kmeans.train(n, vecs.data(), *index), faiss::FaissException);
|
|
delete index;
|
|
}
|