Changeset 39c4dac for tests

Timestamp:

Aug 20, 2018, 1:30:29 PM (6 years ago)

Author:

Rob Schluntz <rschlunt@…>

Branches:

ADT, aaron-thesis, arm-eh, ast-experimental, cleanup-dtors, deferred_resn, demangler, enum, forall-pointer-decay, jacob/cs343-translation, jenkins-sandbox, master, new-ast, new-ast-unique-expr, no_list, persistent-indexer, pthread-emulation, qualifiedEnum

Children:

51a455c

Parents:

550e819 (diff), 69efc321 (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent.

Message:

Merge branch 'master' into demangler

Location:

tests

Files:

• coroutine/fibonacci.c (modified) (2 diffs)
• coroutine/fibonacci_1.c (added)
• coroutine/pingpong.c (modified) (2 diffs)
• coroutine/prodcons.c (modified) (2 diffs)
• gmp.c (modified) (3 diffs)

tests/coroutine/fibonacci.c

@@ -6 +6 @@
 //
 // fibonacci.c -- 3-state finite-state machine
-
 //
 // Author           : Thierry Delisle
 // Created On       : Thu Jun  8 07:29:37 2017
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Thu Aug 16 08:18:16 2018
-// Update Count     : 20
+// Last Modified On : Sat Aug 18 11:21:58 2018
+// Update Count     : 24
 //
 
@@ -39 +38 @@
 int main() {
         Fibonacci f1, f2;
-        for ( int i = 1; i <= 10; i += 1 ) {
+        for ( 10 ) {                                                                            // print N Fibonacci values
                 sout | next( f1 ) | next( f2 ) | endl;
         } // for

tests/coroutine/pingpong.c

@@ -10 +10 @@
 // Created On       : Wed Sep 20 11:55:23 2017
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Wed Sep 20 13:41:39 2017
-// Update Count     : 26
+// Last Modified On : Sat Aug 18 11:31:11 2018
+// Update Count     : 28
 //
 
@@ -39 +39 @@
 }
 void main( PingPong & pingpong ) {                                              // ping's starter ::main, pong's starter ping
-        for ( unsigned int i = 0; i < pingpong.N; i += 1 ) {
+        for ( pingpong.N ) {                                                            // N ping-pongs
                 sout | pingpong.name | endl;
                 cycle( *pingpong.part );

tests/coroutine/prodcons.c

@@ -10 +10 @@
 // Created On       : Mon Sep 18 12:23:39 2017
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Tue Jan  2 12:17:01 2018
-// Update Count     : 47
+// Last Modified On : Sat Aug 18 12:55:10 2018
+// Update Count     : 51
 //
 
 #include <fstream.hfa>
 #include <coroutine.hfa>
-#include <stdlib.hfa>                                                                           // random
+#include <stdlib.hfa>                                                                   // random
 #include <unistd.h>                                                                             // getpid
 
@@ -29 +29 @@
 void main( Prod & prod ) with( prod ) {                                 // starter ::main
         // 1st resume starts here
-        for ( int i = 0; i < N; i += 1 ) {
+        for ( i; N ) {                                                                          // N pairs of values
                 int p1 = random( 100 );
                 int p2 = random( 100 );

tests/gmp.c

@@ -10 +10 @@
 // Created On       : Tue Apr 19 08:55:51 2016
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Thu Sep 28 18:33:51 2017
-// Update Count     : 555
+// Last Modified On : Sat Aug 18 12:43:13 2018
+// Update Count     : 556
 //
 
@@ -89 +89 @@
         fn = 1; fn2 = fn1; fn1 = fn;                                            // 2nd case
         sout | 1 | fn | endl;
-        for ( unsigned int i = 2; i <= 200; i += 1 ) {
+        for ( i; 2u ~= 200 ) {
                 fn = fn1 + fn2; fn2 = fn1; fn1 = fn;                    // general case
                 sout | i | fn | endl;
@@ -99 +99 @@
         Int fact = 1;                                                                           // 1st case
         sout | (int)0 | fact | endl;
-        for ( unsigned int i = 1; i <= 40; i += 1 ) {
+        for ( i; 1u ~= 40u ) {
                 fact *= i;                                                                              // general case
                 sout | i | fact | endl;