summaryrefslogtreecommitdiffstats
path: root/tests/benchmarks/corelib/tools/containers-associative/tst_bench_containers_associative.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'tests/benchmarks/corelib/tools/containers-associative/tst_bench_containers_associative.cpp')
-rw-r--r--tests/benchmarks/corelib/tools/containers-associative/tst_bench_containers_associative.cpp108
1 files changed, 108 insertions, 0 deletions
diff --git a/tests/benchmarks/corelib/tools/containers-associative/tst_bench_containers_associative.cpp b/tests/benchmarks/corelib/tools/containers-associative/tst_bench_containers_associative.cpp
new file mode 100644
index 0000000000..a5618cfcaf
--- /dev/null
+++ b/tests/benchmarks/corelib/tools/containers-associative/tst_bench_containers_associative.cpp
@@ -0,0 +1,108 @@
+// Copyright (C) 2016 The Qt Company Ltd.
+// SPDX-License-Identifier: LicenseRef-Qt-Commercial OR GPL-3.0-only
+#include <QString>
+#include <QMap>
+#include <QHash>
+
+#include <qtest.h>
+
+class tst_associative_containers : public QObject
+{
+ Q_OBJECT
+private slots:
+ void insert_data();
+ void insert();
+ void lookup_data();
+ void lookup();
+};
+
+template <typename T>
+void testInsert(int size)
+{
+ T container;
+
+ QBENCHMARK {
+ for (int i = 0; i < size; ++i)
+ container.insert(i, i);
+ }
+}
+
+void tst_associative_containers::insert_data()
+{
+ QTest::addColumn<bool>("useHash");
+ QTest::addColumn<int>("size");
+
+ for (int size = 10; size < 20000; size += 100) {
+
+ const QByteArray sizeString = QByteArray::number(size);
+
+ QTest::newRow(QByteArray("hash--" + sizeString).constData()) << true << size;
+ QTest::newRow(QByteArray("map--" + sizeString).constData()) << false << size;
+ }
+}
+
+void tst_associative_containers::insert()
+{
+ QFETCH(bool, useHash);
+ QFETCH(int, size);
+
+ QHash<int, int> testHash;
+ QMap<int, int> testMap;
+
+ if (useHash) {
+ testInsert<QHash<int, int> >(size);
+ } else {
+ testInsert<QMap<int, int> >(size);
+ }
+}
+
+void tst_associative_containers::lookup_data()
+{
+// setReportType(LineChartReport);
+// setChartTitle("Time to call value(), with an increasing number of items in the container");
+
+ QTest::addColumn<bool>("useHash");
+ QTest::addColumn<int>("size");
+
+ for (int size = 10; size < 20000; size += 100) {
+
+ const QByteArray sizeString = QByteArray::number(size);
+
+ QTest::newRow(QByteArray("hash--" + sizeString).constData()) << true << size;
+ QTest::newRow(QByteArray("map--" + sizeString).constData()) << false << size;
+ }
+}
+
+template <typename T>
+void testLookup(int size)
+{
+ T container;
+
+ for (int i = 0; i < size; ++i)
+ container.insert(i, i);
+
+ int val;
+
+ QBENCHMARK {
+ for (int i = 0; i < size; ++i)
+ val = container.value(i);
+
+ }
+ Q_UNUSED(val);
+}
+
+void tst_associative_containers::lookup()
+{
+ QFETCH(bool, useHash);
+ QFETCH(int, size);
+
+ if (useHash) {
+ testLookup<QHash<int, int> >(size);
+ } else {
+ testLookup<QMap<int, int> >(size);
+ }
+}
+
+QTEST_MAIN(tst_associative_containers)
+
+#include "tst_bench_containers_associative.moc"