/**************************************************************************** ** ** Copyright (C) 2012 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 #include class tst_associative_containers : public QObject { Q_OBJECT private slots: void insert_data(); void insert(); void lookup_data(); void lookup(); }; template 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("useHash"); QTest::addColumn("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 testHash; QMap testMap; if (useHash) { testInsert >(size); } else { testInsert >(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("useHash"); QTest::addColumn("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 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); } } void tst_associative_containers::lookup() { QFETCH(bool, useHash); QFETCH(int, size); if (useHash) { testLookup >(size); } else { testLookup >(size); } } QTEST_MAIN(tst_associative_containers) #include "main.moc"