-
Notifications
You must be signed in to change notification settings - Fork 0
/
treeitem.cpp
103 lines (77 loc) · 2.34 KB
/
treeitem.cpp
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
#include "treeitem.h"
TreeItem::TreeItem(const QVector<QVariant>& data, TreeItem* parent) {
parentItem = parent;
itemData = data;
}
TreeItem::TreeItem(const TreeItem &treeItem, TreeItem *parent)
{
parentItem = parent;
itemData = treeItem.itemData;
for (auto child : treeItem.childItems) {
childItems.append(new TreeItem(*child, this));
}
}
TreeItem::~TreeItem() {
qDeleteAll(childItems);
}
TreeItem* TreeItem::child(int number) {
return childItems.value(number);
}
int TreeItem::childCount() const {
return childItems.count();
}
int TreeItem::childNumber() const {
if (parentItem)
return parentItem->childItems.indexOf(const_cast<TreeItem*>(this));
return 0;
}
int TreeItem::columnCount() const {
return itemData.count();
}
QVariant TreeItem::data(int column) const {
return itemData.value(column);
}
bool TreeItem::insertChildren(int position, int count, int columns) {
if (position < 0 || position > childItems.size())
return false;
for (int row = 0; row < count; ++row) {
QVector<QVariant> data(columns);
TreeItem* item = new TreeItem(data, this);
childItems.insert(position, item);
}
return true;
}
bool TreeItem::insertColumns(int position, int columns) {
if (position < 0 || position > itemData.size())
return false;
for (int column = 0; column < columns; ++column)
itemData.insert(position, QVariant());
foreach (TreeItem* child, childItems)
child->insertColumns(position, columns);
return true;
}
TreeItem* TreeItem::parent() {
return parentItem;
}
bool TreeItem::removeChildren(int position, int count) {
if (position < 0 || position + count > childItems.size())
return false;
for (int row = 0; row < count; ++row)
delete childItems.takeAt(position);
return true;
}
bool TreeItem::removeColumns(int position, int columns) {
if (position < 0 || position + columns > itemData.size())
return false;
for (int column = 0; column < columns; ++column)
itemData.remove(position);
foreach (TreeItem* child, childItems)
child->removeColumns(position, columns);
return true;
}
bool TreeItem::setData(int column, const QVariant& value) {
if (column < 0 || column >= itemData.size())
return false;
itemData[column] = value;
return true;
}