2013-10-09 17:11:18 -04:00
|
|
|
/*
|
|
|
|
* Copyright (C) 2013 Felix Geyer <debfx@fobos.de>
|
|
|
|
*
|
|
|
|
* This program is free software: you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License as published by
|
|
|
|
* the Free Software Foundation, either version 2 or (at your option)
|
|
|
|
* version 3 of the License.
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*/
|
|
|
|
|
2018-10-01 10:26:24 -04:00
|
|
|
#include "TestRandomGenerator.h"
|
2018-01-24 07:22:20 -05:00
|
|
|
#include "TestGlobal.h"
|
2013-10-09 17:11:18 -04:00
|
|
|
#include "core/Endian.h"
|
2015-07-24 12:28:12 -04:00
|
|
|
#include "core/Global.h"
|
2018-10-01 10:26:24 -04:00
|
|
|
#include "stub/TestRandom.h"
|
2013-10-09 17:11:18 -04:00
|
|
|
|
2018-10-01 10:26:24 -04:00
|
|
|
#include <QTest>
|
2014-05-16 06:32:52 -04:00
|
|
|
|
2018-10-01 10:26:24 -04:00
|
|
|
QTEST_GUILESS_MAIN(TestRandomGenerator)
|
|
|
|
|
|
|
|
void TestRandomGenerator::initTestCase()
|
|
|
|
{
|
|
|
|
m_backend = new RandomBackendPreset();
|
|
|
|
|
|
|
|
TestRandom::setup(m_backend);
|
|
|
|
}
|
|
|
|
|
|
|
|
void TestRandomGenerator::cleanupTestCase()
|
2013-10-09 17:11:18 -04:00
|
|
|
{
|
2018-10-01 10:26:24 -04:00
|
|
|
TestRandom::teardown();
|
2013-10-09 17:11:18 -04:00
|
|
|
|
2018-10-01 10:26:24 -04:00
|
|
|
m_backend = nullptr;
|
2013-10-09 17:11:18 -04:00
|
|
|
}
|
|
|
|
|
2018-10-01 10:26:24 -04:00
|
|
|
void TestRandomGenerator::testUInt()
|
2013-10-09 17:11:18 -04:00
|
|
|
{
|
|
|
|
QByteArray nextBytes;
|
|
|
|
|
2018-01-01 13:20:31 -05:00
|
|
|
nextBytes = Endian::sizedIntToBytes(42, QSysInfo::ByteOrder);
|
2013-10-09 17:11:18 -04:00
|
|
|
m_backend->setNextBytes(nextBytes);
|
|
|
|
QCOMPARE(randomGen()->randomUInt(100), 42U);
|
|
|
|
|
2018-01-01 13:20:31 -05:00
|
|
|
nextBytes = Endian::sizedIntToBytes(117, QSysInfo::ByteOrder);
|
2013-10-09 17:11:18 -04:00
|
|
|
m_backend->setNextBytes(nextBytes);
|
|
|
|
QCOMPARE(randomGen()->randomUInt(100), 17U);
|
|
|
|
|
2018-01-01 13:20:31 -05:00
|
|
|
nextBytes = Endian::sizedIntToBytes(1001, QSysInfo::ByteOrder);
|
2013-10-09 17:11:18 -04:00
|
|
|
m_backend->setNextBytes(nextBytes);
|
|
|
|
QCOMPARE(randomGen()->randomUInt(1), 0U);
|
|
|
|
|
|
|
|
nextBytes.clear();
|
2018-01-01 13:20:31 -05:00
|
|
|
nextBytes.append(Endian::sizedIntToBytes(QUINT32_MAX, QSysInfo::ByteOrder));
|
|
|
|
nextBytes.append(Endian::sizedIntToBytes(QUINT32_MAX - 70000U, QSysInfo::ByteOrder));
|
2013-10-09 17:11:18 -04:00
|
|
|
m_backend->setNextBytes(nextBytes);
|
2013-10-12 13:11:57 -04:00
|
|
|
QCOMPARE(randomGen()->randomUInt(100000U), (QUINT32_MAX - 70000U) % 100000U);
|
2013-10-09 17:11:18 -04:00
|
|
|
|
|
|
|
nextBytes.clear();
|
|
|
|
for (int i = 0; i < 10000; i++) {
|
2018-01-01 13:20:31 -05:00
|
|
|
nextBytes.append(Endian::sizedIntToBytes((QUINT32_MAX / 2U) + 1U + i, QSysInfo::ByteOrder));
|
2013-10-09 17:11:18 -04:00
|
|
|
}
|
2018-01-01 13:20:31 -05:00
|
|
|
nextBytes.append(Endian::sizedIntToBytes(QUINT32_MAX / 2U, QSysInfo::ByteOrder));
|
2013-10-09 17:11:18 -04:00
|
|
|
m_backend->setNextBytes(nextBytes);
|
2013-10-12 13:11:57 -04:00
|
|
|
QCOMPARE(randomGen()->randomUInt((QUINT32_MAX / 2U) + 1U), QUINT32_MAX / 2U);
|
2013-10-09 17:11:18 -04:00
|
|
|
}
|
|
|
|
|
2018-10-01 10:26:24 -04:00
|
|
|
void TestRandomGenerator::testUIntRange()
|
2013-10-09 17:11:18 -04:00
|
|
|
{
|
|
|
|
QByteArray nextBytes;
|
|
|
|
|
2018-01-01 13:20:31 -05:00
|
|
|
nextBytes = Endian::sizedIntToBytes(42, QSysInfo::ByteOrder);
|
2013-10-09 17:11:18 -04:00
|
|
|
m_backend->setNextBytes(nextBytes);
|
|
|
|
QCOMPARE(randomGen()->randomUIntRange(100, 200), 142U);
|
|
|
|
}
|