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
|
/***************************************************************************
* Copyright (C) 2012 by Peter Penz <[email protected]> *
* *
* 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 "kstandarditemmodel.h"
#include "kstandarditem.h"
KStandardItemModel::KStandardItemModel(QObject* parent) :
KItemModelBase(parent),
m_items(),
m_indexesForItems()
{
}
KStandardItemModel::~KStandardItemModel()
{
}
void KStandardItemModel::insertItem(int index, KStandardItem* item)
{
if (!m_indexesForItems.contains(item) && !item->m_model) {
m_items.insert(index, item);
m_indexesForItems.insert(item, index);
item->m_model = this;
// TODO: no hierarchical items are handled yet
emit itemsInserted(KItemRangeList() << KItemRange(index, 1));
}
}
void KStandardItemModel::appendItem(KStandardItem *item)
{
insertItem(m_items.count(), item);
}
void KStandardItemModel::removeItem(KStandardItem* item)
{
const int index = m_indexesForItems.value(item, -1);
if (index >= 0) {
m_items.removeAt(index);
m_indexesForItems.remove(item);
delete item;
// TODO: no hierarchical items are handled yet
}
}
KStandardItem* KStandardItemModel::item(int index) const
{
if (index < 0 || index >= m_items.count()) {
return 0;
}
return m_items[index];
}
int KStandardItemModel::index(const KStandardItem* item) const
{
return m_indexesForItems.value(item, -1);
}
int KStandardItemModel::count() const
{
return m_items.count();
}
QHash<QByteArray, QVariant> KStandardItemModel::data(int index) const
{
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 QSet<int>& indexes) const
{
Q_UNUSED(indexes);
return 0;
}
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
{
return QList<QPair<int, QVariant> >();
}
#include "kstandarditemmodel.moc"
|
