-
Notifications
You must be signed in to change notification settings - Fork 2
/
treemodel.cpp
194 lines (159 loc) · 4.95 KB
/
treemodel.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
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
/*
* TreeItem and TreeModel classes
*
* Copyright 2015 Ivan Romanov <[email protected]>
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
* THE SOFTWARE.
*
*/
#include "treemodel.h"
#include <QDebug>
TreeItem::TreeItem(const QStringList &values, AbstractTreeItem *parent)
: AbstractTreeItem(parent)
, _values(values)
{
}
TreeItem::~TreeItem()
{
}
void TreeItem::setValue(int column, const QString &name)
{
while (column >= _values.size())
_values << "";
_values[column] = name;
}
QString TreeItem::value(int column) const
{
return column < _values.size() ? _values.at(column) : "";
}
void TreeItem::setValues(const QStringList &values)
{
_values = values;
}
QStringList TreeItem::values() const
{
return _values;
}
TreeItem *TreeItem::clone() const
{
TreeItem *newItem = new TreeItem;
newItem->_values = _values;
foreach (AbstractTreeItem *child, children()) {
newItem->appendChild(child->clone());
}
return newItem;
}
QString TreeItem::toString() const
{
return _values.join(" ");
}
TreeModel::TreeModel(QObject *parent)
: AbstractTreeModel(new TreeItem, parent)
{
}
TreeModel::~TreeModel()
{
}
void TreeModel::add(const QStringList &values, const QModelIndex &index)
{
beginInsertRows(index, rowCount(index), rowCount(index));
TreeItem *item;
if (index.isValid())
item = static_cast<TreeItem*>(index.internalPointer());
else
item = static_cast<TreeItem*>(root());
new TreeItem(values, item);
endInsertRows();
}
void TreeModel::remove(const QModelIndex &index)
{
TreeItem *item = static_cast<TreeItem*>(index.internalPointer());
if (item == root() || !item)
return;
beginRemoveRows(index.parent(), item->row(), item->row());
delete item;
endRemoveRows();
}
void TreeModel::up(const QModelIndex &index)
{
TreeItem *item = static_cast<TreeItem*>(index.internalPointer());
if (!item || root() == item)
return;
if (index.row() == 0)
return;
beginMoveRows(index.parent(), index.row(), index.row(), index.parent(), index.row() - 1);
item->setRow(index.row() - 1);
endMoveRows();
}
void TreeModel::down(const QModelIndex &index)
{
TreeItem *item = static_cast<TreeItem*>(index.internalPointer());
if (!item || root() == item)
return;
if (index.row() + 1 == rowCount(index.parent()))
return;
beginMoveRows(index.parent(), index.row(), index.row(), index.parent(), index.row() + 2);
item->setRow(index.row() + 1);
endMoveRows();
}
int TreeModel::columnCount(const QModelIndex &parent) const
{
Q_UNUSED(parent)
return 3;
}
QVariant TreeModel::data(const QModelIndex &index, int role) const
{
if (!index.isValid())
return QVariant();
if (role == Qt::DisplayRole || role == Qt::EditRole) {
TreeItem *node = static_cast<TreeItem*>(index.internalPointer());
return node->value(index.column());
}
return QVariant();
}
bool TreeModel::setData(const QModelIndex &index, const QVariant &value, int role)
{
if (!index.isValid())
return false;
if (role != Qt::EditRole && role != Qt::CheckStateRole && role < Qt::UserRole)
return false;
if (role == Qt::EditRole) {
TreeItem *node = static_cast<TreeItem*>(index.internalPointer());
node->setValue(index.column(), value.toString());
emit dataChanged(index, index);
return true;
}
return false;
}
QVariant TreeModel::headerData(int section, Qt::Orientation orientation, int role) const
{
if (orientation == Qt::Orientation::Horizontal && role == Qt::DisplayRole) {
return QString("Column %1").arg(section);
}
else {
return AbstractTreeModel::headerData(section, orientation, role);
}
}
Qt::ItemFlags TreeModel::flags(const QModelIndex &index) const
{
if (!index.isValid())
return AbstractTreeModel::flags(index);
Qt::ItemFlags f = Qt::ItemIsSelectable | Qt::ItemIsEnabled | Qt::ItemIsEditable;
return f;
}