TaskScheduler::TaskQueue Class Reference

Public Member Functions
void	Push (TaskContainer &&task)
TaskContainer	Pop ()
	Pops the task out of the container. More...
TaskContainer const &	First () const
void	Clear ()
void	RemoveIf (std::function< bool(TaskContainer const &)> const &filter)
void	ModifyIf (std::function< bool(TaskContainer const &)> const &filter)
std::size_t	Count (group_t const &group)
bool	IsEmpty () const

Private Attributes
std::multiset< TaskContainer, Compare >	container

Member Function Documentation

Clear()

void TaskScheduler::TaskQueue::Clear

(

)

{
    container.clear();
}

Referenced by TaskScheduler::CancelAll().

Here is the caller graph for this function:

Count()

std::size_t TaskScheduler::TaskQueue::Count

(

group_t const &

group

)

{
    std::size_t count = 0;
 
    for (std::multiset<TaskContainer, Compare>::iterator it = container.begin();
         it != container.end(); it++) {
        if ((*it)->IsInGroup(group))
            count++;
    }
 
    return count;
}

References GridTypeListIterator::count().

Referenced by TaskScheduler::Count().

Here is the call graph for this function:

Here is the caller graph for this function:

First()

auto TaskScheduler::TaskQueue::First

(

)

const

{
    return *container.begin();
}

Referenced by TaskScheduler::Dispatch().

Here is the caller graph for this function:

IsEmpty()

bool TaskScheduler::TaskQueue::IsEmpty

(

)

const

{
    return container.empty();
}

Referenced by TaskScheduler::Dispatch().

Here is the caller graph for this function:

ModifyIf()

void TaskScheduler::TaskQueue::ModifyIf

(

std::function< bool(TaskContainer const &)> const &

filter

)

{
    std::vector<TaskContainer> cache;
    for (auto itr = container.begin(); itr != container.end();)
        if (filter(*itr))
        {
            cache.push_back(*itr);
            itr = container.erase(itr);
        }
        else
            ++itr;
 
    container.insert(cache.begin(), cache.end());
}

Referenced by TaskScheduler::DelayAll(), TaskScheduler::DelayGroup(), and TaskScheduler::RescheduleAtWithPredicate().

Here is the caller graph for this function:

Pop()

auto TaskScheduler::TaskQueue::Pop

(

)

Pops the task out of the container.

{
    TaskContainer result = *container.begin();
    container.erase(container.begin());
    return result;
}

Referenced by TaskScheduler::Dispatch().

Here is the caller graph for this function:

Push()

void TaskScheduler::TaskQueue::Push

(

TaskContainer &&

task

)

{
    container.insert(task);
}

References container.

Referenced by TaskScheduler::InsertTask().

Here is the caller graph for this function:

RemoveIf()

void TaskScheduler::TaskQueue::RemoveIf

(

std::function< bool(TaskContainer const &)> const &

filter

)

{
    for (auto itr = container.begin(); itr != container.end();)
        if (filter(*itr))
            itr = container.erase(itr);
        else
            ++itr;
}

Referenced by TaskScheduler::CancelGroup().

Here is the caller graph for this function:

Member Data Documentation

container

std::multiset<TaskContainer, Compare> TaskScheduler::TaskQueue::container

private

Referenced by Push().

---

The documentation for this class was generated from the following files:

• src/Utility/TaskScheduler.hpp
• src/Utility/TaskScheduler.cpp