Changeset f6a4917

Timestamp:

Aug 25, 2022, 10:43:36 PM (20 months ago)

Author:

Peter A. Buhr <pabuhr@…>

Branches:

ADT, ast-experimental, master, pthread-emulation

Children:

51fbba5

Parents:

d2f09e4

Message:

change C loop control to CFA loop control

Location:

libcfa/src

Files:

• iostream.cfa (modified) (2 diffs)
• rational.cfa (modified) (3 diffs)
• stdlib.cfa (modified) (4 diffs)
• stdlib.hfa (modified) (2 diffs)

libcfa/src/iostream.cfa

@@ -10 +10 @@
 // Created On       : Wed May 27 17:56:53 2015
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Wed Jan 19 08:15:53 2022
-// Update Count     : 1352
+// Last Modified On : Thu Aug 25 18:05:49 2022
+// Update Count     : 1354
 //
 
@@ -197 +197 @@
                         fmt( os, "%s", buf ); \
                         if ( isfinite( val ) ) { /* if number, print decimal point when no fraction or exponent */ \
-                                for ( int i = 0;; i += 1 ) { \
+                                for ( i; 0 ~ @ ) { \
                                         if ( i == len ) { fmt( os, "." ); break; } \
                                         if ( buf[i] == '.' || buf[i] == 'e' || buf[i] == 'E' ) break; /* decimal point or scientific ? */ \

libcfa/src/rational.cfa

@@ -10 +10 @@
 // Created On       : Wed Apr  6 17:54:28 2016
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Tue Jul 20 16:30:06 2021
-// Update Count     : 193
+// Last Modified On : Thu Aug 25 18:09:58 2022
+// Update Count     : 194
 //
 
@@ -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;

libcfa/src/stdlib.cfa

@@ -10 +10 @@
 // Created On       : Thu Jan 28 17:10:29 2016
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Thu Feb 10 22:41:39 2022
-// Update Count     : 602
+// Last Modified On : Thu Aug 25 22:41:14 2022
+// Update Count     : 604
 //
 
@@ -35 +35 @@
 T * anew( size_t dim, TT p ) {
         T * arr = alloc( dim );
-        for ( unsigned int i = 0; i < dim; i += 1 ) {
+        for ( i; dim ) {
                 (arr[i]){ p };                                                                  // run constructor
         } // for
@@ -45 +45 @@
         if ( arr ) {                                                                            // ignore null
                 size_t dim = malloc_size( arr ) / sizeof( T );
-                for ( int i = dim - 1; i >= 0; i -= 1 ) {               // reverse allocation order, must be unsigned
+                for ( i; 0 -~= dim - 1 ) {                                              // reverse allocation order, must be unsigned
                         ^(arr[i]){};                                                            // run destructor
                 } // for
@@ -56 +56 @@
         if ( arr ) {                                                                            // ignore null
                 size_t dim = malloc_size( arr ) / sizeof( T );
-                for ( int i = dim - 1; i >= 0; i -= 1 ) {               // reverse allocation order, must be unsigned
+                for ( i; 0 -~= dim - 1 ) {                                              // reverse allocation order, must be unsigned
                         ^(arr[i]){};                                                            // run destructor
                 } // for

libcfa/src/stdlib.hfa

@@ -10 +10 @@
 // Created On       : Thu Jan 28 17:12:35 2016
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Mon Apr 18 17:57:36 2022
-// Update Count     : 644
+// Last Modified On : Thu Aug 25 18:07:06 2022
+// Update Count     : 645
 //
 
@@ -192 +192 @@
                         memset( (char *)ptr + copy_end, (int)Fill.c, Dim * size - copy_end );
                 } else if ( Fill.tag == 't' ) {
-                        for ( int i = copy_end; i < Dim * size; i += size ) {
+                        for ( i; copy_end ~ Dim * size ~ size ) {
                                 #pragma GCC diagnostic push
                                 #pragma GCC diagnostic ignored "-Wmaybe-uninitialized"