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

Exhaustively search to identify all facets in facet query.

Kishore Nallanabdf26c2630b
diff --git a/src/index.cpp b/src/index.cpp
index 4322cfb3..814d6cd5 100644
--- a/src/index.cpp
+++ b/src/index.cpp
@@ -3750,7 +3750,7 @@ void Index::compute_facet_infos(const std::vector<facet>& facets, facet_query_t&
//LOG(INFO) << "si: " << si << ", field_result_ids_len: " << field_result_ids_len;
- for(size_t i = 0; i < std::min<size_t>(1000, field_result_ids_len); i++) {
+ for(size_t i = 0; i < field_result_ids_len; i++) {
uint32_t seq_id = field_result_ids[i];
const auto doc_fvalues_it = field_facet_mapping_it->second[seq_id % ARRAY_FACET_DIM]->find(seq_id);
@@ -3762,7 +3762,8 @@ void Index::compute_facet_infos(const std::vector<facet>& facets, facet_query_t&
for(auto pl: posting_lists) {
if(!posting_t::contains(pl, seq_id)) {
- // need to ensure that document ID actually contains both searched_query tokens
+ // need to ensure that document ID actually contains searched_query tokens
+ // since `field_result_ids` contains documents matched across all queries
id_matched = false;
break;
}