blob: 55915a4204f1fb4c307027d92994d468bf797e67 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
|
/****************************************************************************
**
** 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 <QPair>
#include <QtDebug>
#include "TestContainer.h"
using namespace QPatternistSDK;
TestContainer::TestContainer() : m_deleteChildren(true)
{
}
TestContainer::~TestContainer()
{
if(m_deleteChildren)
qDeleteAll(m_children);
}
TestResult::List TestContainer::execute(const ExecutionStage stage,
TestSuite *ts)
{
Q_ASSERT(ts);
const unsigned int c = m_children.count();
TestResult::List result;
for(unsigned int i = 0; i != c; ++i)
result += static_cast<TestItem *>(child(i))->execute(stage, ts);
return result;
}
TestItem::ResultSummary TestContainer::resultSummary() const
{
const int c = childCount();
int total = 0;
int pass = 0;
for(int i = 0; i != c; ++i)
{
TestItem *t = static_cast<TestItem *>(child(i));
const ResultSummary sum(t->resultSummary());
pass += sum.first;
total += sum.second;
}
return ResultSummary(pass, total);
}
TreeItem::List TestContainer::children() const
{
return m_children;
}
void TestContainer::appendChild(TreeItem *item)
{
/* When one of our children changes, we changes. */
connect(item, SIGNAL(changed(TreeItem *)), SIGNAL(changed(TreeItem *)));
m_children.append(item);
}
TreeItem *TestContainer::child(const unsigned int rowP) const
{
return m_children.value(rowP);
}
unsigned int TestContainer::childCount() const
{
return m_children.count();
}
void TestContainer::setTitle(const QString &titleP)
{
m_title = titleP;
}
QString TestContainer::title() const
{
return m_title;
}
bool TestContainer::isFinalNode() const
{
return false;
}
int TestContainer::columnCount() const
{
return 4;
}
QString TestContainer::description() const
{
return m_description;
}
void TestContainer::setDescription(const QString &desc)
{
m_description = desc;
}
void TestContainer::setDeleteChildren(const bool val)
{
m_deleteChildren = val;
}
void TestContainer::removeLast()
{
m_children.removeLast();
}
// vim: et:ts=4:sw=4:sts=4
|
