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

Increase the number of frequently occuring facets to 100.

Kishore Nallanf6643c9af7a9
diff --git a/src/collection.cpp b/src/collection.cpp
index ddcbece5..710aa64c 100644
--- a/src/collection.cpp
+++ b/src/collection.cpp
@@ -616,7 +616,7 @@ Option<nlohmann::json> Collection::search(std::string query, const std::vector<s
return a.second > b.second;
});
- for(size_t i = 0; i < std::min((size_t)10, value_to_count.size()); i++) {
+ for(size_t i = 0; i < std::min((size_t)100, value_to_count.size()); i++) {
auto & kv = value_to_count[i];
nlohmann::json facet_value_count = nlohmann::json::object();
facet_value_count["value"] = kv.first;