2009-02-25 09:15:00 +01:00
|
|
|
/**************************************************************************
|
2008-12-02 12:01:29 +01:00
|
|
|
**
|
|
|
|
|
** This file is part of Qt Creator
|
|
|
|
|
**
|
2009-02-25 09:15:00 +01:00
|
|
|
** Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
|
2008-12-02 12:01:29 +01:00
|
|
|
**
|
2009-06-17 00:01:27 +10:00
|
|
|
** Contact: Nokia Corporation (qt-info@nokia.com)
|
2008-12-02 12:01:29 +01:00
|
|
|
**
|
2009-02-25 09:15:00 +01:00
|
|
|
** Commercial Usage
|
2008-12-02 14:17:16 +01:00
|
|
|
**
|
2009-02-25 09:15:00 +01:00
|
|
|
** Licensees holding valid Qt Commercial licenses may use this file in
|
|
|
|
|
** accordance with the Qt Commercial License Agreement provided with the
|
|
|
|
|
** Software or, alternatively, in accordance with the terms contained in
|
|
|
|
|
** a written agreement between you and Nokia.
|
2008-12-02 14:17:16 +01:00
|
|
|
**
|
2009-02-25 09:15:00 +01:00
|
|
|
** GNU Lesser General Public License Usage
|
2008-12-02 14:17:16 +01:00
|
|
|
**
|
2009-02-25 09:15:00 +01:00
|
|
|
** Alternatively, this file may be used under the terms of the GNU Lesser
|
|
|
|
|
** General Public License version 2.1 as published by the Free Software
|
|
|
|
|
** Foundation and appearing in the file LICENSE.LGPL included in the
|
|
|
|
|
** packaging of this file. Please review the following information to
|
|
|
|
|
** ensure the GNU Lesser General Public License version 2.1 requirements
|
|
|
|
|
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
|
2008-12-02 14:17:16 +01:00
|
|
|
**
|
2009-02-25 09:15:00 +01:00
|
|
|
** If you are unsure which license is appropriate for your use, please
|
2009-06-17 00:01:27 +10:00
|
|
|
** contact the sales department at http://www.qtsoftware.com/contact.
|
2008-12-02 12:01:29 +01:00
|
|
|
**
|
2009-02-25 09:15:00 +01:00
|
|
|
**************************************************************************/
|
2008-12-02 14:09:21 +01:00
|
|
|
|
2008-12-02 12:01:29 +01:00
|
|
|
#include "progressview.h"
|
|
|
|
|
#include "futureprogress.h"
|
|
|
|
|
|
2008-12-09 15:25:01 +01:00
|
|
|
#include <utils/qtcassert.h>
|
|
|
|
|
|
2008-12-02 12:01:29 +01:00
|
|
|
#include <QtGui/QHBoxLayout>
|
|
|
|
|
|
|
|
|
|
using namespace Core;
|
|
|
|
|
using namespace Core::Internal;
|
|
|
|
|
|
|
|
|
|
ProgressView::ProgressView(QWidget *parent)
|
2008-12-02 14:09:21 +01:00
|
|
|
: QWidget(parent)
|
2008-12-02 12:01:29 +01:00
|
|
|
{
|
|
|
|
|
m_layout = new QVBoxLayout;
|
|
|
|
|
setLayout(m_layout);
|
|
|
|
|
m_layout->setMargin(0);
|
|
|
|
|
m_layout->setSpacing(0);
|
|
|
|
|
setWindowTitle(tr("Processes"));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
ProgressView::~ProgressView()
|
|
|
|
|
{
|
|
|
|
|
qDeleteAll(m_taskList);
|
|
|
|
|
m_taskList.clear();
|
|
|
|
|
m_type.clear();
|
|
|
|
|
m_keep.clear();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
FutureProgress *ProgressView::addTask(const QFuture<void> &future,
|
|
|
|
|
const QString &title,
|
|
|
|
|
const QString &type,
|
2009-01-13 14:16:36 +01:00
|
|
|
ProgressManager::PersistentType persistency)
|
2008-12-02 12:01:29 +01:00
|
|
|
{
|
|
|
|
|
removeOldTasks(type);
|
|
|
|
|
if (m_taskList.size() == 3)
|
|
|
|
|
removeOneOldTask();
|
|
|
|
|
FutureProgress *progress = new FutureProgress(this);
|
|
|
|
|
progress->setTitle(title);
|
|
|
|
|
progress->setFuture(future);
|
|
|
|
|
m_layout->insertWidget(0, progress);
|
|
|
|
|
m_taskList.append(progress);
|
|
|
|
|
m_type.insert(progress, type);
|
2009-01-13 14:16:36 +01:00
|
|
|
m_keep.insert(progress, (persistency == ProgressManager::KeepOnFinish));
|
2008-12-02 12:01:29 +01:00
|
|
|
connect(progress, SIGNAL(finished()), this, SLOT(slotFinished()));
|
|
|
|
|
return progress;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void ProgressView::removeOldTasks(const QString &type, bool keepOne)
|
|
|
|
|
{
|
|
|
|
|
bool firstFound = !keepOne; // start with false if we want to keep one
|
|
|
|
|
QList<FutureProgress *>::iterator i = m_taskList.end();
|
|
|
|
|
while (i != m_taskList.begin()) {
|
|
|
|
|
--i;
|
|
|
|
|
if (m_type.value(*i) == type) {
|
|
|
|
|
if (firstFound && (*i)->future().isFinished()) {
|
|
|
|
|
deleteTask(*i);
|
|
|
|
|
i = m_taskList.erase(i);
|
|
|
|
|
}
|
|
|
|
|
firstFound = true;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void ProgressView::deleteTask(FutureProgress *progress)
|
|
|
|
|
{
|
|
|
|
|
m_type.remove(progress);
|
|
|
|
|
m_keep.remove(progress);
|
|
|
|
|
layout()->removeWidget(progress);
|
2009-01-28 16:33:16 +01:00
|
|
|
progress->hide();
|
2008-12-02 12:01:29 +01:00
|
|
|
progress->deleteLater();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void ProgressView::removeOneOldTask()
|
|
|
|
|
{
|
|
|
|
|
if (m_taskList.isEmpty())
|
|
|
|
|
return;
|
|
|
|
|
// look for oldest ended process
|
|
|
|
|
for (QList<FutureProgress *>::iterator i = m_taskList.begin(); i != m_taskList.end(); ++i) {
|
|
|
|
|
if ((*i)->future().isFinished()) {
|
|
|
|
|
deleteTask(*i);
|
|
|
|
|
i = m_taskList.erase(i);
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
// no ended process, look for a task type with multiple running tasks and remove the oldest one
|
|
|
|
|
for (QList<FutureProgress *>::iterator i = m_taskList.begin(); i != m_taskList.end(); ++i) {
|
|
|
|
|
QString type = m_type.value(*i);
|
|
|
|
|
if (m_type.keys(type).size() > 1) { // don't care for optimizations it's only a handful of entries
|
|
|
|
|
deleteTask(*i);
|
|
|
|
|
i = m_taskList.erase(i);
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// no ended process, no type with multiple processes, just remove the oldest task
|
|
|
|
|
FutureProgress *task = m_taskList.takeFirst();
|
|
|
|
|
deleteTask(task);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void ProgressView::removeTask(FutureProgress *task)
|
|
|
|
|
{
|
|
|
|
|
m_taskList.removeAll(task);
|
|
|
|
|
deleteTask(task);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void ProgressView::slotFinished()
|
|
|
|
|
{
|
|
|
|
|
FutureProgress *progress = qobject_cast<FutureProgress *>(sender());
|
2008-12-09 15:25:01 +01:00
|
|
|
QTC_ASSERT(progress, return);
|
2008-12-02 12:01:29 +01:00
|
|
|
if (m_keep.contains(progress) && !m_keep.value(progress) && !progress->hasError())
|
|
|
|
|
removeTask(progress);
|
|
|
|
|
removeOldTasks(m_type.value(progress), true);
|
|
|
|
|
}
|