source: tests/rational.cfa @ f498c51

ADTaaron-thesisarm-ehast-experimentalcleanup-dtorsdeferred_resnenumforall-pointer-decayjacob/cs343-translationjenkins-sandboxnew-astnew-ast-unique-exprno_listpersistent-indexerpthread-emulationqualifiedEnum
Last change on this file since f498c51 was 200fcb3, checked in by Peter A. Buhr <pabuhr@…>, 5 years ago

add auto newline to sout, change endl to nl

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