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

Refactor `Index::search_wildcard`.

Harpreet Sangar889c1759e283
diff --git a/src/index.cpp b/src/index.cpp
index 3b2dc166..29938911 100644
--- a/src/index.cpp
+++ b/src/index.cpp
@@ -4960,12 +4960,6 @@ void Index::search_wildcard(filter_node_t const* const& filter_tree_root,
filter_result_iterator.next();
} while (batch_result_ids.size() < window_size && filter_result_iterator.valid());
- uint32_t* new_all_result_ids = nullptr;
- all_result_ids_len = ArrayUtils::or_scalar(all_result_ids, all_result_ids_len, batch_result_ids.data(),
- batch_result_ids.size(), &new_all_result_ids);
- delete [] all_result_ids;
- all_result_ids = new_all_result_ids;
-
num_queued++;
searched_queries.push_back({});
@@ -5046,6 +5040,9 @@ void Index::search_wildcard(filter_node_t const* const& filter_tree_root,
/*long long int timeMillisF = std::chrono::duration_cast<std::chrono::milliseconds>(
std::chrono::high_resolution_clock::now() - beginF).count();
LOG(INFO) << "Time for raw scoring: " << timeMillisF;*/
+
+ filter_result_iterator.reset();
+ all_result_ids_len = filter_result_iterator.to_filter_id_array(all_result_ids);
}
void Index::populate_sort_mapping(int* sort_order, std::vector<size_t>& geopoint_indices,