Changeset 6a93e4d

Timestamp:

Jun 6, 2023, 8:39:07 AM (11 months ago)

Author:

Peter A. Buhr <pabuhr@…>

Branches:

ast-experimental, master

Children:

541dbc09

Parents:

874b16e

Message:

make trait names not, equality, relational, additive, inc_dec, multiplicative, arithmetic, lower-case

Location:

libcfa/src

Files:

• math.trait.hfa (modified) (4 diffs)
• parseconfig.cfa (modified) (4 diffs)
• parseconfig.hfa (modified) (1 diff)

libcfa/src/math.trait.hfa

@@ -10 +10 @@
 // Created On       : Fri Jul 16 15:40:52 2021
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Thu Feb  2 11:36:56 2023
-// Update Count     : 20
+// Last Modified On : Tue Jun  6 07:59:17 2023
+// Update Count     : 24
 // 
 
@@ -17 +17 @@
 
 forall( U )
-trait Not {
+trait not {
         void ?{}( U &, zero_t );
         int !?( U );
-}; // Not
+}; // not
 
-forall( T | Not( T ) )
-trait Equality {
+forall( T | not( T ) )
+trait equality {
         int ?==?( T, T );
         int ?!=?( T, T );
-}; // Equality
+}; // equality
 
-forall( U | Equality( U ) )
-trait Relational {
+forall( U | equality( U ) )
+trait relational {
         int ?<?( U, U );
         int ?<=?( U, U );
         int ?>?( U, U );
         int ?>=?( U, U );
-}; // Relational
+}; // relational
 
 forall ( T )
-trait Signed {
+trait Signed {  // must be capitalized, conflict with keyword signed
         T +?( T );
         T -?( T );
@@ -44 +44 @@
 
 forall( U | Signed( U ) )
-trait Additive {
+trait additive {
         U ?+?( U, U );
         U ?-?( U, U );
         U ?+=?( U &, U );
         U ?-=?( U &, U );
-}; // Additive
+}; // additive
 
-forall( T | Additive( T ) )
-trait Incdec {
+forall( T | additive( T ) )
+trait inc_dec {
         void ?{}( T &, one_t );
         // T ?++( T & );
@@ -58 +58 @@
         // T ?--( T & );
         // T --?( T & );
-}; // Incdec
+}; // inc_dec
 
-forall( U | Incdec( U ) )
-trait Multiplicative {
+forall( U | inc_dec( U ) )
+trait multiplicative {
         U ?*?( U, U );
         U ?/?( U, U );
         U ?%?( U, U );
         U ?/=?( U &, U );
-}; // Multiplicative
+}; // multiplicative
 
-forall( T | Relational( T ) | Multiplicative( T ) )
-trait Arithmetic {
-}; // Arithmetic
+forall( T | relational( T ) | multiplicative( T ) )
+trait arithmetic {
+}; // arithmetic
 
 // Local Variables: //

libcfa/src/parseconfig.cfa

@@ -203 +203 @@
 
 
-forall(T | Relational( T ))
+forall(T | relational( T ))
 [ bool ] is_nonnegative( & T value ) {
         T zero_val = 0;
@@ -209 +209 @@
 }
 
-forall(T | Relational( T ))
+forall(T | relational( T ))
 [ bool ] is_positive( & T value ) {
         T zero_val = 0;
@@ -215 +215 @@
 }
 
-forall(T | Relational( T ))
+forall(T | relational( T ))
 [ bool ] is_nonpositive( & T value ) {
         T zero_val = 0;
@@ -221 +221 @@
 }
 
-forall(T | Relational( T ))
+forall(T | relational( T ))
 [ bool ] is_negative( & T value ) {
         T zero_val = 0;

libcfa/src/parseconfig.hfa

@@ -107 +107 @@
 
 
-forall(T | Relational( T ))
+forall(T | relational( T ))
 [ bool ] is_nonnegative( & T );
 
-forall(T | Relational( T ))
+forall(T | relational( T ))
 [ bool ] is_positive( & T );
 
-forall(T | Relational( T ))
+forall(T | relational( T ))
 [ bool ] is_nonpositive( & T );
 
-forall(T | Relational( T ))
+forall(T | relational( T ))
 [ bool ] is_negative( & T );