Changes in libcfa/src/rational.cfa [f6a4917:0aa4beb]

File:

• libcfa/src/rational.cfa (modified) (3 diffs)

libcfa/src/rational.cfa

@@ -10 +10 @@
 // Created On       : Wed Apr  6 17:54:28 2016
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Thu Aug 25 18:09:58 2022
-// Update Count     : 194
+// Last Modified On : Tue Jul 20 16:30:06 2021
+// Update Count     : 193
 //
 
@@ -26 +26 @@
         // rationals.  alternative: https://en.wikipedia.org/wiki/Binary_GCD_algorithm
         static T gcd( T a, T b ) {
-                for () {                                                                                // Euclid's algorithm
+                for ( ;; ) {                                                                    // Euclid's algorithm
                         T r = a % b;
                   if ( r == (T){0} ) break;
@@ -246 +246 @@
 
         // find terms until denom gets too big
-        for () {
+        for ( ;; ) {
                 ai = convert( f );
           if ( ! (m10 * ai + m11 <= md) ) break;