Changeset 52f85e0 for src/examples/sum.c
- Timestamp:
- Feb 10, 2016, 3:57:00 PM (8 years ago)
- Branches:
- ADT, aaron-thesis, arm-eh, ast-experimental, cleanup-dtors, ctor, deferred_resn, demangler, enum, forall-pointer-decay, gc_noraii, jacob/cs343-translation, jenkins-sandbox, master, memory, new-ast, new-ast-unique-expr, new-env, no_list, persistent-indexer, pthread-emulation, qualifiedEnum, resolv-new, string, with_gc
- Children:
- 6ba0659, cce7872
- Parents:
- bd85400
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/examples/sum.c
rbd85400 r52f85e0 10 10 // Created On : Wed May 27 17:56:53 2015 11 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : Fri Feb 5 16:47:44201613 // Update Count : 1 3912 // Last Modified On : Sat Feb 6 11:57:42 2016 13 // Update Count : 182 14 14 // 15 15 … … 33 33 34 34 // Required to satisfy sumable as char does not have addition. 35 // const char 0; 36 // char ?+?( char op1, char op2 ) { return (int)op1 + op2; } // cast forces integer addition or recursion 37 // char ++?( char *op ) { *op += 1; return *op; } 38 // char ?++( char *op ) { char temp = *op; *op += 1; return temp; } 35 const char 0; 36 char ?+?( char t1, char t2 ) { return (int)t1 + t2; } // cast forces integer addition, otherwise recursion 37 char ?+=?( char *t1, char t2 ) { *t1 = *t1 + t2; return *t1; } 38 char ++?( char *t ) { *t += 1; return *t; } 39 char ?++( char *t ) { char temp = *t; *t += 1; return temp; } 39 40 40 41 int main( void ) { 41 42 const int low = 5, High = 15, size = High - low; 42 43 ofstream *sout = ofstream_stdout(); 43 #if 044 44 45 char s = 0, a[size]; 46 char v = low; 45 char s = 0, a[size], v = low; 47 46 for ( int i = 0; i < size; i += 1, v += 1 ) { 48 47 s += v; 49 48 a[i] = v; 50 } 49 } // for 51 50 sout | "sum from " | low | " to " | High | " is " 52 51 | (int)sum( size, a ) | ", check " | (int)s | endl; 53 52 54 int s = 0, a[size]; 55 int v = low; 53 int s = 0, a[size], v = low; 56 54 for ( int i = 0; i < size; i += 1, v += 1 ) { 57 55 s += (int)v; 58 56 a[i] = (int)v; 59 } 57 } // for 60 58 sout | "sum from " | low | " to " | High | " is " 61 59 | sum( size, (int *)a ) | ", check " | (int)s | endl; 62 60 63 float s = 0.0, a[size]; 64 float v = low / 10.0; 61 float s = 0.0, a[size], v = low / 10.0; 65 62 for ( int i = 0; i < size; i += 1, v += 0.1f ) { 66 63 s += (float)v; 67 64 a[i] = (float)v; 68 } 65 } // for 69 66 sout | "sum from " | low / 10.0 | " to " | High / 10.0 | " is " 70 67 | sum( size, (float *)a ) | ", check " | (float)s | endl; 71 #endif72 double s = 0, a[size];73 double v = low / 10.0;74 68 69 double s = 0, a[size], v = low / 10.0; 75 70 for ( int i = 0; i < size; i += 1, v += 0.1 ) { 76 71 s += (double)v; 77 72 a[i] = (double)v; 78 } 73 } // for 79 74 sout | "sum from " | low / 10.0 | " to " | High / 10.0 | " is " 80 75 | sum( size, (double *)a ) | ", check " | (double)s | endl; 81 76 82 // struct S { int i, j; } sarr[size]; 83 // struct S 0 = { 0, 0 }; 84 // struct S 1 = { 1, 1 }; 85 // S ?+?( S t1, S t2 ) { S s = { t1.i + t1.j, t2.i + t2.j }; return s; } 86 // S ?+=?( S *t1, S t2 ) { *t1 = *t1 + t2; return *t1; } 87 // S ++?( S *t ) { *t += 1; return *t; } 88 // S ?++( S *t ) { S temp = *t; *t += 1; return temp; } 89 // sum( size, sarr ); 77 struct S { int i, j; } 0 = { 0, 0 }, 1 = { 1, 1 }; 78 S ?+?( S t1, S t2 ) { S s = { t1.i + t2.i, t1.j + t2.j }; return s; } 79 S ?+=?( S *t1, S t2 ) { *t1 = *t1 + t2; return *t1; } 80 S ++?( S *t ) { *t += 1; return *t; } 81 S ?++( S *t ) { S temp = *t; *t += 1; return temp; } 82 ofstream * ?|?( ofstream * os, S v ) { return os | v.i | ' ' | v.j; } 83 84 S s = 0, a[size], v = { low, low }; 85 for ( int i = 0; i < size; i += 1, v += (S)1 ) { 86 s += (S)v; 87 a[i] = (S)v; 88 } // for 89 sout | "sum from " | low | " to " | High | " is " 90 | sum( size, (S *)a ) | ", check " | (S)s | endl; 90 91 } // main 91 92
Note: See TracChangeset
for help on using the changeset viewer.