Changeset b11fac4 for src/libcfa/rational.c

Timestamp:

Apr 13, 2016, 5:40:32 PM (9 years ago)

Author:

Aaron Moss <a3moss@…>

Branches:

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

Children:

02af22de

Parents:

02ad3f5 (diff), 45161b4d (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent.

Message:

Merge branch 'master' of plg.uwaterloo.ca:software/cfa/cfa-cc

File:

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

src/libcfa/rational.c

@@ -11 +11 @@
 // Created On       : Wed Apr  6 17:54:28 2016
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Fri Apr  8 17:35:05 2016
-// Update Count     : 18
+// Last Modified On : Tue Apr 12 21:26:42 2016
+// Update Count     : 21
 // 
 
@@ -19 +19 @@
 #include "stdlib"
 
-extern "C" {
-#include <stdlib.h>                                                                             // exit
-} // extern
-
 
 // constants
@@ -30 +26 @@
 
 
-// helper
+// helper routines
 
 // 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 ) {
     for ( ;; ) {                                                                                // Euclid's algorithm