[af0c8da] | 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.c -- test resolvers ability to deal with many variables with the same name and to use the minimum number of casts |
---|
| 8 | // 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 |
---|
[c0b4db0] | 13 | // Last Modified On : Sat Feb 17 11:49:17 2018 |
---|
| 14 | // Update Count : 273 |
---|
[af0c8da] | 15 | // |
---|
| 16 | |
---|
| 17 | #include <fstream> |
---|
[2b9ddf2] | 18 | #include <stdlib> |
---|
[af0c8da] | 19 | |
---|
| 20 | void ?{}( int & c, zero_t ) { c = 0; } |
---|
| 21 | |
---|
| 22 | trait sumable( otype T ) { |
---|
| 23 | void ?{}( T &, zero_t ); // constructor from 0 literal |
---|
| 24 | T ?+?( T, T ); // assortment of additions |
---|
| 25 | T ?+=?( T &, T ); |
---|
| 26 | T ++?( T & ); |
---|
| 27 | T ?++( T & ); |
---|
| 28 | }; // sumable |
---|
| 29 | |
---|
| 30 | forall( otype T | sumable( T ) ) // use trait |
---|
[2b9ddf2] | 31 | T sum( unsigned int size, T a[] ) { |
---|
| 32 | T total = 0; // instantiate T from 0 by calling constructor |
---|
| 33 | for ( unsigned int i = 0; i < size; i += 1 ) |
---|
| 34 | total += a[i]; // select appropriate + |
---|
[af0c8da] | 35 | return total; |
---|
| 36 | } // sum |
---|
| 37 | |
---|
| 38 | // Not in prelude. |
---|
| 39 | unsigned char ?+?( unsigned char t1, unsigned char t2 ) { return (int)t1 + t2; } // cast forces integer addition, otherwise recursion |
---|
| 40 | unsigned char ?+=?( unsigned char & t1, unsigned char t2 ) { t1 = t1 + t2; return t1; } |
---|
| 41 | unsigned char ++?( unsigned char & t ) { t += 1; return t; } |
---|
| 42 | unsigned char ?++( unsigned char & t ) { unsigned char temp = t; t += 1; return temp; } |
---|
| 43 | |
---|
| 44 | // Not in prelude. |
---|
| 45 | void ?{}( unsigned char & c, zero_t ) { c = 0; } |
---|
| 46 | void ?{}( float & f, zero_t ) { f = 0.0; } |
---|
| 47 | void ?{}( double & d, zero_t ) { d = 0.0; } |
---|
| 48 | |
---|
| 49 | int main( void ) { |
---|
| 50 | const int low = 5, High = 15, size = High - low; |
---|
| 51 | |
---|
| 52 | unsigned char s = 0, a[size], v = (char)low; |
---|
| 53 | for ( int i = 0; i < size; i += 1, v += 1 ) { |
---|
| 54 | s += v; |
---|
| 55 | a[i] = v; |
---|
| 56 | } // for |
---|
| 57 | sout | "sum from" | low | "to" | High | "is" |
---|
[2b9ddf2] | 58 | | sum( size, (unsigned char *)a ) | ", check" | (int)s | endl; |
---|
[af0c8da] | 59 | |
---|
| 60 | int s = 0, a[size], v = low; |
---|
| 61 | for ( int i = 0; i < size; i += 1, v += 1 ) { |
---|
| 62 | s += (int)v; |
---|
| 63 | a[i] = (int)v; |
---|
| 64 | } // for |
---|
| 65 | sout | "sum from" | low | "to" | High | "is" |
---|
[2b9ddf2] | 66 | | sum( size, (int *)a ) | ", check" | (int)s | endl; |
---|
[af0c8da] | 67 | |
---|
| 68 | float s = 0.0f, a[size], v = low / 10.0f; |
---|
| 69 | for ( int i = 0; i < size; i += 1, v += 0.1f ) { |
---|
| 70 | s += (float)v; |
---|
| 71 | a[i] = (float)v; |
---|
| 72 | } // for |
---|
| 73 | sout | "sum from" | low / 10.0f | "to" | High / 10.0f | "is" |
---|
[2b9ddf2] | 74 | | sum( size, (float *)a ) | ", check" | (float)s | endl; |
---|
[af0c8da] | 75 | |
---|
| 76 | double s = 0.0, a[size], v = low / 10.0; |
---|
| 77 | for ( int i = 0; i < size; i += 1, v += 0.1 ) { |
---|
| 78 | s += (double)v; |
---|
| 79 | a[i] = (double)v; |
---|
| 80 | } // for |
---|
| 81 | sout | "sum from" | low / 10.0 | "to" | High / 10.0 | "is" |
---|
[2b9ddf2] | 82 | | sum( size, (double *)a ) | ", check" | (double)s | endl; |
---|
[af0c8da] | 83 | |
---|
| 84 | struct S { int i, j; }; |
---|
| 85 | void ?{}( S & s ) { s.[i, j] = 0; } |
---|
[c0b4db0] | 86 | void ?{}( S & s, int i ) { s.[i, j] = [i, 0]; } |
---|
| 87 | void ?{}( S & s, int i, int j ) { s.[i, j] = [i, j]; } |
---|
| 88 | void ?{}( S & s, zero_t ) { s.[i, j] = 0; } |
---|
| 89 | void ?{}( S & s, one_t ) { s.[i, j] = 1; } |
---|
[af0c8da] | 90 | S ?+?( S t1, S t2 ) { return (S){ t1.i + t2.i, t1.j + t2.j }; } |
---|
| 91 | S ?+=?( S & t1, S t2 ) { t1 = t1 + t2; return t1; } |
---|
| 92 | S ++?( S & t ) { t += (S){1}; return t; } |
---|
| 93 | S ?++( S & t ) { S temp = t; t += (S){1}; return temp; } |
---|
[09687aa] | 94 | ofstream & ?|?( ofstream & os, S v ) { return os | v.i | v.j; } |
---|
[af0c8da] | 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" |
---|
[2b9ddf2] | 102 | | sum( size, (S *)a ) | ", check" | (S)s | endl; |
---|
| 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 filed array in generic type |
---|
| 114 | } // for |
---|
| 115 | sout | "sum from" | low | "to" | High | "is" |
---|
| 116 | | sum( size, gs.x ) | ", check" | (int)s | endl; // add filed array in generic type |
---|
[af0c8da] | 117 | } // main |
---|
| 118 | |
---|
| 119 | // Local Variables: // |
---|
| 120 | // tab-width: 4 // |
---|
| 121 | // compile-command: "cfa sum.c" // |
---|
| 122 | // End: // |
---|