c++

* prefer prefix increment operator unless logically necessary
  (it doesn't make any diff foro built-in type but good practice)

2 files changed, 2 insertions, 2 deletions

diff --git a/include/llmr/geometry/binpack.hpp b/include/llmr/geometry/binpack.hpp
index d7405d7d35..53b9e6c1ab 100644
--- a/include/llmr/geometry/binpack.hpp
+++ b/include/llmr/geometry/binpack.hpp
@@ -69,7 +69,7 @@ public:
         // Simple algorithm to recursively merge the newly released cell with its
         // neighbor. This doesn't merge more than two cells at a time, and fails
         // for complicated merges.
-        for (auto it = free.begin(); it != free.end(); it++) {
+        for (auto it = free.begin(); it != free.end(); ++it) {
             Rect<T> ref = *it;
             if (ref.y == rect.y && ref.h == rect.h && ref.x + ref.w == rect.x) {
                 ref.w += rect.w;
diff --git a/include/llmr/util/unitbezier.hpp b/include/llmr/util/unitbezier.hpp
index e64f7abd4a..6acae7a3de 100644
--- a/include/llmr/util/unitbezier.hpp
+++ b/include/llmr/util/unitbezier.hpp
@@ -66,7 +66,7 @@ struct UnitBezier {
         int i;
 
         // First try a few iterations of Newton's method -- normally very fast.
-        for (t2 = x, i = 0; i < 8; i++) {
+        for (t2 = x, i = 0; i < 8; ++i) {
             x2 = sampleCurveX(t2) - x;
             if (fabs (x2) < epsilon)
                 return t2;