48 funcs_.emplace(sf.moveOutFunc());
55 for (count = 0; count < n; count++) {
78 size_t tasksForSingleRun = 0;
79 while ((tasksForSingleRun =
run()) != 0) {
80 tasksRun += tasksForSingleRun;
std::queue< Func > funcs_
std::chrono::steady_clock::time_point TimePoint
constexpr detail::Map< Move > move
bool post()
Silently saturates if value is already 2^32-1.
—— Concurrent Priority Queue Implementation ——
void wait()
Wait for work to do.
bool tryWait()
Returns true iff value was decremented.
auto lock(Synchronized< D, M > &synchronized, Args &&...args)
void advanceTo(TimePoint const &t)
std::priority_queue< ScheduledFunc > scheduledFuncs_