mirror of
https://github.com/simonbrunel/qtpromise.git
synced 2025-03-15 02:49:42 +08:00
272 lines
7.5 KiB
C++
272 lines
7.5 KiB
C++
/*
|
|
* Copyright (c) Simon Brunel, https://github.com/simonbrunel
|
|
*
|
|
* This source code is licensed under the MIT license found in
|
|
* the LICENSE file in the root directory of this source tree.
|
|
*/
|
|
|
|
#include "../shared/data.h"
|
|
#include "../shared/utils.h"
|
|
|
|
#include <QtPromise>
|
|
#include <QtConcurrent>
|
|
#include <QtTest>
|
|
|
|
#include <memory>
|
|
|
|
using namespace QtPromise;
|
|
|
|
class tst_helpers_resolve : public QObject
|
|
{
|
|
Q_OBJECT
|
|
|
|
private Q_SLOTS:
|
|
void value();
|
|
void noValue();
|
|
void moveRValue();
|
|
void copyLValue();
|
|
void qtSharedPtr();
|
|
void stdSharedPtr();
|
|
void typedPromise();
|
|
void voidPromise();
|
|
void typedFuture();
|
|
void voidFuture();
|
|
};
|
|
|
|
QTEST_MAIN(tst_helpers_resolve)
|
|
#include "tst_resolve.moc"
|
|
|
|
void tst_helpers_resolve::value()
|
|
{
|
|
int v0 = 42;
|
|
const int v1 = 42;
|
|
|
|
auto p0 = QtPromise::resolve(42);
|
|
auto p1 = QtPromise::resolve(v0);
|
|
auto p2 = QtPromise::resolve(v1);
|
|
|
|
Q_STATIC_ASSERT((std::is_same<decltype(p0), QPromise<int>>::value));
|
|
Q_STATIC_ASSERT((std::is_same<decltype(p1), QPromise<int>>::value));
|
|
Q_STATIC_ASSERT((std::is_same<decltype(p2), QPromise<int>>::value));
|
|
|
|
for (const auto& p : {p0, p1, p2}) {
|
|
QCOMPARE(p.isFulfilled(), true);
|
|
}
|
|
for (const auto& p : {p0, p1, p2}) {
|
|
QCOMPARE(waitForValue(p, -1), 42);
|
|
}
|
|
}
|
|
|
|
void tst_helpers_resolve::noValue()
|
|
{
|
|
auto p = QtPromise::resolve();
|
|
|
|
Q_STATIC_ASSERT((std::is_same<decltype(p), QPromise<void>>::value));
|
|
|
|
QCOMPARE(p.isFulfilled(), true);
|
|
QCOMPARE(waitForValue(p, -1, 42), 42);
|
|
}
|
|
|
|
void tst_helpers_resolve::moveRValue()
|
|
{
|
|
Data::logs().reset();
|
|
|
|
{
|
|
auto p = QtPromise::resolve(Data(42)).wait();
|
|
|
|
Q_STATIC_ASSERT((std::is_same<decltype(p), QPromise<Data>>::value));
|
|
}
|
|
|
|
QCOMPARE(Data::logs().ctor, 1);
|
|
QCOMPARE(Data::logs().copy, 0);
|
|
QCOMPARE(Data::logs().move, 1);
|
|
QCOMPARE(Data::logs().refs, 0);
|
|
}
|
|
|
|
void tst_helpers_resolve::copyLValue()
|
|
{
|
|
Data::logs().reset();
|
|
|
|
{
|
|
Data value(42);
|
|
auto p = QtPromise::resolve(value).wait();
|
|
|
|
Q_STATIC_ASSERT((std::is_same<decltype(p), QPromise<Data>>::value));
|
|
}
|
|
|
|
QCOMPARE(Data::logs().ctor, 1);
|
|
QCOMPARE(Data::logs().copy, 1);
|
|
QCOMPARE(Data::logs().move, 0);
|
|
QCOMPARE(Data::logs().refs, 0);
|
|
}
|
|
|
|
// https://github.com/simonbrunel/qtpromise/issues/6
|
|
void tst_helpers_resolve::qtSharedPtr()
|
|
{
|
|
Data::logs().reset();
|
|
|
|
QWeakPointer<Data> wptr;
|
|
|
|
{
|
|
QSharedPointer<Data> sptr0(new Data(42));
|
|
const QSharedPointer<Data> sptr1 = sptr0;
|
|
|
|
auto p0 = QtPromise::resolve(QSharedPointer<Data>(new Data(42)));
|
|
auto p1 = QtPromise::resolve(sptr0);
|
|
auto p2 = QtPromise::resolve(sptr1);
|
|
|
|
Q_STATIC_ASSERT((std::is_same<decltype(p0), QPromise<QSharedPointer<Data>>>::value));
|
|
Q_STATIC_ASSERT((std::is_same<decltype(p1), QPromise<QSharedPointer<Data>>>::value));
|
|
Q_STATIC_ASSERT((std::is_same<decltype(p2), QPromise<QSharedPointer<Data>>>::value));
|
|
|
|
QCOMPARE(waitForValue(p1, QSharedPointer<Data>()), sptr0);
|
|
QCOMPARE(waitForValue(p2, QSharedPointer<Data>()), sptr1);
|
|
|
|
wptr = sptr0;
|
|
|
|
QCOMPARE(wptr.isNull(), false);
|
|
QCOMPARE(Data::logs().refs, 2);
|
|
}
|
|
|
|
QCOMPARE(wptr.isNull(), true);
|
|
|
|
QCOMPARE(Data::logs().ctor, 2);
|
|
QCOMPARE(Data::logs().copy, 0);
|
|
QCOMPARE(Data::logs().move, 0);
|
|
QCOMPARE(Data::logs().refs, 0);
|
|
}
|
|
|
|
// https://github.com/simonbrunel/qtpromise/issues/6
|
|
void tst_helpers_resolve::stdSharedPtr()
|
|
{
|
|
Data::logs().reset();
|
|
|
|
std::weak_ptr<Data> wptr;
|
|
|
|
{
|
|
std::shared_ptr<Data> sptr0(new Data(42));
|
|
const std::shared_ptr<Data> sptr1 = sptr0;
|
|
|
|
auto p0 = QtPromise::resolve(std::shared_ptr<Data>(new Data(42)));
|
|
auto p1 = QtPromise::resolve(sptr0);
|
|
auto p2 = QtPromise::resolve(sptr1);
|
|
|
|
Q_STATIC_ASSERT((std::is_same<decltype(p0), QPromise<std::shared_ptr<Data>>>::value));
|
|
Q_STATIC_ASSERT((std::is_same<decltype(p1), QPromise<std::shared_ptr<Data>>>::value));
|
|
Q_STATIC_ASSERT((std::is_same<decltype(p2), QPromise<std::shared_ptr<Data>>>::value));
|
|
|
|
QCOMPARE(waitForValue(p1, std::shared_ptr<Data>()), sptr0);
|
|
QCOMPARE(waitForValue(p2, std::shared_ptr<Data>()), sptr1);
|
|
|
|
wptr = sptr0;
|
|
|
|
QCOMPARE(wptr.use_count(), 4l);
|
|
QCOMPARE(Data::logs().refs, 2);
|
|
}
|
|
|
|
QCOMPARE(wptr.use_count(), 0l);
|
|
|
|
QCOMPARE(Data::logs().ctor, 2);
|
|
QCOMPARE(Data::logs().copy, 0);
|
|
QCOMPARE(Data::logs().move, 0);
|
|
QCOMPARE(Data::logs().refs, 0);
|
|
}
|
|
|
|
void tst_helpers_resolve::typedPromise()
|
|
{
|
|
auto resolver = [](const QPromiseResolve<int>& resolve) {
|
|
QtPromisePrivate::qtpromise_defer([=](){
|
|
resolve(42);
|
|
});
|
|
};
|
|
|
|
QPromise<int> v0(resolver);
|
|
const QPromise<int> v1 = v0;
|
|
|
|
auto p0 = QtPromise::resolve(QPromise<int>(resolver));
|
|
auto p1 = QtPromise::resolve(v0);
|
|
auto p2 = QtPromise::resolve(v1);
|
|
|
|
Q_STATIC_ASSERT((std::is_same<decltype(p0), QPromise<int>>::value));
|
|
Q_STATIC_ASSERT((std::is_same<decltype(p1), QPromise<int>>::value));
|
|
Q_STATIC_ASSERT((std::is_same<decltype(p2), QPromise<int>>::value));
|
|
|
|
for (const auto& promise : {p0, p1, p2}) {
|
|
QCOMPARE(promise.isPending(), true);
|
|
}
|
|
for (const auto& promise : {p0, p1, p2}) {
|
|
QCOMPARE(waitForValue(promise, -1), 42);
|
|
}
|
|
}
|
|
|
|
void tst_helpers_resolve::voidPromise()
|
|
{
|
|
auto resolver = [](const QPromiseResolve<void>& resolve) {
|
|
QtPromisePrivate::qtpromise_defer([=](){
|
|
resolve();
|
|
});
|
|
};
|
|
|
|
QPromise<void> v0(resolver);
|
|
const QPromise<void> v1 = v0;
|
|
|
|
auto p0 = QtPromise::resolve(QPromise<void>(resolver));
|
|
auto p1 = QtPromise::resolve(v0);
|
|
auto p2 = QtPromise::resolve(v1);
|
|
|
|
Q_STATIC_ASSERT((std::is_same<decltype(p0), QPromise<void>>::value));
|
|
Q_STATIC_ASSERT((std::is_same<decltype(p1), QPromise<void>>::value));
|
|
Q_STATIC_ASSERT((std::is_same<decltype(p2), QPromise<void>>::value));
|
|
|
|
for (const auto& promise : {p0, p1, p2}) {
|
|
QCOMPARE(promise.isPending(), true);
|
|
}
|
|
for (const auto& promise : {p0, p1, p2}) {
|
|
QCOMPARE(waitForValue(promise, -1, 42), 42);
|
|
}
|
|
}
|
|
|
|
void tst_helpers_resolve::typedFuture()
|
|
{
|
|
auto fn = [](){ return 42; };
|
|
QFuture<int> v0 = QtConcurrent::run(fn);
|
|
const QFuture<int> v1 = v0;
|
|
|
|
auto p0 = QtPromise::resolve(QtConcurrent::run(fn));
|
|
auto p1 = QtPromise::resolve(v0);
|
|
auto p2 = QtPromise::resolve(v1);
|
|
|
|
Q_STATIC_ASSERT((std::is_same<decltype(p0), QPromise<int>>::value));
|
|
Q_STATIC_ASSERT((std::is_same<decltype(p1), QPromise<int>>::value));
|
|
Q_STATIC_ASSERT((std::is_same<decltype(p2), QPromise<int>>::value));
|
|
|
|
for (const auto& promise : {p0, p1, p2}) {
|
|
QCOMPARE(promise.isPending(), true);
|
|
}
|
|
for (const auto& promise : {p0, p1, p2}) {
|
|
QCOMPARE(waitForValue(promise, -1), 42);
|
|
}
|
|
}
|
|
|
|
void tst_helpers_resolve::voidFuture()
|
|
{
|
|
auto fn = [](){ };
|
|
QFuture<void> v0 = QtConcurrent::run(fn);
|
|
const QFuture<void> v1 = v0;
|
|
|
|
auto p0 = QtPromise::resolve(QtConcurrent::run(fn));
|
|
auto p1 = QtPromise::resolve(v0);
|
|
auto p2 = QtPromise::resolve(v1);
|
|
|
|
Q_STATIC_ASSERT((std::is_same<decltype(p0), QPromise<void>>::value));
|
|
Q_STATIC_ASSERT((std::is_same<decltype(p1), QPromise<void>>::value));
|
|
Q_STATIC_ASSERT((std::is_same<decltype(p2), QPromise<void>>::value));
|
|
|
|
for (const auto& promise : {p0, p1, p2}) {
|
|
QCOMPARE(promise.isPending(), true);
|
|
}
|
|
for (const auto& promise : {p0, p1, p2}) {
|
|
QCOMPARE(waitForValue(promise, -1, 42), 42);
|
|
}
|
|
}
|