Skip to content

Open Source alternative to Algolia + Pinecone and an Easier-to-Use alternative to ElasticSearch ⚡ 🔍 ✨ Fast, typo tolerant, in-memory fuzzy Search Engine for building delightful search experiences

Decrease vector search test run time with lower threshold.

Kishore Nallan276ffa9e84d6
diff --git a/test/collection_vector_search_test.cpp b/test/collection_vector_search_test.cpp
index 14a91472..5d27f638 100644
--- a/test/collection_vector_search_test.cpp
+++ b/test/collection_vector_search_test.cpp
@@ -155,7 +155,7 @@ TEST_F(CollectionVectorTest, BasicVectorQuerying) {
collectionManager.drop_collection("coll1");
}
-TEST_F(CollectionVectorTest, Index10KVectors) {
+TEST_F(CollectionVectorTest, IndexGreaterThan1KVectors) {
// tests the dynamic resizing of graph
nlohmann::json schema = R"({
"name": "coll1",
@@ -169,7 +169,7 @@ TEST_F(CollectionVectorTest, Index10KVectors) {
Collection* coll1 = collectionManager.create_collection(schema).get();
size_t d = 4;
- size_t n = 10 * 1000;
+ size_t n = 1500;
std::mt19937 rng;
rng.seed(47);
@@ -198,5 +198,5 @@ TEST_F(CollectionVectorTest, Index10KVectors) {
4, {off}, 32767, 32767, 2,
false, true, "").get();
- ASSERT_EQ(10000, results["found"].get<size_t>());
+ ASSERT_EQ(1500, results["found"].get<size_t>());
}