Changeset f621a148 for src/libcfa/rational.c

Timestamp:

May 1, 2017, 12:38:10 PM (7 years ago)

Author:

Peter A. Buhr <pabuhr@…>

Branches:

ADT, aaron-thesis, arm-eh, ast-experimental, cleanup-dtors, deferred_resn, demangler, enum, forall-pointer-decay, jacob/cs343-translation, jenkins-sandbox, master, new-ast, new-ast-unique-expr, new-env, no_list, persistent-indexer, pthread-emulation, qualifiedEnum, resolv-new, with_gc

Children:

13e2c54

Parents:

c07d724

Message:

change to implementation type for rational and add to test suite

File:

• src/libcfa/rational.c (modified) (9 diffs)

src/libcfa/rational.c

@@ -10 +10 @@
 // Created On       : Wed Apr  6 17:54:28 2016
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Sat Jul  9 11:18:04 2016
-// Update Count     : 40
+// Last Modified On : Thu Apr 27 17:05:06 2017
+// Update Count     : 51
 // 
 
@@ -30 +30 @@
 // Calculate greatest common denominator of two numbers, the first of which may be negative. Used to reduce rationals.
 // alternative: https://en.wikipedia.org/wiki/Binary_GCD_algorithm
-static long int gcd( long int a, long int b ) {
+static RationalImpl gcd( RationalImpl a, RationalImpl b ) {
         for ( ;; ) {                                                                            // Euclid's algorithm
-                long int r = a % b;
+                RationalImpl r = a % b;
           if ( r == 0 ) break;
                 a = b;
@@ -40 +40 @@
 } // gcd
 
-static long int simplify( long int *n, long int *d ) {
+static RationalImpl simplify( RationalImpl *n, RationalImpl *d ) {
         if ( *d == 0 ) {
                 serr | "Invalid rational number construction: denominator cannot be equal to 0." | endl;
@@ -56 +56 @@
 } // rational
 
-void ?{}( Rational * r, long int n ) {
+void ?{}( Rational * r, RationalImpl n ) {
         r{ n, 1 };
 } // rational
 
-void ?{}( Rational * r, long int n, long int d ) {
-        long int t = simplify( &n, &d );                                        // simplify
+void ?{}( Rational * r, RationalImpl n, RationalImpl d ) {
+        RationalImpl t = simplify( &n, &d );                            // simplify
         r->numerator = n / t;
         r->denominator = d / t;
@@ -67 +67 @@
 
 
-// getter/setter for numerator/denominator
-
-long int numerator( Rational r ) {
+// getter for numerator/denominator
+
+RationalImpl numerator( Rational r ) {
         return r.numerator;
 } // numerator
 
-long int numerator( Rational r, long int n ) {
-        long int prev = r.numerator;
-        long int t = gcd( abs( n ), r.denominator );            // simplify
+RationalImpl denominator( Rational r ) {
+        return r.denominator;
+} // denominator
+
+[ RationalImpl, RationalImpl ] ?=?( * [ RationalImpl, RationalImpl ] dest, Rational src ) {
+        return *dest = src.[ numerator, denominator ];
+}
+
+// setter for numerator/denominator
+
+RationalImpl numerator( Rational r, RationalImpl n ) {
+        RationalImpl prev = r.numerator;
+        RationalImpl t = gcd( abs( n ), r.denominator );                // simplify
         r.numerator = n / t;
         r.denominator = r.denominator / t;
@@ -81 +91 @@
 } // numerator
 
-long int denominator( Rational r ) {
-        return r.denominator;
-} // denominator
-
-long int denominator( Rational r, long int d ) {
-        long int prev = r.denominator;
-        long int t = simplify( &r.numerator, &d );                      // simplify
+RationalImpl denominator( Rational r, RationalImpl d ) {
+        RationalImpl prev = r.denominator;
+        RationalImpl t = simplify( &r.numerator, &d );                  // simplify
         r.numerator = r.numerator / t;
         r.denominator = d / t;
@@ -170 +176 @@
 
 // http://www.ics.uci.edu/~eppstein/numth/frap.c
-Rational narrow( double f, long int md ) {
+Rational narrow( double f, RationalImpl md ) {
         if ( md <= 1 ) {                                                                        // maximum fractional digits too small?
                 return (Rational){ f, 1};                                               // truncate fraction
@@ -176 +182 @@
 
         // continued fraction coefficients
-        long int m00 = 1, m11 = 1, m01 = 0, m10 = 0;
-        long int ai, t;
+        RationalImpl m00 = 1, m11 = 1, m01 = 0, m10 = 0;
+        RationalImpl ai, t;
 
         // find terms until denom gets too big
         for ( ;; ) {
-                ai = (long int)f;
+                ai = (RationalImpl)f;
           if ( ! (m10 * ai + m11 <= md) ) break;
                 t = m00 * ai + m01;
@@ -202 +208 @@
 forall( dtype istype | istream( istype ) )
 istype * ?|?( istype *is, Rational *r ) {
-        long int t;
+        RationalImpl t;
         is | &(r->numerator) | &(r->denominator);
         t = simplify( &(r->numerator), &(r->denominator) );