# source:tests/sum.cfa

Last change on this file was dd3576b, checked in by Peter A. Buhr <pabuhr@…>, 17 months ago

update from old to new trait syntax using forall

• Property mode set to `100644`
File size: 3.9 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
14// Update Count     : 347
15//
16
17#include <fstream.hfa>
18#include <stdlib.hfa>
19
20forall( T )
21trait sumable {
22        void ?{}( T &, zero_t );                                                        // 0 literal constructor
23        void ?{}( T &, one_t );                                                         // 1 literal constructor
24        T ?+?( T, T );                                                                          // assortment of additions
25        T ?+=?( T &, T );                                                                       // get pre/post ++ with += and one_t
26}; // sumable
27
28forall( T | sumable( T ) )                                                              // use trait
29T sum( size_t size, T a[] ) {
30        T total = 0;                                                                            // initialize by 0 constructor
31        for ( i; size )
32                total += a[i];                                                                  // select appropriate +
34} // sum
35
36int main( void ) {
37        const int low = 5, High = 15, size = High - low;
38
39        signed char s = 0, a[size], v = (char)low;
40        for ( int i = 0; i < size; i += 1, v += 1hh ) {
41                s += v;
42                a[i] = v;
43        } // for
44        sout | "sum from" | low | "to" | High | "is"
45                 | sum( size, (signed char *)a ) | ", check" | (signed char)s;
46
47        unsigned char s = 0, a[size], v = low;
48        for ( int i = 0; i < size; i += 1, v += 1hhu ) {
49                s += (unsigned char)v;
50                a[i] = (unsigned char)v;
51        } // for
52        sout | "sum from" | low | "to" | High | "is"
53                 | sum( size, (unsigned char *)a ) | ", check" | (unsigned char)s;
54
55        short int s = 0, a[size], v = low;
56        for ( int i = 0; i < size; i += 1, v += 1h ) {
57                s += (short int)v;
58                a[i] = (short int)v;
59        } // for
60        sout | "sum from" | low | "to" | High | "is"
61                 | sum( size, (short int *)a ) | ", check" | (short int)s;
62
63        int s = 0, a[size], v = low;
64        for ( int i = 0; i < size; i += 1, v += 1 ) {
65                s += (int)v;
66                a[i] = (int)v;
67        } // for
68        sout | "sum from" | low | "to" | High | "is"
69                 | sum( size, (int *)a ) | ", check" | (int)s;
70
71        float s = 0.0f, a[size], v = low / 10.0f;
72        for ( int i = 0; i < size; i += 1, v += 0.1f ) {
73                s += (float)v;
74                a[i] = (float)v;
75        } // for
76        sout | "sum from" | low / 10.0f | "to" | High / 10.0f | "is"
77                 | sum( size, (float *)a ) | ", check" | (float)s;
78
79        double s = 0.0, a[size], v = low / 10.0;
80        for ( int i = 0; i < size; i += 1, v += 0.1 ) {
81                s += (double)v;
82                a[i] = (double)v;
83        } // for
84        sout | "sum from" | low / 10.0 | "to" | High / 10.0 | "is"
85                 | sum( size, (double *)a ) | ", check" | (double)s;
86
87        struct S { int i, j; };
88        void ?{}( S & s ) { s.[i, j] = 0; }
89        void ?{}( S & s, int i ) { s.[i, j] = [i, 0]; }
90        void ?{}( S & s, int i, int j ) { s.[i, j] = [i, j]; }
91        void ?{}( S & s, zero_t ) { s.[i, j] = 0; }
92        void ?{}( S & s, one_t ) { s.[i, j] = 1; }
93        S ?+?( S t1, S t2 ) { return (S){ t1.i + t2.i, t1.j + t2.j }; }
94        S ?+=?( S & t1, S t2 ) { t1 = t1 + t2; return t1; }
95        ofstream & ?|?( ofstream & os, S v ) { return os | v.i | v.j; }
96        void ?|?( ofstream & os, S v ) { (ofstream &)(os | v); ends( os ); }
97
98        S s = 0, a[size], v = { low, low };
99        for ( int i = 0; i < size; i += 1, v += (S){1} ) {
100                s += (S)v;
101                a[i] = (S)v;
102        } // for
103        sout | "sum from" | low | "to" | High | "is"
104                 | sum( size, (S *)a ) | ", check" | (S)s;
105
106        forall( Impl | sumable( Impl ) )
107        struct GS {
108                Impl * x, * y;
109        };
110        GS(int) gs;
111        // FIX ME, resolution problem with anew not picking up the LH type
112        gs.x = (typeof(gs.x))anew( size );                                      // create array storage for field
113        s = 0; v = low;
114        for ( int i = 0; i < size; i += 1, v += 1 ) {
115                s += (int)v;
116                gs.x[i] = (int)v;                                                               // set field array in generic type
117        } // for
118        sout | "sum from" | low | "to" | High | "is"
119                 | sum( size, gs.x ) | ", check" | (int)s;              // add field array in generic type
120        delete( gs.x );
121} // main
122
123// Local Variables: //
124// tab-width: 4 //
125// compile-command: "cfa sum.cfa" //
126// End: //
Note: See TracBrowser for help on using the repository browser.