diff --git a/src/TreeSupport.cpp b/src/TreeSupport.cpp
index cc7bb4032f..8985432a6a 100644
--- a/src/TreeSupport.cpp
+++ b/src/TreeSupport.cpp
@@ -1651,7 +1651,7 @@ void TreeSupport::generateBranchAreas(
     }
 
     std::vector<Polygons> linear_inserts(linear_data.size());
-    const size_t progress_inserts_check_interval = std::max(linear_data.size() / progress_report_steps,size_t(1));
+    const size_t progress_inserts_check_interval = std::max(linear_data.size() / progress_report_steps, size_t(1));
 
     std::mutex critical_sections;
     cura::parallel_for<size_t>(
@@ -1924,11 +1924,8 @@ void TreeSupport::dropNonGraciousAreas(
         [&](const size_t idx)
         {
             TreeSupportElement* elem = linear_data[idx].second;
-            bool non_gracious_model_contact
-                = ! elem->to_model_gracious_
-               && ! inverse_tree_order.count(elem)
-               && linear_data[idx].first > 0
-               && ! elem->to_buildplate_; // If an element has no child, it connects to whatever is below as no support further down for it will exist.
+            bool non_gracious_model_contact = ! elem->to_model_gracious_ && ! inverse_tree_order.count(elem) && linear_data[idx].first > 0
+                                           && ! elem->to_buildplate_; // If an element has no child, it connects to whatever is below as no support further down for it will exist.
             if (non_gracious_model_contact)
             {
                 Polygons rest_support = layer_tree_polygons[linear_data[idx].first][elem].intersection(volumes_.getAccumulatedPlaceable0(linear_data[idx].first));