#include <work_stealing_pool.hpp>
|
| using | Task = std::function< void()> |
| |
|
| static std::size_t | adaptive_grain (std::size_t work_items, std::size_t threads) noexcept |
| |
Definition at line 27 of file work_stealing_pool.hpp.
◆ Task
◆ WorkStealingPool() [1/2]
| velographx::WorkStealingPool::WorkStealingPool |
( |
std::size_t |
threads = std::thread::hardware_concurrency(), |
|
|
std::vector< std::size_t > |
queue_groups = {} |
|
) |
| |
|
inlineexplicit |
◆ WorkStealingPool() [2/2]
◆ ~WorkStealingPool()
| velographx::WorkStealingPool::~WorkStealingPool |
( |
| ) |
|
|
inline |
◆ adaptive_grain()
| static std::size_t velographx::WorkStealingPool::adaptive_grain |
( |
std::size_t |
work_items, |
|
|
std::size_t |
threads |
|
) |
| |
|
inlinestaticnoexcept |
◆ operator=()
◆ parallel_for()
template<class Fn >
| void velographx::WorkStealingPool::parallel_for |
( |
std::size_t |
begin, |
|
|
std::size_t |
end, |
|
|
Fn && |
fn, |
|
|
std::size_t |
grain = 0 |
|
) |
| |
|
inline |
◆ queue_group()
| std::size_t velographx::WorkStealingPool::queue_group |
( |
std::size_t |
index | ) |
const |
|
inlinenoexcept |
◆ size()
| std::size_t velographx::WorkStealingPool::size |
( |
| ) |
const |
|
inlinenoexcept |
◆ stats()
◆ submit()
| void velographx::WorkStealingPool::submit |
( |
Task |
task, |
|
|
std::size_t |
locality_hint = 0 |
|
) |
| |
|
inline |
◆ wait_idle()
| void velographx::WorkStealingPool::wait_idle |
( |
| ) |
|
|
inline |
The documentation for this class was generated from the following file: