|
1 /**************************************************************************** |
|
2 ** |
|
3 ** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies). |
|
4 ** Contact: Nokia Corporation (qt-info@nokia.com) |
|
5 ** |
|
6 ** This file is part of the examples of the Qt Toolkit. |
|
7 ** |
|
8 ** $QT_BEGIN_LICENSE:LGPL$ |
|
9 ** No Commercial Usage |
|
10 ** This file contains pre-release code and may not be distributed. |
|
11 ** You may use this file in accordance with the terms and conditions |
|
12 ** contained in the either Technology Preview License Agreement or the |
|
13 ** Beta Release License Agreement. |
|
14 ** |
|
15 ** GNU Lesser General Public License Usage |
|
16 ** Alternatively, this file may be used under the terms of the GNU Lesser |
|
17 ** General Public License version 2.1 as published by the Free Software |
|
18 ** Foundation and appearing in the file LICENSE.LGPL included in the |
|
19 ** packaging of this file. Please review the following information to |
|
20 ** ensure the GNU Lesser General Public License version 2.1 requirements |
|
21 ** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html. |
|
22 ** |
|
23 ** In addition, as a special exception, Nokia gives you certain |
|
24 ** additional rights. These rights are described in the Nokia Qt LGPL |
|
25 ** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this |
|
26 ** package. |
|
27 ** |
|
28 ** GNU General Public License Usage |
|
29 ** Alternatively, this file may be used under the terms of the GNU |
|
30 ** General Public License version 3.0 as published by the Free Software |
|
31 ** Foundation and appearing in the file LICENSE.GPL included in the |
|
32 ** packaging of this file. Please review the following information to |
|
33 ** ensure the GNU General Public License version 3.0 requirements will be |
|
34 ** met: http://www.gnu.org/copyleft/gpl.html. |
|
35 ** |
|
36 ** If you are unsure which license is appropriate for your use, please |
|
37 ** contact the sales department at http://qt.nokia.com/contact. |
|
38 ** $QT_END_LICENSE$ |
|
39 ** |
|
40 ****************************************************************************/ |
|
41 |
|
42 #include "testfunctionresult.h" |
|
43 |
|
44 TestFunctionResult::TestFunctionResult() |
|
45 : QObject(), |
|
46 mName(""), |
|
47 mBenchmarks(), |
|
48 mErrors() |
|
49 { |
|
50 } |
|
51 |
|
52 TestFunctionResult::~TestFunctionResult() |
|
53 { |
|
54 for (int i = 0; i<mBenchmarks.count(); ++i) |
|
55 delete mBenchmarks.at(i); |
|
56 mBenchmarks.clear(); |
|
57 } |
|
58 |
|
59 |
|
60 Benchmark *TestFunctionResult::createBenchmark() |
|
61 { |
|
62 Benchmark *bm = new Benchmark(); |
|
63 mBenchmarks.append(bm); |
|
64 return bm; |
|
65 } |
|
66 |
|
67 int TestFunctionResult::benchmarkCount(const QString &tag) |
|
68 { |
|
69 int count = 0; |
|
70 for (int i = 0; i < mBenchmarks.count(); ++i) { |
|
71 if (mBenchmarks.at(i)->tag() == tag) |
|
72 count++; |
|
73 } |
|
74 return count; |
|
75 } |
|
76 Benchmark* TestFunctionResult::getBenchmark(const QString &tag, const int index) |
|
77 { |
|
78 QList<Benchmark*> foundItems; |
|
79 for (int i = 0; i < mBenchmarks.count(); ++i) { |
|
80 if (mBenchmarks.at(i)->tag() == tag) |
|
81 foundItems.append(mBenchmarks.at(i)); |
|
82 } |
|
83 |
|
84 if (foundItems.count() > index) |
|
85 return foundItems.at(index); |
|
86 return 0; |
|
87 } |
|
88 |
|
89 void TestFunctionResult::addError(const QString &error) |
|
90 { |
|
91 mErrors.append(error); |
|
92 } |
|
93 |
|
94 |
|
95 QString TestFunctionResult::name() const |
|
96 { |
|
97 return mName; |
|
98 } |
|
99 |
|
100 void TestFunctionResult::setName(const QString &name) |
|
101 { |
|
102 mName = name; |
|
103 } |
|
104 |
|
105 |
|
106 Benchmarks* TestFunctionResult::benchmarks() |
|
107 { |
|
108 return &mBenchmarks; |
|
109 } |
|
110 |
|
111 QStringList& TestFunctionResult::errors() |
|
112 { |
|
113 return mErrors; |
|
114 } |