class to create a semophore object for building a concurrency constraint More...
#include <taskflow/core/semaphore.hpp>
Public Member Functions | |
| Semaphore ()=default | |
| constructs a default semaphore | |
| Semaphore (size_t max_value) | |
| constructs a semaphore with the given value (i.e., counter) | |
| size_t | value () const |
| queries the current counter value | |
| size_t | max_value () const |
| queries the maximum allowable value of this semaphore | |
| void | reset () |
| resets the semaphores to a clean state | |
| void | reset (size_t new_max_value) |
| resets the semaphores to a clean state with the given new maximum value | |
Friends | |
| class | Node |
| class | Executor |
class to create a semophore object for building a concurrency constraint
A semaphore creates a constraint that limits the maximum concurrency, i.e., the number of workers, in a set of tasks. You can let a task acquire/release one or multiple semaphores before/after executing its work. A task can acquire and release a semaphore, or just acquire or just release it. A tf::Semaphore object starts with an initial count. As long as that count is above 0, tasks can acquire the semaphore and do their work. If the count is 0 or less, a task trying to acquire the semaphore will not run but goes to a waiting list of that semaphore. When the semaphore is released by another task, it reschedules all tasks on that waiting list.
The above example creates five tasks with no dependencies between them. Under normal circumstances, the five tasks would be executed concurrently. However, this example has a semaphore with initial count 1, and all tasks need to acquire that semaphore before running and release that semaphore after they are done. This arrangement limits the number of concurrently running tasks to only one.
|
default |
constructs a default semaphore
A default semaphore has the value of zero. Users can call tf::Semaphore::reset to reassign a new value to the semaphore.
|
inlineexplicit |
constructs a semaphore with the given value (i.e., counter)
A semaphore creates a constraint that limits the maximum concurrency, i.e., the number of workers, in a set of tasks.