101 lines
2.5 KiB
C++
101 lines
2.5 KiB
C++
#include "SequentialTask.h"
|
|
|
|
SequentialTask::SequentialTask(QObject* parent, const QString& task_name) : Task(parent), m_name(task_name), m_currentIndex(-1) {}
|
|
|
|
SequentialTask::~SequentialTask()
|
|
{
|
|
for(auto task : m_queue){
|
|
if(task)
|
|
task->deleteLater();
|
|
}
|
|
}
|
|
|
|
auto SequentialTask::getStepProgress() const -> qint64
|
|
{
|
|
return m_stepProgress;
|
|
}
|
|
|
|
auto SequentialTask::getStepTotalProgress() const -> qint64
|
|
{
|
|
return m_stepTotalProgress;
|
|
}
|
|
|
|
void SequentialTask::addTask(Task::Ptr task)
|
|
{
|
|
m_queue.append(task);
|
|
}
|
|
|
|
void SequentialTask::executeTask()
|
|
{
|
|
m_currentIndex = -1;
|
|
startNext();
|
|
}
|
|
|
|
bool SequentialTask::abort()
|
|
{
|
|
if(m_currentIndex == -1 || m_currentIndex >= m_queue.size()) {
|
|
if(m_currentIndex == -1) {
|
|
// Don't call emitAborted() here, we want to bypass the 'is the task running' check
|
|
emit aborted();
|
|
emit finished();
|
|
}
|
|
m_queue.clear();
|
|
return true;
|
|
}
|
|
|
|
bool succeeded = m_queue[m_currentIndex]->abort();
|
|
m_queue.clear();
|
|
|
|
if(succeeded)
|
|
emitAborted();
|
|
|
|
return succeeded;
|
|
}
|
|
|
|
void SequentialTask::startNext()
|
|
{
|
|
if (m_currentIndex != -1) {
|
|
Task::Ptr previous = m_queue[m_currentIndex];
|
|
disconnect(previous.get(), 0, this, 0);
|
|
}
|
|
m_currentIndex++;
|
|
if (m_queue.isEmpty() || m_currentIndex >= m_queue.size()) {
|
|
emitSucceeded();
|
|
return;
|
|
}
|
|
Task::Ptr next = m_queue[m_currentIndex];
|
|
|
|
connect(next.get(), SIGNAL(failed(QString)), this, SLOT(subTaskFailed(QString)));
|
|
connect(next.get(), SIGNAL(succeeded()), this, SLOT(startNext()));
|
|
|
|
connect(next.get(), SIGNAL(status(QString)), this, SLOT(subTaskStatus(QString)));
|
|
connect(next.get(), SIGNAL(stepStatus(QString)), this, SLOT(subTaskStatus(QString)));
|
|
|
|
connect(next.get(), SIGNAL(progress(qint64, qint64)), this, SLOT(subTaskProgress(qint64, qint64)));
|
|
|
|
setStatus(tr("Executing task %1 out of %2").arg(m_currentIndex + 1).arg(m_queue.size()));
|
|
setStepStatus(next->isMultiStep() ? next->getStepStatus() : next->getStatus());
|
|
|
|
next->start();
|
|
}
|
|
|
|
void SequentialTask::subTaskFailed(const QString& msg)
|
|
{
|
|
emitFailed(msg);
|
|
}
|
|
void SequentialTask::subTaskStatus(const QString& msg)
|
|
{
|
|
setStepStatus(msg);
|
|
}
|
|
void SequentialTask::subTaskProgress(qint64 current, qint64 total)
|
|
{
|
|
if (total == 0) {
|
|
setProgress(0, 100);
|
|
return;
|
|
}
|
|
setProgress(m_currentIndex + 1, m_queue.count());
|
|
|
|
m_stepProgress = current;
|
|
m_stepTotalProgress = total;
|
|
}
|