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

Add comment.

Harpreet Sangardaa8e28d00a0
diff --git a/test/collection_sorting_test.cpp b/test/collection_sorting_test.cpp
index 40882e38..1dee1d2e 100644
--- a/test/collection_sorting_test.cpp
+++ b/test/collection_sorting_test.cpp
@@ -2134,6 +2134,7 @@ TEST_F(CollectionSortingTest, OptionalFilteringViaSortingWildcard) {
results = nlohmann::json::parse(json_res);
ASSERT_EQ(4, results["hits"].size()); // 3 Adidas 1 Puma documents
+ // Because of `_eval`, Puma document will be on top even when having a lower text match score than Adidas documents.
expected_ids = {"5", "4", "2", "1"};
for(size_t i = 0; i < expected_ids.size(); i++) {
ASSERT_EQ(expected_ids[i], results["hits"][i]["document"]["id"].get<std::string>());