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
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
|
/*
* SPDX-FileCopyrightText: 2012 Peter Penz <[email protected]>
*
* SPDX-License-Identifier: GPL-2.0-or-later
*/
#include "kstandarditemmodel.h"
#include "kstandarditem.h"
KStandardItemModel::KStandardItemModel(QObject* parent) :
KItemModelBase(parent),
m_items(),
m_indexesForItems()
{
}
KStandardItemModel::~KStandardItemModel()
{
qDeleteAll(m_items);
m_items.clear();
m_indexesForItems.clear();
}
void KStandardItemModel::insertItem(int index, KStandardItem* item)
{
if (index < 0 || index > count() || !item) {
delete item;
return;
}
if (!m_indexesForItems.contains(item)) {
item->m_model = this;
m_items.insert(index, item);
m_indexesForItems.insert(item, index);
// Inserting an item requires to update the indexes
// afterwards from m_indexesForItems.
for (int i = index + 1; i < m_items.count(); ++i) {
m_indexesForItems.insert(m_items[i], i);
}
// TODO: no hierarchical items are handled yet
onItemInserted(index);
Q_EMIT itemsInserted(KItemRangeList() << KItemRange(index, 1));
}
}
void KStandardItemModel::changeItem(int index, KStandardItem* item)
{
if (index < 0 || index >= count() || !item) {
delete item;
return;
}
item->m_model = this;
QSet<QByteArray> changedRoles;
KStandardItem* oldItem = m_items[index];
const QHash<QByteArray, QVariant> oldData = oldItem->data();
const QHash<QByteArray, QVariant> newData = item->data();
// Determine which roles have been changed
QHashIterator<QByteArray, QVariant> it(oldData);
while (it.hasNext()) {
it.next();
const QByteArray role = it.key();
const QVariant oldValue = it.value();
if (newData.contains(role) && newData.value(role) != oldValue) {
changedRoles.insert(role);
}
}
m_indexesForItems.remove(oldItem);
delete oldItem;
oldItem = nullptr;
m_items[index] = item;
m_indexesForItems.insert(item, index);
onItemChanged(index, changedRoles);
Q_EMIT itemsChanged(KItemRangeList() << KItemRange(index, 1), changedRoles);
}
void KStandardItemModel::removeItem(int index)
{
if (index >= 0 && index < count()) {
KStandardItem* item = m_items[index];
m_indexesForItems.remove(item);
m_items.removeAt(index);
// Removing an item requires to update the indexes
// afterwards from m_indexesForItems.
for (int i = index; i < m_items.count(); ++i) {
m_indexesForItems.insert(m_items[i], i);
}
onItemRemoved(index, item);
item->deleteLater();
item = nullptr;
Q_EMIT itemsRemoved(KItemRangeList() << KItemRange(index, 1));
// TODO: no hierarchical items are handled yet
}
}
void KStandardItemModel::clear()
{
int size = m_items.size();
m_items.clear();
m_indexesForItems.clear();
Q_EMIT itemsRemoved(KItemRangeList() << KItemRange(0, size));
}
KStandardItem* KStandardItemModel::item(int index) const
{
if (index < 0 || index >= m_items.count()) {
return nullptr;
}
return m_items[index];
}
int KStandardItemModel::index(const KStandardItem* item) const
{
return m_indexesForItems.value(item, -1);
}
void KStandardItemModel::appendItem(KStandardItem *item)
{
insertItem(m_items.count(), item);
}
int KStandardItemModel::count() const
{
return m_items.count();
}
QHash<QByteArray, QVariant> KStandardItemModel::data(int index) const
{
if (index >= 0 && index < count()) {
const KStandardItem* item = m_items[index];
if (item) {
return item->data();
}
}
return QHash<QByteArray, QVariant>();
}
bool KStandardItemModel::setData(int index, const QHash<QByteArray, QVariant>& values)
{
Q_UNUSED(values)
if (index < 0 || index >= count()) {
return false;
}
return true;
}
QMimeData* KStandardItemModel::createMimeData(const KItemSet& indexes) const
{
Q_UNUSED(indexes)
return nullptr;
}
int KStandardItemModel::indexForKeyboardSearch(const QString& text, int startFromIndex) const
{
Q_UNUSED(text)
Q_UNUSED(startFromIndex)
return -1;
}
bool KStandardItemModel::supportsDropping(int index) const
{
Q_UNUSED(index)
return false;
}
QString KStandardItemModel::roleDescription(const QByteArray& role) const
{
Q_UNUSED(role)
return QString();
}
QList<QPair<int, QVariant> > KStandardItemModel::groups() const
{
QList<QPair<int, QVariant> > groups;
const QByteArray role = sortRole().isEmpty() ? "group" : sortRole();
bool isFirstGroupValue = true;
QString groupValue;
const int maxIndex = count() - 1;
for (int i = 0; i <= maxIndex; ++i) {
const QString newGroupValue = m_items.at(i)->dataValue(role).toString();
if (newGroupValue != groupValue || isFirstGroupValue) {
groupValue = newGroupValue;
groups.append(QPair<int, QVariant>(i, newGroupValue));
isFirstGroupValue = false;
}
}
return groups;
}
void KStandardItemModel::onItemInserted(int index)
{
Q_UNUSED(index)
}
void KStandardItemModel::onItemChanged(int index, const QSet<QByteArray>& changedRoles)
{
Q_UNUSED(index)
Q_UNUSED(changedRoles)
}
void KStandardItemModel::onItemRemoved(int index, KStandardItem* removedItem)
{
Q_UNUSED(index)
Q_UNUSED(removedItem)
}
|
