/****************************************************************************

**

** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).

** All rights reserved.

** Contact: Nokia Corporation (qt-info@nokia.com)

**

** This file is part of the test suite of the Qt Toolkit.

**

** $QT_BEGIN_LICENSE:LGPL$

** No Commercial Usage

** This file contains pre-release code and may not be distributed.

** You may use this file in accordance with the terms and conditions

** contained in the Technology Preview License Agreement accompanying

** this package.

**

** 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, Nokia gives you certain additional

** rights.  These rights are described in the Nokia Qt LGPL Exception

** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.

**

** If you have questions regarding the use of this file, please contact

** Nokia at qt-info@nokia.com.

**

**

**

**

**

**

**

**

** $QT_END_LICENSE$

**

****************************************************************************/

#include <QtGui>

#include <QString>

#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(("hash--" + sizeString).constData()) << true << size;

        QTest::newRow(("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(("hash--" + sizeString).constData()) << true << size;

        QTest::newRow(("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);

    }

}

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 "main.moc"