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
|
/*******************************************************************************
**
** smolbote: yet another qute browser
** Copyright (C) 2017 Xian Nox
**
** 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/>.
**
******************************************************************************/
#include "filtertree.h"
#include "filternode.h"
FilterTree::FilterTree(QObject *parent) :
QAbstractItemModel(parent)
{
// create some nodes here
QList<QVariant> rootData;
rootData << "Domain" << "Request" << "Blocked" << "Allowed Types" << "Blocked Types";
rootItem = new FilterNode(rootData);
}
FilterTree::~FilterTree()
{
delete rootItem;
}
QModelIndex FilterTree::index(int row, int column, const QModelIndex &parent) const
{
if(!hasIndex(row, column, parent)) {
return QModelIndex();
}
FilterNode *parentItem;
if(!parent.isValid()) {
parentItem = rootItem;
} else {
parentItem = static_cast<FilterNode*>(parent.internalPointer());
}
FilterNode *childItem = parentItem->child(row);
if(childItem) {
return createIndex(row, column, childItem);
} else {
return QModelIndex();
}
}
QModelIndex FilterTree::parent(const QModelIndex &index) const
{
if(!index.isValid()) {
return QModelIndex();
}
FilterNode *childItem = static_cast<FilterNode*>(index.internalPointer());
FilterNode *parentItem = childItem->parentItem();
if(parentItem == rootItem) {
return QModelIndex();
}
return createIndex(parentItem->row(), 0, parentItem);
}
int FilterTree::rowCount(const QModelIndex &parent) const
{
FilterNode *parentItem;
if(parent.column() > 0) {
return 0;
}
if(!parent.isValid()) {
parentItem = rootItem;
} else {
parentItem = static_cast<FilterNode*>(parent.internalPointer());
}
return parentItem->childCount();
}
int FilterTree::columnCount(const QModelIndex &parent) const
{
if(parent.isValid()) {
return static_cast<FilterNode*>(parent.internalPointer())->columnCount();
} else {
return rootItem->columnCount();
}
}
QVariant FilterTree::data(const QModelIndex &index, int role) const
{
if(!index.isValid()) {
return QVariant();
}
if(role != Qt::DisplayRole) {
return QVariant();
}
return static_cast<FilterNode*>(index.internalPointer())->data(index.column());
}
QVariant FilterTree::headerData(int section, Qt::Orientation orientation, int role) const
{
if(orientation != Qt::Horizontal) {
return QVariant();
}
if(role != Qt::DisplayRole) {
return QVariant();
}
return rootItem->data(section);
}
FilterNode *FilterTree::addFilter(QList<QVariant> &data)
{
FilterNode *node = new FilterNode(data, rootItem);
rootItem->appendChild(node);
return node;
}
|
