|
1 /**************************************************************************** |
|
2 ** |
|
3 ** Copyright (C) 2010 Nokia Corporation and/or its subsidiary(-ies). |
|
4 ** All rights reserved. |
|
5 ** Contact: Nokia Corporation (qt-info@nokia.com) |
|
6 ** |
|
7 ** This file is part of the test suite of the Qt Toolkit. |
|
8 ** |
|
9 ** $QT_BEGIN_LICENSE:LGPL$ |
|
10 ** No Commercial Usage |
|
11 ** This file contains pre-release code and may not be distributed. |
|
12 ** You may use this file in accordance with the terms and conditions |
|
13 ** contained in the Technology Preview License Agreement accompanying |
|
14 ** this package. |
|
15 ** |
|
16 ** GNU Lesser General Public License Usage |
|
17 ** Alternatively, this file may be used under the terms of the GNU Lesser |
|
18 ** General Public License version 2.1 as published by the Free Software |
|
19 ** Foundation and appearing in the file LICENSE.LGPL included in the |
|
20 ** packaging of this file. Please review the following information to |
|
21 ** ensure the GNU Lesser General Public License version 2.1 requirements |
|
22 ** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html. |
|
23 ** |
|
24 ** In addition, as a special exception, Nokia gives you certain additional |
|
25 ** rights. These rights are described in the Nokia Qt LGPL Exception |
|
26 ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package. |
|
27 ** |
|
28 ** If you have questions regarding the use of this file, please contact |
|
29 ** Nokia at qt-info@nokia.com. |
|
30 ** |
|
31 ** |
|
32 ** |
|
33 ** |
|
34 ** |
|
35 ** |
|
36 ** |
|
37 ** |
|
38 ** $QT_END_LICENSE$ |
|
39 ** |
|
40 ****************************************************************************/ |
|
41 |
|
42 #include <QPair> |
|
43 #include <QtDebug> |
|
44 |
|
45 #include "TestContainer.h" |
|
46 |
|
47 using namespace QPatternistSDK; |
|
48 |
|
49 TestContainer::TestContainer() : m_deleteChildren(true) |
|
50 { |
|
51 } |
|
52 |
|
53 TestContainer::~TestContainer() |
|
54 { |
|
55 if(m_deleteChildren) |
|
56 qDeleteAll(m_children); |
|
57 } |
|
58 |
|
59 TestResult::List TestContainer::execute(const ExecutionStage stage, |
|
60 TestSuite *ts) |
|
61 { |
|
62 Q_ASSERT(ts); |
|
63 const unsigned int c = m_children.count(); |
|
64 TestResult::List result; |
|
65 |
|
66 for(unsigned int i = 0; i != c; ++i) |
|
67 result += static_cast<TestItem *>(child(i))->execute(stage, ts); |
|
68 |
|
69 return result; |
|
70 } |
|
71 |
|
72 TestItem::ResultSummary TestContainer::resultSummary() const |
|
73 { |
|
74 const int c = childCount(); |
|
75 int total = 0; |
|
76 int pass = 0; |
|
77 |
|
78 for(int i = 0; i != c; ++i) |
|
79 { |
|
80 TestItem *t = static_cast<TestItem *>(child(i)); |
|
81 const ResultSummary sum(t->resultSummary()); |
|
82 pass += sum.first; |
|
83 total += sum.second; |
|
84 } |
|
85 |
|
86 return ResultSummary(pass, total); |
|
87 } |
|
88 |
|
89 TreeItem::List TestContainer::children() const |
|
90 { |
|
91 return m_children; |
|
92 } |
|
93 |
|
94 void TestContainer::appendChild(TreeItem *item) |
|
95 { |
|
96 /* When one of our children changes, we changes. */ |
|
97 connect(item, SIGNAL(changed(TreeItem *)), SIGNAL(changed(TreeItem *))); |
|
98 m_children.append(item); |
|
99 } |
|
100 |
|
101 TreeItem *TestContainer::child(const unsigned int rowP) const |
|
102 { |
|
103 return m_children.value(rowP); |
|
104 } |
|
105 |
|
106 unsigned int TestContainer::childCount() const |
|
107 { |
|
108 return m_children.count(); |
|
109 } |
|
110 |
|
111 void TestContainer::setTitle(const QString &titleP) |
|
112 { |
|
113 m_title = titleP; |
|
114 } |
|
115 |
|
116 QString TestContainer::title() const |
|
117 { |
|
118 return m_title; |
|
119 } |
|
120 |
|
121 bool TestContainer::isFinalNode() const |
|
122 { |
|
123 return false; |
|
124 } |
|
125 |
|
126 int TestContainer::columnCount() const |
|
127 { |
|
128 return 4; |
|
129 } |
|
130 |
|
131 QString TestContainer::description() const |
|
132 { |
|
133 return m_description; |
|
134 } |
|
135 |
|
136 void TestContainer::setDescription(const QString &desc) |
|
137 { |
|
138 m_description = desc; |
|
139 } |
|
140 |
|
141 void TestContainer::setDeleteChildren(const bool val) |
|
142 { |
|
143 m_deleteChildren = val; |
|
144 } |
|
145 |
|
146 void TestContainer::removeLast() |
|
147 { |
|
148 m_children.removeLast(); |
|
149 } |
|
150 |
|
151 // vim: et:ts=4:sw=4:sts=4 |