1 /****************************************************************************
3 ** Copyright (C) 2012 Nokia Corporation and/or its subsidiary(-ies).
4 ** Contact: http://www.qt-project.org/
6 ** This file is part of the test suite of the Qt Toolkit.
8 ** $QT_BEGIN_LICENSE:LGPL$
9 ** GNU Lesser General Public License Usage
10 ** This file may be used under the terms of the GNU Lesser General Public
11 ** License version 2.1 as published by the Free Software Foundation and
12 ** appearing in the file LICENSE.LGPL included in the packaging of this
13 ** file. Please review the following information to ensure the GNU Lesser
14 ** General Public License version 2.1 requirements will be met:
15 ** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
17 ** In addition, as a special exception, Nokia gives you certain additional
18 ** rights. These rights are described in the Nokia Qt LGPL Exception
19 ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
21 ** GNU General Public License Usage
22 ** Alternatively, this file may be used under the terms of the GNU General
23 ** Public License version 3.0 as published by the Free Software Foundation
24 ** and appearing in the file LICENSE.GPL included in the packaging of this
25 ** file. Please review the following information to ensure the GNU General
26 ** Public License version 3.0 requirements will be met:
27 ** http://www.gnu.org/copyleft/gpl.html.
30 ** Alternatively, this file may be used in accordance with the terms and
31 ** conditions contained in a signed written agreement between you and Nokia.
40 ****************************************************************************/
45 #include "TestContainer.h"
47 using namespace QPatternistSDK;
49 TestContainer::TestContainer() : m_deleteChildren(true)
53 TestContainer::~TestContainer()
56 qDeleteAll(m_children);
59 TestResult::List TestContainer::execute(const ExecutionStage stage,
63 const unsigned int c = m_children.count();
64 TestResult::List result;
66 for(unsigned int i = 0; i != c; ++i)
67 result += static_cast<TestItem *>(child(i))->execute(stage, ts);
72 TestItem::ResultSummary TestContainer::resultSummary() const
74 const int c = childCount();
78 for(int i = 0; i != c; ++i)
80 TestItem *t = static_cast<TestItem *>(child(i));
81 const ResultSummary sum(t->resultSummary());
86 return ResultSummary(pass, total);
89 TreeItem::List TestContainer::children() const
94 void TestContainer::appendChild(TreeItem *item)
96 /* When one of our children changes, we changes. */
97 connect(item, SIGNAL(changed(TreeItem *)), SIGNAL(changed(TreeItem *)));
98 m_children.append(item);
101 TreeItem *TestContainer::child(const unsigned int rowP) const
103 return m_children.value(rowP);
106 unsigned int TestContainer::childCount() const
108 return m_children.count();
111 void TestContainer::setTitle(const QString &titleP)
116 QString TestContainer::title() const
121 bool TestContainer::isFinalNode() const
126 int TestContainer::columnCount() const
131 QString TestContainer::description() const
133 return m_description;
136 void TestContainer::setDescription(const QString &desc)
138 m_description = desc;
141 void TestContainer::setDeleteChildren(const bool val)
143 m_deleteChildren = val;
146 void TestContainer::removeLast()
148 m_children.removeLast();
151 // vim: et:ts=4:sw=4:sts=4