void SmartNameCache::modifyTask( const Task& task )
{
const TaskList::Iterator it = qBinaryFind( m_tasks.begin(), m_tasks.end(), Task( task.id(), QString() ), IdLessThan() );
if ( it != m_tasks.constEnd() )
*it = task;
sortTasks();
regenerateSmartNames();
}
/** Creates a task list for the specified task ids, sorts them and tests the result. */
void sortTasksWithIds(unsigned long refTaskIds[], int count){
int i;
/* Arrange */
task_t** reference = makeTasks(refTaskIds, count);
if (NULL == reference) return;
/* Act & Assert */
sortTasks(reference, count);
/* Clean-up */
for(i=0; i<count; ++i){
free(reference[i]);
}
free(reference);
}
struct SingleTask* TaskGenerator::generateTasks() {
srand( time(NULL));
int length;
struct SingleTask *taskArray = new SingleTask[processQuantity];
for (int i = 0; i < this->processQuantity; i++) {
taskArray[i].piority = rand() % PRIORITY_RANGE;
length = rand() % LENGTH_RANGE;
if(length == 0) {
++length;
}
taskArray[i].tasklength = length;
taskArray[i].startTime = rand() % TIME_RANGE;
taskArray[i].complete = false;
taskArray[i].progress = 0;
}
return sortTasks(taskArray);
}
u64 RuntimeQueue::enqueue(RuntimeTask&& task)
{
RecLock _(mTasksLock);
u64 output = ++mTaskIndex;
task_data_t task_d;
task_d.task = std::move(task);
task_d.index = output;
task_d.alive = true;
task_d.to_dispose = false;
mTasks.push_back(task_d);
sortTasks();
return output;
}
void testSortNull(void){
printf(" => testSortNull\n");
sortTasks(NULL, 999);
}
void SmartNameCache::addTask( const Task& task )
{
m_tasks.append( task );
sortTasks();
regenerateSmartNames();
}
void SmartNameCache::setAllTasks( const TaskList& taskList )
{
m_tasks = taskList;
sortTasks();
regenerateSmartNames();
}
