Simplify Euclidean algorithm very slightly using (x) vs (x != 0).

jeremy-murphy · jeremy-murphy · commit e7b5e406c406 · 2016-12-12T01:11:36.000+11:00
diff --git a/include/boost/math/common_factor_rt.hpp b/include/boost/math/common_factor_rt.hpp
@@ -381,7 +381,7 @@ namespace detail
     inline EuclideanDomain Euclid_gcd(EuclideanDomain a, EuclideanDomain b)
     {
         using std::swap;
-        while (b != EuclideanDomain(0))
+        while (b)
         {
             gcd_traits<EuclideanDomain>::modulo(a, b);
             swap(a, b);

Original file line number	Diff line number	Diff line change
`@@ -381,7 +381,7 @@ namespace detail`
`381`	`381`	`inline EuclideanDomain Euclid_gcd(EuclideanDomain a, EuclideanDomain b)`
`382`	`382`	`{`
`383`	`383`	`using std::swap;`
`384`		`- while (b != EuclideanDomain(0))`
	`384`	`+ while (b)`
`385`	`385`	`{`
`386`	`386`	`gcd_traits<EuclideanDomain>::modulo(a, b);`
`387`	`387`	`swap(a, b);`