Changeset 6804f38 for libcfa

Timestamp:

Jul 17, 2024, 9:23:25 PM (6 hours ago)

Author:

Peter A. Buhr <pabuhr@…>

Branches:

master

Parents:

a758169

Message:

formatting

File:

• libcfa/src/enum.hfa (modified) (2 diffs)

libcfa/src/enum.hfa

@@ -4 +4 @@
 
 forall( E ) trait Bounded {
-    E lowerBound();
-    E upperBound();
+        E lowerBound();
+        E upperBound();
 };
 
 forall( E | Bounded( E ) ) trait Serial {
-    unsigned fromInstance( E e );
-    E fromInt_unsafe( unsigned i );
-    E succ_unsafe( E e );
-    E pred_unsafe( E e );
+        unsigned fromInstance( E e );
+        E fromInt_unsafe( unsigned i );
+        E succ_unsafe( E e );
+        E pred_unsafe( E e );
 };
 
 forall( E | Serial( E ) ) {
-    E fromInt( unsigned i );
-    E succ( E e );
-    E pred( E e );
-    int Countof( E e );
+        E fromInt( unsigned i );
+        E succ( E e );
+        E pred( E e );
+        int Countof( E e );
 }
 
 // forall( E | Bounded(E) ) trait SafeSerial {
-//     // unsigned fromInstance( E e );
-//     E fromInt_unsafe( unsigned i );
-//     // E succ_unsafe( E e );
-//     //E pred_unsafe( E e );
+//       // unsigned fromInstance( E e );
+//       E fromInt_unsafe( unsigned i );
+//       // E succ_unsafe( E e );
+//       //E pred_unsafe( E e );
 
-//     unsigned fromInstance( E e );
-//     E fromInt( unsigned i );
-//     E succ( E e );
-//     E pred( E e );
+//       unsigned fromInstance( E e );
+//       E fromInt( unsigned i );
+//       E succ( E e );
+//       E pred( E e );
 // };
 
 forall( E ) trait CfaEnum {
-    const char * label( E e );
-    unsigned int posn( E e );
+        const char * label( E e );
+        unsigned int posn( E e );
 };
 
 forall( E, V | CfaEnum( E ) ) trait TypedEnum {
-    V value( E e );
+        V value( E e );
 };
 
@@ -55 +55 @@
 static inline
 forall( E | Serial(E) | CfaEnum(E) ) {
-    int ?==?( E l, E r ) { return posn( l ) == posn( r ); }     // relational operators
-    int ?!=?( E l, E r ) { return posn( l ) != posn( r ); }
-    int ?<?( E l, E r ) { return posn( l ) < posn( r ); }
-    int ?<=?( E l, E r ) { return posn( l ) <= posn( r ); }
-    int ?>?( E l, E r ) { return posn( l ) > posn( r ); }
-    int ?>=?( E l, E r ) { return posn( l ) >= posn( r ); }
+        int ?==?( E l, E r ) { return posn( l ) == posn( r ); } // relational operators
+        int ?!=?( E l, E r ) { return posn( l ) != posn( r ); }
+        int ?<?( E l, E r ) { return posn( l ) < posn( r ); }
+        int ?<=?( E l, E r ) { return posn( l ) <= posn( r ); }
+        int ?>?( E l, E r ) { return posn( l ) > posn( r ); }
+        int ?>=?( E l, E r ) { return posn( l ) >= posn( r ); }
 
-    E ++?( E & l ) {                                                                    // increment operators
-        l = succ( l );
-        return l;
-    }
-    
-    E ?++( E & l ) {
-        E ret = l;
-        l = succ( l );
-        return ret;
-    }
+        E ++?( E & l ) {                                                                        // increment operators
+                l = succ( l );
+                return l;
+        }
+        
+        E ?++( E & l ) {
+                E ret = l;
+                l = succ( l );
+                return ret;
+        }
 
-    E --?( E & l ) {
-        l = pred( l );
-        return l;
-    }
+        E --?( E & l ) {
+                l = pred( l );
+                return l;
+        }
 
-    E ?--( E & l ) {
-        E ret = l;
-        l = pred( l );
-        return ret;
-    }
+        E ?--( E & l ) {
+                E ret = l;
+                l = pred( l );
+                return ret;
+        }
 }