source: tests/sum.cfa @ 0e66857

aaron-thesisarm-ehcleanup-dtorsjacob/cs343-translationjenkins-sandboxnew-astnew-ast-unique-exprpersistent-indexer
Last change on this file since 0e66857 was 0e66857, checked in by Peter A. Buhr <pabuhr@…>, 3 years ago

formatting

  • Property mode set to 100644
File size: 4.0 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// sum.cfa -- test resolvers ability to deal with many variables with the same name and to use the minimum number of
8//    casts necessary to disambiguate overloaded variable names.
9//
10// Author           : Peter A. Buhr
11// Created On       : Wed May 27 17:56:53 2015
12// Last Modified By : Peter A. Buhr
13// Last Modified On : Sat Feb  9 15:38:48 2019
14// Update Count     : 293
15//
16
17#include <fstream.hfa>
18#include <stdlib.hfa>
19
20trait sumable( otype T ) {
21        void ?{}( T &, zero_t );                                                        // 0 literal constructor
22        T ?+?( T, T );                                                                          // assortment of additions
23        T ?+=?( T &, T );
24        T ++?( T & );
25        T ?++( T & );
26}; // sumable
27
28forall( otype T | sumable( T ) )                                                // use trait
29T sum( size_t size, T a[] ) {
30        T total = 0;                                                                            // initialize by 0 constructor
31        for ( size_t i = 0; i < size; i += 1 )
32                total += a[i];                                                                  // select appropriate +
33        return total;
34} // sum
35
36// Not in prelude.
37unsigned char ?+?( unsigned char t1, unsigned char t2 ) { return (int)t1 + t2; } // cast forces integer addition, otherwise recursion
38unsigned char ?+=?( unsigned char & t1, unsigned char t2 ) { t1 = t1 + t2; return t1; }
39unsigned char ++?( unsigned char & t ) { t += 1; return t; }
40unsigned char ?++( unsigned char & t ) { unsigned char temp = t; t += 1; return temp; }
41
42// Not in prelude.
43void ?{}( unsigned char & c, zero_t ) { c = 0; }
44void ?{}( int & i, zero_t ) { i = 0; }
45void ?{}( float & f, zero_t ) { f = 0.0; }
46void ?{}( double & d, zero_t ) { d = 0.0; }
47
48int main( void ) {
49        const int low = 5, High = 15, size = High - low;
50
51        unsigned char s = 0, a[size], v = (char)low;
52        for ( int i = 0; i < size; i += 1, v += 1 ) {
53                s += v;
54                a[i] = v;
55        } // for
56        sout | "sum from" | low | "to" | High | "is"
57                 | sum( size, (unsigned char *)a ) | ", check" | (int)s;
58
59        int s = 0, a[size], v = low;
60        for ( int i = 0; i < size; i += 1, v += 1 ) {
61                s += (int)v;
62                a[i] = (int)v;
63        } // for
64        sout | "sum from" | low | "to" | High | "is"
65                 | sum( size, (int *)a ) | ", check" | (int)s;
66
67        float s = 0.0f, a[size], v = low / 10.0f;
68        for ( int i = 0; i < size; i += 1, v += 0.1f ) {
69                s += (float)v;
70                a[i] = (float)v;
71        } // for
72        sout | "sum from" | low / 10.0f | "to" | High / 10.0f | "is"
73                 | sum( size, (float *)a ) | ", check" | (float)s;
74
75        double s = 0.0, a[size], v = low / 10.0;
76        for ( int i = 0; i < size; i += 1, v += 0.1 ) {
77                s += (double)v;
78                a[i] = (double)v;
79        } // for
80        sout | "sum from" | low / 10.0 | "to" | High / 10.0 | "is"
81                 | sum( size, (double *)a ) | ", check" | (double)s;
82
83        struct S { int i, j; };
84        void ?{}( S & s ) { s.[i, j] = 0; }
85        void ?{}( S & s, int i ) { s.[i, j] = [i, 0]; }
86        void ?{}( S & s, int i, int j ) { s.[i, j] = [i, j]; }
87        void ?{}( S & s, zero_t ) { s.[i, j] = 0; }
88        void ?{}( S & s, one_t ) { s.[i, j] = 1; }
89        S ?+?( S t1, S t2 ) { return (S){ t1.i + t2.i, t1.j + t2.j }; }
90        S ?+=?( S & t1, S t2 ) { t1 = t1 + t2; return t1; }
91        S ++?( S & t ) { t += (S){1}; return t; }
92        S ?++( S & t ) { S temp = t; t += (S){1}; return temp; }
93        ofstream & ?|?( ofstream & os, S v ) { return os | v.i | v.j; }
94        void ?|?( ofstream & os, S v ) { (ofstream &)(os | v); nl( os ); }
95
96        S s = (S){0}, a[size], v = { low, low };
97        for ( int i = 0; i < size; i += 1, v += (S){1} ) {
98                s += (S)v;
99                a[i] = (S)v;
100        } // for
101        sout | "sum from" | low | "to" | High | "is"
102                 | sum( size, (S *)a ) | ", check" | (S)s;
103
104        forall( otype Impl | sumable( Impl ) )
105        struct GS {
106                Impl * x, * y;
107        };
108        GS(int) gs;
109        gs.x = anew( size );                                                            // create array storage for field
110        s = 0; v = low;
111        for ( int i = 0; i < size; i += 1, v += 1 ) {
112                s += (int)v;
113                gs.x[i] = (int)v;                                                               // set field array in generic type
114        } // for
115        sout | "sum from" | low | "to" | High | "is"
116                 | sum( size, gs.x ) | ", check" | (int)s;              // add field array in generic type
117        delete( gs.x );
118} // main
119
120// Local Variables: //
121// tab-width: 4 //
122// compile-command: "cfa sum.cfa" //
123// End: //
Note: See TracBrowser for help on using the repository browser.