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

Address valgrind warning

Jason Boscod058d6165e16
diff --git a/src/collection.cpp b/src/collection.cpp
index b643cabc..09e9858f 100644
--- a/src/collection.cpp
+++ b/src/collection.cpp
@@ -1034,7 +1034,7 @@ Option<nlohmann::json> Collection::search(const std::string & query, const std::
wrapper_doc["highlights"].push_back(h_json);
}
- wrapper_doc["seq_id"] = (uint32_t) field_order_kv->key;
+ //wrapper_doc["seq_id"] = (uint32_t) field_order_kv->key;
prune_document(document, include_fields, exclude_fields);
wrapper_doc["document"] = document;
diff --git a/src/index.cpp b/src/index.cpp
index 2ec98834..e4626827 100644
--- a/src/index.cpp
+++ b/src/index.cpp
@@ -913,7 +913,7 @@ void Index::search_candidates(const uint8_t & field_id,
size_t filtered_results_size = ArrayUtils::and_scalar(filter_ids, filter_ids_length, result_ids,
result_size, &filtered_result_ids);
- uint32_t* new_all_result_ids;
+ uint32_t* new_all_result_ids = nullptr;
all_result_ids_len = ArrayUtils::or_scalar(*all_result_ids, all_result_ids_len, filtered_result_ids,
filtered_results_size, &new_all_result_ids);
delete [] *all_result_ids;
@@ -928,7 +928,7 @@ void Index::search_candidates(const uint8_t & field_id,
delete[] filtered_result_ids;
delete[] result_ids;
} else {
- uint32_t* new_all_result_ids;
+ uint32_t* new_all_result_ids = nullptr;
all_result_ids_len = ArrayUtils::or_scalar(*all_result_ids, all_result_ids_len, result_ids,
result_size, &new_all_result_ids);
delete [] *all_result_ids;