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
C++ algoliadatastoreelasticsearchenterprise-searchfacetingfull-text-searchfuzzy-searchgeosearchin-memoryinstantsearchmerchandisingpineconesearchsearch-enginesemantic-searchsimilarity-searchsite-searchsynonymstypo-tolerancevector-search
Fix memory leak.
Harpreet Sangar68c2c5b37824
diff --git a/src/art.cpp b/src/art.cppindex 48470551..d189d7eb 100644--- a/src/art.cpp+++ b/src/art.cpp@@ -1724,10 +1724,7 @@ int art_fuzzy_search_i(art_tree *t, const unsigned char *term, const int term_le<< ", filter_ids_length: " << filter_ids_length;}*/-// TODO: Figure out this edge case.-// if(allowed_doc_ids != filter_ids) {-// delete [] allowed_doc_ids;-// }+ delete [] allowed_doc_ids;return 0;}diff --git a/src/posting_list.cpp b/src/posting_list.cppindex e983e98b..1b5a3323 100644--- a/src/posting_list.cpp+++ b/src/posting_list.cpp@@ -1267,7 +1267,7 @@ bool posting_list_t::has_exact_match(std::vector<posting_list_t::iterator_t>& po} else {if (!field_is_array) {- for (uint32_t i = posting_list_iterators.size() - 1; i >= 0; i--) {+ for (int i = posting_list_iterators.size() - 1; i >= 0; i--) {posting_list_t::iterator_t& it = posting_list_iterators[i];block_t* curr_block = it.block();@@ -1320,7 +1320,7 @@ bool posting_list_t::has_exact_match(std::vector<posting_list_t::iterator_t>& postd::map<size_t, token_index_meta_t> array_index_to_token_index;- for(uint32_t i = posting_list_iterators.size() - 1; i >= 0; i--) {+ for(int i = posting_list_iterators.size() - 1; i >= 0; i--) {posting_list_t::iterator_t& it = posting_list_iterators[i];block_t* curr_block = it.block();