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
|
/*
* Copyright 2008 Ben Boeckel <MathStuf@gmail.com>
*
* 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 3 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, see <http://www.gnu.org/licenses/>.
*/
// Header include
#include "PokemodTreeModel.h"
PokemodTreeModel::PokemodTreeModel(const QStringList& pokemods, QObject* parent) :
QAbstractItemModel(parent)
{
// TODO: construct
}
PokemodTreeModel::~PokemodTreeModel()
{
delete m_root;
}
QVariant PokemodTreeModel::data(const QModelIndex& index, int role) const
{
if (!index.isValid())
return QVariant();
BaseModel* object = static_cast<BaseModel*>(index.internalPointer());
return object->data(role);
}
QModelIndex PokemodTreeModel::index(int row, int /*column*/, const QModelIndex& parent) const
{
if (!parent.isValid())
return QModelIndex();
BaseModel* object = getItem(parent)->childItem(row);
if (object)
return createIndex(row, 0, object);
else
return QModelIndex();
}
QModelIndex PokemodTreeModel::parent(const QModelIndex& index) const
{
if (!index.isValid())
return QModelIndex();
BaseModel* object = static_cast<BaseModel*>(index.internalPointer());
BaseModel* parent = object->parent();
if (parent == m_root)
return QModelIndex();
return createIndex(parent->indexNumber(), 0, parent);
}
int PokemodTreeModel::rowCount(const QModelIndex& parent) const
{
if (!parent.isValid())
return 0;
BaseModel* object = static_cast<BaseModel*>(parent.internalPointer());
return object->rowCount();
}
int PokemodTreeModel::columnCount(const QModelIndex& /*parent*/) const
{
return 1;
}
Qt::ItemFlags PokemodTreeModel::flags(const QModelIndex& index) const
{
if (!index.isValid())
return 0;
BaseModel* object = static_cast<BaseModel*>(index.internalPointer());
return object->flags();
}
bool PokemodTreeModel::setData(const QModelIndex& index, const QVariant& value, int role)
{
if (!index.isValid())
return false;
BaseModel* object = static_cast<BaseModel*>(index.internalPointer());
return object->setData(value, role);
}
bool PokemodTreeModel::insertColumns(int /*position*/, int /*columns*/, const QModelIndex& /*parent*/)
{
return false;
}
bool PokemodTreeModel::removeColumns(int /*position*/, int /*columns*/, const QModelIndex& /*parent*/)
{
return false;
}
bool PokemodTreeModel::insertRows(int /*position*/, int rows, const QModelIndex& parent)
{
BaseModel* object = getItem(parent);
if (!object->canInsertRows())
return false;
emit(beginInsertRows(parent, object->rowCount(), object->rowCount() + rows - 1));
bool success = object->insertRows(rows);
emit(endInsertRows());
return success;
}
bool PokemodTreeModel::removeRows(int position, int rows, const QModelIndex& parent)
{
BaseModel* object = getItem(parent);
if (!object->canRemoveRows())
return false;
emit(beginRemoveRows(parent, position, position + rows - 1));
bool success = object->removeRows(position, rows);
emit(endRemoveRows());
return success;
}
BaseModel* PokemodTreeModel::getItem(const QModelIndex& index) const
{
if (index.isValid())
{
BaseModel* object = static_cast<BaseModel*>(index.internalPointer());
if (object)
return object;
}
return m_root;
}
|
