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

Add `Index::rearranging_recursive_filter`.

Harpreet Sangareacd644d3aed
diff --git a/include/index.h b/include/index.h
index b427763a..fdc059d7 100644
--- a/include/index.h
+++ b/include/index.h
@@ -707,7 +707,7 @@ public:
const std::string & reference_helper_field_name) const;
void do_reference_filtering_with_lock(std::pair<uint32_t, uint32_t*>& reference_index_ids,
- filter_node_t const* const& filter_tree_root,
+ filter_node_t* filter_tree_root,
const std::string& reference_field_name) const;
void refresh_schemas(const std::vector<field>& new_fields, const std::vector<field>& del_fields);
diff --git a/src/index.cpp b/src/index.cpp
index 3ec45ac4..6592b87b 100644
--- a/src/index.cpp
+++ b/src/index.cpp
@@ -1497,7 +1497,7 @@ Option<bool> Index::do_filtering(filter_node_t* const root,
const uint32_t& context_ids_length,
const uint32_t* context_ids) const {
// auto begin = std::chrono::high_resolution_clock::now();
-/**/ const filter a_filter = root->filter_exp;
+ const filter a_filter = root->filter_exp;
bool is_referenced_filter = !a_filter.referenced_collection_name.empty();
if (is_referenced_filter) {
@@ -1958,7 +1958,6 @@ Option<bool> Index::rearrange_filter_tree(filter_node_t* const root,
if (root == nullptr) {
return Option(true);
}
-
if (root->isOperator) {
uint32_t l_filter_ids_length = 0;
if (root->left != nullptr) {