source: tests/loopctrl.cfa @ 25cdca5

aaron-thesisarm-ehcleanup-dtorsdeferred_resnjacob/cs343-translationjenkins-sandboxnew-astnew-ast-unique-exprno_listpersistent-indexer
Last change on this file since 25cdca5 was ef346f7c, checked in by Peter A. Buhr <pabuhr@…>, 3 years ago

fix ostype

  • Property mode set to 100644
File size: 3.3 KB
Line 
1//
2// Cforall Version 1.0.0 Copyright (C) 2015 University of Waterloo
3//
4// The contents of this file are covered under the licence agreement in the
5// file "LICENCE" distributed with Cforall.
6//
7// loopctrl.cfa --
8//
9// Author           : Peter A. Buhr
10// Created On       : Wed Aug  8 18:32:59 2018
11// Last Modified By : Peter A. Buhr
12// Last Modified On : Sun Dec 23 23:00:29 2018
13// Update Count     : 79
14//
15
16#include <fstream.hfa>
17
18struct S { int i, j; };
19void ?{}( S & s ) { s.[i, j] = 0; }
20void ?{}( S & s, int i ) { s.[i, j] = [i, 0]; }
21void ?{}( S & s, int i, int j ) { s.[i, j] = [i, j]; }
22void ?{}( S & s, zero_t ) { s.[i, j] = 0; }
23void ?{}( S & s, one_t ) { s.[i, j] = 1; }
24int ?<?( S t1, S t2 ) { return t1.i < t2.i && t1.j < t2.j; }
25int ?<=?( S t1, S t2 ) { return t1.i <= t2.i && t1.j <= t2.j; }
26int ?>?( S t1, S t2 ) { return t1.i > t2.i && t1.j > t2.j; }
27int ?>=?( S t1, S t2 ) { return t1.i >= t2.i && t1.j >= t2.j; }
28S ?=?( S & t1, S t2 ) { t1.i = t2.i; t1.j = t2.j; return t1; }
29S ?+=?( S & t1, S t2 ) { t1.i += t2.i; t1.j += t2.j; return t1; }
30S ?+=?( S & t, one_t ) { t.i += 1; t.j += 1; return t; }
31S ?-=?( S & t1, S t2 ) { t1.i -= t2.i; t1.j -= t2.j; return t1; }
32S ?-=?( S & t, one_t ) { t.i -= 1; t.j -= 1; return t; }
33ofstream & ?|?( ofstream & os, S v ) { return os | '(' | v.i | v.j | ')'; }
34void & ?|?( ofstream & os, S v ) { (ofstream &)(os | v); nl( os ); }
35
36int main() {
37        sout | nlOff;                                                                           // turn off auto newline
38        while () { sout | "empty"; break; }                                     sout | nl;
39        do { sout | "empty"; break; } while ();                         sout | nl;
40        for () { sout | "empty"; break; }                                       sout | nl | nl;
41
42        for ( 0 ) { sout | "A"; }                                                       sout | "zero" | nl;
43        for ( 1 ) { sout | "A"; }                                                       sout | nl;
44        for ( 10 ) { sout | "A"; }                                                      sout | nl;
45        for ( 1 ~= 10 ~ 2 ) { sout | "B"; }                                     sout | nl;
46        for ( 10 -~= 1 ~ 2 ) { sout | "C"; }                            sout | nl;
47        for ( 0.5 ~ 5.5 ) { sout | "D"; }                                       sout | nl;
48        for ( 5.5 -~ 0.5 ) { sout | "E"; }                                      sout | nl | nl;
49
50        for ( i; 10 ) { sout | i; }                                                     sout | nl;
51        for ( i; 1 ~= 10 ~ 2 ) { sout | i; }                            sout | nl;
52        for ( i; 10 -~= 1 ~ 2 ) { sout | i; }                           sout | nl;
53        for ( i; 0.5 ~ 5.5 ) { sout | i; }                                      sout | nl;
54        for ( i; 5.5 -~ 0.5 ) { sout | i; }                                     sout | nl;
55        for ( ui; 2u ~= 10u ~ 2u ) { sout | ui; }                       sout | nl;
56        for ( ui; 10u -~= 2u ~ 2u ) { sout | ui; }                      sout | nl | nl | nl;
57
58        enum { N = 10 };
59        for ( N ) { sout | "N"; }                                                       sout | nl;
60        for ( i; N ) { sout | i; }                                                      sout | nl;
61        for ( i; N -~ 0 ) { sout | i; }                                         sout | nl | nl | nl;
62
63        const int start = 3, comp = 10, inc = 2;
64        for ( i; start ~ comp ~ inc + 1 ) { sout | i; }         sout | nl | nl;
65
66        sout | nl;
67        for ( S s = (S){0}; s < (S){10,10}; s += (S){1} ) { sout | s; } sout | nl;
68        for ( s; (S){10,10} ) { sout | s; } sout | nl;
69        sout | nl;
70        for ( s; (S){0} ~ (S){10,10} ) { sout | s; }             sout | nl;
71        for ( s; (S){0} ~ (S){10,10} ~ (S){1} ) { sout | s; } sout | nl;
72        for ( s; (S){0} ~= (S){10,10} ) { sout | s; }            sout | nl;
73        for ( s; (S){0} ~= (S){10,10} ~ (S){1} ) { sout | s; } sout | nl;
74        sout | nl;
75        for ( s; (S){10,10} -~ (S){0} ) { sout | s; }            sout | nl;
76        for ( s; (S){10,10} -~ (S){0} ~ (S){1} ) { sout | s; } sout | nl;
77        for ( s; (S){10,10} -~= (S){0} ) { sout | s; }           sout | nl;
78        for ( s; (S){10,10} -~= (S){0} ~ (S){1} ) { sout | s; } sout | nl;
79}
80
81// Local Variables: //
82// tab-width: 4 //
83// compile-command: "cfa loopctrl.cfa" //
84// End: //
Note: See TracBrowser for help on using the repository browser.