Mercurial > ldforge / file diff

--- a/src/misc/ringFinder.cc	Sun Dec 29 16:40:45 2013 +0200
+++ b/src/misc/ringFinder.cc	Sun Dec 29 16:52:08 2013 +0200
@@ -147,14 +147,11 @@
 	// ring counts, the solutions with lesser maximum rings should result
 	// in cleaner code and less new primitives, right?
 	int maxA = 0,
-	maxB = 0;
+		maxB = 0;
 
 	for (int i = 0; i < getComponents().size(); ++i)
-	{	if (getComponents()[i].num > maxA)
-			maxA = getComponents()[i].num;
-
-		if (other.getComponents()[i].num > maxB)
-			maxB = other.getComponents()[i].num;
+	{	maxA = max (getComponents()[i].num, maxA);
+		maxB = max (other.getComponents()[i].num, maxB);
 	}
 
 	if (maxA < maxB)