mirror of https://github.com/qt/qtbase.git
172 lines
4.7 KiB
C++
172 lines
4.7 KiB
C++
/****************************************************************************
|
|
**
|
|
** Copyright (C) 2013 Digia Plc and/or its subsidiary(-ies).
|
|
** Contact: http://www.qt-project.org/legal
|
|
**
|
|
** This file is part of the test suite 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 Digia. For licensing terms and
|
|
** conditions see http://qt.digia.com/licensing. For further information
|
|
** use the contact form at http://qt.digia.com/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 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, Digia gives you certain additional
|
|
** rights. These rights are described in the Digia 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.
|
|
**
|
|
**
|
|
** $QT_END_LICENSE$
|
|
**
|
|
****************************************************************************/
|
|
|
|
#include "main.h"
|
|
|
|
#include <QFile>
|
|
#include <QHash>
|
|
#include <QString>
|
|
#include <QStringList>
|
|
#include <QUuid>
|
|
#include <QTest>
|
|
|
|
|
|
class tst_QHash : public QObject
|
|
{
|
|
Q_OBJECT
|
|
|
|
private slots:
|
|
void initTestCase();
|
|
void qhash_qt4_data() { data(); }
|
|
void qhash_qt4();
|
|
void javaString_data() { data(); }
|
|
void javaString();
|
|
|
|
private:
|
|
void data();
|
|
|
|
QStringList smallFilePaths;
|
|
QStringList uuids;
|
|
QStringList dict;
|
|
QStringList numbers;
|
|
};
|
|
|
|
///////////////////// QHash /////////////////////
|
|
|
|
#include <QDebug>
|
|
|
|
void tst_QHash::initTestCase()
|
|
{
|
|
// small list of file paths
|
|
QFile smallPathsData("paths_small_data.txt");
|
|
QVERIFY(smallPathsData.open(QIODevice::ReadOnly));
|
|
smallFilePaths = QString::fromLatin1(smallPathsData.readAll()).split(QLatin1Char('\n'));
|
|
QVERIFY(!smallFilePaths.isEmpty());
|
|
|
|
// list of UUIDs
|
|
// guaranteed to be completely random, generated by http://xkcd.com/221/
|
|
QUuid ns = QUuid("{f43d2ef3-2fe9-4563-a6f5-5a0100c2d699}");
|
|
uuids.reserve(smallFilePaths.size());
|
|
|
|
foreach (const QString &path, smallFilePaths)
|
|
uuids.append(QUuid::createUuidV5(ns, path).toString());
|
|
|
|
|
|
// lots of strings with alphabetical characters, vaguely reminiscent of
|
|
// a dictionary.
|
|
//
|
|
// this programatically generates a series like:
|
|
// AAAAAA
|
|
// AAAAAB
|
|
// AAAAAC
|
|
// ...
|
|
// AAAAAZ
|
|
// AAAABZ
|
|
// ...
|
|
// AAAAZZ
|
|
// AAABZZ
|
|
QByteArray id("AAAAAAA");
|
|
|
|
if (dict.isEmpty()) {
|
|
for (int i = id.length() - 1; i > 0;) {
|
|
dict.append(id);
|
|
char c = id.at(i);
|
|
id[i] = ++c;
|
|
|
|
if (c == 'Z') {
|
|
// wrap to next digit
|
|
i--;
|
|
id[i] = 'A';
|
|
}
|
|
}
|
|
}
|
|
|
|
// string versions of numbers.
|
|
for (int i = 5000000; i < 5005001; ++i)
|
|
numbers.append(QString::number(i));
|
|
}
|
|
|
|
void tst_QHash::data()
|
|
{
|
|
QTest::addColumn<QStringList>("items");
|
|
QTest::newRow("paths-small") << smallFilePaths;
|
|
QTest::newRow("uuids-list") << uuids;
|
|
QTest::newRow("dictionary") << dict;
|
|
QTest::newRow("numbers") << numbers;
|
|
}
|
|
|
|
void tst_QHash::qhash_qt4()
|
|
{
|
|
QFETCH(QStringList, items);
|
|
QHash<Qt4String, int> hash;
|
|
|
|
QList<Qt4String> realitems;
|
|
foreach (const QString &s, items)
|
|
realitems.append(s);
|
|
|
|
QBENCHMARK {
|
|
for (int i = 0, n = realitems.size(); i != n; ++i) {
|
|
hash[realitems.at(i)] = i;
|
|
}
|
|
}
|
|
}
|
|
|
|
void tst_QHash::javaString()
|
|
{
|
|
QFETCH(QStringList, items);
|
|
QHash<JavaString, int> hash;
|
|
|
|
QList<JavaString> realitems;
|
|
foreach (const QString &s, items)
|
|
realitems.append(s);
|
|
|
|
QBENCHMARK {
|
|
for (int i = 0, n = realitems.size(); i != n; ++i) {
|
|
hash[realitems.at(i)] = i;
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
QTEST_MAIN(tst_QHash)
|
|
|
|
#include "main.moc"
|