source: tests/ctrl-flow/loop_else.cfa@ a0c746df

ADT ast-experimental
Last change on this file since a0c746df was 1fb09eff, checked in by Andrew Beach <ajbeach@…>, 3 years ago

Grouped some control flow tests together.

  • Property mode set to 100644
File size: 5.5 KB
Line 
1#include <fstream.hfa>
2
3struct S { int i, j; };
4void ?{}( S & s ) { s.[i, j] = 0; }
5void ?{}( S & s, int i ) { s.[i, j] = [i, 0]; }
6void ?{}( S & s, int i, int j ) { s.[i, j] = [i, j]; }
7void ?{}( S & s, zero_t ) { s.[i, j] = 0; }
8void ?{}( S & s, one_t ) { s.[i, j] = 1; }
9int ?<?( S t1, S t2 ) { return t1.i < t2.i && t1.j < t2.j; }
10int ?<=?( S t1, S t2 ) { return t1.i <= t2.i && t1.j <= t2.j; }
11int ?>?( S t1, S t2 ) { return t1.i > t2.i && t1.j > t2.j; }
12int ?>=?( S t1, S t2 ) { return t1.i >= t2.i && t1.j >= t2.j; }
13S ?=?( S & t1, S t2 ) { t1.i = t2.i; t1.j = t2.j; return t1; }
14S ?+=?( S & t1, S t2 ) { t1.i += t2.i; t1.j += t2.j; return t1; }
15S ?+=?( S & t, one_t ) { t.i += 1; t.j += 1; return t; }
16S ?-=?( S & t1, S t2 ) { t1.i -= t2.i; t1.j -= t2.j; return t1; }
17S ?-=?( S & t, one_t ) { t.i -= 1; t.j -= 1; return t; }
18ofstream & ?|?( ofstream & os, S v ) { return os | '(' | v.i | v.j | ')'; }
19void & ?|?( ofstream & os, S v ) { (ofstream &)(os | v); ends( os ); }
20
21int main() {
22 // Test some loop options.
23
24 sout | nlOff; // turn off auto newline
25 while () { sout | "empty"; break; } else { sout | "else"; } sout | nl;
26 do { sout | "empty"; break; } while () else { sout | "else"; } sout | nl;
27 for () { sout | "empty"; break; } else { sout | "else"; } sout | nl | nl;
28
29 do { sout | "false"; } while (false) else { sout | "else"; } sout | nl | nl;
30
31 for ( 0 ) { sout | "A"; } else { sout | "else"; } sout | "zero" | nl;
32 for ( 1 ) { sout | "A"; } else { sout | "else"; } sout | nl;
33 for ( 10 ) { sout | "A"; } else { sout | "else"; } sout | nl;
34 for ( ~= 10 ) { sout | "A"; } else { sout | "else"; } sout | nl;
35 for ( 1 ~= 10 ~ 2 ) { sout | "B"; } else { sout | "else"; } sout | nl;
36 for ( 1 -~= 10 ~ 2 ) { sout | "C"; } else { sout | "else"; } sout | nl;
37 for ( 0.5 ~ 5.5 ) { sout | "D"; } else { sout | "else"; } sout | nl;
38 for ( 0.5 -~ 5.5 ) { sout | "E"; } else { sout | "else"; } sout | nl | nl;
39
40 for ( i; 10 ) { sout | i; } else { sout | "else"; } sout | nl;
41 for ( i; ~= 10 ) { sout | i; } else { sout | "else"; } sout | nl;
42 for ( i; 1 ~= 10 ~ 2 ) { sout | i; } else { sout | "else"; } sout | nl;
43 for ( i; 1 -~= 10 ~ 2 ) { sout | i; } else { sout | "else"; } sout | nl;
44 for ( i; 0.5 ~ 5.5 ) { sout | i; } else { sout | "else"; } sout | nl;
45 for ( i; 0.5 -~ 5.5 ) { sout | i; } else { sout | "else"; } sout | nl;
46 for ( ui; 2u ~= 10u ~ 2u ) { sout | ui; } else { sout | "else"; } sout | nl;
47 for ( ui; 2u -~= 10u ~ 2u ) { sout | ui; } else { sout | "else"; } sout | nl | nl;
48
49 // @ means do nothing
50 for ( i; 1 ~ @ ) {
51 if ( i > 10 ) break;
52 sout | i;
53 } else { sout | "else"; } sout | nl;
54 for ( i; @ -~ 10 ) {
55 if ( i < 0 ) break;
56 sout | i;
57 } else { sout | "else"; } sout | nl;
58 for ( i; 2 ~ @ ~ 2 ) {
59 if ( i > 10 ) break;
60 sout | i;
61 } else { sout | "else"; } sout | nl;
62 for ( i; 2.1 ~ @ ~ @ ) {
63 if ( i > 10.5 ) break;
64 sout | i;
65 i += 1.7;
66 } else { sout | "else"; } sout | nl;
67 for ( i; @ -~ 10 ~ 2 ) {
68 if ( i < 0 ) break;
69 sout | i;
70 } else { sout | "else"; } sout | nl;
71 for ( i; 12.1 ~ @ ~ @ ) {
72 if ( i < 2.5 ) break;
73 sout | i;
74 i -= 1.7;
75 } else { sout | "else"; } sout | nl | nl;
76
77 enum { N = 10 };
78 for ( N ) { sout | "N"; } else { sout | "else"; } sout | nl;
79 for ( i; N ) { sout | i; } else { sout | "else"; } sout | nl;
80 for ( i; ~= N ) { sout | i; } else { sout | "else"; } sout | nl;
81 for ( i; -~= N ) { sout | i; } else { sout | "else"; } sout | nl | nl;
82
83 const int start = 3, comp = 10, inc = 2;
84 for ( i; start ~ comp ~ inc + 1 ) { sout | i; } else { sout | "else"; } sout | nl | nl;
85
86 for ( i; 10 : j; -5 ~ @ ) { sout | i | j; } else { sout | "else"; } sout | nl;
87 for ( i; 10 : j; @ -~ -5 ) { sout | i | j; } else { sout | "else"; } sout | nl;
88 for ( i; 10 : j; -5 ~ @ ~ 2 ) { sout | i | j; } else { sout | "else"; } sout | nl;
89 for ( i; 10 : j; @ -~ -5 ~ 2 ) { sout | i | j; } else { sout | "else"; } sout | nl | nl;
90
91 for ( j; -5 ~ @ : i; 10 ) { sout | i | j; } else { sout | "else"; } sout | nl;
92 for ( j; @ -~ -5 : i; 10 ) { sout | i | j; } else { sout | "else"; } sout | nl;
93 for ( j; -5 ~ @ ~ 2 : i; 10 ) { sout | i | j; } else { sout | "else"; } sout | nl;
94 for ( j; @ -~ -5 ~ 2 : i; 10 ) { sout | i | j; } else { sout | "else"; } sout | nl | nl;
95
96 for ( j; @ -~ -5 ~ 2 : i; 10 : k; 1.5 ~ @ ) { sout | i | j | k; } else { sout | "else"; } sout | nl;
97 for ( j; @ -~ -5 ~ 2 : k; 1.5 ~ @ : i; 10 ) { sout | i | j | k; } else { sout | "else"; } sout | nl;
98 for ( k; 1.5 ~ @ : j; @ -~ -5 ~ 2 : i; 10 ) { sout | i | j | k; } else { sout | "else"; } sout | nl;
99
100 for ( S s = (S){0}; s < (S){10,10}; s += (S){1} ) { sout | s; } else { sout | "else"; } sout | nl;
101 for ( s; (S){10,10} ) { sout | s; } else { sout | "else"; } sout | nl;
102 sout | nl;
103 for ( s; (S){0} ~ (S){10,10} ) { sout | s; } else { sout | "else"; } sout | nl;
104 for ( s; (S){0} ~ (S){10,10} ~ (S){1} ) { sout | s; } else { sout | "else"; } sout | nl;
105 for ( s; (S){0} ~= (S){10,10} ) { sout | s; } else { sout | "else"; } sout | nl;
106 for ( s; (S){0} ~= (S){10,10} ~ (S){1} ) { sout | s; } else { sout | "else"; } sout | nl;
107 sout | nl;
108 for ( s; (S){0} -~ (S){10,10} ) { sout | s; } else { sout | "else"; } sout | nl;
109 for ( s; (S){0} -~ (S){10,10} ~ (S){1} ) { sout | s; } else { sout | "else"; } sout | nl;
110 for ( s; (S){0} -~= (S){10,10} ) { sout | s; } else { sout | "else"; } sout | nl;
111 for ( s; (S){0} -~= (S){10,10} ~ (S){1} ) { sout | s; } else { sout | "else"; } sout | nl | nl;
112}
Note: See TracBrowser for help on using the repository browser.