source: tests/rational.cfa @ dc8511c

aaron-thesisarm-ehcleanup-dtorsdeferred_resnjacob/cs343-translationjenkins-sandboxnew-astnew-ast-unique-exprno_listpersistent-indexer
Last change on this file since dc8511c was dc8511c, checked in by Peter A. Buhr <pabuhr@…>, 3 years ago

first attempt at updating suffixes for test programs

  • Property mode set to 100644
File size: 2.5 KB
Line 
1//
2// Cforall Version 1.0.0 Copyright (C) 2016 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// rational.cfa -- test rational number package
8//
9// Author           : Peter A. Buhr
10// Created On       : Mon Mar 28 08:43:12 2016
11// Last Modified By : Peter A. Buhr
12// Last Modified On : Tue Nov  6 18:00:27 2018
13// Update Count     : 68
14//
15
16#include <rational.hfa>
17#include <limits.hfa>
18#include <stdlib.hfa>
19#include <fstream.hfa>
20
21// UNNECESSARY, FIX ME
22void ?{}( int & this ) { this = 0; }
23void ?{}( int & this, zero_t ) { this = 0; }
24void ?{}( int & this, one_t ) { this = 1; }
25double convert( int i ) { return (double)i; }
26int convert( double d ) { return (int)d; }
27
28int main() {
29        sout | "constructor" | endl;
30        Rational(int) a = { 3 }, b = { 4 }, c;
31        sout | a | b | c | endl;
32
33        a = (Rational(int)){ 4, 8 };
34        b = (Rational(int)){ 5, 7 };
35        sout | a | b | endl;
36        a = (Rational(int)){ -2, -3 };
37        b = (Rational(int)){ 3, -2 };
38        sout | a | b | endl;
39        a = (Rational(int)){ -2, 3 };
40        b = (Rational(int)){ 3, 2 };
41        sout | a | b | endl;
42
43        sout | "logical" | endl;
44        a = (Rational(int)){ -2 };
45        b = (Rational(int)){ -3, 2 };
46        sout | a | b | endl;
47//      sout | a == 1 | endl; // FIX ME
48        sout | a != b | endl;
49        sout | a <  b | endl;
50        sout | a <= b | endl;
51        sout | a >  b | endl;
52        sout | a >= b | endl;
53
54        sout | "arithmetic" | endl;
55        sout | a | b | endl;
56        sout | a + b | endl;
57        sout | a - b | endl;
58        sout | a * b | endl;
59        sout | a / b | endl;
60
61        sout | "conversion" | endl;
62        a = (Rational(int)){ 3, 4 };
63        sout | widen( a ) | endl;
64        a = (Rational(int)){ 1, 7 };
65        sout | widen( a ) | endl;
66        a = (Rational(int)){ 355, 113 };
67        sout | widen( a ) | endl;
68        sout | narrow( 0.75, 4 ) | endl;
69        sout | narrow( 0.14285714285714, 16 ) | endl;
70        sout | narrow( 3.14159265358979, 256 ) | endl;
71
72        sout | "decompose" | endl;
73        int n, d;
74//      [n, d] = a;
75//      sout | a | n | d | endl;
76
77        sout | "more tests" | endl;
78        Rational(int) x = { 1, 2 }, y = { 2 };
79        sout | x - y | endl;
80        sout | x > y | endl;
81        sout | x | numerator( x, 2 ) | x | endl;
82        sout | y | denominator( y, -2 ) | y | endl;
83
84        Rational(int) z = { 0, 5 };
85        sout | z | endl;
86
87        sout | x | numerator( x, 0 ) | x | endl;
88
89        x = (Rational(int)){ 1, MAX } + (Rational(int)){ 1, MAX };
90        sout | x | endl;
91        x = (Rational(int)){ 3, MAX } + (Rational(int)){ 2, MAX };
92        sout | x | endl;
93
94        sin | a | b;
95        sout | a | b | endl;
96} // main
97
98// Local Variables: //
99// tab-width: 4 //
100// compile-command: "cfa rational.cfa" //
101// End: //
Note: See TracBrowser for help on using the repository browser.