Reference | Class List | Member Functions | Typedefs | File List |
This container implements a scheduling policy based on task priorities. The task with highest priority will be the first to be removed. It must be possible to compare two tasks using operator<.
Task | A function object which implements the operator() and operator<. operator< must be a partial ordering. |
Definition at line 193 of file scheduling_policies.hpp.
Public Types | |
typedef Task | task_type |
Public Member Functions | |
void | clear () |
bool | empty () const |
void | pop () |
bool | push (task_type const &task) |
size_t | size () const |
task_type const & | top () const |
Protected Attributes | |
std::priority_queue< task_type > | m_container |
|
Indicates the scheduler's task type.
Definition at line 196 of file scheduling_policies.hpp. |
|
Removes all tasks from the scheduler. Definition at line 248 of file scheduling_policies.hpp. |
|
Checks if the scheduler is empty.
Definition at line 241 of file scheduling_policies.hpp. |
|
Removes the task which should be executed next. Definition at line 215 of file scheduling_policies.hpp. |
|
Adds a new task to the scheduler.
Definition at line 207 of file scheduling_policies.hpp. |
|
Gets the current number of tasks in the scheduler.
Definition at line 232 of file scheduling_policies.hpp. |
|
Gets the task which should be executed next.
Definition at line 223 of file scheduling_policies.hpp. |
|
Internal task container.
Definition at line 199 of file scheduling_policies.hpp. |