Changeset 61dafb8 for tests

Timestamp:

Nov 7, 2018, 5:13:08 PM (6 years ago)

Author:

Peter A. Buhr <pabuhr@…>

Branches:

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

Children:

3180aa1

Parents:

909aebf

Message:

finish test and documentation for loop-control

Location:

tests

Files:

• .expect/loopctrl.txt (modified) (1 diff)
• loopctrl.cfa (modified) (3 diffs)

tests/.expect/loopctrl.txt

@@ -20 +20 @@
 
 
+N N N N N N N N N N
+0 1 2 3 4 5 6 7 8 9
+10 9 8 7 6 5 4 3 2 1
+
+
 3 6 9
+
 
 (0 0)(1 1)(2 2)(3 3)(4 4)(5 5)(6 6)(7 7)(8 8)(9 9)

tests/loopctrl.cfa

@@ -10 +10 @@
 // Created On       : Wed Aug  8 18:32:59 2018
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Tue Nov  6 17:58:25 2018
-// Update Count     : 52
+// Last Modified On : Wed Nov  7 16:54:11 2018
+// Update Count     : 62
 // 
 
@@ -41 +41 @@
         for ( 1 ) { sout | "A"; }                                       sout | endl;
         for ( 10 ) { sout | "A"; }                                      sout | endl;
-
         for ( 1 ~= 10 ~ 2 ) { sout | "B"; }                     sout | endl;
         for ( 10 -~= 1 ~ 2 ) { sout | "C"; }            sout | endl;
@@ -52 +51 @@
         for ( i; 0.5 ~ 5.5 ) { sout | i; }                      sout | endl;
         for ( i; 5.5 -~ 0.5 ) { sout | i; }                     sout | endl;
-
         for ( ui; 2u ~= 10u ~ 2u ) { sout | ui; }       sout | endl;
         for ( ui; 10u -~= 2u ~ 2u ) { sout | ui; }      sout | endl | endl | endl;
 
+        enum { N = 10 };
+        for ( N ) { sout | "N"; }                                       sout | endl;
+        for ( i; N ) { sout | i; }                                      sout | endl;
+        for ( i; N -~ 0 ) { sout | i; }                         sout | endl | endl | endl;
+
         const int start = 3, comp = 10, inc = 2;
-        for ( i; start ~ comp ~ inc + 1 ) { sout | i; } sout | endl;
+        for ( i; start ~ comp ~ inc + 1 ) { sout | i; } sout | endl | endl;
 
         sout | endl;