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 operand deletion.

Kishore Nallan58e7b2def65b
diff --git a/src/field.cpp b/src/field.cpp
index 1ec4438f..3675d43c 100644
--- a/src/field.cpp
+++ b/src/field.cpp
@@ -410,6 +410,7 @@ Option<bool> toParseTree(std::queue<std::string>& postfix, filter_node_t*& root,
nodeStack.pop();
if (nodeStack.empty()) {
+ delete operandB;
is_successful = false;
error_message = "Could not parse the filter query: unbalanced `" + expression + "` operands.";
break;
@@ -453,9 +454,6 @@ Option<bool> toParseTree(std::queue<std::string>& postfix, filter_node_t*& root,
}
if (!is_successful) {
- delete filter_node;
- filter_node = nullptr;
-
while (!nodeStack.empty()) {
auto filterNode = nodeStack.top();
delete filterNode;