/**************************************************************************** ** ** Copyright (C) 2012 Nokia Corporation and/or its subsidiary(-ies). ** Contact: http://www.qt-project.org/ ** ** This file is part of the QtCore module of the Qt Toolkit. ** ** $QT_BEGIN_LICENSE:LGPL$ ** GNU Lesser General Public License Usage ** 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. ** ** In addition, as a special exception, Nokia gives you certain additional ** rights. These rights are described in the Nokia Qt LGPL Exception ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package. ** ** GNU General Public License Usage ** Alternatively, this file may be used under the terms of the GNU General ** Public License version 3.0 as published by the Free Software Foundation ** and appearing in the file LICENSE.GPL included in the packaging of this ** file. Please review the following information to ensure the GNU General ** Public License version 3.0 requirements will be met: ** http://www.gnu.org/copyleft/gpl.html. ** ** Other Usage ** Alternatively, this file may be used in accordance with the terms and ** conditions contained in a signed written agreement between you and Nokia. ** ** ** ** ** ** ** $QT_END_LICENSE$ ** ****************************************************************************/ #ifndef QFUTUREINTERFACE_H #define QFUTUREINTERFACE_H #include #include #ifndef QT_NO_QFUTURE #include #include #include QT_BEGIN_HEADER QT_BEGIN_NAMESPACE template class QFuture; class QFutureInterfaceBasePrivate; class QFutureWatcherBase; class QFutureWatcherBasePrivate; class Q_CONCURRENT_EXPORT QFutureInterfaceBase { public: enum State { NoState = 0x00, Running = 0x01, Started = 0x02, Finished = 0x04, Canceled = 0x08, Paused = 0x10, Throttled = 0x20 }; QFutureInterfaceBase(State initialState = NoState); QFutureInterfaceBase(const QFutureInterfaceBase &other); virtual ~QFutureInterfaceBase(); // reporting functions available to the engine author: void reportStarted(); void reportFinished(); void reportCanceled(); #ifndef QT_NO_EXCEPTIONS void reportException(const QtConcurrent::Exception &e); #endif void reportResultsReady(int beginIndex, int endIndex); void setRunnable(QRunnable *runnable); void setFilterMode(bool enable); void setProgressRange(int minimum, int maximum); int progressMinimum() const; int progressMaximum() const; bool isProgressUpdateNeeded() const; void setProgressValue(int progressValue); int progressValue() const; void setProgressValueAndText(int progressValue, const QString &progressText); QString progressText() const; void setExpectedResultCount(int resultCount); int expectedResultCount(); int resultCount() const; bool queryState(State state) const; bool isRunning() const; bool isStarted() const; bool isCanceled() const; bool isFinished() const; bool isPaused() const; bool isThrottled() const; bool isResultReadyAt(int index) const; void cancel(); void setPaused(bool paused); void togglePaused(); void setThrottled(bool enable); void waitForFinished(); bool waitForNextResult(); void waitForResult(int resultIndex); void waitForResume(); QMutex *mutex() const; QtConcurrent::internal::ExceptionStore &exceptionStore(); QtConcurrent::ResultStoreBase &resultStoreBase(); const QtConcurrent::ResultStoreBase &resultStoreBase() const; inline bool operator==(const QFutureInterfaceBase &other) const { return d == other.d; } inline bool operator!=(const QFutureInterfaceBase &other) const { return d != other.d; } QFutureInterfaceBase &operator=(const QFutureInterfaceBase &other); protected: bool referenceCountIsOne() const; public: #ifndef QFUTURE_TEST private: #endif QFutureInterfaceBasePrivate *d; private: friend class QFutureWatcherBase; friend class QFutureWatcherBasePrivate; }; template class QFutureInterface : public QFutureInterfaceBase { public: QFutureInterface(State initialState = NoState) : QFutureInterfaceBase(initialState) { } QFutureInterface(const QFutureInterface &other) : QFutureInterfaceBase(other) { } ~QFutureInterface() { if (referenceCountIsOne()) resultStore().clear(); } static QFutureInterface canceledResult() { return QFutureInterface(State(Started | Finished | Canceled)); } QFutureInterface &operator=(const QFutureInterface &other) { if (referenceCountIsOne()) resultStore().clear(); QFutureInterfaceBase::operator=(other); return *this; } inline QFuture future(); // implemented in qfuture.h inline void reportResult(const T *result, int index = -1); inline void reportResult(const T &result, int index = -1); inline void reportResults(const QVector &results, int beginIndex = -1, int count = -1); inline void reportFinished(const T *result = 0); inline const T &resultReference(int index) const; inline const T *resultPointer(int index) const; inline QList results(); private: QtConcurrent::ResultStore &resultStore() { return static_cast &>(resultStoreBase()); } const QtConcurrent::ResultStore &resultStore() const { return static_cast &>(resultStoreBase()); } }; template inline void QFutureInterface::reportResult(const T *result, int index) { QMutexLocker locker(mutex()); if (this->queryState(Canceled) || this->queryState(Finished)) { return; } QtConcurrent::ResultStore &store = resultStore(); if (store.filterMode()) { const int resultCountBefore = store.count(); store.addResult(index, result); this->reportResultsReady(resultCountBefore, resultCountBefore + store.count()); } else { const int insertIndex = store.addResult(index, result); this->reportResultsReady(insertIndex, insertIndex + 1); } } template inline void QFutureInterface::reportResult(const T &result, int index) { reportResult(&result, index); } template inline void QFutureInterface::reportResults(const QVector &_results, int beginIndex, int count) { QMutexLocker locker(mutex()); if (this->queryState(Canceled) || this->queryState(Finished)) { return; } QtConcurrent::ResultStore &store = resultStore(); if (store.filterMode()) { const int resultCountBefore = store.count(); store.addResults(beginIndex, &_results, count); this->reportResultsReady(resultCountBefore, store.count()); } else { const int insertIndex = store.addResults(beginIndex, &_results, count); this->reportResultsReady(insertIndex, insertIndex + _results.count()); } } template inline void QFutureInterface::reportFinished(const T *result) { if (result) reportResult(result); QFutureInterfaceBase::reportFinished(); } template inline const T &QFutureInterface::resultReference(int index) const { QMutexLocker lock(mutex()); return resultStore().resultAt(index).value(); } template inline const T *QFutureInterface::resultPointer(int index) const { QMutexLocker lock(mutex()); return resultStore().resultAt(index).pointer(); } template inline QList QFutureInterface::results() { if (this->isCanceled()) { exceptionStore().throwPossibleException(); return QList(); } QFutureInterfaceBase::waitForResult(-1); QList res; QMutexLocker lock(mutex()); QtConcurrent::ResultIterator it = resultStore().begin(); while (it != resultStore().end()) { res.append(it.value()); ++it; } return res; } template <> class QFutureInterface : public QFutureInterfaceBase { public: QFutureInterface(State initialState = NoState) : QFutureInterfaceBase(initialState) { } QFutureInterface(const QFutureInterface &other) : QFutureInterfaceBase(other) { } static QFutureInterface canceledResult() { return QFutureInterface(State(Started | Finished | Canceled)); } QFutureInterface &operator=(const QFutureInterface &other) { QFutureInterfaceBase::operator=(other); return *this; } inline QFuture future(); // implemented in qfuture.h void reportResult(const void *, int) { } void reportResults(const QVector &, int) { } void reportFinished(void * = 0) { QFutureInterfaceBase::reportFinished(); } }; QT_END_NAMESPACE QT_END_HEADER #endif // QT_NO_CONCURRENT #endif // QFUTUREINTERFACE_H