Changeset eae8b37 for libcfa/src/rational.cfa

Timestamp:

Dec 4, 2024, 10:17:49 PM (2 weeks ago)

Author:

JiadaL <j82liang@…>

Branches:

master

Children:

fc276f3

Parents:

509ec82

Message:

Move enum.hfa/enum.cfa to prelude

File:

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

libcfa/src/rational.cfa

@@ -21 +21 @@
 
 // Arithmetic, Relational
-
-forall( T | arithmetic( T ) ) {
+forall( T | Simple(T) ) {
         // 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
@@ -44 +42 @@
                 return gcd( abs( n ), d );                                              // simplify
         } // simplify
-
+}
+
+forall( T | arithmetic( T ) ) {
         // constructors
 
@@ -197 +197 @@
 
 forall( T ) {
-        forall( istype & | istream( istype ) | { istype & ?|?( istype &, T & ); } | arithmetic( T ) )
+        forall( istype & | istream( istype ) | { istype & ?|?( istype &, T & ); } | Simple(T) )
         istype & ?|?( istype & is, rational(T) & r ) {
                 is | r.numerator | r.denominator;