- Timestamp:
- Nov 29, 2024, 4:24:14 PM (3 weeks ago)
- Branches:
- master
- Children:
- 4175659, 509ec82
- Parents:
- 718601e
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
libcfa/src/concurrency/future.hfa
r718601e r1c0a3a4 9 9 // Author : Thierry Delisle & Peiran Hong & Colby Parsons 10 10 // Created On : Wed Jan 06 17:33:18 2021 11 // Last Modified By : 12 // Last Modified On : 13 // Update Count : 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : Fri Nov 29 16:07:34 2024 13 // Update Count : 30 14 14 // 15 15 … … 23 23 //---------------------------------------------------------------------------- 24 24 // future 25 // I don't use future_t here since I need to use a lock for this future 26 // since it supports multiple consumers 27 // future_t is lockfree and uses atomics which aren't needed given we use locks here 25 // I don't use future_t here as I need to use a lock for this future since it supports multiple consumers. 26 // future_t is lockfree and uses atomics which aren't needed given we use locks here 28 27 forall( T ) { 29 // enum { FUTURE_EMPTY = 0, FUTURE_FULFILLED = 1 }; // Enums seem to be broken so feel free to add this back afterwards 30 31 // temporary enum replacement 32 const int FUTURE_EMPTY = 0; 33 const int FUTURE_FULFILLED = 1; 28 enum { FUTURE_EMPTY = 0, FUTURE_FULFILLED = 1 }; 34 29 35 30 struct future {
Note: See TracChangeset
for help on using the changeset viewer.