source: src/examples/sum.c@ bed4d37c

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 string with_gc
Last change on this file since bed4d37c was 52f85e0, checked in by Peter A. Buhr <pabuhr@…>, 10 years ago

syslib updates and examples, formatting, make double 0 work

  • Property mode set to 100644
File size: 2.8 KB
RevLine 
[86bd7c1f]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//
[097e2b0]9// Author : Peter A. Buhr
[86bd7c1f]10// Created On : Wed May 27 17:56:53 2015
11// Last Modified By : Peter A. Buhr
[52f85e0]12// Last Modified On : Sat Feb 6 11:57:42 2016
13// Update Count : 182
[86bd7c1f]14//
15
[d3b7937]16#include <fstream>
[a0d9f94]17
18context sumable( type T ) {
[86bd7c1f]19 const T 0;
20 T ?+?( T, T );
21 T ?+=?( T *, T );
[097e2b0]22 T ++?( T * );
23 T ?++( T * );
[d3b7937]24}; // sumable
[a0d9f94]25
26forall( type T | sumable( T ) )
[097e2b0]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 +
[86bd7c1f]31 return total;
[d3b7937]32} // sum
[a0d9f94]33
[bdd516a]34// Required to satisfy sumable as char does not have addition.
[52f85e0]35const char 0;
36char ?+?( char t1, char t2 ) { return (int)t1 + t2; } // cast forces integer addition, otherwise recursion
37char ?+=?( char *t1, char t2 ) { *t1 = *t1 + t2; return *t1; }
38char ++?( char *t ) { *t += 1; return *t; }
39char ?++( char *t ) { char temp = *t; *t += 1; return temp; }
[bdd516a]40
[784deab]41int main( void ) {
[6e7e2b36]42 const int low = 5, High = 15, size = High - low;
[097e2b0]43 ofstream *sout = ofstream_stdout();
44
[52f85e0]45 char s = 0, a[size], v = low;
[6e7e2b36]46 for ( int i = 0; i < size; i += 1, v += 1 ) {
[097e2b0]47 s += v;
48 a[i] = v;
[52f85e0]49 } // for
[784deab]50 sout | "sum from " | low | " to " | High | " is "
51 | (int)sum( size, a ) | ", check " | (int)s | endl;
[86bd7c1f]52
[52f85e0]53 int s = 0, a[size], v = low;
[097e2b0]54 for ( int i = 0; i < size; i += 1, v += 1 ) {
55 s += (int)v;
56 a[i] = (int)v;
[52f85e0]57 } // for
[784deab]58 sout | "sum from " | low | " to " | High | " is "
59 | sum( size, (int *)a ) | ", check " | (int)s | endl;
[86bd7c1f]60
[52f85e0]61 float s = 0.0, a[size], v = low / 10.0;
[097e2b0]62 for ( int i = 0; i < size; i += 1, v += 0.1f ) {
63 s += (float)v;
64 a[i] = (float)v;
[52f85e0]65 } // for
[784deab]66 sout | "sum from " | low / 10.0 | " to " | High / 10.0 | " is "
67 | sum( size, (float *)a ) | ", check " | (float)s | endl;
[bd85400]68
[52f85e0]69 double s = 0, a[size], v = low / 10.0;
[d3b7937]70 for ( int i = 0; i < size; i += 1, v += 0.1 ) {
71 s += (double)v;
72 a[i] = (double)v;
[52f85e0]73 } // for
[d3b7937]74 sout | "sum from " | low / 10.0 | " to " | High / 10.0 | " is "
75 | sum( size, (double *)a ) | ", check " | (double)s | endl;
[bd85400]76
[52f85e0]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;
[d3b7937]91} // main
[42dcae7]92
93// Local Variables: //
[86bd7c1f]94// tab-width: 4 //
[d3b7937]95// compile-command: "cfa sum.c" //
[42dcae7]96// End: //
Note: See TracBrowser for help on using the repository browser.