From 3c305e2aa517f969aa4c3f761a0409e84b000c3e Mon Sep 17 00:00:00 2001
From: Markus Vieth <mvieth@techfak.uni-bielefeld.de>
Date: Fri, 30 Sep 2022 21:20:21 +0200
Subject: [PATCH] Prefer prefix increment operators

---
 .../impl/transformation_estimation_dual_quaternion.hpp    | 4 ++--
 .../pcl/segmentation/impl/min_cut_segmentation.hpp        | 8 ++++----
 2 files changed, 6 insertions(+), 6 deletions(-)

diff --git a/registration/include/pcl/registration/impl/transformation_estimation_dual_quaternion.hpp b/registration/include/pcl/registration/impl/transformation_estimation_dual_quaternion.hpp
index 927a324ad22..ddfc4be6a87 100644
--- a/registration/include/pcl/registration/impl/transformation_estimation_dual_quaternion.hpp
+++ b/registration/include/pcl/registration/impl/transformation_estimation_dual_quaternion.hpp
@@ -173,8 +173,8 @@ TransformationEstimationDualQuaternion<PointSource, PointTarget, Scalar>::
     c2[6] += a.x + b.x;
     c2[7] += a.y - b.y;
     c2[11] += a.z - b.z;
-    source_it++;
-    target_it++;
+    ++source_it;
+    ++target_it;
   }
 
   c1[4] = c1[1];
diff --git a/segmentation/include/pcl/segmentation/impl/min_cut_segmentation.hpp b/segmentation/include/pcl/segmentation/impl/min_cut_segmentation.hpp
index 510504dc096..0b390c3b892 100644
--- a/segmentation/include/pcl/segmentation/impl/min_cut_segmentation.hpp
+++ b/segmentation/include/pcl/segmentation/impl/min_cut_segmentation.hpp
@@ -467,7 +467,7 @@ pcl::MinCutSegmentation<PointT>::recalculateUnaryPotentials ()
   OutEdgeIterator src_edge_end;
   std::pair<EdgeDescriptor, bool> sink_edge;
 
-  for (boost::tie (src_edge_iter, src_edge_end) = boost::out_edges (source_, *graph_); src_edge_iter != src_edge_end; src_edge_iter++)
+  for (boost::tie (src_edge_iter, src_edge_end) = boost::out_edges (source_, *graph_); src_edge_iter != src_edge_end; ++src_edge_iter)
   {
     double source_weight = 0.0;
     double sink_weight = 0.0;
@@ -498,12 +498,12 @@ pcl::MinCutSegmentation<PointT>::recalculateBinaryPotentials ()
   edge_marker.clear ();
   edge_marker.resize (indices_->size () + 2, out_edges_marker);
 
-  for (boost::tie (vertex_iter, vertex_end) = boost::vertices (*graph_); vertex_iter != vertex_end; vertex_iter++)
+  for (boost::tie (vertex_iter, vertex_end) = boost::vertices (*graph_); vertex_iter != vertex_end; ++vertex_iter)
   {
     VertexDescriptor source_vertex = *vertex_iter;
     if (source_vertex == source_ || source_vertex == sink_)
       continue;
-    for (boost::tie (edge_iter, edge_end) = boost::out_edges (source_vertex, *graph_); edge_iter != edge_end; edge_iter++)
+    for (boost::tie (edge_iter, edge_end) = boost::out_edges (source_vertex, *graph_); edge_iter != edge_end; ++edge_iter)
     {
       //If this is not the edge of the graph, but the reverse fictitious edge that is needed for the algorithm then continue
       EdgeDescriptor reverse_edge = (*reverse_edges_)[*edge_iter];
@@ -544,7 +544,7 @@ pcl::MinCutSegmentation<PointT>::assembleLabels (ResidualCapacityMap& residual_c
   clusters_.resize (2, segment);
 
   OutEdgeIterator edge_iter, edge_end;
-  for ( boost::tie (edge_iter, edge_end) = boost::out_edges (source_, *graph_); edge_iter != edge_end; edge_iter++ )
+  for ( boost::tie (edge_iter, edge_end) = boost::out_edges (source_, *graph_); edge_iter != edge_end; ++edge_iter )
   {
     if (labels[edge_iter->m_target] == 1)
     {