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
|
// Copyright (C) 2021 The Qt Company Ltd.
// SPDX-License-Identifier: LicenseRef-Qt-Commercial OR LGPL-3.0-only OR GPL-2.0-only OR GPL-3.0-only
#include "testmodel.h"
TreeItem::TreeItem(TreeItem *parent)
: m_parentItem(parent)
{}
TreeItem::TreeItem(int rootRow)
: m_parentItem(nullptr)
, rootRow(rootRow)
{}
TreeItem::~TreeItem()
{
qDeleteAll(m_childItems);
}
int TreeItem::row() const
{
if (!m_parentItem) {
Q_ASSERT(rootRow != -1);
return rootRow;
}
return m_parentItem->m_childItems.indexOf(const_cast<TreeItem *>(this));
}
TestModel::TestModel(QObject *parent)
: QAbstractItemModel(parent)
{
m_rootItems.append(new TreeItem(0));
m_rootItems.append(new TreeItem(1));
m_rootItems.append(new TreeItem(2));
for (int row = 0; row < m_rootItems.count(); ++row) {
const QString branchTag = QString::number(row);
for (int col = 0; col < m_columnCount; ++col)
m_rootItems[row]->m_entries << QVariant(QString("r:%1, c:%2, d:0, b:%3").arg(row).arg(col).arg(branchTag));
createTreeRecursive(m_rootItems[row], 4, 1, 5, branchTag);
}
}
void TestModel::createTreeRecursive(TreeItem *parentItem, int childCount, int currentDepth, int maxDepth, const QString &branchTag)
{
for (int row = 0; row < childCount; ++row) {
auto childItem = new TreeItem(parentItem);
if (currentDepth < maxDepth && row == 0)
createTreeRecursive(childItem, childCount, currentDepth + 1, maxDepth, branchTag);
for (int col = 0; col < m_columnCount; ++col)
childItem->m_entries << QVariant(QString("r:%1, c:%2, d:%3, b:%4").arg(row).arg(col).arg(currentDepth).arg(branchTag));
parentItem->m_childItems.append(childItem);
}
}
TreeItem *TestModel::treeItem(const QModelIndex &index) const
{
if (!index.isValid())
return nullptr;
return static_cast<TreeItem *>(index.internalPointer());
}
int TestModel::rowCount(const QModelIndex &parent) const
{
if (!parent.isValid())
return m_rootItems.count();
return treeItem(parent)->m_childItems.count();
}
int TestModel::columnCount(const QModelIndex &) const
{
return m_columnCount;
}
QVariant TestModel::data(const QModelIndex &index, int role) const
{
switch (role) {
case Qt::SizeHintRole:
return QSize(100, 20);
case Qt::DisplayRole: {
if (!index.isValid())
return QVariant("invalid index");
TreeItem *item = treeItem(index);
return item->m_entries.at(index.column());
break; }
default:
break;
}
return QVariant();
}
bool TestModel::setData(const QModelIndex &index, const QVariant &value, int role)
{
Q_UNUSED(role)
if (!index.isValid())
return false;
TreeItem *item = treeItem(index);
Q_ASSERT(item);
item->m_entries[index.column()] = value;
emit dataChanged(index, index);
return true;
}
QModelIndex TestModel::index(int row, int column, const QModelIndex &parent) const
{
if (!hasIndex(row, column, parent))
return QModelIndex();
if (!parent.isValid())
return createIndex(row, column, m_rootItems[row]);
return createIndex(row, column, treeItem(parent)->m_childItems.at(row));
}
QModelIndex TestModel::parent(const QModelIndex &index) const
{
if (!index.isValid())
return QModelIndex();
TreeItem *item = treeItem(index);
TreeItem *parentItem = item->m_parentItem;
if (!parentItem)
return QModelIndex();
return createIndex(parentItem->row(), 0, parentItem);
}
bool TestModel::insertRows(int position, int count, const QModelIndex &parent)
{
if (!parent.isValid()) {
qWarning() << "Cannot insert rows on an invalid parent!";
return false;
}
beginInsertRows(parent, position, position + count - 1);
TreeItem *parentItem = treeItem(parent);
for (int row = 0; row < count; ++row) {
auto newChildItem = new TreeItem(parentItem);
for (int col = 0; col < m_columnCount; ++col)
newChildItem->m_entries << QVariant(QString("(inserted at %1, %2)").arg(position + row).arg(col));
parentItem->m_childItems.insert(position + row, newChildItem);
}
endInsertRows();
return true;
}
bool TestModel::removeRows(int position, int count, const QModelIndex &parent)
{
if (!parent.isValid()) {
qWarning() << "Cannot remove rows on an invalid parent!";
return false;
}
beginRemoveRows(parent, position, position + count - 1);
TreeItem *parentItem = treeItem(parent);
parentItem->m_childItems.remove(position, count);
endRemoveRows();
return true;
}
Qt::ItemFlags TestModel::flags(const QModelIndex &index) const
{
Q_UNUSED(index)
return Qt::ItemIsSelectable | Qt::ItemIsEnabled | Qt::ItemIsEditable;
}
|
