/**************************************************************************** ** ** Copyright (C) 2016 The Qt Company Ltd. ** Contact: https://www.qt.io/licensing/ ** ** This file is part of the test suite of the Qt Toolkit. ** ** $QT_BEGIN_LICENSE:GPL-EXCEPT$ ** 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. ** ** $QT_END_LICENSE$ ** ****************************************************************************/ // This file contains benchmarks for comparing QVector against std::vector #include #include #include #include template // T is the item type class UseCases { public: virtual ~UseCases() {} // Use case: Insert \a size items into the vector. virtual void insert(int size) = 0; // Use case: Lookup \a size items from the vector. virtual void lookup(int size) = 0; }; template T * f(T *ts) // dummy function to prevent code from being optimized away by the compiler { return ts; } // This subclass implements the use cases using QVector as efficiently as possible. template class UseCases_QVector : public UseCases { void insert(int size) { QVector v; T t; QBENCHMARK { for (int i = 0; i < size; ++i) v.append(t); } } void lookup(int size) { QVector v; T t; for (int i = 0; i < size; ++i) v.append(t); T *ts = new T[size]; QBENCHMARK { for (int i = 0; i < size; ++i) ts[i] = v.value(i); } f(ts); delete[] ts; } }; // This subclass implements the use cases using std::vector as efficiently as possible. template class UseCases_stdvector : public UseCases { void insert(int size) { std::vector v; T t; QBENCHMARK { for (int i = 0; i < size; ++i) v.push_back(t); } } void lookup(int size) { std::vector v; T t; for (int i = 0; i < size; ++i) v.push_back(t); T *ts = new T[size]; QBENCHMARK { for (int i = 0; i < size; ++i) ts[i] = v[i]; } f(ts); delete[] ts; } }; struct Large { // A "large" item type int x[1000]; }; #define LARGE_MAX_SIZE 20000 class tst_vector_vs_std : public QObject { Q_OBJECT public: tst_vector_vs_std() { useCases_QVector_int = new UseCases_QVector; useCases_stdvector_int = new UseCases_stdvector; useCases_QVector_Large = new UseCases_QVector; useCases_stdvector_Large = new UseCases_stdvector; } private: UseCases *useCases_QVector_int; UseCases *useCases_stdvector_int; UseCases *useCases_QVector_Large; UseCases *useCases_stdvector_Large; private slots: void insert_int_data(); void insert_int(); void insert_Large_data(); void insert_Large(); void lookup_int_data(); void lookup_int(); void lookup_Large_data(); void lookup_Large(); }; void tst_vector_vs_std::insert_int_data() { QTest::addColumn("useStd"); QTest::addColumn("size"); for (int size = 10; size < 20000; size += 100) { const QByteArray sizeString = QByteArray::number(size); QTest::newRow(QByteArray("std::vector-int--" + sizeString).constData()) << true << size; QTest::newRow(QByteArray("QVector-int--" + sizeString).constData()) << false << size; } } void tst_vector_vs_std::insert_int() { QFETCH(bool, useStd); QFETCH(int, size); if (useStd) useCases_stdvector_int->insert(size); else useCases_QVector_int->insert(size); } void tst_vector_vs_std::insert_Large_data() { QTest::addColumn("useStd"); QTest::addColumn("size"); for (int size = 10; size < LARGE_MAX_SIZE; size += 100) { const QByteArray sizeString = QByteArray::number(size); QTest::newRow(QByteArray("std::vector-Large--" + sizeString).constData()) << true << size; QTest::newRow(QByteArray("QVector-Large--" + sizeString).constData()) << false << size; } } void tst_vector_vs_std::insert_Large() { QFETCH(bool, useStd); QFETCH(int, size); if (useStd) useCases_stdvector_Large->insert(size); else useCases_QVector_Large->insert(size); } void tst_vector_vs_std::lookup_int_data() { QTest::addColumn("useStd"); QTest::addColumn("size"); for (int size = 10; size < 20000; size += 100) { const QByteArray sizeString = QByteArray::number(size); QTest::newRow(QByteArray("std::vector-int--" + sizeString).constData()) << true << size; QTest::newRow(QByteArray("QVector-int--" + sizeString).constData()) << false << size; } } void tst_vector_vs_std::lookup_int() { QFETCH(bool, useStd); QFETCH(int, size); if (useStd) useCases_stdvector_int->lookup(size); else useCases_QVector_int->lookup(size); } void tst_vector_vs_std::lookup_Large_data() { QTest::addColumn("useStd"); QTest::addColumn("size"); for (int size = 10; size < LARGE_MAX_SIZE; size += 100) { const QByteArray sizeString = QByteArray::number(size); QTest::newRow(QByteArray("std::vector-Large--" + sizeString).constData()) << true << size; QTest::newRow(QByteArray("QVector-Large--" + sizeString).constData()) << false << size; } } void tst_vector_vs_std::lookup_Large() { QFETCH(bool, useStd); QFETCH(int, size); if (useStd) useCases_stdvector_Large->lookup(size); else useCases_QVector_Large->lookup(size); } QTEST_MAIN(tst_vector_vs_std) #include "main.moc"