1 /****************************************************************************
2 **
3 ** Copyright (C) 2015 The Qt Company Ltd.
4 ** Contact: http://www.qt.io/licensing/
5 **
6 ** This file is part of the test suite of the Qt Toolkit.
7 **
8 ** $QT_BEGIN_LICENSE:LGPL$
9 ** Commercial License Usage
10 ** Licensees holding valid commercial Qt licenses may use this file in
11 ** accordance with the commercial license agreement provided with the
12 ** Software or, alternatively, in accordance with the terms contained in
13 ** a written agreement between you and The Qt Company. For licensing terms
14 ** and conditions see http://www.qt.io/terms-conditions. For further
15 ** information use the contact form at http://www.qt.io/contact-us.
16 **
17 ** GNU Lesser General Public License Usage
18 ** Alternatively, this file may be used under the terms of the GNU Lesser
19 ** General Public License version 2.1 or version 3 as published by the Free
20 ** Software Foundation and appearing in the file LICENSE.LGPLv21 and
21 ** LICENSE.LGPLv3 included in the packaging of this file. Please review the
22 ** following information to ensure the GNU Lesser General Public License
23 ** requirements will be met: https://www.gnu.org/licenses/lgpl.html and
24 ** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
25 **
26 ** As a special exception, The Qt Company gives you certain additional
27 ** rights. These rights are described in The Qt Company LGPL Exception
28 ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
29 **
30 ** GNU General Public License Usage
31 ** Alternatively, this file may be used under the terms of the GNU
32 ** General Public License version 3.0 as published by the Free Software
33 ** Foundation and appearing in the file LICENSE.GPL included in the
34 ** packaging of this file. Please review the following information to
35 ** ensure the GNU General Public License version 3.0 requirements will be
36 ** met: http://www.gnu.org/copyleft/gpl.html.
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
TestContainer()49 TestContainer::TestContainer() : m_deleteChildren(true)
50 {
51 }
52
~TestContainer()53 TestContainer::~TestContainer()
54 {
55 if(m_deleteChildren)
56 qDeleteAll(m_children);
57 }
58
execute(const ExecutionStage stage,TestSuite * ts)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
resultSummary() const72 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
children() const89 TreeItem::List TestContainer::children() const
90 {
91 return m_children;
92 }
93
appendChild(TreeItem * item)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
child(const unsigned int rowP) const101 TreeItem *TestContainer::child(const unsigned int rowP) const
102 {
103 return m_children.value(rowP);
104 }
105
childCount() const106 unsigned int TestContainer::childCount() const
107 {
108 return m_children.count();
109 }
110
setTitle(const QString & titleP)111 void TestContainer::setTitle(const QString &titleP)
112 {
113 m_title = titleP;
114 }
115
title() const116 QString TestContainer::title() const
117 {
118 return m_title;
119 }
120
isFinalNode() const121 bool TestContainer::isFinalNode() const
122 {
123 return false;
124 }
125
columnCount() const126 int TestContainer::columnCount() const
127 {
128 return 4;
129 }
130
description() const131 QString TestContainer::description() const
132 {
133 return m_description;
134 }
135
setDescription(const QString & desc)136 void TestContainer::setDescription(const QString &desc)
137 {
138 m_description = desc;
139 }
140
setDeleteChildren(const bool val)141 void TestContainer::setDeleteChildren(const bool val)
142 {
143 m_deleteChildren = val;
144 }
145
removeLast()146 void TestContainer::removeLast()
147 {
148 m_children.removeLast();
149 }
150
151 // vim: et:ts=4:sw=4:sts=4
152