mirror of
https://github.com/baldurk/renderdoc.git
synced 2026-05-29 13:20:54 +00:00
768e812e45
* On windows it's strongly desired to be able to compile straight out of a clean checkout or source download. This means anyone can download the source and investigate something quickly, without having to worry about the hassle of figuring out how the project downloads 3rd party dependencies, fetching them, getting them registered in the right place. * This can't be put in a submodule as git submodules don't get downloaded by default so people new to git will get confusing compilation messages, and someone downloading the source from github directly without cloning via git won't get submodules included. * It does add some extra size to a fresh download/checkout which is unfortunate, but absolutely worth the cost. Shallow checkouts still aren't unfeasibly large, and it's only a one-off cost at clone time.
248 lines
8.2 KiB
C++
248 lines
8.2 KiB
C++
/****************************************************************************
|
|
**
|
|
** Copyright (C) 2016 The Qt Company Ltd.
|
|
** Contact: https://www.qt.io/licensing/
|
|
**
|
|
** This file is part of the QtCore module of the Qt Toolkit.
|
|
**
|
|
** $QT_BEGIN_LICENSE:LGPL$
|
|
** Commercial License Usage
|
|
** Licensees holding valid commercial Qt licenses may use this file in
|
|
** accordance with the commercial license agreement provided with the
|
|
** Software or, alternatively, in accordance with the terms contained in
|
|
** a written agreement between you and The Qt Company. For licensing terms
|
|
** and conditions see https://www.qt.io/terms-conditions. For further
|
|
** information use the contact form at https://www.qt.io/contact-us.
|
|
**
|
|
** GNU Lesser General Public License Usage
|
|
** Alternatively, this file may be used under the terms of the GNU Lesser
|
|
** General Public License version 3 as published by the Free Software
|
|
** Foundation and appearing in the file LICENSE.LGPL3 included in the
|
|
** packaging of this file. Please review the following information to
|
|
** ensure the GNU Lesser General Public License version 3 requirements
|
|
** will be met: https://www.gnu.org/licenses/lgpl-3.0.html.
|
|
**
|
|
** GNU General Public License Usage
|
|
** Alternatively, this file may be used under the terms of the GNU
|
|
** General Public License version 2.0 or (at your option) the GNU General
|
|
** Public license version 3 or any later version approved by the KDE Free
|
|
** Qt Foundation. The licenses are as published by the Free Software
|
|
** Foundation and appearing in the file LICENSE.GPL2 and LICENSE.GPL3
|
|
** included in the packaging of this file. Please review the following
|
|
** information to ensure the GNU General Public License requirements will
|
|
** be met: https://www.gnu.org/licenses/gpl-2.0.html and
|
|
** https://www.gnu.org/licenses/gpl-3.0.html.
|
|
**
|
|
** $QT_END_LICENSE$
|
|
**
|
|
****************************************************************************/
|
|
|
|
#ifndef QFUTURE_H
|
|
#define QFUTURE_H
|
|
|
|
#include <QtCore/qglobal.h>
|
|
|
|
#ifndef QT_NO_QFUTURE
|
|
|
|
#include <QtCore/qfutureinterface.h>
|
|
#include <QtCore/qstring.h>
|
|
|
|
QT_BEGIN_NAMESPACE
|
|
|
|
|
|
template <typename T>
|
|
class QFutureWatcher;
|
|
template <>
|
|
class QFutureWatcher<void>;
|
|
|
|
template <typename T>
|
|
class QFuture
|
|
{
|
|
public:
|
|
QFuture()
|
|
: d(QFutureInterface<T>::canceledResult())
|
|
{ }
|
|
explicit QFuture(QFutureInterface<T> *p) // internal
|
|
: d(*p)
|
|
{ }
|
|
|
|
bool operator==(const QFuture &other) const { return (d == other.d); }
|
|
bool operator!=(const QFuture &other) const { return (d != other.d); }
|
|
|
|
void cancel() { d.cancel(); }
|
|
bool isCanceled() const { return d.isCanceled(); }
|
|
|
|
void setPaused(bool paused) { d.setPaused(paused); }
|
|
bool isPaused() const { return d.isPaused(); }
|
|
void pause() { setPaused(true); }
|
|
void resume() { setPaused(false); }
|
|
void togglePaused() { d.togglePaused(); }
|
|
|
|
bool isStarted() const { return d.isStarted(); }
|
|
bool isFinished() const { return d.isFinished(); }
|
|
bool isRunning() const { return d.isRunning(); }
|
|
|
|
int resultCount() const { return d.resultCount(); }
|
|
int progressValue() const { return d.progressValue(); }
|
|
int progressMinimum() const { return d.progressMinimum(); }
|
|
int progressMaximum() const { return d.progressMaximum(); }
|
|
QString progressText() const { return d.progressText(); }
|
|
void waitForFinished() { d.waitForFinished(); }
|
|
|
|
inline T result() const;
|
|
inline T resultAt(int index) const;
|
|
bool isResultReadyAt(int resultIndex) const { return d.isResultReadyAt(resultIndex); }
|
|
|
|
operator T() const { return result(); }
|
|
QList<T> results() const { return d.results(); }
|
|
|
|
class const_iterator
|
|
{
|
|
public:
|
|
typedef std::bidirectional_iterator_tag iterator_category;
|
|
typedef qptrdiff difference_type;
|
|
typedef T value_type;
|
|
typedef const T *pointer;
|
|
typedef const T &reference;
|
|
|
|
inline const_iterator() {}
|
|
inline const_iterator(QFuture const * const _future, int _index) : future(_future), index(_index) {}
|
|
inline const_iterator(const const_iterator &o) : future(o.future), index(o.index) {}
|
|
inline const_iterator &operator=(const const_iterator &o)
|
|
{ future = o.future; index = o.index; return *this; }
|
|
inline const T &operator*() const { return future->d.resultReference(index); }
|
|
inline const T *operator->() const { return future->d.resultPointer(index); }
|
|
|
|
inline bool operator!=(const const_iterator &other) const
|
|
{
|
|
if (index == -1 && other.index == -1) // comparing end != end?
|
|
return false;
|
|
if (other.index == -1)
|
|
return (future->isRunning() || (index < future->resultCount()));
|
|
return (index != other.index);
|
|
}
|
|
|
|
inline bool operator==(const const_iterator &o) const { return !operator!=(o); }
|
|
inline const_iterator &operator++() { ++index; return *this; }
|
|
inline const_iterator operator++(int) { const_iterator r = *this; ++index; return r; }
|
|
inline const_iterator &operator--() { --index; return *this; }
|
|
inline const_iterator operator--(int) { const_iterator r = *this; --index; return r; }
|
|
inline const_iterator operator+(int j) const { return const_iterator(future, index + j); }
|
|
inline const_iterator operator-(int j) const { return const_iterator(future, index - j); }
|
|
inline const_iterator &operator+=(int j) { index += j; return *this; }
|
|
inline const_iterator &operator-=(int j) { index -= j; return *this; }
|
|
private:
|
|
QFuture const * future;
|
|
int index;
|
|
};
|
|
friend class const_iterator;
|
|
typedef const_iterator ConstIterator;
|
|
|
|
const_iterator begin() const { return const_iterator(this, 0); }
|
|
const_iterator constBegin() const { return const_iterator(this, 0); }
|
|
const_iterator end() const { return const_iterator(this, -1); }
|
|
const_iterator constEnd() const { return const_iterator(this, -1); }
|
|
|
|
private:
|
|
friend class QFutureWatcher<T>;
|
|
|
|
public: // Warning: the d pointer is not documented and is considered private.
|
|
mutable QFutureInterface<T> d;
|
|
};
|
|
|
|
template <typename T>
|
|
inline T QFuture<T>::result() const
|
|
{
|
|
d.waitForResult(0);
|
|
return d.resultReference(0);
|
|
}
|
|
|
|
template <typename T>
|
|
inline T QFuture<T>::resultAt(int index) const
|
|
{
|
|
d.waitForResult(index);
|
|
return d.resultReference(index);
|
|
}
|
|
|
|
template <typename T>
|
|
inline QFuture<T> QFutureInterface<T>::future()
|
|
{
|
|
return QFuture<T>(this);
|
|
}
|
|
|
|
Q_DECLARE_SEQUENTIAL_ITERATOR(Future)
|
|
|
|
template <>
|
|
class QFuture<void>
|
|
{
|
|
public:
|
|
QFuture()
|
|
: d(QFutureInterface<void>::canceledResult())
|
|
{ }
|
|
explicit QFuture(QFutureInterfaceBase *p) // internal
|
|
: d(*p)
|
|
{ }
|
|
|
|
bool operator==(const QFuture &other) const { return (d == other.d); }
|
|
bool operator!=(const QFuture &other) const { return (d != other.d); }
|
|
|
|
#if !defined(Q_CC_XLC)
|
|
template <typename T>
|
|
QFuture(const QFuture<T> &other)
|
|
: d(other.d)
|
|
{ }
|
|
|
|
template <typename T>
|
|
QFuture<void> &operator=(const QFuture<T> &other)
|
|
{
|
|
d = other.d;
|
|
return *this;
|
|
}
|
|
#endif
|
|
|
|
void cancel() { d.cancel(); }
|
|
bool isCanceled() const { return d.isCanceled(); }
|
|
|
|
void setPaused(bool paused) { d.setPaused(paused); }
|
|
bool isPaused() const { return d.isPaused(); }
|
|
void pause() { setPaused(true); }
|
|
void resume() { setPaused(false); }
|
|
void togglePaused() { d.togglePaused(); }
|
|
|
|
bool isStarted() const { return d.isStarted(); }
|
|
bool isFinished() const { return d.isFinished(); }
|
|
bool isRunning() const { return d.isRunning(); }
|
|
|
|
int resultCount() const { return d.resultCount(); }
|
|
int progressValue() const { return d.progressValue(); }
|
|
int progressMinimum() const { return d.progressMinimum(); }
|
|
int progressMaximum() const { return d.progressMaximum(); }
|
|
QString progressText() const { return d.progressText(); }
|
|
void waitForFinished() { d.waitForFinished(); }
|
|
|
|
private:
|
|
friend class QFutureWatcher<void>;
|
|
|
|
#ifdef QFUTURE_TEST
|
|
public:
|
|
#endif
|
|
mutable QFutureInterfaceBase d;
|
|
};
|
|
|
|
inline QFuture<void> QFutureInterface<void>::future()
|
|
{
|
|
return QFuture<void>(this);
|
|
}
|
|
|
|
template <typename T>
|
|
QFuture<void> qToVoidFuture(const QFuture<T> &future)
|
|
{
|
|
return QFuture<void>(future.d);
|
|
}
|
|
|
|
QT_END_NAMESPACE
|
|
|
|
#endif // QT_NO_QFUTURE
|
|
|
|
#endif // QFUTURE_H
|