forked from qt-creator/qt-creator
98 lines
3.5 KiB
C++
98 lines
3.5 KiB
C++
|
|
/****************************************************************************
|
||
|
|
**
|
||
|
|
** Copyright (C) 2016 The Qt Company Ltd.
|
||
|
|
** Contact: https://www.qt.io/licensing/
|
||
|
|
**
|
||
|
|
** This file is part of Qt Creator.
|
||
|
|
**
|
||
|
|
** 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 General Public License Usage
|
||
|
|
** Alternatively, this file may be used under the terms of the GNU
|
||
|
|
** General Public License version 3 as published by the Free Software
|
||
|
|
** Foundation with exceptions as appearing in the file LICENSE.GPL3-EXCEPT
|
||
|
|
** 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-3.0.html.
|
||
|
|
**
|
||
|
|
****************************************************************************/
|
||
|
|
|
||
|
|
#include <utils/algorithm.h>
|
||
|
|
#include <utils/mapreduce.h>
|
||
|
|
|
||
|
|
#include <QtTest>
|
||
|
|
|
||
|
|
class tst_MapReduce : public QObject
|
||
|
|
{
|
||
|
|
Q_OBJECT
|
||
|
|
|
||
|
|
private slots:
|
||
|
|
void mapReduce();
|
||
|
|
};
|
||
|
|
|
||
|
|
static int returnxx(int x)
|
||
|
|
{
|
||
|
|
return x*x;
|
||
|
|
}
|
||
|
|
|
||
|
|
static void returnxxThroughFutureInterface(QFutureInterface<int> &fi, int x)
|
||
|
|
{
|
||
|
|
fi.reportResult(x*x);
|
||
|
|
}
|
||
|
|
|
||
|
|
void tst_MapReduce::mapReduce()
|
||
|
|
{
|
||
|
|
const auto dummyInit = [](QFutureInterface<double>& fi) -> double {
|
||
|
|
fi.reportResult(0.);
|
||
|
|
return 0.;
|
||
|
|
};
|
||
|
|
const auto reduceWithFutureInterface = [](QFutureInterface<double>& fi, double &state, int value) {
|
||
|
|
state += value;
|
||
|
|
fi.reportResult(value);
|
||
|
|
};
|
||
|
|
const auto reduceWithReturn = [](double &state, int value) -> double {
|
||
|
|
state += value;
|
||
|
|
return value;
|
||
|
|
};
|
||
|
|
const auto cleanupHalfState = [](QFutureInterface<double> &fi, double &state) {
|
||
|
|
state /= 2.;
|
||
|
|
fi.reportResult(state);
|
||
|
|
};
|
||
|
|
|
||
|
|
// TODO: cannot use function returnxx without pointer here because of decayCopy of arguments in runAsync
|
||
|
|
{
|
||
|
|
QList<double> results = Utils::mapReduce(QList<int>({1, 2, 3, 4, 5}),
|
||
|
|
dummyInit, &returnxx,
|
||
|
|
reduceWithFutureInterface, cleanupHalfState)
|
||
|
|
.results();
|
||
|
|
Utils::sort(results); // mapping order is undefined
|
||
|
|
QCOMPARE(results, QList<double>({0., 1., 4., 9., 16., 25., 27.5}));
|
||
|
|
}
|
||
|
|
{
|
||
|
|
QList<double> results = Utils::mapReduce(QList<int>({1, 2, 3, 4, 5}),
|
||
|
|
dummyInit, &returnxxThroughFutureInterface,
|
||
|
|
reduceWithFutureInterface, cleanupHalfState)
|
||
|
|
.results();
|
||
|
|
Utils::sort(results); // mapping order is undefined
|
||
|
|
QCOMPARE(results, QList<double>({0., 1., 4., 9., 16., 25., 27.5}));
|
||
|
|
}
|
||
|
|
{
|
||
|
|
QList<double> results = Utils::mapReduce(QList<int>({1, 2, 3, 4, 5}),
|
||
|
|
dummyInit, &returnxx,
|
||
|
|
reduceWithReturn, cleanupHalfState)
|
||
|
|
.results();
|
||
|
|
Utils::sort(results); // mapping order is undefined
|
||
|
|
QCOMPARE(results, QList<double>({0., 1., 4., 9., 16., 25., 27.5}));
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
QTEST_MAIN(tst_MapReduce)
|
||
|
|
|
||
|
|
#include "tst_mapreduce.moc"
|