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

resolve conflicts and refactor getting group_by_field_it

krunala8234cf2b628
diff --cc src/index.cpp
index b7aefaf5,a35ad262..72b4e0f4
--- a/src/index.cpp
+++ b/src/index.cpp
@@@ -5268,17 -5229,8 +5301,18 @@@ Option<bool> Index::search_wildcard(fil
search_stop_us = parent_search_stop_ms;
search_cutoff = parent_search_cutoff;
- size_t filter_index = 0;
+ std::vector<std::pair<posting_list_t::iterator_t, std::string>> group_by_it_field_vec;
+ for(const auto& field_name: group_by_fields) {
+ if (!facet_index_v4->has_hash_index(field_name)) {
+ continue;
+ }
+ auto facet_index = facet_index_v4->get_facet_hash_index(field_name);
+ auto facet_index_it = facet_index->new_iterator();
+ group_by_it_field_vec.emplace_back(std::make_pair(std::move(facet_index_it), field_name));
+ }
+
+ std::vector<uint32_t> filter_indexes;
+
for(size_t i = 0; i < batch_result->count; i++) {
const uint32_t seq_id = batch_result->docs[i];
std::map<basic_string<char>, reference_filter_result_t> references;