Fixed build

Author: jkurdek

include/sparser.h

@@ -80,7 +80,7 @@ class CascadeBuilder {
     std::vector<std::shared_ptr<Node>> HandleSuccess(const size_t current_depth, const size_t conjunction_idx);
 };
 
-void PrettyPrint(const std::shared_ptr<Node>& node, const std::string& prefix = "", bool isLeft = true,
-                 std::ostream& os = std::cout);
+void PrettyPrint(const std::shared_ptr<Node>& node, const RawFilterDisjunction& rf_data, const std::string& prefix = "",
+                 bool isLeft = true, std::ostream& os = std::cout);
 
 #endif  // SPARSER_H_

src/sparser/sparser.cpp

@@ -158,8 +158,8 @@ std::vector<std::shared_ptr<Node>> CascadeBuilder::HandleSuccess(const size_t cu
     return valid_subtrees;
 }
 
-void PrettyPrint(const std::shared_ptr<Node>& node, const std::string& prefix, bool isLeft, std::ostream& os,
-                 RawFilterDisjunction& rf_data) {
+void PrettyPrint(const std::shared_ptr<Node>& node, RawFilterDisjunction& rf_data, const std::string& prefix,
+                 bool isLeft, std::ostream& os) {
     if (!node) {
         // Print "NULL" or some placeholder for an empty child.
         os << prefix << (isLeft ? "├── " : "└── ") << "NULL\n";
@@ -177,6 +177,6 @@ void PrettyPrint(const std::shared_ptr<Node>& node, const std::string& prefix, b
     auto newPrefix = prefix + (isLeft ? "│   " : "    ");
 
     // Recursively print left and right subtrees.
-    PrettyPrint(node->left, newPrefix, true, os);
-    PrettyPrint(node->right, newPrefix, false, os);
+    PrettyPrint(node->left, rf_data, newPrefix, true, os);
+    PrettyPrint(node->right, rf_data, newPrefix, false, os);
 }