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
|
/*
* Copyright (c) 2007 Boudewijn Rempt <boud@valdyas.org>
* Copyright (c) 2011 Dmitry Kazakov <dimula73@gmail.com>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#include "testutil.h"
namespace TestUtil
{
QStringList getHierarchy(KisNodeSP root, const QString &prefix) {
QStringList list;
QString nextPrefix;
if (root->parent()) {
nextPrefix = prefix + "+";
list << prefix + root->name();
}
KisNodeSP node = root->firstChild();
while (node) {
list += getHierarchy(node, nextPrefix);
node = node->nextSibling();
}
return list;
}
bool checkHierarchy(KisNodeSP root, const QStringList &expected)
{
QStringList result = getHierarchy(root);
if (result != expected) {
qDebug() << "Failed to compare hierarchy:";
qDebug() << " " << ppVar(result);
qDebug() << " " << ppVar(expected);
return false;
}
return true;
}
}
|
