source: src/examples/sum.c@ 7528ba1

ADT aaron-thesis arm-eh ast-experimental cleanup-dtors ctor deferred_resn demangler enum forall-pointer-decay gc_noraii jacob/cs343-translation jenkins-sandbox memory new-ast new-ast-unique-expr new-env no_list persistent-indexer pthread-emulation qualifiedEnum resolv-new with_gc
Last change on this file since 7528ba1 was bd85400, checked in by Peter A. Buhr <pabuhr@…>, 10 years ago

remove offsetof keyword, parser 0/1 names as structure fields, update examples to new stdlib, rename algorithms to stdlib, extend stdlib, use correct type for box parameters

  • Property mode set to 100644
File size: 2.6 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.c --
8//
9// Author : Peter A. Buhr
10// Created On : Wed May 27 17:56:53 2015
11// Last Modified By : Peter A. Buhr
12// Last Modified On : Fri Feb 5 16:47:44 2016
13// Update Count : 139
14//
15
16#include <fstream>
17
18context sumable( type T ) {
19 const T 0;
20 T ?+?( T, T );
21 T ?+=?( T *, T );
22 T ++?( T * );
23 T ?++( T * );
24}; // sumable
25
26forall( type T | sumable( T ) )
27T sum( unsigned int n, T a[] ) {
28 T total = 0; // instantiate T, select 0
29 for ( unsigned int i = 0; i < n; i += 1 )
30 total += a[i]; // select +
31 return total;
32} // sum
33
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; }
39
40int main( void ) {
41 const int low = 5, High = 15, size = High - low;
42 ofstream *sout = ofstream_stdout();
43#if 0
44
45 char s = 0, a[size];
46 char v = low;
47 for ( int i = 0; i < size; i += 1, v += 1 ) {
48 s += v;
49 a[i] = v;
50 }
51 sout | "sum from " | low | " to " | High | " is "
52 | (int)sum( size, a ) | ", check " | (int)s | endl;
53
54 int s = 0, a[size];
55 int v = low;
56 for ( int i = 0; i < size; i += 1, v += 1 ) {
57 s += (int)v;
58 a[i] = (int)v;
59 }
60 sout | "sum from " | low | " to " | High | " is "
61 | sum( size, (int *)a ) | ", check " | (int)s | endl;
62
63 float s = 0.0, a[size];
64 float v = low / 10.0;
65 for ( int i = 0; i < size; i += 1, v += 0.1f ) {
66 s += (float)v;
67 a[i] = (float)v;
68 }
69 sout | "sum from " | low / 10.0 | " to " | High / 10.0 | " is "
70 | sum( size, (float *)a ) | ", check " | (float)s | endl;
71#endif
72 double s = 0, a[size];
73 double v = low / 10.0;
74
75 for ( int i = 0; i < size; i += 1, v += 0.1 ) {
76 s += (double)v;
77 a[i] = (double)v;
78 }
79 sout | "sum from " | low / 10.0 | " to " | High / 10.0 | " is "
80 | sum( size, (double *)a ) | ", check " | (double)s | endl;
81
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 );
90} // main
91
92// Local Variables: //
93// tab-width: 4 //
94// compile-command: "cfa sum.c" //
95// End: //
Note: See TracBrowser for help on using the repository browser.