Index: libcfa/src/concurrency/future.hfa
===================================================================
--- libcfa/src/concurrency/future.hfa	(revision e25ef8c9bc1cec34146129133c0654aaa9d5c268)
+++ libcfa/src/concurrency/future.hfa	(revision 283fbddd969525e9694abcb709bc45b284c7f7ea)
@@ -9,7 +9,7 @@
 // Author           : Thierry Delisle & Peiran Hong & Colby Parsons
 // Created On       : Wed Jan 06 17:33:18 2021
-// Last Modified By :
-// Last Modified On :
-// Update Count     :
+// Last Modified By : Peter A. Buhr
+// Last Modified On : Fri Nov 29 16:07:34 2024
+// Update Count     : 30
 //
 
@@ -23,13 +23,8 @@
 //----------------------------------------------------------------------------
 // future
-// I don't use future_t here since I need to use a lock for this future
-//  since it supports multiple consumers
-//  future_t is lockfree and uses atomics which aren't needed given we use locks here
+// I don't use future_t here as I need to use a lock for this future since it supports multiple consumers.
+// future_t is lockfree and uses atomics which aren't needed given we use locks here
 forall( T ) {
-    // enum { FUTURE_EMPTY = 0, FUTURE_FULFILLED = 1 }; // Enums seem to be broken so feel free to add this back afterwards
-
-    // temporary enum replacement
-    const int FUTURE_EMPTY = 0;
-    const int FUTURE_FULFILLED = 1;
+    enum { FUTURE_EMPTY = 0, FUTURE_FULFILLED = 1 };
 
 	struct future {