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

Use partial_sort for bucketed match score.

Kishore Nallan4e1f01289ef4
diff --git a/src/collection.cpp b/src/collection.cpp
index a027d33b..09e539a9 100644
--- a/src/collection.cpp
+++ b/src/collection.cpp
@@ -1328,7 +1328,8 @@ Option<nlohmann::json> Collection::search(const std::string & raw_query,
}
// sort again based on bucketed match score
- std::sort(raw_result_kvs.begin(), raw_result_kvs.end(), Topster::is_greater_kv_group);
+ std::partial_sort(raw_result_kvs.begin(), raw_result_kvs.begin() + max_kvs_bucketed, raw_result_kvs.end(),
+ Topster::is_greater_kv_group);
// restore original scores
for(i = 0; i < max_kvs_bucketed; i++) {