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
|
// Copyright (C) 2016 The Qt Company Ltd.
// SPDX-License-Identifier: LicenseRef-Qt-Commercial OR GPL-3.0+ OR GPL-3.0 WITH Qt-GPL-exception-1.0
#include <utils/treemodel.h>
#include <QtTest>
#include <type_traits>
//TESTED_COMPONENT=src/libs/utils/treemodel
using namespace Utils;
class tst_TreeModel : public QObject
{
Q_OBJECT
private slots:
void testTypes();
void testIteration();
void testMixed();
};
static int countLevelItems(TreeItem *base, int level)
{
int n = 0;
int bl = base->level();
base->forAllChildren([level, bl, &n](TreeItem *item) {
if (item->level() == bl + level)
++n;
});
return n;
}
static TreeItem *createItem(const QString &name)
{
return new StaticTreeItem(name);
}
void tst_TreeModel::testIteration()
{
TreeModel<> m;
TreeItem *r = m.rootItem();
TreeItem *group0 = createItem("group0");
TreeItem *group1 = createItem("group1");
TreeItem *item10 = createItem("item10");
TreeItem *item11 = createItem("item11");
TreeItem *item12 = createItem("item12");
group1->appendChild(item10);
group1->appendChild(item11);
TreeItem *group2 = createItem("group2");
TreeItem *item20 = createItem("item20");
TreeItem *item21 = createItem("item21");
TreeItem *item22 = createItem("item22");
r->appendChild(group0);
r->appendChild(group1);
r->appendChild(group2);
group1->appendChild(item12);
group2->appendChild(item20);
group2->appendChild(item21);
group2->appendChild(item22);
QCOMPARE(r->childCount(), 3);
QCOMPARE(countLevelItems(r, 1), 3);
QCOMPARE(countLevelItems(r, 2), 6);
QCOMPARE(countLevelItems(r, 3), 0);
QCOMPARE(countLevelItems(group0, 1), 0);
QCOMPARE(countLevelItems(group1, 1), 3);
QCOMPARE(countLevelItems(group1, 2), 0);
QCOMPARE(countLevelItems(group2, 1), 3);
QCOMPARE(countLevelItems(group2, 2), 0);
}
struct ItemA : public TreeItem {};
struct ItemB : public TreeItem {};
void tst_TreeModel::testMixed()
{
TreeModel<TreeItem, ItemA, ItemB> m;
TreeItem *r = m.rootItem();
TreeItem *ra;
r->appendChild(new ItemA);
r->appendChild(ra = new ItemA);
ra->appendChild(new ItemB);
ra->appendChild(new ItemB);
int n = 0;
m.forItemsAtLevel<1>([&n](ItemA *) { ++n; });
QCOMPARE(n, 2);
n = 0;
m.forItemsAtLevel<2>([&n](ItemB *) { ++n; });
QCOMPARE(n, 2);
}
void tst_TreeModel::testTypes()
{
struct A {};
struct B {};
struct C {};
static_assert(std::is_same<Internal::SelectType<0, A>::Type, A>::value, "");
static_assert(std::is_same<Internal::SelectType<0>::Type, TreeItem>::value, "");
static_assert(std::is_same<Internal::SelectType<1>::Type, TreeItem>::value, "");
static_assert(std::is_same<Internal::SelectType<0, A, B, C>::Type, A>::value, "");
static_assert(std::is_same<Internal::SelectType<1, A, B, C>::Type, B>::value, "");
static_assert(std::is_same<Internal::SelectType<2, A, B, C>::Type, C>::value, "");
static_assert(std::is_same<Internal::SelectType<3, A, B, C>::Type, TreeItem>::value, "");
}
QTEST_GUILESS_MAIN(tst_TreeModel)
#include "tst_treemodel.moc"
|
